Array-index: A plug&search K nearest neighbors method for high-dimensional data

Data and Knowledge Engineering

Volumn 52, Issue 3, 2005, Pages 333-352

  Aghbari, Zaher Al ^a  

^a UNIVERSITY OF SHARJAH   (United Arab Emirates)

Author keywords

Image databases; Indexing methods; KNN image search, array index, plug search method

Indexed keywords

ALGORITHMS; ARRAYS; DATA COMPRESSION; IMAGE PROCESSING; INDEXING (OF INFORMATION); SET THEORY; THEOREM PROVING;

ARRAY-INDEX; IMAGE DATABASES; INDEXING METHODS; KNN IMAGE SEARCH; PLUG&SEARCH METHOD;

DATABASE SYSTEMS;

EID: 10444274033     PISSN: 0169023X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.datak.2004.06.015     Document Type: Article

References (33)

1. C.C. Aggarwal, C.M. Procopiuc, J.L. Wolf, P.S. Yu, and J.S. Park Fast algorithms for projected clustering ACM SIGMOD 1999
2. C.C. Aggarwal Towards meaningful high-dimensional nearest neighbor search by human-computer interaction ICDE 2002
3. N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger R*-tree: an efficient and robust access method for points and rectangles ACM SIGMOD May 1990 322 331
4. J.L. Bentley Multidimensional binary search trees in database applications IEEE Trans. Software Eng. SE-5 4 1979 333 340
5. S. Berchtold, C. Bohm, H.V. Jagadish, H.-P. Kriegel, J. Sander, Independent quantization: an index compression technique for high-dimensional data spaces, in: Proc. of ICDE, 2000
6. S. Berchtold, D. Keim, and H.-P. Kriegel The X-tree: an index structure for high-dimensional data VLDB 1996
7. G.-H. Cha, X. Zhu, D. Petkovic, and C.-W. Chung An efficient indexing method for nearest neighbor searches in high-dimensional image databases IEEE Trans. Multimedia 4 1 2002
8. K. Chakrabarti, S. Mehrotra, Local dimensionality reduction: a new approach to indexing high dimensional space, 26th VLDB, Egypt, 2000
9. C. Faloutsos Searching Multimedia Databases By Content 1996 Kluwer Academic Publishers Boston, USA
10. C. Faloutsos, and K. Lin A fast algorithm for indexing data-mining and visualization of traditional and multimedia datasets ACM SIGMOD May 1995
11. C. Faloutsos, M. Ranganathan, and Yannis Manolopoulos Fast subsequence matching in time-series databases ACM SIGMOD 1994
12. C. Faloutsos, S. Roseman, Fractals for Secondaru Key Retrieval. 8th ACM Symposium on Principles of Database Systems (PODS), March 1989
13. M. Flickner, H. Sawhney, W. Niblack, J. Ashley, Q. Huang, B. Dom, M. Gorkani, J. Hafner, D Lee, D. Perkovic, D. Steele, and P. Yanker Query by image and video content: the QBIC system IEEE September 1995
14. M. Hagedoom Nearest neighbors can be found efficiently if the dimension is small relative to the input size ICDT 2003
15. C.E. Jacobs, A. Finkelstein, D.H.Salesin. Fast multiresolution image querying. in: Proc. of ACM SIGGRAPH, New York, 1995
16. H. Jin, B.C. Ooi, H.T. Shen, C. Yu, and A. Zhou An adaptive and efficient dimensionality reduction algorithm for high-dimensional indexing ICDE 2003
17. N. Katayama, and S. Satoh The SR-tree: an index structure for high-dimensional nearest neighbor queries ACM SIGMOD May 1997
18. E. Keogh, K. Chakrabarti, S. Mehrotra, and M. Pazzani Locally adaptive dimensionality reduction for indexing large time series databases ACM SIGMOD 2001
19. J.M. Kleinberg, Two algorithms for nearest neighbor search in high dimensions. 29th ACM Symposium on Theory of Computing, 1997
20. T. Kohonen Self-Organizing Maps second ed. 1997 Springer-Verlag
21. P.P. Korn, N. Sidiropoulos, C. Faloutsos, E. Siegel, and Z. Protopapas Fast and effective retrieval of medical tumor shapes IEEE Trans. Knowledge Data Eng. 10 6 1998
22. J. Nievergelt, H. Hinterberger, and K. Sevcik The gridfile: an adaptable symmetric multikey file stucture ACM Trans. Database Syst. 9 1 1984 38 71
23. K.-S. Oh, Z. Aghbari, P.-K. Kim, Fast k-NN search with self-organizing maps. in: Proc. of 5th Int. Conf. on Image and Video Retrieval, July 2002
24. J. Orenstein, Spatial query processing in an object-oriented database system. in: Proc. ACM SIGMOD, May 1986
25. A. Rauber, J. Paralic, and E. Pampalk Empirical evaluation of clustering algorithms J. Inf. Organizational Sci. 24 2 2000 195 209
26. N. Roussopoulos, S. Kelley, and F. Vincent Nearest neighbor queries ACM SIGMOD 1995
27. J. Shepherd, X. Zhu, N. Megiddo, A fast indexing method for multidimensional nearest neighbor search. in: Proc. IS & T/SPIE Conf. Storage and Retrieval for Image and Video Databases VII, 1999
28. C. Traina, A.J.M. Traina, R.F.S. Filho, and C. Faloutsos How to improve the pruning ability of dynamic metric access methods CIKM November 2002
29. A.d. Vries, N. Mamoulis, N. Nes, and M. Kersten Efficient k-NN search on vertically decomposed data SIGMOD 2002
30. R. Weber, H.-J. Schek, S. Blott. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. in: Proc. of the 24th VLDB, USA, 1998
31. D.A. White, R. Jain, Similarity Indexing with the SS-tree. in: Proc. of Int. Conf. on Data Engineering (ICDE), 1996
32. C. Yu, B.C Ooi, K.L. Tan, H.V. Jagadish, Indexing the distance: an efficient method to KNN processing. in: Proc. Of the 27th VLDB Conf., 2001
33. T. Zhang, R. Ramakrishnan, and M. Livny BIRCH: an efficient data clustering method for very large databases ACM SIGMOD 1996