> Bruce Momjian <maillist@candle.pha.pa.us> writes:
> > Wonder how our create index does it. Seems it is must be similar.
>
> CREATE INDEX (for btrees) is very similar, and really ought to share
> code. Someone apparently didn't want to figure out how to generalize
> psort.c to handle index tuples, though. The CREATE INDEX code is a
> little better for large amounts of data but a lot worse for small
> amounts --- AFAICT it doesn't take any shortcuts, even when everything
> fits in memory. (I'm sure you've noticed that CREATE INDEX hits the
> disk pretty hard even when the source table is empty :-(.)
>
> I'm planning to merge the two sets of code and keep the best features of
> both. I already have some first-draft code that allows them to work
> with >2gig data sets.
Great.
-- Bruce Momjian | http://www.op.net/~candle maillist@candle.pha.pa.us | (610)
853-3000+ If your life is a hard drive, | 830 Blythe Avenue + Christ can be your backup. | Drexel Hill,
Pennsylvania19026
