Abstract
Continuous k-nearest neighbors (CKNN) search has been in the core of spatiotemporal database research during the last decade. It is interested in continuously finding the k closest objects to a predefined query object q during a time interval. Existing methods are either computationally intensive performing repetitive queries to the database or restrictive with respect to the application settings. In this paper we develop an efficient method in order to computes CKNN queries for a query point during a specified time interval. The basic advantage of the proposed approach is that only one query is issued per time interval. The R-tree structure is used to index the static objects. An extensive performance evaluation shows that all the techniques we presented boost the query performance greatly.
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., Schneider, R., Seeger, B.: The R*-tree: An Efficient and Robust Access Method for Points and Rectangle. In: ACM SIGMOD, ACM Press, New York (1990)
Sistla, A.P., Wolfson, O., Chamberlain, S., Dao, S.: Modeling and querying moving objects. In: Proceedings of the International Conference on Data Engineering, pp. 422–432 (1997)
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)
Zheng, B., Lee, D.: Semantic caching in location-dependent query processing. In: Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J. (eds.) SSTD 2001. LNCS, vol. 2121, pp. 97–116. Springer, Heidelberg (2001)
Kollios, G., Gunopulos, D., Tsotras, V.J.: Nearest neighbor queries in a mobile environment. In: Böhlen, M.H., Jensen, C.S., Scholl, M.O. (eds.) STDBM 1999. LNCS, vol. 1678, pp. 119–134. Springer, Heidelberg (1999)
Tao, Y., Papadias, D.: Time-parameterized queries in spatio-temporal databases. In: Proceedings ACM SIGMOD Conference, pp. 334–345. ACM Press, New York (2002)
Roussopoulos, N., Kelley, S., Vincent, F.: Nearest Neighbor Queries. In: Proceedings of ACM SIGMOD, ACM Press, New York (1995)
Cheung, K.L., Fu, A.: Enhanced Nearest Neighbor Search on the R-tree. SIGMOD Record 27(3), 16–21 (1998)
Guttman, A.: R-Trees: A Dynamic Index Structure for Spatial Searching. In: ACM SIGMOD, ACM Press, New York (1984)
Benetis, R., Jensen, C., Karciauskas, G., Saltenis, S.: Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects. In: Proc. Int’l Symp. Database Eng. & Applications, pp. 44–53 (2002)
Xiong, X., Mokbel, M.F., Aref, W.G., Hambrusch, S.E., Prabhakar, S.: Scalable Spatio-Temporal Continuous Query Processing for Location-Aware Services. In: Proc. 16th Int’l Conf. Scientific and Statistical Database Management, pp. 317–326 (2004)
Tao, Y., Papadias, D., Shen, Q.: Continuous Nearest Neighbor Search. In: Bressan, S., Chaudhri, A.B., Lee, M.L., Yu, J.X., Lacroix, Z. (eds.) CAiSE 2002 and VLDB 2002. LNCS, vol. 2590, pp. 287–298. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xiao, H., Li, Q., Sheng, Q. (2007). Continuous K-Nearest Neighbor Queries for Moving Objects. In: Kang, L., Liu, Y., Zeng, S. (eds) Advances in Computation and Intelligence. ISICA 2007. Lecture Notes in Computer Science, vol 4683. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74581-5_49
Download citation
DOI: https://doi.org/10.1007/978-3-540-74581-5_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74580-8
Online ISBN: 978-3-540-74581-5
eBook Packages: Computer ScienceComputer Science (R0)