Posted by Erland Sommarskog on 05/06/06 22:31

Erland Sommarskog (esquel@sommarskog.se) writes:
> This is quite a difficult problem for a relational engine, and it could
> be a case where a cursor is the best.

I should stress that this is just a wild idea. It may very well prove
that a cursor solution is horribly slow - as cursor solutions often are.



--
Erland Sommarskog, SQL Server MVP, esquel@sommarskog.se

Books Online for SQL Server 2005 at
http://www.microsoft.com/technet/prodtechnol/sql/2005/downloads/books.mspx
Books Online for SQL Server 2000 at
http://www.microsoft.com/sql/prodinfo/previousversions/books.mspx

• Next in forum: Re: locating set of points close to one another (within a threshold)
• Prev in forum: Re: locating set of points close to one another (within a threshold)
• Thread view: Re: locating set of points close to one another (within a threshold)

[Reply to this message]