The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.07 - July (2008 vol.20)
pp: 894-910
ABSTRACT
Given a set of data points P and a query point q in a multidimensional space, Reverse Nearest Neighbor (RNN) query finds data points in P whose nearest neighbors are q. Reverse k-Nearest Neighbor (RkNN) query (where k ≥ 1) generalizes RNN query to find data points whose kNNs include q. For RkNN query semantics, q is said to have influence to all those answer data points. The degree of q?s influence on a data point p (∈ P) is denoted by κp where q is the κp-th NN of p. We introduce a new variant of RNN query, namely, Ranked Reverse Nearest Neighbor (RRNN) query, that retrieves t data points most influenced by q, i.e., the t data points having the smallest κ?s with respect to q. To answer this RRNN query efficiently, we propose two novel algorithms, κ-Counting and κ-Browsing that are applicable to both monochromatic and bichromatic scenarios and are able to deliver results progressively. Through an extensive performance evaluation, we validate that the two proposed RRNN algorithms are superior to solutions derived from algorithms designed for RkNN query.
INDEX TERMS
Database, Query Processing, Algorithms, Nearest Neighbor, Reverse Nearest Neighbor
CITATION
Ken C.K. Lee, Baihua Zheng, Wang-Chien Lee, "Ranked Reverse Nearest Neighbor Search", IEEE Transactions on Knowledge & Data Engineering, vol.20, no. 7, pp. 894-910, July 2008, doi:10.1109/TKDE.2008.36
REFERENCES
[1] E. Achtert, C. Böhm, P. Kröger, P. Kunath, A. Pryakhin, and M. Renz, “Efficient Reverse $k\hbox{-}{\rm Nearest}$ Neighbor Search in Arbitrary Metric Spaces,” Proc. ACM SIGMOD '06, pp. 515-526, June 2006.
[2] N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger, “The ${\rm R}^{\ast}\hbox{-}{\rm Tree}$ : An Efficient and Robust Access Method for Points and Rectangles,” Proc. ACM SIGMOD '90, pp. 322-331, May 1990.
[3] 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 '02), pp. 44-53, July 2002.
[4] A. Corral, Y. Manolopoulos, Y. Theodoridis, and M. Vassilakopoulos, “Closest Pair Queries in Spatial Databases,” Proc. ACM SIGMOD '00, pp. 189-200, May 2000.
[5] H. Ferhatosmanoglu, I. Stanoi, D. Agrawal, and A. El Abbadi, “Constrained Nearest Neighbor Queries,” Proc. Seventh Int'l Symp. Advances in Spatial and Temporal Databases (SSTD '01), pp. 257-278, July 2001.
[6] A. Guttman, “R-Trees: A Dynamic Index Structure for Spatial Searching,” Proc. ACM SIGMOD '84, pp. 47-57, June 1984.
[7] G.R. Hjaltason and H. Samet, “Distance Browsing in Spatial Databases,” ACM Trans. Database System (TODS), vol. 24, no. 2, pp.265-318, 1999.
[8] F. Korn and S. Muthukrishnan, “Influence Sets Based on Reverse Nearest Neighbor Queries,” Proc. ACM SIGMOD '00, pp. 201-212, May 2000.
[9] F. Korn, S. Muthukrishnan, and D. Srivastava, “Reverse Nearest Neighbor Aggregates over Data Streams,” Proc. 28th Int'l Conf. Very Large Data Bases (VLDB '02), pp. 814-825, Aug. 2002.
[10] I. Lazaridis and S. Mehrotra, “Progressive Approximate Aggregate Queries with a Multi-Resolution Tree Structure,” Proc. ACM SIGMOD '01, pp. 401-412, May 2001.
[11] M.-L. Lee, W. Hsu, C.S. Jensen, B. Cui, and K.L. Teo, “Supporting Frequent Updates in R-Trees: A Bottom-Up Approach,” Proc. 29th Int'l Conf. Very Large Data Bases (VLDB '03), pp. 608-619, Sept. 2003.
[12] K.-I. Lin, M. Nolen, and C. Yang, “Applying Bulk Insertion Techniques for Dynamic Reverse Nearest Neighbor Problems,” Proc. Seventh Int'l Database Eng. and Applications Symp. (IDEAS '03), pp. 290-297, July 2003.
[13] N. Roussopoulos, S. Kelley, and F. Vincent, “Nearest Neighbor Queries,” Proc. ACM SIGMOD '95, pp. 71-79, May 1995.
[14] A. Singh, H. Ferhatosmanoglu, and A. Saman Tosun, “High Dimensional Reverse Nearest Neighbor Queries,” Proc. ACM Int'l Conf. Information and Knowledge Management (CIKM '03), pp. 91-98, Nov. 2003.
[15] I. Stanoi, D. Agrawal, and A. El Abbadi, “Reverse Nearest Neighbor Queries for Dynamic Databases,” Proc. ACM SIGMOD Workshop Research Issues in Data Mining and Knowledge Discovery (DMKD), 2000.
[16] I. Stanoi, M. Riedewald, D. Agrawal, and A. El Abbadi, “Discovery of Influence Sets in Frequently Updated Databases,” Proc. 27th Int'l Conf. Very Large Data Bases (VLDB '01), pp. 99-108, Sept. 2001.
[17] Y. Tao, D. Papadias, and X. Lian, “Reverse $k{\rm NN}$ Search in Arbitrary Dimensionality,” Proc. 30th Int'l Conf. Very Large Data Bases (VLDB '04), pp. 744-755, Aug.-Sept. 2004.
[18] C. Xia, W. Hsu, and M.-L. Lee, “ERkNN: Efficient Reverse $k\hbox{-}{\rm Nearest}$ Neighbors Retrieval with Local $k{\rm NN}\hbox{-}{\rm Distance}$ Estimation,” Proc. ACM Int'l Conf. Information and Knowledge Management (CIKM '05), pp. 533-540, Oct.-Nov. 2005.
[19] T. Xia and D. Zhang, “Continuous Reverse Nearest Neighbor Monitoring,” Proc. 22nd Int'l Conf. Data Eng. (ICDE '06), p. 77, Apr. 2006.
[20] T. Xia, D. Zhang, E. Kanoulas, and Y. Du, “On Computing ${\rm Top}\hbox{-}t$ Most Influential Spatial Sites,” Proc. 31st Int'l Conf. Very Large Data Bases (VLDB '05), pp. 946-957, Aug.-Sept. 2005.
[21] X. Xiong and W.G. Aref, “R-Trees with Update Memos,” Proc. 22nd Int'l Conf. Data Eng. (ICDE '06), p. 22, Apr. 2006.
[22] C. Yang and K.-I. Lin, “An Index Structure for Efficient Reverse Nearest Neighbor Queries,” Proc. 17th Int'l Conf. Data Eng. (ICDE '01), pp. 485-492, Apr. 2001.
[23] M.L. Yiu and N. Mamoulis, “Reverse Nearest Neighbors Search in Ad-Hoc Subspaces,” Proc. 22nd Int'l Conf. Data Eng. (ICDE '06), p.76, Apr. 2006.
[24] M.L. Yiu, D. Papadias, N. Mamoulis, and Y. Tao, “Reverse Nearest Neighbors in Large Graphs,” Proc. 21st Int'l Conf. Data Eng. (ICDE '05), pp. 186-187, 2005.
26 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool