Re: Using multidimensional indexes in ordinal queries

From: Robert Haas <robertmhaas(at)gmail(dot)com>
To: Alexander Korotkov <aekorotkov(at)gmail(dot)com>
Cc: Thom Brown <thombrown(at)gmail(dot)com>, pgsql-hackers <pgsql-hackers(at)postgresql(dot)org>
Subject: Re: Using multidimensional indexes in ordinal queries
Date: 2010-06-21 21:58:44
Message-ID: AANLkTikBHy_ilFO-19q_CMavsLjCWSUHDQEZhpHO5CXj@mail.gmail.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

On Mon, Jun 21, 2010 at 5:20 PM, Alexander Korotkov
<aekorotkov(at)gmail(dot)com> wrote:
> 1) Make knngist deal with negative values. I think this will make easier
> using knngist just for sorting, not only k-neighbor searching.

It doesn't? I didn't think it was making any assumptions about the
ordering data type beyond the fact that it had a default btree
opclass.

--
Robert Haas
EnterpriseDB: http://www.enterprisedb.com
The Enterprise Postgres Company

In response to

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message Simon Riggs 2010-06-21 22:13:42 Re: Cannot cancel the change of a tablespace
Previous Message Alexander Korotkov 2010-06-21 21:20:31 Re: Using multidimensional indexes in ordinal queries