Abstract
The query for retrieving the rank of all neighbors of a moving object at any given time, a continuous rank query, is an important case of continuous nearest neighbor (CNN) queries. An application for ranking queries is given by an ambulance driver who needs to keep track of the closest hospitals at all times. We present a set of incremental algorithms that facilitate efficient rank updates for some or all neighbors of a moving query point. The proposed algorithms allow us not only to maintain the exact rank of all n neighbors at any given time but also to track the rank of a subset of all neighbors. We show that updates for these continuous rank queries can be performed in linear time for arbitrary polygonal curves in two dimensions and in logarithmic time for movements along a fixed direction. Instead of using Voronoi diagrams, our algorithms are based on small subsets of all bisectors between neighbors. We prove that it is sufficient to keep track of only n–1 bisectors for all n neighbors. The algorithms for maintaining the rank only require minimal incremental updates on the bisector sets.
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.
References
Aurenhammer, F.: Voronoi diagrams: A survey of a fundamental geometric data structure. ACM Computing Surveys 23(3), 345–405 (1991)
Benetis, R., Jensen, C.S., Karciauskas, G., Saltenis, S.: Nearest neighbor and reverse nearest neighbor queries for moving objects. In: Proceedings of the IEEE IDEAS, Edmonton, Canada, pp. 44–53 (July 2002)
Chon, H.D., Agrawal, D., El Abbadi, A.: Range and KNN query processing for moving objects in grid model. Mobile Networks and Applications 8(4), 401–412 (2003)
Hjaltason, G., Samet, H.: Ranking in spatial databases. In: Egenhofer, M.J., Herring, J.R. (eds.) SSD 1995. LNCS, vol. 951, pp. 83–95. Springer, Heidelberg (1995)
Hjaltason, G., Samet, H.: Distance browsing in spatial databases. ACM Transactions on Database Systems 24(2), 265–318 (1999)
Hjaltason, G., Samet, H.: Index-driven similarity search in metric spaces. ACM Transactions on Database Systems 28(4), 517–580 (2003)
Hu, H., Xu, J., Lee, D.L.: A generic framework for monitoring continuous spatial queries over moving objects. In: Proceedings of the ACM SIGMOD, Baltimore, MD, pp. 479–490 (June 2005)
Iwerks, G.S., Samet, H., Smith, K.: Continuous k-nearest neighbor queries for continuously moving points with updates. In: Aberer, K., Koubarakis, M., Kalogeraki, V. (eds.) VLDB 2003. LNCS, vol. 2944, pp. 512–523. Springer, Heidelberg (2004)
Mokbel, M.F.: Continuous query processing in spatio-temporal databases. In: Lindner, W., Mesiti, M., Türker, C., Tzitzikas, Y., Vakali, A.I. (eds.) EDBT 2004. LNCS, vol. 3268, pp. 100–111. Springer, Heidelberg (2004)
Mouratidis, K., Hadjieleftheriou, M., Papadias, D.: Conceptual partitioning: An efficient method for continuous nearest neighbor monitoring. In: Proceedings of the ACM SIGMOD, Baltimore, MD, pp. 634–645 (June 2005)
Okabe, A., Boots, B., Sugihara, K., Chiu, S.N.: Spatial Tessellations: Concepts and Applications of Voronoi Diagrams, 2nd edn. Wiley, Chichester (2000)
O’Rourke, J.: Computational Geometry in C. Cambridge University, Cambridge (1994)
Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: Proceedings of the ACM SIGMOD, San Jose, CA, pp. 71–79 (May 1995)
Saltenis, S., Jensen, C.S., Leutenegger, S.T., Lopez, M.A.: Indexing the positions of continuously moving objects. In: Proceedings of ACM SIGMOD, Dallas, TX, pp. 331–342 (May 2000)
Samet, H.: Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS. Addison-Wesley, Reading (1990)
Samet, H.: The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading (1990)
Samet, H.: Foundations of Multidimensional Data Structures. Morgan Kaufmann, San Francisco (2006)
Song, Z., Roussopoulos, N.: K-nearest neighbor search for moving query point. In: Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J. (eds.) SSTD 2001. LNCS, vol. 2121, pp. 79–96. Springer, Heidelberg (2001)
Tao, Y., Papadias, D.: Time-parameterized queries in spatio-temporal databases. In: Proceedings of the ACM SIGMOD, Madison, WI, pp. 334–345 (June 2002)
Tao, Y., Papadias, D.: Spatial queries in dynamic environments. ACM Transactions on Database Systems 28(2), 101–139 (2003)
Tao, Y., Papadias, D., Shen, Q.: Continuous nearest neighbor search. In: Proceedings of the VLDB, pp. 287–298 (August 2002)
Xiong, X., Mokbel, M.F., Aref, W.G.: SEA-CNN: Scalable processing of continuous k-nearest neighbor queries in spatio-temporal databases. In: Proceedings of the IEEE ICDE, Tokyo, Japan, pp. 643–654 (April 2005)
Zhang, J., Zhu, M., Papadias, D., Tao, Y., Lee, D.: Location-based spatial queries. In: Proceeding of the ACM SIGMOD, San Diego, CA, pp. 443–453 (June 2003)
Zheng, B., Lee, D.L.: Semantic caching in location-dependent query processing. In: Proceedings of the SSTD, Redondo Beach, CA, pp. 97–116 (July 2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kulik, L., Tanin, E. (2006). Incremental Rank Updates for Moving Query Points. In: Raubal, M., Miller, H.J., Frank, A.U., Goodchild, M.F. (eds) Geographic Information Science. GIScience 2006. Lecture Notes in Computer Science, vol 4197. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11863939_17
Download citation
DOI: https://doi.org/10.1007/11863939_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44526-5
Online ISBN: 978-3-540-44528-9
eBook Packages: Computer ScienceComputer Science (R0)