On Wed, 28 Nov 2007, Tom Lane wrote:
> Have you looked at contrib/seg/ ?
Yes, I had a pretty good look at that. However, I believe that in order to
use seg's indexes, I would need to put my data into seg's data type, and
reformat my query, as I stated in my original message. What I'm looking
for is a general R-tree (or similar) index that will index multiple
columns of normal data types.
For instance, the normal B-tree index on (a, b) is able to answer queries
like "a = 5 AND b > 1" or "a > 5". An R-tree would be able to index these,
plus queries like "a > 5 AND b < 1".
As far as I can see, it is not possible at the moment to write such an
index system for GiST, which is a shame because the actual R-tree
algorithm is very simple. It's just a matter of communicating both values
from the query to the index code.
I have an inferiority complex. But it's not a very good one.
In response to
pgsql-performance by date
|Next:||From: Usama Munir Dar||Date: 2007-11-28 16:15:09|
|Subject: Re: Windows XP selects are very slow|
|Previous:||From: Dave Dutcher||Date: 2007-11-28 16:00:05|
|Subject: Re: Query only slow on first run|