Re: Finding matching ranges

From: Mikito Harakiri <nospam_at_newsranger.com>
Date: Thu, 07 Jun 2001 22:26:40 GMT
Message-ID: <AcTT6.264$pb1.5657@www.newsranger.com>

In article <KYST6.225$pb1.5456_at_www.newsranger.com>, Vadim Tropashko says...
>
>In article <YKST6.216$pb1.5120_at_www.newsranger.com>, Mikito Harakiri says...
>>
>>As far as the original question is conserned, assuming that your problem has an
>>indexing solution, it would be also applicable to spatial/temporary domain. The
>>fact that spatial doesn't have widely recognised indexing mechanism (compared >to B-tree) sound like an indicator that your problem is hard.
>>
>Is there really a connection to spatial? In spatial we never compare x with y
>and here we do (indirectly, of course).
>

I think so. "Find all rectangular regions that cover a point":

select XMIN,YMIN,XMAX,YMAX from RECTANGLE where XMIN < PX < XMAX and YMIN < PY < YMAX Received on Thu Jun 07 2001 - 17:26:40 CDT