Abstract
In this paper, we investigate the problem of efficiently processing historical continuous k-Nearest Neighbor (HCkNN) queries on R-tree-like structures storing historical information about moving object trajectories. The existing approaches for HCkNN queries need high I/O (i.e., number of node accesses) and CPU costs since they follow depth-first fashion. Motivated by this observation, we present two algorithms, called HCP-kNN and HCT-kNN, which deal with the HCkNN retrieval with respect to the stationary query point and the moving query trajectory, respectively. The core of our solution employs best-first traversal paradigm and enables effective update strategies to maintain the nearest lists. Extensive performance studies with real and synthetic datasets show that the proposed algorithms outperform their competitors significantly in both efficiency and scalability.
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
Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-tree: An Efficient and Robust Access Method for Points and Rectangles. In: SIGMOD, pp. 322–331 (1990)
Benetis, R., Jensen, C.S., Karciauskas, G., Saltenis, S.: Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects. In: IDEAS, pp. 44–53 (2002)
Corral, A., Manolopoulos, Y., Theodoridis, Y., Vassilakopoulos, M.: Closest pair queries in spatial databases. In: SIGMOD, pp. 189–200 (2000)
Frentzos, E., Gratsias, K., Pelekis, N., Theodoridis, Y.: Nearest Neighbor Search on Moving Object Trajectories. In: Bauzer Medeiros, C., Egenhofer, M.J., Bertino, E. (eds.) SSTD 2005. LNCS, vol. 3633, pp. 328–345. Springer, Heidelberg (2005)
Hjaltason, G.R., Samet, H.: Distance Browsing in Spatial Databases. ACM TODS 24, 265–318 (1999)
Iwerks, G.S., Samet, H., Smith, K.: Continuous k-Nearest Neighbor Queries for Continuously Moving Points with Updates. In: VLDB, pp. 512–523 (2003)
Manolopoulos, Y., Nanopoulos, A., Papadopoulos, A.N., Theodoridis, Y.: R-trees: theory and applications. Springer, Heidelberg (2005)
Mouratidis, K., Hadjieleftheriou, M., Papadias, D.: Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring. In: SIGMOD, pp. 634–645 (2005)
Mouratidis, K., Papadias, D., Bakiras, S., Tao, Y.: A Threshold-based Algorithm for Continuous Monitoring of k Nearest Neighbors. TKDE 17, 1451–1464 (2005)
Pfoser, D., Jensen, C.S., Theodoridis, Y.: Novel Approaches in Query Processing for Moving Object Trajectories. In: VLDB, pp. 395–406 (2000)
Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: SIGMOD, pp. 71–79 (1995)
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., Shen, Q.: Continuous Nearest Neighbor Search. In: VLDB, pp. 287–298 (2002)
Tao, Y., Papadias, D.: Time Parameterized Queries in Spatio-Temporal Databases. In: SIGMOD, pp. 334–345 (2002)
Theodoridis, Y., Silva, J.R.O., Nascimento, M.A.: On the Generation of Spatiotemporal Datasets. In: Güting, R.H., Papadias, D., Lochovsky, F.H. (eds.) SSD 1999. LNCS, vol. 1651, pp. 147–164. Springer, Heidelberg (1999)
Theodoridis, Y., Vazirgiannis, M., Sellis, T.K.: Spatio-Temporal Indexing for Large Multimedia Applications. In: ICMCS, pp. 441–448 (1996)
Xiong, X., Mokbel, M., Aref, W.: SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-temporal Databases. In: ICDE, pp. 643–654 (2005)
Yu, X., Pu, K., Koudas, N.: Monitoring k-Nearest Neighbor Queries Over Moving Objects. In: ICDE, pp. 631–642 (2005)
Gao, Y., Li, C., Chen, G., Chen, L., Jiang, X., Chen, C.: Efficient k-Nearest-Neighbor Search Algorithms for Historical Moving Object Trajectories. JCST 22, 232–244 (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Gao, Y., Li, C., Chen, G., Li, Q., Chen, C. (2007). Efficient Algorithms for Historical Continuous kNN Query Processing over Moving Object Trajectories. In: Dong, G., Lin, X., Wang, W., Yang, Y., Yu, J.X. (eds) Advances in Data and Web Management. APWeb WAIM 2007 2007. Lecture Notes in Computer Science, vol 4505. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72524-4_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-72524-4_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72483-4
Online ISBN: 978-3-540-72524-4
eBook Packages: Computer ScienceComputer Science (R0)