
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Haibo Hu, Dik Lun Lee, "Range NearestNeighbor Query," IEEE Transactions on Knowledge and Data Engineering, vol. 18, no. 1, pp. 7891, January, 2006.  
BibTex  x  
@article{ 10.1109/TKDE.2006.15, author = {Haibo Hu and Dik Lun Lee}, title = {Range NearestNeighbor Query}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {18}, number = {1}, issn = {10414347}, year = {2006}, pages = {7891}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2006.15}, 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  Range NearestNeighbor Query IS  1 SN  10414347 SP78 EP91 EPD  7891 A1  Haibo Hu, A1  Dik Lun Lee, PY  2006 KW  Index Terms Spatial database KW  nearestneighbor search. VL  18 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] F. Korn, N. Sidiropoulos, C. Faloutsos, E. Siegel, and Z. Protopapas, “Fast Nearest Neighbor Search in Medical Image Databases,” Proc. 22nd Int'l Conf. Very Large Data Bases, pp. 215226, 1996.
[2] T. Seidl and H.P. Kriegel, “Optimal MultiStep KNearest Neighbor Search,” Proc. 1998 ACM SIGMOD Int'l Conf. Management of Data, pp. 154165, 1998.
[3] R. Weber, H.J. Schek, and S. Blott, “A Quantitative Analysis and Performance Study for SimilaritySearch Methods in HighDimensional Spaces,” Proc. 24th Int'l Conf. Very Large Data Bases, pp. 194205, 1998.
[4] B. Cui, B.C. Ooi, J. Su, and K.L. Tan, “Contorting High Dimensional Data for Efficient Main Memory KNN Processing,” Proc. 2003 ACM SIGMOD Int'l Conf. Management of Data, pp. 479490, 2003.
[5] Y. Tao, D. Papadias, and Q. Shen, “Continuous Nearest Neighbor Search,” Proc. Very Large Data Bases Conf., pp. 287298, 2002.
[6] N. Roussopoulos, S. Kelley, and F. Vincent, “Nearest Neighbor Queries,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 7179, 1995.
[7] G.R. Hjaltason and H. Samet, “Distance Browsing in Spatial Databases,” ACM Trans. Database Systems (TODS), vol. 24, no. 2, pp. 265318, 1999.
[8] A. Guttman, “RTrees: A Dynamic Index Structure for Spatial Searching,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 4757, 1984.
[9] T. Sellis, N. Roussopoulos, and C. Faloutsos, “The ${\rm{R^+{\hbox{}}Tree}}$ : A Dynamic Index for Multidimensional Objects,” Proc. Very Large Data Bases Conf., pp. 311, 1987.
[10] N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger, “The ${\rm{R^+{\hbox{}}Tree}}$ : An Efficient and Robust Access Method for Points and Rectangles,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 322331, 1990.
[11] Z. Song and N. Roussopoulos, “KNearest Neighbor Search for Moving Query Point,” Proc. Symp. Spatial and Temporal Databases, pp. 7996, 2001.
[12] D.A. White and R. Jain, “Similarity Indexing with the SSTree,” Proc. Int'l Conf. Data Eng. (ICDE), pp. 516523, 1996.
[13] N. Katayama and S. Satoh, “The SRTree: An Index Structure for HighDimensional Nearest Neighbor Queries,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 369380, 1997.
[14] S.W. Kim, C.C. Aggarwal, and P.S. Yu, “Effective Nearest Neighbor Indexing with the Euclidean Metric,” Proc. Conf. Information and Knowledge Management, pp. 916, 2001.
[15] C. Yu, B.C. Ooi, K.L. Tan, and H.V. Jagadish, “Indexing the Distance: An Efficient Method to KNN Processing,” Proc. Very Large Data Bases Conf., pp. 421430, 2001.
[16] S. Berchtold, B. Ertl, D.A. Keim, H.P. Kriegel, and T. Seidl, “Fast Nearest Neighbor Search in HighDimensional Spaces,” Proc. Int'l Conf. Data Eng., pp. 209218, 1998.
[17] S. Berchtold, D.A. Keim, H.P. Kriegel, and T. Seidl, “Indexing the Solution Space: A New Technique for Nearest Neighbor Search in HighDimensional Space,” IEEE Trans. Knowledge and Data Eng., vol. 12, no. 1, pp. 4557, Jan./Feb. 2000.
[18] B. Zheng, J. Xu, W.C. Lee, and D.L. Lee, “GridPartition Index: A Hybrid Approach to NearestNeighbor Queries in Wireless LocationBased Services,” VLDB J., 2005.
[19] M.J. Panik, Linear Programming: Mathematics, Theory and Algorithms. Kluwer Academic, 1996.
[20] B. Moon, H. Jagadish, C. Faloutsos, and J.H. Saltz, “Analysis of the Clustering Properties of the Hilbert SpaceFilling Curve,” IEEE Trans. Knowledge and Data Eng., vol. 13, no. 1, pp. 124141, Jan./Feb. 2001.
[21] Y. Theodoridis, “Spatial Datasets: An Unofficial Collection,” http://dke.cti.gr/People/ytheod/research/ datasets spatial. html, 2005.
[22] S.J. Fortune, “A Sweepline Algorithm for Voronoi Diagrams,” Algorithmica, vol. 2, pp. 153174, 1987.
[23] A. Hinneburg, C.C. Aggarwal, and D.A. Keim, “What is the Nearest Neighbor in High Dimensional Spaces?” Proc. 26th Int'l Conf. Very Large Data Bases, pp. 506515, 2000.