This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Threshold-Based Algorithm for Continuous Monitoring of k Nearest Neighbors
November 2005 (vol. 17 no. 11)
pp. 1451-1464
Assume a set of moving objects and a central server that monitors their positions over time, while processing continuous nearest neighbor queries from geographically distributed clients. In order to always report up-to-date results, the server could constantly obtain the most recent position of all objects. However, this naïve solution requires the transmission of a large number of rapid data streams corresponding to location updates. Intuitively, current information is necessary only for objects that may influence some query result (i.e., they may be included in the nearest neighbor set of some client). Motivated by this observation, we present a threshold-based algorithm for the continuous monitoring of nearest neighbors that minimizes the communication overhead between the server and the data objects. The proposed method can be used with multiple, static, or moving queries, for any distance definition, and does not require additional knowledge (e.g., velocity vectors) besides object locations.

[1] C. Bohm, “A Cost Model for Query Processing in High Dimensional Data Spaces,” ACM Trans. Database Systems, vol. 25, no. 2, pp. 129-178, 2000.
[2] T. Brinkhoff, “A Framework for Generating Network-Based Moving Objects,” GeoInformatica, vol. 6, no. 2, pp. 153-180, 2002.
[3] R. Benetis, C. Jensen, G. Karciauskas, and S. Saltenis, “Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects,” Proc. 2002 Int'l Symp. Database Eng. & Applications (IDEAS), 2002.
[4] B. Babcock and C. Olston, “Distributed Top-k Monitoring,” Proc. ACM SIGMOD Conf., 2003.
[5] Y. Cai, K. Hua, and G. Cao, “Processing Range-Monitoring Queries on Heterogeneous Mobile Objects,” Proc. 2004 IEEE Int'l Conf. Mobile Data Management, 2004.
[6] M. Dilman and D. Raz, “Efficient Reactive Monitoring,” Proc. INFOCOM Conf., 2001.
[7] B. Gedik and L. Liu, “MobiEyes: Distributed Processing of Continuously Moving Queries on Moving Objects in a Mobile System,” Proc. Int'l Conf. Extending Database Technology, 2004.
[8] G. Hjaltason and H. Samet, “Distance Browsing in Spatial Databases,” ACM Trans. Database Systems, vol. 24, no. 2, pp. 265-318, 1999.
[9] C. Jones, K. Sivalingam, P. Agrawal, and J. Chen, “A Survey of Energy Efficient Network Protocols for Wireless Networks,” Wireless Networks, vol. 7, no. 4, pp. 343-358, 2001.
[10] N. Koudas, B. Ooi, K. Tan, and R. Zhang, “Approximate NN Queries on Streams with Guaranteed Error/Performance Bounds,” Proc. Very Large Data Bases Conf., 2004.
[11] D. Kalashnikov, S. Prabhakar, and S. Hambrusch, “Main Memory Evaluation of Monitoring Queries Over Moving Objects,” Distributed and Parallel Databases, vol. 15, no. 2, pp. 117-135, 2004.
[12] K. Mouratidis, M. Hadjieleftheriou, and D. Papadias, “Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring,” Proc. ACM SIGMOD Conf., 2005.
[13] S. Madden, H. Shah, J. Hellerstein, and V. Raman, “Continuously Adaptive Continuous Queries over Streams,” Proc. ACM SIGMOD Conf., 2002.
[14] M. Mokbel, X. Xiong, and W. Aref, “SINA: Scalable Incremental Processing of Continuous Queries in Spatio-Temporal Databases,” Proc. ACM SIGMOD Conf., 2004.
[15] S. Prabhakar, Y. Xia, D. Kalashnikov, W. Aref, and S. Hambrusch, “Query Indexing and Velocity Constrained Indexing: Scalable Techniques for Continuous Queries on Moving Objects,” IEEE Trans. Computers, vol. 51, no. 10, pp. 1124-1140, 2002.
[16] D. Papadias, J. Zhang, N. Mamoulis, and Y. Tao, “Query Processing in Spatial Network Databases,” Proc. Very Large Data Bases Conf., 2003.
[17] N. Roussopoulos, S. Kelly, and F. Vincent, “Nearest Neighbor Queries,” Proc. ACM SIGMOD Conf., 1995.
[18] Z. Song and N. Roussopoulos, “K-Nearest Neighbor Search for Moving Query Point,” Proc. Int'l Symp. Spatial and Temporal Databases, 2001.
[19] Y. Tao and D. Papadias, “Spatial Queries in Dynamic Environments,” ACM Trans. Databsase Systems, vol. 28, no. 2, pp. 101-139, 2003.
[20] X. Xiong, M. Mokbel, and W. Aref, “SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-Temporal Databases,” Proc. Int'l Conf. Data Eng., 2005.
[21] X. Yu, K. Pu, and N. Koudas, “Monitoring K-Nearest Neighbor Queries over Moving Objects,” Proc. Int'l Conf. Data Eng., 2005.
[22] B. Zheng and D. Lee, “Semantic Caching in Location-Dependent Query Processing,” Proc. Int'l Symp. Spatial and Temporal Databases, 2001.
[23] D. Zhang, V. Tsotras, and D. Gunopulos, “Efficient Aggregation over Objects with Extent,” Proc. ACM Symp. Principles of Database Systems, 2002.
[24] J. Zhang, M. Zhu, D. Papadias, Y. Tao, and D. Lee, “Location-Based Spatial Queries,” Proc. SIGMOD Conf., 2003.

Index Terms:
Index Terms- Spatial databases, location-dependent and sensitive, query processing.
Citation:
Kyriakos Mouratidis, Dimitris Papadias, Spiridon Bakiras, Yufei Tao, "A Threshold-Based Algorithm for Continuous Monitoring of k Nearest Neighbors," IEEE Transactions on Knowledge and Data Engineering, vol. 17, no. 11, pp. 1451-1464, Nov. 2005, doi:10.1109/TKDE.2005.172
Usage of this product signifies your acceptance of the Terms of Use.