Skip site navigation (1)
Skip section navigation (2)
Peripheral Links
Header And Logo
|
Site Navigation
Re: GiST indexing tuples
- From: "Matthew T. O'Connor" <matthew(at)zeut(dot)net>
- To: Matthew <matthew(at)flymine(dot)org>
- Cc: pgsql-performance(at)postgresql(dot)org
- Subject: Re: GiST indexing tuples
- Date: Thu, 29 Nov 2007 15:23:10 -0500
Matthew wrote:
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".
Sorry in advance if this is a stupid question, but how is this better than two index, one on "a" and one on "b"? I supposed there could be a space savings but beyond that?
- Follow-Ups:
- Re: GiST indexing tuples
- From: Matthew
- Re: GiST indexing tuples
- From: Steinar H. Gunderson
- Re: GiST indexing tuples
- References:
- GiST indexing tuples
- From: Matthew
- Re: GiST indexing tuples
- From: Steinar H. Gunderson
- Re: GiST indexing tuples
- From: Matthew
- Re: GiST indexing tuples
- From: Tom Lane
- Re: GiST indexing tuples
- From: Matthew
- GiST indexing tuples
- Prev by Date: Re: Configuring a Large RAM PostgreSQL Server
- Next by Date: Re: GiST indexing tuples
- Previous by thread: Re: GiST indexing tuples
- Next by thread: Re: GiST indexing tuples
- Indexes: