| From: | Alvaro Herrera <alvherre(at)dcc(dot)uchile(dot)cl> |
|---|---|
| To: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
| Cc: | Bruce Momjian <pgman(at)candle(dot)pha(dot)pa(dot)us>, Greg Stark <gsstark(at)mit(dot)edu>, pgsql-hackers(at)postgresql(dot)org |
| Subject: | Re: Question about indexes |
| Date: | 2004-01-30 15:24:18 |
| Message-ID: | 20040130152418.GB24123@dcc.uchile.cl |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
On Fri, Jan 30, 2004 at 09:48:19AM -0500, Tom Lane wrote:
> A variant is to make the per-page bit arrays be entries in a hash table
> with page number as hash key. This would reduce insertion to a nearly
> constant-time operation, but the drawback is that you'd need an explicit
> sort at the end to put the per-page entries into page number order
> before you scan 'em. You might come out ahead anyway, not sure.
Is there a reason sort the pages before scanning them? The result won't
come out sorted one way or the other.
--
Alvaro Herrera (<alvherre[a]dcc.uchile.cl>)
"Para tener más hay que desear menos"
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Bruce Momjian | 2004-01-30 15:30:42 | Re: Question about indexes |
| Previous Message | Bruce Momjian | 2004-01-30 15:22:34 | Re: Question about indexes |