On Sat, 4 Dec 2010, Greg Stark wrote:
> On Sat, Dec 4, 2010 at 6:07 PM, Oleg Bartunov <oleg@sai.msu.su> wrote:
>> We'll sync contrib/btree_gist with current API. Also, we're thinking
>> about distance for ltree, boxes, circles. I'm not sure about polygons,
>> though.
>> So, we'll have rather complete set of knn-fied data types.
>
> I kind of assumed the natural client for KNN-gist was the tsearch full
> text search indexes handling sorting by relevance. For example if I
> search for "Postgres DBA" I should find documents where those words
> appear adjacent first and documents where the two words appear far
> apart in the document sorted further down. Is that not on the list of
> operators supported or planned to be supported?
We'll start thinking about this once we know how to store coordinate
information in index :)
Regards, Oleg
_____________________________________________________________
Oleg Bartunov, Research Scientist, Head of AstroNet (www.astronet.ru),
Sternberg Astronomical Institute, Moscow University, Russia
Internet: oleg@sai.msu.su, http://www.sai.msu.su/~megera/
phone: +007(495)939-16-83, +007(495)939-23-83
