I was wondering if there is a way to get access to the tree structure
underlying at GIST index? What I would like to do is perform a
breadth-first search on the tree in order to find nearest neighbors
(using PostGIS data types). Nearest neighbor searchers are not very
efficient using only range que
On Fri, Apr 4, 2008 at 4:58 PM, Teodor Sigaev <[EMAIL PROTECTED]> wrote:
>
>
> > encode spatial proximity. Is there an API (backend C-level is fine) to
> > access a GIST index?
> >
>
> The best way is to extend existing interface to GiST to support KNN-search.
> But you can see how to get access t
I am combining query results that I know are disjoint. I'm wondering
how much overhead there is in calling union versus union all. (Just
curious really; I can't see a reason not to use union all.) (cc me
please; not subscribed...)
THK
--
Timothy H. Keitt
http://www.keittlab.org/
--
Sent via pg
