Re: Radial searches of cartesian points? - Mailing list pgsql-general

From Demitri Muna
Subject Re: Radial searches of cartesian points?
Date
Msg-id 02705416-E852-4BE1-AE76-42EC487B4363@mac.com
Whole thread Raw
In response to Re: Radial searches of cartesian points?  (Merlin Moncure <mmoncure@gmail.com>)
List pgsql-general
Hi,

On Jan 5, 2012, at 12:54 PM, Merlin Moncure wrote:

> see:
> http://www.postgresql.org/docs/9.1/interactive/cube.html
>
> and pay special attention to gist indexing portions.  cube only
> indexes box operations, but you can cull the sphere using 3d distance
> formula for points between inner and outer bounding cube.

Thanks for the pointer, Merlin. I had been looking at that, and the bounding boxes idea is good. I'm a little concerned
aboutthe very large number of trigonometric calculations this will lead to. For a single, occasional search this would
notbe an issue, but I'm going to be performing this search thousands of times. 

Is anyone aware of a datatype or third-party implementation that will index in three dimensions radially, or what it
wouldtake to accomplish this? 

Cheers,
Demitri

pgsql-general by date:

Previous
From: Nishad Prakash
Date:
Subject: Running multiple versions
Next
From: Scott Marlowe
Date:
Subject: Re: Running multiple versions