Skip site navigation (1) Skip section navigation (2)

Re: GiST indexing tuples

From: Matthew <matthew(at)flymine(dot)org>
To: pgsql-performance(at)postgresql(dot)org
Subject: Re: GiST indexing tuples
Date: 2007-11-28 16:08:51
Message-ID: Pine.LNX.4.58.0711281607510.3731@aragorn.flymine.org (view raw or flat)
Thread:
Lists: pgsql-performance
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.

Matthew

-- 
I have an inferiority complex. But it's not a very good one.

In response to

Responses

pgsql-performance by date

Next:From: Usama Munir DarDate: 2007-11-28 16:15:09
Subject: Re: Windows XP selects are very slow
Previous:From: Dave DutcherDate: 2007-11-28 16:00:05
Subject: Re: Query only slow on first run

Privacy Policy | About PostgreSQL
Copyright © 1996-2014 The PostgreSQL Global Development Group