Scalable processing of continuous K-nearest neighbor queries with uncertain velocity
Pages 9256 - 9265
Abstract
Continuous K-nearest neighbor (CKNN) query is an important type of spatio-temporal queries. Given a time interval [t"s,t"e] and a moving query object q, a CKNN query is to find the K-nearest neighbors (KNNs) of q at each time instant within [t"s,t"e]. In this paper, we focus on the issue of scalable processing of CKNN queries over moving objects with uncertain velocity. Due to the large amount of CKNN queries that need to be evaluated concurrently, efficiently processing such queries inevitably becomes more complicated. We propose an index structure, namely the CI-tree, to predetermine and organize the candidates for each query issued by the user from anywhere and anytime. When the CKNN queries are evaluated, their corresponding candidates can be rapidly retrieved by traversing the CI-tree so that the processing time is greatly reduced. A comprehensive set of experiments is performed to demonstrate the effectiveness and the efficiency of the CI-tree.
References
[1]
Benetis, R., Jensen, C. S., Karciauskas, G. & Saltenis, S. (2002). Nearest neighbor and reverse nearest neighbor queries for moving objects. In Proceedings of the international database engineering and applications symposium, Canada, July 17-19.
[2]
Nearest neighbor and reverse nearest neighbor queries for moving objects. VLDB Journal. v15 i3. 229-249.
[3]
Guttman, A. (1984). R-trees: A dynamic index structure for spatial searching. In Proceedings of ACM sigmod.
[4]
Continuous K-nearest neighbor query for moving objects with uncertain velocity. GeoInformatica. v13 i1. 1-25.
[5]
Iwerks, G., Samet, H., & Smith, K. (2003). Continuous K-nearest neighbor queries for continuously moving points with updates. In Proceedings of the international conference on very large data bases. Berlin, Germany, September 9-12.
[6]
Lee, K. C. K., Leong, H. V., Zhou, J., & Si, A. (2005). An efficient algorithm for predictive continuous nearest neighbor query processing and result maintenance. In Proceedings of the international conference on mobile data management.
[7]
Mouratidis, K., Hadjieleftheriou, M., & Papadias, D. (2005). Conceptual partitioning: An efficient method for continuous nearest neighbor monitoring. In Proceedings of the ACM SIGMOD international conference on management of data.
[8]
Fast nearest-neighbor query processing in moving-object databases. GeoInformatica. v7 i2. 113-137.
[9]
Saltenis, S., Jensen, C. S., Leutenegger, S. T., & Lopez, M. A. (2000). Indexing the positions of continuously moving objects. In Proceedings of the ACM SIGMOD international conference on management of data.
[10]
Song, Z., & Roussopoulos, N. (2001). K-nearest neighbor search for moving query point. In Proceedings of 7th international symposium on advances in spatial and temporal databases. Redondo Beach, CA, USA, July 12-15.
[11]
Tao, Y., & Papadias, D. (2002). Time parameterized queries in spatio-temporal databases. In Proceedings of the ACM SIGMOD, Madison, Wisconsin.
[12]
Tao, Y., Papadias, D., & Shen, Q. (2002). Continuous nearest neighbor search. In International conference on very large data bases. Hong Kong, China, August 20-23.
[13]
Yu, X., Pu, K. Q., & Koudas, N. (2005). Monitoring K-nearest neighbor queries over moving objects. In Proceedings of the international conference on data engineering.
[14]
Xiong, X., Mokbel, M. F., & Aref, W. G. (2005). SEA-CNN: Scalable processing of continuous K-nearest neighbor queries in spatio-temporal databases. In Proceedings of the international conference on data engineering.
- Scalable processing of continuous K-nearest neighbor queries with uncertain velocity
Recommendations
Continuous K-Nearest Neighbor Query for Moving Objects with Uncertain Velocity
AbstractOne of the most important queries in spatio-temporal databases that aim at managing moving objects efficiently is the continuous K-nearest neighbor (CKNN) query. A CKNN query is to retrieve the K-nearest neighbors (KNNs) of a moving user at each ...
Efficient evaluation of continuous spatio-temporal queries on moving objects with uncertain velocity
Continuous Range (CR) query and Continuous K-Nearest Neighbor (CKNN) query are two important types of spatio-temporal queries. Given a time interval [t s , t ...
Scalable Processing of Continuous K-Nearest Neighbor Queries with Uncertainty in Spatio-Temporal Databases
ICRCCS '09: Proceedings of the 2009 International Conference on Research Challenges in Computer ScienceContinuous K-Nearest Neighbor (CKNN) query is an important type of spatio-temporal queries. Given a time interval [ts, te] and a moving query object q, a CKNN query is to find the K-Nearest Neighbors (KNNs) of q at each time instant within [ts, te]. In ...
Comments
Information & Contributors
Information
Published In
Copyright © Elsevier Ltd © 2011.
Publisher
Pergamon Press, Inc.
United States
Publication History
Published: 01 August 2011
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 25 Jan 2025