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 where it is often a feature to report events that lie nearby a planned route. The simple method of performing repeated range query (RRQ), i.e. the standard range query for each query point p/sub i/ (1 /spl les/ i /spl les/ n) and combining the results is inefficient as it involves multiple searches on the database. We present an algorithm for the PRQ that uses only one pass of the R-tree while simultaneously process all the points in the query path P. We generalize pruning rules for the standard range query and also present new ones for efficient processing of PRQ. Extensive experiments on the PRQ and RRQ using various different datasets (real and randomly-generated), different R-tree variants (including bulk-loaded ones), over different query paths P, and search distances d. Experiments show that the algorithm for PRQ outperforms RRQ significantly and that this is consistent across the various problem parameters studied. Recently, we have also compared this basic PRQ algorithm with more refined techniques for the PRQ such as the sorted-path algorithm and the rectangle intersection method. Our simple algorithm performs well in comparison to these more sophisticated methods.