
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Ken C.K. Lee, Baihua Zheng, WangChien Lee, "Ranked Reverse Nearest Neighbor Search," IEEE Transactions on Knowledge and Data Engineering, vol. 20, no. 7, pp. 894910, July, 2008.  
BibTex  x  
@article{ 10.1109/TKDE.2008.36, author = {Ken C.K. Lee and Baihua Zheng and WangChien Lee}, title = {Ranked Reverse Nearest Neighbor Search}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {20}, number = {7}, issn = {10414347}, year = {2008}, pages = {894910}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2008.36}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  Ranked Reverse Nearest Neighbor Search IS  7 SN  10414347 SP894 EP910 EPD  894910 A1  Ken C.K. Lee, A1  Baihua Zheng, A1  WangChien Lee, PY  2008 KW  Database KW  Query Processing KW  Algorithms KW  Nearest Neighbor KW  Reverse Nearest Neighbor VL  20 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[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. 515526, 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. 322331, 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. 4453, July 2002.
[4] A. Corral, Y. Manolopoulos, Y. Theodoridis, and M. Vassilakopoulos, “Closest Pair Queries in Spatial Databases,” Proc. ACM SIGMOD '00, pp. 189200, 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. 257278, July 2001.
[6] A. Guttman, “RTrees: A Dynamic Index Structure for Spatial Searching,” Proc. ACM SIGMOD '84, pp. 4757, June 1984.
[7] G.R. Hjaltason and H. Samet, “Distance Browsing in Spatial Databases,” ACM Trans. Database System (TODS), vol. 24, no. 2, pp.265318, 1999.
[8] F. Korn and S. Muthukrishnan, “Influence Sets Based on Reverse Nearest Neighbor Queries,” Proc. ACM SIGMOD '00, pp. 201212, 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. 814825, Aug. 2002.
[10] I. Lazaridis and S. Mehrotra, “Progressive Approximate Aggregate Queries with a MultiResolution Tree Structure,” Proc. ACM SIGMOD '01, pp. 401412, May 2001.
[11] M.L. Lee, W. Hsu, C.S. Jensen, B. Cui, and K.L. Teo, “Supporting Frequent Updates in RTrees: A BottomUp Approach,” Proc. 29th Int'l Conf. Very Large Data Bases (VLDB '03), pp. 608619, 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. 290297, July 2003.
[13] N. Roussopoulos, S. Kelley, and F. Vincent, “Nearest Neighbor Queries,” Proc. ACM SIGMOD '95, pp. 7179, 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. 9198, 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. 99108, 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. 744755, 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. 533540, 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. 946957, Aug.Sept. 2005.
[21] X. Xiong and W.G. Aref, “RTrees 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. 485492, Apr. 2001.
[23] M.L. Yiu and N. Mamoulis, “Reverse Nearest Neighbors Search in AdHoc 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. 186187, 2005.