Abstract
This paper studies k-nearest-neighbor (kNN) search on R-tree-based structures storing historical information about trajectories. We develop BFPkNN, an efficient best-first based algorithm for handling kNN search with arbitrary values of k, which is I/O optimal, i.e., it performs a single access only to those qualifying nodes that may contain the final result. Furthermore, in order to save memory space consumption and reduce CPU overhead further, several effective pruning heuristics are also proposed. Finally, extensive experiments with synthetic and real datasets show that BFPkNN outperforms its competitor significantly in both efficiency and scalability in all cases.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
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)
Chakka, V.P., Everspaugh, A., Patel, J.M.: Indexing Large Trajectory Data Sets With SETI. In: CIDR (2003)
Cheung, K.L., Fu, A.W.-C.: Enhanced Nearest Neighbour Search on the R-tree. SIGMOD Record 27, 16–21 (1998)
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)
Guttman, A.: R-trees: A Dynamic Index Structure for Spatial Searching. In: SIGMOD, pp. 47–57 (1984)
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)
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)
Papadopoulos, A., Manolopoulos, Y.: Parallel Processing of Nearest Neighbor Queries in Declustered Spatial Data. In: ACM GIS, pp. 35–43 (1996)
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)
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
Gao, Y., Li, C., Chen, G., Chen, L., Jiang, X., Chen, C. (2006). BFPkNN: An Efficient k-Nearest-Neighbor Search Algorithm for Historical Moving Object Trajectories. In: Yakhno, T., Neuhold, E.J. (eds) Advances in Information Systems. ADVIS 2006. Lecture Notes in Computer Science, vol 4243. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11890393_8
Download citation
DOI: https://doi.org/10.1007/11890393_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46291-0
Online ISBN: 978-3-540-46292-7
eBook Packages: Computer ScienceComputer Science (R0)