Abstract
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 NodeIn, 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Chan, E.P.F.: Evaluation of Buffer Queries in Spatial Databases. In: Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J. (eds.) SSTD 2001. LNCS, vol. 2121, pp. 197–216. Springer, Heidelberg (2001)
Garcia, Y.J., Lopez, M.A., Leutnegger, S.T.: A Greedy Algorithm for Bulk Loading R-Trees. In: Proc. of 6th ACM Symp. on Geographic Information Systems, pp. 163–164 (1998)
Mehlhorn, K., Näher, S.: LEDA, A Platform For Combinatorial and Geometric Computing. Communications of the ACM, 96–102 (1995)
Ng, H.K., Leong, H.W., Ho, N.L.: Efficient Algorithm For A New Path-Based Range Query In Spatial Databases, National University of Singapore (2003) (manuscript)
Papadopoulos, A., Manolopoulos, Y.: Parallel Processing of Nearest Neighbor Queries in Declustered Spatial Data. In: Proc. of the 1998 ACM SIGMOD Conf., pp. 225–236 (1998)
Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction, pp. 351–355. Springer, Heidelberg (1985)
Roussopoulos, N., Kelley, S., Vincent, F.: Nearest Neighbor Queries. In: Proc. of the 1995 ACM SIGMOD Conf., pp. 71–79 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ng, H.K., Leong, H.W. (2004). Path-Based Range Query Processing Using Sorted Path and Rectangle Intersection Approach. In: Lee, Y., Li, J., Whang, KY., Lee, D. (eds) Database Systems for Advanced Applications. DASFAA 2004. Lecture Notes in Computer Science, vol 2973. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24571-1_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-24571-1_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21047-4
Online ISBN: 978-3-540-24571-1
eBook Packages: Springer Book Archive