Re: [PATCHES] Explain XML patch v2

2008-07-04 Thread Tom Raney
le with libxml? Are there any lighter weight solutions to serialize other than libxml? -Tom Raney -- Sent via pgsql-patches mailing list (pgsql-patches@postgresql.org) To make changes to your subscription: http://www.postgresql.org/mailpref/pgsql-patches

Re: [PATCHES] Explain XML patch v2

2008-07-02 Thread Tom Raney
Peter Eisentraut wrote: Am Mittwoch, 2. Juli 2008 schrieb Tom Raney: This is an update to my EXPLAIN XML patch submitted a few days ago. Could you explain how you came up with the XML schema design? I suppose you just made something up that went along with the existing XML output

[PATCHES] Explain XML patch v2

2008-07-01 Thread Tom Raney
umentation with matching XML output for every standard example query. But, I added enough to hopefully give the user an idea of what to expect. Regards, Tom Raney *** doc/src/sgml/perform.sgml.orig 2008-07-01 20:27:19.0 -0700 --- doc/src/sgml/perform.sgml 2008-0

Re: [PATCHES] Explain XML patch

2008-06-27 Thread Tom Raney
That's no problem and it makes a lot of sense. I will prepare a patch for the documentation. -Tom Raney Tom Lane wrote: Simon Riggs <[EMAIL PROTECTED]> writes: You probably need to say a whole lot more about this patch. I've updated the wiki with things I've lea

Re: [PATCHES] Hash Index Build Patch v2

2008-03-17 Thread Tom Raney
Tom, Thanks for your comments and for your work incorporating our patch into 8.4. This will help us provide even a better patch next time around :) -Shreya Bhargava and Tom Raney Tom Raney <[EMAIL PROTECTED]> writes: This revised version of our patch uses the function estimate_re

[PATCHES] Hash Index Build Patch v2

2007-10-21 Thread Tom Raney
This revised version of our patch uses the function estimate_rel_size() from plancat.c to estimate the number of tuples in the parent relation. This method is an alternative to scanning the parent relation to estimate the number of tuples, as we did in the first version of the patch. -Tom #in

Re: [PATCHES] Hash Index Build Patch

2007-09-26 Thread Tom Raney
Alvaro Herrera wrote: Hi Tom, Tom Raney wrote: We used spool functions from the BTree code to sort the index tuples. Sorting is done on the hash value of the tuples. The hash value depends on the number of primary bucket pages (henceforth just bucket pages) that will be required to fit

[PATCHES] Hash Index Build Patch

2007-09-25 Thread Tom Raney
test FROM 'data'; \timing CREATE INDEX hash ON test USING HASH(value); Regards, Shreya Bhargava <[EMAIL PROTECTED]> Tom Raney <[EMAIL PROTECTED]> /*-