Re: Finding matching ranges

From: Mikito Harakiri <>
Date: Thu, 07 Jun 2001 22:26:40 GMT
Message-ID: <AcTT6.264$>

In article <KYST6.225$>, Vadim Tropashko says...
>In article <YKST6.216$>, 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 Fri Jun 08 2001 - 00:26:40 CEST

Original text of this message