Path-Based Range Query Processing Using Sorted Path and Rectangle Intersection Approach

摘要

Path-based range query (PRQ) is a class of range query in which given a set of points P in two-dimensional plane that define a path, find the union of all points within a distance d from the points in P. The simple method of performing repeated range query (RRQ), i.e. the standard range query for each query point and combining the results is inefficient as it searches the spatial index multiple times. Current method, using two pruning rules PointOut and Nodeln, of solving PRQ in one pass while simultaneously processing all the points in P involves using minimum and maximum geometric distances of the query points in P was revisited. We further present two techniques for PRQ that improves the running time of the two pruning rules, called sorted path and rectangle intersection. Empirical results from real life datasets supported our theoretic results that PRQ using sorted path is better than the other approaches.