From: | Rémi Cura <remi(dot)cura(at)gmail(dot)com> |
---|---|
To: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
Cc: | PostgreSQL General <pgsql-general(at)postgresql(dot)org> |
Subject: | Re: GIST index : order Hack : getting the order used by CLUSTER .. USING my_index |
Date: | 2013-10-24 14:02:47 |
Message-ID: | CAJvUf_uWwg55VgJF+P1TunUqN-S6_Qp=t8A6HEv9-EZyho6oHw@mail.gmail.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-general |
Hello,
I'm interested in the tree structure inherent to the gist indexing.
I was thinking to retrieve it from order of index.
Do you know how I could access it directly?
My use case would be to take advantage of this gist ordering to order 2D
points
s1 : N1 N2 .. Nn
so that for any given t<n, s2 : [N1 Nt] points are an extract of s1 which
is well spread (spatially speaking).
Ideally I would prefer to use the quadtree index in contrib rather than the
Gist R Tree.
Cheers,
Rémi-C
2013/10/24 Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>
> =?UTF-8?Q?R=C3=A9mi_Cura?= <remi(dot)cura(at)gmail(dot)com> writes:
> > I would like to be able to get the rows following the order of an index
> > (*NOT* getting an order by accelerated, but only an order defined by an
> > index).
>
> Since a GiST index hasn't got any specific internal order, I fail to see
> the point of this.
>
> regards, tom lane
>
From | Date | Subject | |
---|---|---|---|
Next Message | David Johnston | 2013-10-24 14:29:51 | Re: Wrong estimate in query plan |
Previous Message | Tom Lane | 2013-10-24 13:42:54 | Re: GIST index : order Hack : getting the order used by CLUSTER .. USING my_index |