Re: multi-column btree index for real values

From: Bruce Momjian <pgman(at)candle(dot)pha(dot)pa(dot)us>
To: Martin Weinberg <weinberg(at)osprey(dot)astro(dot)umass(dot)edu>
Cc: Martijn van Oosterhout <kleptog(at)svana(dot)org>, "Martin D(dot) Weinberg" <weinberg(at)astro(dot)umass(dot)edu>, pgsql-general(at)postgresql(dot)org
Subject: Re: multi-column btree index for real values
Date: 2002-10-05 18:30:47
Message-ID: 200210051830.g95IUlW06080@candle.pha.pa.us
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-general

Martin Weinberg wrote:
> Martijn,
>
> Thanks. So that implies that a multidimensional btree index is
> useless for two columns of floats (one will probably always
> be searching on the first index for a tree of large height).
>
> Let me restate my question as an example. Supose I have columns
> of longitude and latitude. What is the best indexing strategy to
> find all tuples with in a two dimensional bound of longitude and
> latitude. E.g. with where clause
>
> lat between 21.49 and 37.41 and

Oh, rtree. That is exactly the index type you want.

--
Bruce Momjian | http://candle.pha.pa.us
pgman(at)candle(dot)pha(dot)pa(dot)us | (610) 359-1001
+ If your life is a hard drive, | 13 Roberts Road
+ Christ can be your backup. | Newtown Square, Pennsylvania 19073

In response to

Responses

Browse pgsql-general by date

  From Date Subject
Next Message Garo Hussenjian 2002-10-05 19:26:24 Re: Boolean output format
Previous Message Masaru Sugawara 2002-10-05 17:11:34 Re: Dynamic limit for the number of records?