From: | Oleg Bartunov <oleg(at)sai(dot)msu(dot)su> |
---|---|
To: | Jeremiah Peschka <jeremiah(dot)peschka(at)gmail(dot)com> |
Cc: | pgsql-hackers(at)postgresql(dot)org |
Subject: | Re: k-neighbourhood search in databases |
Date: | 2011-04-10 10:18:14 |
Message-ID: | Pine.LNX.4.64.1104101415240.9772@sn.sai.msu.ru |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
Wow, custom solution for 2008 still much faster Denali 2011 solution.
Also, what's about not spatial data types ?
In our approach, we can provide knn for any datatype, which has GiST index
and distance method.
Oleg
On Fri, 8 Apr 2011, Jeremiah Peschka wrote:
>
> On 4/8/11 5:21 AM, Oleg Bartunov wrote:
>> Hi there,
>>
>> I'm interesting if other databases provides built-in effective knn
>> search ? Google didn't help me.
> SQL Server provides some knn search functionality[1] with enhancements coming this November in SQL 11[2].
>
> [1]: http://blogs.msdn.com/b/isaac/archive/2008/10/23/nearest-neighbors.aspx
> [2]: http://www.sqlskills.com/BLOGS/BOBB/post/The-nearest-neighbor-optimization-in-SQL-Server-Denali.aspx
>
>
>
Regards,
Oleg
_____________________________________________________________
Oleg Bartunov, Research Scientist, Head of AstroNet (www.astronet.ru)
Sternberg Astronomical Institute, Moscow University, Russia
Internet: oleg(at)sai(dot)msu(dot)su, http://www.sai.msu.su/~megera/
phone: +007(495)939-16-83, +007(495)939-23-83
From | Date | Subject | |
---|---|---|---|
Next Message | Noah Misch | 2011-04-10 10:36:36 | Re: BUG #5856: pg_attribute.attinhcount is not correct. |
Previous Message | tomas | 2011-04-10 05:37:54 | Re: How would sorting work with millions of rows in a huge DB with PG? |