The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.07 - July (2010 vol.22)
pp: 983-999
James M. Kang , University of Minnesota, Minneapolis
Mohamed F. Mokbel , University of Minnesota, Minneapolis
Shashi Shekhar , University of Minnesota, Minneapolis
Tian Xia , Oracle Corporation, Stamford
Donghui Zhang , Northeastern University, Boston
ABSTRACT
This paper presents a novel algorithm for Incremental and General Evaluation of continuous Reverse Nearest neighbor queries (IGERN, for short). The IGERN algorithm is general in that it is applicable for both continuous monochromatic and bichromatic reverse nearest neighbor queries. This problem is faced in a number of applications such as enhanced 911 services and in army strategic planning. A main challenge in these problems is to maintain the most up-to-date query answers as the data set frequently changes over time. Previous algorithms for monochromatic continuous reverse nearest neighbor queries rely mainly on monitoring at the worst case of six pie regions, whereas IGERN takes a radical approach by monitoring only a single region around the query object. The IGERN algorithm clearly outperforms the state-of-the-art algorithms in monochromatic queries. We also propose a new optimization for the monochromatic IGERN to reduce the number of nearest neighbor searches. Furthermore, a filter and refine approach for IGERN (FR-IGERN) is proposed for the continuous evaluation of bichromatic reverse nearest neighbor queries which is an optimized version of our previous approach. The computational complexity of IGERN and FR-IGERN is presented in comparison to the state-of-the-art algorithms in the monochromatic and bichromatic cases. In addition, the correctness of IGERN and FR-IGERN in both the monochromatic and bichromatic cases, respectively, are proved. Extensive experimental analysis using synthetic and real data sets shows that IGERN and FR-IGERN is efficient, is scalable, and outperforms previous techniques for continuous reverse nearest neighbor queries.
INDEX TERMS
Continuous queries, query processing, and reverse nearest neighbor.
CITATION
James M. Kang, Mohamed F. Mokbel, Shashi Shekhar, Tian Xia, Donghui Zhang, "Incremental and General Evaluation of Reverse Nearest Neighbors", IEEE Transactions on Knowledge & Data Engineering, vol.22, no. 7, pp. 983-999, July 2010, doi:10.1109/TKDE.2009.133
REFERENCES
[1] 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 (EDBT), 2004.
[2] H. Hu, J. Xu, and D.L. Lee, "A Generic Framework for Monitoring Continuous Spatial Queries over Moving Objects," Proc. ACM SIGMOD, 2005.
[3] G.S. Iwerks, H. Samet, and K. Smith, "Continuous K-Nearest Neighbor Queries for Continuously Moving Points with Updates," Proc. Int'l Conf. Very Large Data Bases (VLDB), 2003.
[4] I. Lazaridis, K. Porkaew, and S. Mehrotra, "Dynamic Queries over Mobile Objects," Proc. Int'l Conf. Extending Database Technology (EDBT), 2002.
[5] K. Mouratidis, D. Papadias, and M. Hadjieleftheriou, "Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring," Proc. ACM SIGMOD, 2005.
[6] M.F. Mokbel, X. Xiong, and W.G. Aref, "SINA: Scalable Incremental Processing of Continuous Queries in Spatio-Temporal Databases," Proc. ACM SIGMOD, 2004.
[7] S. Prabhakar, Y. Xia, D.V. Kalashnikov, W.G. Aref, and S.E. 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, Oct. 2002.
[8] Y. Tao, D. Papadias, and Q. Shen, "Continuous Nearest Neighbor Search," Proc. Int'l Conf. Very Large Data Bases (VLDB), 2002.
[9] X. Xiong, M.F. Mokbel, and W.G. Aref, "SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-Temporal Databases," Proc. Int'l Conf. Data Eng. (ICDE), 2005.
[10] T. Xia and D. Zhang, "Continuous Reverse Nearest Neighbor Monitoring," Proc. Int'l Conf. Data Eng. (ICDE), 2006.
[11] X. Yu, K.Q. Pu, and N. Koudas, "Monitoring K-Nearest Neighbor Queries over Moving Objects," Proc. Int'l Conf. Data Eng. (ICDE), 2005.
[12] F. Korn and S. Muthukrishnan, "Influence Sets Based on Reverse Nearest Neighbor Queries," Proc. ACM SIGMOD, 2000.
[13] A. Nanopoulos, Y. Theodoridis, and Y. Manolopoulos, "C2P: Clustering Based on Closest Pairs," Proc. Int'l Conf. Very Large Data Bases (VLDB), 2001.
[14] E. Achtert, C. Bahm, P. Krager, P. Kunath, A. Pryakhin, and M. Renz, "Efficient Reverse k-Nearest Neighbor Search in Arbitrary Metric Spaces," Proc. ACM SIGMOD, 2006.
[15] R. Benetis, C.S. Jensen, G. Karciauskas, and S. Saltenis, "Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects," Proc. Int'l Database Eng. and Applications Symp. (IDEAS), 2002.
[16] I. Stanoi, D. Agrawal, and A. ElAbbadi, "Reverse Nearest Neighbor Queries for Dynamic Databases," Proc. ACM SIGMOD Workshop Research Issues in Data Mining and Knowledge Discovery, 2000.
[17] Y. Tao, D. Papadias, and X. Lian, "Reverse kNN Search in Arbitrary Dimensionality," Proc. Int'l Conf. Very Large Data Bases (VLDB), 2004.
[18] Y. Tao, M.L. Yiu, and N. Mamoulis, "Reverse Nearest Neighbor Search in Metric Spaces," IEEE Trans. Knowledge and Data Eng., vol. 18, no. 8, pp. 1239-1252, Sept. 2006.
[19] M.L. Yiu and N. Mamoulis, "Reverse Nearest Neighbors Search in Ad-Hoc Subspaces," Proc. Int'l Conf. Data Eng. (ICDE), 2006.
[20] M.L. Yiu, D. Papadias, N. Mamoulis, and Y. Tao, "Reverse Nearest Neighbors in Large Graphs," IEEE Trans. Knowledge and Data Eng., vol. 18, no. 4, pp. 540-553, Apr. 2006.
[21] J.M. Kang, M.F. Mokbel, S. Shekhar, T. Xia, and D. Zhang, "Continuous Evaluation of Monochromatic and Bichromatic Reverse Nearest Neighbors," Proc. Int'l Conf. Data Eng. (ICDE), pp. 806-815, 2007.
[22] C.S. Jensen, "Database Aspects of Location-Based Services," Location-Based Services, Morgan Kaufmann, pp. 115-148, 2004.
[23] M.F. Mokbel and W.G. Aref, "PLACE: A Scalable Location-Aware Database Server for Spatio-Temporal Data Streams," IEEE Data Eng. Bull., vol. 28, no. 3, pp. 3-10, Sept. 2005.
[24] M. Hadjieleftheriou, G. Kollios, D. Gunopulos, and V.J. Tsotras, "On-Line Discovery of Dense Areas in Spatio-temporal Databases," Proc. Int'l Symp. Spatial and Temporal Databases (SSTD), 2003.
[25] C.S. Jensen, D. Lin, B.C. Ooi, and R. Zhang, "Effective Density Queries on Continuously Moving Objects," Proc. Int'l Conf. Data Eng. (ICDE), 2006.
[26] C. Yang and K.I. Lin, "An Index Structure for Efficient Reverse Nearest Neighbor Queries," Proc. Int'l Conf. Data Eng. (ICDE), 2001.
[27] A. Singh, H. Ferhatosmanoglu, and A.S. Tosun, "High Dimensional Reverse Nearest Neighbor Queries," Proc. Int'l Conf. Information and Knowledge Management (CIKM), 2003.
[28] R. Benetis, C.S. Jensen, G. Karciauskas, and S. Saltenis, "Nearest and Reverse Nearest Neighbor Queries for Moving Objects," Very Large Data Base J., vol. 15, no. 3, pp. 229-249, 2006.
[29] R.H. Güting, V.T. de Almeida, D. Ansorge, T. Behr, Z. Ding, T. Hose, F. Hoffmann, M. Spiekermann, and U. Telle, "SECONDO: An Extensible DBMS Platform for Research Prototyping and Teaching," Proc. Int'l Conf. Data Eng. (ICDE), 2005.
[30] M.F. Mokbel, X. Xiong, W.G. Aref, S. Hambrusch, S. Prabhakar, and M. Hammad, "PLACE: A Query Processor for Handling Real-Time Spatio-Temporal Data Streams (Demo)," Proc. Int'l Conf. Very Large Data Bases (VLDB), 2004.
[31] O. Wolfson, A.P. Sistla, B. Xu, J. Zhou, and S. Chamberlain, "DOMINO: Databases fOr MovINg Objects Tracking (Demo)," Proc. ACM SIGMOD, 1999.
[32] F. Aurenhammer, "Voronoi Diagrams—A Survey of a Fundamental Geometric Data Structure," ACM Computing Surveys, vol. 23, no. 3, pp. 345-405, 1991.
[33] T. Brinkhoff, "A Framework for Generating Network-Based Moving Objects," GeoInformatica, vol. 6, no. 2, pp. 153-180, 2002.
[34] "eCourier," http:/www.ecourier.co.uk, 2007.
6 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool