
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Yufei Tao, Man Lung Yiu, Nikos Mamoulis, "Reverse Nearest Neighbor Search in Metric Spaces," IEEE Transactions on Knowledge and Data Engineering, vol. 18, no. 9, pp. 12391252, September, 2006.  
BibTex  x  
@article{ 10.1109/TKDE.2006.148, author = {Yufei Tao and Man Lung Yiu and Nikos Mamoulis}, title = {Reverse Nearest Neighbor Search in Metric Spaces}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {18}, number = {9}, issn = {10414347}, year = {2006}, pages = {12391252}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2006.148}, 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  Reverse Nearest Neighbor Search in Metric Spaces IS  9 SN  10414347 SP1239 EP1252 EPD  12391252 A1  Yufei Tao, A1  Man Lung Yiu, A1  Nikos Mamoulis, PY  2006 KW  Reverse nearest neighbor KW  metric space. VL  18 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] N. Beckmann, H.P. Kriegel, R. Schneider, and B. Seeger, “The R*Tree: An Efficient and Robust Access Method for Points and Rectangles, ” Proc. SIGMOD Conf., pp. 322331, 1990.
[2] 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), pp. 4453, 2002.
[3] M. Berg, M. Kreveld, M. Overmars, and O. Schwarzkopf, Computational Geometry: Algorithms and Applications. Springer, 2000.
[4] M.M. Breunig, H.P. Kriegel, R.T. Ng, and J. Sander, “LOF: Identifying DensityBased Local Outliers,” Proc. SIGMOD Conf., pp. 93104, 2000.
[5] P. Ciaccia and M. Patella, “Searching in Metric Spaces with UserDefined and Approximate Distances,” ACM Trans. Database Systems, vol. 27, no. 4, pp. 398437, 2002.
[6] P. Ciaccia, M. Patella, and P. Zezula, “MTree: An Efficient Access Method for Similarity Search in Metric Spaces,” Proc. Very Large Data Bases Conf. (VLDB), pp. 426435, 1997.
[7] P. Ciaccia, M. Patella, and P. Zezula, “A Cost Model for Similarity Queries in Metric Spaces,” Proc. Symp. Principles of Database Systems (PODS), pp. 5968, 1998.
[8] H. Ferhatosmanoglu, I. Stanoi, D. Agrawal, and A.E. Abbadi, “Constrained Nearest Neighbor Queries, Proc. Symp. Spatial and Temporal Databases (SSTD), pp. 257278, 2001.
[9] G.R. Hjaltason and H. Samet, “Distance Browsing in Spatial Databases,” ACM Trans. Database Systems, vol. 24, no. 2, pp. 265318, 1999.
[10] G.R. Hjaltason and H. Samet, “IndexDriven Similarity Search in Metric Spaces,” ACM Trans. Database Systems, vol. 28, no. 4, pp. 517580, 2003.
[11] F. Korn and S. Muthukrishnan, “Influence Sets Based on Reverse Nearest Neighbor Queries,” Proc. SIGMOD Conf., pp. 201212, 2000.
[12] K.I. Lin, M. Nolen, and C. Yang, “Applying Bulk Insertion Techniques for Dynamic Reverse Nearest Neighbor Problems,” Proc. Int'l Database Eng. and Applications Symp. (IDEAS), pp. 128132, 2002.
[13] A. Maheshwari, J. Vahrenhold, and N. Zeh, “On Reverse Nearest Neighbor Queries,” Proc. Canadian Conf. Computational Geometry (CCCG), pp. 128132, 2002.
[14] A. Nanopoulos, Y. Theodoridis, and Y. Manolopoulos, “C2P: Clustering Based on Closest Pairs,” Proc. Very Large Data Bases Conf. (VLDB), pp. 331340, 2001.
[15] S. Ramaswamy, R. Rastogi, and K. Shim, “Efficient Algorithms for Mining Outliers from Large Data Sets,” Proc. SIGMOD Conf., pp. 427438, 2000.
[16] N. Roussopoulos, S. Kelley, and F. Vincent, Nearest Neighbor Queries, Proc. SIGMOD Conf., pp. 7179, 1995.
[17] A. Singh, H. Ferhatosmanoglu, and A.S. Tosun, “High Dimensional Reverse Nearest Neighbor Queries,” Proc. Conf. Information and Knowledge Management (CIKM), pp. 9198, 2003.
[18] I. Stanoi, D. Agrawal, and A.E. Abbadi, “Reverse Nearest Neighbor Queries for Dynamic Databases,” Proc. ACM SIGMOD Workshop, pp. 744755, 2000.
[19] Y. Tao, D. Papadias, and X. Lian, “Reverse kNN Search in Arbitrary Dimensionality,” Proc. Very Large Data Bases Conf. (VLDB), pp. 744755, 2004.
[20] C. Yang and K.I. Lin, “An Index Structure for Efficient Reverse Nearest Neighbor Queries,” Proc. Int'l Conf. Data Eng. (ICDE), pp. 485492, 2001.