LDC: Enabling search by partial distance in a hyper-dimensional space

Proceedings - International Conference on Data Engineering

Volumn 20, Issue , 2004, Pages 6-17

  Koudas, Nick ^a   Ooi, Beng Chin ^b   Shen, Heng Tao ^b   Tung, Anthony K H ^b  

^a AT AND T LABS RESEARCH   (United States)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS; HYPER-DIMENSIONAL SPACE; K-NEAREST NEIGHBORS (KNN); LOCAL DIGITAL CODING (LDC);

COSTS; DATA MINING; DATA PROCESSING; IMAGE CODING; INDEXING (OF INFORMATION); MULTIMEDIA SYSTEMS; NONBIBLIOGRAPHIC RETRIEVAL SYSTEMS; OPTIMIZATION; TREES (MATHEMATICS);

DATABASE SYSTEMS;

EID: 2442615937     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2004.1319980     Document Type: Conference Paper

References (13)

1. S. Berchtold, C. Böhm, H. V. Jagadish, H.-P. Kriegel, and J. Sander. Independent quantization: An index compression technique for high-dimensional data spaces. In ICDE, pages 577-588, 2000.
2. S. Berchtold, C. Böhm, and H.-P. Kriegel. The pyramid-technique: Towards breaking the curse of dimensionality. In SIGMOD, pages 142-153, 1998.
3. K. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft. When is nearest neighbors meaningful? In ICDT, pages 217-235, 1999.
4. C. Böhm, S. Berchtold, and D. Keim. Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. ACM Computing Surveys, pages 33(3):322-373, 2001.
5. A. Borodin, R. Ostrofsky, and Y. Rabani. Subquadratic Algorithms for Approximate Clustering in High Dimensional Spaces. Proceedings of ACM STOC, 1999.
6. K. Chakrabarti and S. Mehrotra. Local dimensionality reduction: A new approach to indexing high dimensional spaces. In VLDB, pages 89-100, 2000.
7. A.P. de Vries, N. Mamoulis, N. Nes, and M.L. Kersten. Efficient k-NN search on vertically decomposed data. In SIGMOD, pages 322-333, 2002.
8. S. Guha, R. Rastogi, and K. Shim, CURE: An Efficient Clustering Algorithm for Large Databases. Proceedings of ACM SIGMOD, pages 73-84, June 1998.
9. H. Jin, B.C. Ooi, H.T. Shen, C. Yu, and A. Zhou. An Adaptive and Efficient Dimensionality Reduction Algorithm for High-Dimensional Indexing. In ICDE, pages 87-98, 2003.
10. Y. Sakurai, M. Yoshikawa, S. Uemura, and H. Kojima. The A-tree: An index structure for high-dimensional spaces using relative approximation. In VLDB, pages 516-526, 2000.
11. R. Weber, H. Schek, and S. Blott. A quantitative analysis and performance study for similarity search methods in high dimensional spaces. In VLDB, pages 194-205, 1998.
12. C. Yu, B.C. Ooi, K.L. Tan, and H. V. Jagadish. Indexing the distance: An efficient method to KNN processing. In VLDB, pages 166-174, 2001.
13. T. Zhang, R. Ramakrishnan, and M. Livny. BIRCH: An Efficient Data Clustering Method for Very Large Databases. Proceedings of ACM SIGMOD, Montreal Canada, pages 103-114, June 1996.