> A different approach that's been discussed on pghackers is to make use
> of btree indexes for columns that have such indexes: we could scan the
> indexes to visit all the column values in sorted order. I have rejected
> that approach because (a) it doesn't help for columns without a suitable
> index; (b) our indexes don't distinguish deleted and live tuples,
> which would skew the statistics --- in particular, we couldn't tell a
> frequently-updated single tuple from a commonly repeated value; (c)
> scanning multiple indexes would likely require more total I/O than just
> grabbing sample tuples from the main table --- especially if we have to
> do that anyway to handle columns without indexes.
Remember one idea is for index scans to automatically update the expired
flag in the index bitfields when they check the heap tuple.
--
Bruce Momjian | http://candle.pha.pa.us
[EMAIL PROTECTED] | (610) 853-3000
+ If your life is a hard drive, | 830 Blythe Avenue
+ Christ can be your backup. | Drexel Hill, Pennsylvania 19026
---------------------------(end of broadcast)---------------------------
TIP 3: if posting/reading through Usenet, please send an appropriate
subscribe-nomail command to [EMAIL PROTECTED] so that your
message can get through to the mailing list cleanly
