Dynamic vp-tree indexing for n-nearest neighbor search given pair-wise distances

VLDB Journal

Volumn 9, Issue 2, 2000, Pages 154-173

  Fu, Ada Wai Chee ^a   Chan, Polly Mei Shuen ^a   Cheung, Yin Ling ^a   Moon, Yiu Sang ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Content based retrieval; Indexing; Nearest neighbor search; Pair wise distances; Updating

Indexed keywords

EID: 0034215869     PISSN: 10668888     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00010672     Document Type: Article

References (39)

1. W. A. Ainsworth (1988) Speech Recognition by Machine. London: Peter Peregrinus
2. N. Beckmann, H.P. Kriegel, R. Schneider, B. Seeger (1990) The R*-tree: an efficient and robust access method for points and rectangles. In: Proc. ACM SIGMOD Int. Conf. on the Manage. of Data, pp 322-331, May 1990
3. S. Berchtold, C. Bohm, B. Braunmuller, D. A. Keim, H.P. Kriegel (1997) Fast parallel similarity search in multimedia databases. In: Proc. ACM SIGMOD Int. Conf. on the Manage. of Data, pp. 1-12
4. S. Berchtold, D. A. Keim, H.P. Kriegel (1996) The X-tree: an index structure for high-dimensional data. In: Proc. 22nd Int. Conf. on VLDB, pp. 28-39
5. D. J. Berndt, J. Clifford (1996) Finding Patterns in Time Series: a Dynamic Programming Approach. In: Fayyad U.M., Piatestsky-Shapiro G., Smyth P., Uthurusamy R., (eds) Advances in Knowledge Discovery and Data Mining, Cambridge, MA: AAAI/MIT Press
6. T. Bozkaya, M. Ozoyoglu (1997) Distance-based indexing for high-dimensional metric spaces. In: Proc. ACM SIGMOD Int. Conf. on the Manage. of Data, pp. 357-368
7. S. Brin (1995) Near neighbor search in large metric space In: Proc. 21st Int. Conf. on VLDB, pp 574-584
8. W. A. Burkhard, R. M. Keller (1973) Some approaches to best-match file searching. Commun. of the ACM, 16(4): 230-236, April 1973
9. K. Cheung, A. Fu (1998) Enhanced nearest neighbour search on the r-tree. In: ACM SIGMOD Record, 27(3): 16-21, September 1998
10. T.C. Chiueh (1994) Content-based image indexing. In: Proc. 20th VLDB Conf., pp 582-593
11. T. Ciaccia, Patella M., Zezula P (1997) M-tree: an efficient access method for similarity search in metric. In: Proc. 23rd Int. Conf. on VLDB, pp 426-435, August 1997
12. II-tree: a modified bB-tree supporting concurrency, recovery and node consolidation. In: Proc. 21st Int. Conf. on VLDB, pp 551-561
13. G. Evangelidis, D. Lomet, B. Salzberg (1997) The hBpi-tree: a multi-attribute index supporting concurrency, recovery and node consolidation. The VLDB J., 6(1): 1-25
14. C. Faloutsos, R. Barber, M. Flickner, J. Hafner, W. Niblack, D. Petkovic, W. Equitz (1994) Effic ent and effective querying by image content. J. Intell. Inf. Syst., 3: 231-262, July 1994
15. J.H. Friedman, J.H. Bentley, Finkel A (1977) An algorithm for finding best matches in logarithmic expected time. ACM Trans. on Math. Software, 3: 209-226, September, 1977
16. A. Fu, K.L. Cheung (1997) Enhancements on the R-tree to support efficient similarity search in high-dimensional space. In: Mphil Thesis, Chinese Univ. of Hong Kong
17. W.I. Grosky, R. Mehrotra (1990) Index-based object recognition in pictorial data management. Comput. Vision, 52(3): 416-436
18. V.N. Gudivada, V.V. Raghavan (1995) Content-based image retrieval systems. IEEE Comput., 28(9): 18-22, September 1995
19. A. Guttman (1984) R-trees: a dynamic index structure for spatial searching. In: Proc. ACM SIGMOD Int. Conf. on the Manage. of Data, pp 47-57, June 1984
20. J. Hafner, H. S. Sawhney, W. Equitz, M. Flickner, W. Niblack (1995) Efficient color histogram indexing for quadratic form distance functions. IEEE Trans. on Pattern Anal. and Mach. Intell., 17(7): 729-736, July 1995
21. N. Katayama, S. Satoh (1997) The SR-tree: an index structure for high-dimensional nearest neighbor queries. In: Proc. ACM SIGMOD Int. Conf. on the Manage. of Data, pp. 369-380
22. F. Korn, N. Sidiropoulos, C. Faloutsos, E. Siegel, Z. Protopapas (1996) Fast nearest neighbor search in medical image databases. Technical Report CS-TR-3613, University of Maryland, March 1996
23. J. B. Kruskal, M. Wish (1978) Multidimensional scaling. Beverly Hills, CA: SAGE
24. K.I. Lin, C. Faloutsos (1995) Fastmap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets. In: Proc. ACM SIGMOD, pp. 163-174
25. K.I. Lin, H. V. Jagadish, C. Faloutsos (1994) The TV-tree - an index structure for high-dimensional data. VLDB J., 3: 517-542, October 1995
26. D. B. Lomet, B. Salzberg (1990) The hB-tree: a multiattribute indexing method with good guaranteed performance. ACM TODS, 15(4): 625-658, December 1990
27. W. Niblack, R. Barber, W. Equitz, M. Flickner, E. Glasman, D. Petkovic, P. Yanker, C. Faloutsos, G. Taubin (1993) The QBIC project: querying images by content using color, texture and shape. In: Proc. SPIE: Storage and Retr. for Image and Video Databases, 1908, pp 173-187, February 1993
28. N. Roussopoulos, S. Kelley, F. Vincent (1995) Nearest neighbor queries. In: Proc. ACM SIGMOD Int. Conf. on the Manage. of Data, pp 71-79, June 1995
29. H. Sakoe, S. Chiba (1990) Dynamic Programming Algorithm Optimization for Spoken Word Recognition. In: Waibel, A., Lee K., (eds) Readings in Speech Recognition. San Francsico, CA: Morgan Kaufmann
30. H. Samet (1989) The Design and Analysis of Spatial Data Structures. Reading, MA: Addison-Wesley
31. D. Sankoff, J.B. Kruskal (1983) Time Warps, String Edits and Macromolecules: the Theory and Practice of Sequence Comparisons. Reading, MA: Addison-Wesley
32. T. Seidl, H.P. Kriegel (1998) Optimal multi-step k-nearest neighbor search. In: Proc. ACM SIGMOD Int. Conf. on the Manage. of Data, pp 154-165
33. +-tree: a dynamic index for multidimensional objects. In: Proc. 13th Int. Conf. on VLDB, pp 507-518
34. Y. Theodoridis, T. Sellis (1996) A model for prediction of R-tree performance. In: Proc. ACM Princ. of Database Syst., PODS, pp 161-170
35. S. Thomas, H. Kriegel (1997) Efficient user-adaptable similarity search in large multimedia databases. In: Proc. 23th Int. Conf. on VLDB, pp. 506-515
36. J. Uhlmann (1991) Satisfying general proximity/similarity queries with metric trees. Inf. Process. Lett., 40:4: 175-179, November 1991
37. D. A. White, R. Jain (1996) Algorithms and strategies for similarity retrieval. Technical Report VCL-96-101, University of California, San Diego, July 1996
38. D. A. White, R. Jain (1996) Similarity indexing with the SS-tree. In: Proc. 12th IEEE Int. Conf. on Data Engin., pp 516-523, February 1996
39. P. Yianilos (1993) Data structures and algorithms for nearest neighbor search in general metric spaces. In: Proc. 3rd Annual ACM-SIAM Symp. on Discrete Algorithms, pp 311-321