Indexing high-dimensional data for content-based retrieval in large databases

Proceedings - 8th International Conference on Database Systems for Advanced Applications, DASFAA 2003

Volumn , Issue , 2003, Pages 267-274

  Fonseca, M J ^a   Jorge, J A ^a  

^a INSTITUTO SUPERIOR TÉCNICO   (Portugal)

Author keywords

Computer science; Content based retrieval; Data structures; Image databases; Indexing; Information retrieval; Information systems; Nearest neighbor searches; Spatial databases; Technical drawing

Indexed keywords

ALGORITHMS; CLUSTERING ALGORITHMS; COMPUTER SCIENCE; CONTENT BASED RETRIEVAL; DATA STRUCTURES; DATABASE SYSTEMS; FORESTRY; INDEXING (OF INFORMATION); INFORMATION RETRIEVAL; INFORMATION SYSTEMS; NEAREST NEIGHBOR SEARCH; QUERY PROCESSING; TREES (MATHEMATICS);

DIMENSION REDUCTION; HIGH DIMENSIONAL DATA; IMAGE DATABASE; INDEXING STRUCTURES; NEAREST NEIGHBOR QUERIES; SPATIAL DATABASE; SYNTHETIC AND REAL DATA; TECHNICAL DRAWING;

SEARCH ENGINES;

EID: 84943427674     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DASFAA.2003.1192391     Document Type: Conference Paper

References (15)

1. S. Berchtold, C. Böhm, and H.-P. Kriegel. The Pyramid-Technique: Towards Breaking the Curse of Dimensionality. In Proc. of the Int. Conf. on Management of Data (SIGMOD'98). ACM Press, 1998.
2. S. Berchtold, D. Keim, and H.-P. Kriegel. The X-tree: An Index Structure for High-Dimensional Data. In Proc. of the 22nd Int. Conf. on Very Large Data Bases (VLDB'96), Mumbai(Bombay), India, 1996.
3. K. Chakrabarti and S. Mehrotra. The Hybrid Tree: An index structure for high dimensional feature spaces. In Proc. of the 15th Int. Conf. on Data Engineering (ICDE'99), pages 440-447, 1999.
4. M. J. Fonseca and J. A. Jorge. CALI : A Software Library for Calligraphic Interfaces. INESC-ID, available at http://immi.inesc-id.pt/cali/, 2000.
5. M. J. Fonseca and J. A. Jorge. Indexing high-dimensional data for content-based retrieval in large databases. Technical report, INESC-ID, http://virtual.inesc-id.pt/tr/mjf-jaj-TR-01-03.pdf, 2003.
6. M. J. Fonseca and J. A. Jorge. Towards content-based retrieval of technical drawings through high-dimensional indexing. Computers and Graphics, To appear, 2003.
7. A. Henrich. The LSDh-tree: An access structure for feature vectors. In Proc. of the 14th Int. Conf. on Data Engineering (ICDE'98), pages 362-369, 1998.
8. N. Katayama and S. Satoh. The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries. In Proc. of the Int. Conf. on Management of Data (SIGMOD'97), pages 369-380. ACM Press, 1997.
9. K.-I. Lin, H. Jagadashi, and C. Faloutsos. The TV-tree: An index structure for high-dimensional data. The VLDB Journal, 3(4):517-543, 1994.
10. C. Bohm, H. V. Jagadish, H.-P. Kriegel, and J. Sander. Independent quantization: An index compression technique for high-dimensional data spaces. In Proc. of the 16th Int. Conf. on Data Engineering (ICDE'00), pages 577-588, San Diego, USA, 2000.
11. Y. Sakurai, M. Yoshikawa, S. Uemura, and H. Kojima. The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation. In Proc. of the 26th Int. Conf. on Very Large Data Bases (VLDB'00), pages 516-526, Cairo, Egypt, 2000.
12. J. Shepherd, X. Zhu, and N. Megiddo. A fast indexing method for multidimensional nearest neighbor search. In SPIE Conf. on Storage and Retrieval for Image and Video Databases, pages 350-355, 1999.
13. R. Weber, H.-J. Schek, and S. Blott. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In Proc. of the 24th Int. Conf. on Very Large Data Bases (VLDB'98), pages 194-205, New York, USA, 1998.
14. D. White and R. Jain. Similarity indexing with the SS-tree. In Proc. of the 12th IEEE Int. Conf. on Data Engineering, pages 516-523, 1996.
15. C. Yu, S. Bressan, B. C. Ooi, and K.-L. Tan. Querying high-dimensional data in single dimensional space. VLDB Journal, To Appear, 2002.