From: | Neil Conway <neilc(at)samurai(dot)com> |
---|---|
To: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
Cc: | pgsql-hackers <pgsql-hackers(at)postgresql(dot)org>, Oleg Bartunov <oleg(at)sai(dot)msu(dot)su>, Teodor Sigaev <teodor(at)stack(dot)net> |
Subject: | Re: GiST: PickSplit and multi-attr indexes |
Date: | 2004-11-16 04:12:45 |
Message-ID: | 1100578365.23420.71.camel@localhost.localdomain |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
On Mon, 2004-11-15 at 10:19 -0500, Tom Lane wrote:
> I'm not familiar with the details of the GiST code, but would it work to
> generalize PickSplit to return a three-way classification? That is,
> instead of actually splitting the node, have it identify each item as
> "definitely left", "definitely right", or "don't care" (think "less",
> "greater", or "equal to" the desired split value).
I had thought about this solution, but I was worried that it will
actually make GiST a less general framework, because it requires that
the PickSplit() method effectively order the leaves of the tree. For
btree that is a reasonable assumption to make, but I'm not sure if it
can or should be made in general.
That said, I haven't actually implemented any indexes using GiST;
perhaps Oleg or Teodor can comment?
-Neil
From | Date | Subject | |
---|---|---|---|
Next Message | Neil Conway | 2004-11-16 05:25:37 | Re: postmaster segfaults with HUGE table |
Previous Message | Neil Conway | 2004-11-16 04:00:59 | Re: postmaster segfaults with HUGE table |