| From: | Hannu Krosing <hannu(at)skype(dot)net> |
|---|---|
| To: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
| Cc: | Simon Riggs <simon(at)2ndquadrant(dot)com>, Martin Scholes <marty(at)iicolo(dot)com>, "Jonah H(dot) Harris" <jonah(dot)harris(at)gmail(dot)com>, Christopher Kings-Lynne <chris(dot)kings-lynne(at)calorieking(dot)com>, pgsql-hackers(at)postgresql(dot)org |
| Subject: | Re: WAL Bypass for indexes |
| Date: | 2006-04-03 15:33:57 |
| Message-ID: | 1144078438.3766.10.camel@localhost.localdomain |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
Ühel kenal päeval, E, 2006-04-03 kell 09:55, kirjutas Tom Lane:
> (2) Some of the index code is itself deliberately nondeterministic.
> I'm thinking in particular of the move-right-or-not choice in
> _bt_insertonpg() when there are many equal keys, but randomization is
> in general a useful algorithmic technique that we'd have to forswear.
Why can't we just order "many equal keys" by ctid ? This would align the
run of equal keys with table order, likely making index scans run
faster, especially on very long equal runs.
------------
Hannu
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Tom Lane | 2006-04-03 15:41:33 | Re: WAL Bypass for indexes |
| Previous Message | Hannu Krosing | 2006-04-03 15:27:38 | Re: WAL Bypass for indexes |