Efficient algorithm for path-based range query in spatial databases


We study the path-based range query (PRQ) for 2-dimensional spatial database defined as follows: given a sequence of query points, P = {p/sub 1/, p/sub 2/,..., p/sub n/}, and a search distance d, we want to report all points in the spatial database that are within a distance d of some point p/sub i/ in P. This query arises from traveler information systems… (More)
DOI: 10.1109/IDEAS.2004.23


12 Figures and Tables

Slides referencing similar topics