Benchmarking access structures for the similarity retrieval of high-dimensional multimedia data

IEEE International Conference on Multi-Media and Expo

Volumn , Issue II/TUESDAY, 2000, Pages 1215-1218

  Colossi, N G ^a   Nascimento, M A ^a  

^a UNIVERSITY OF CAMPINAS   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; MULTIMEDIA SYSTEMS; VECTORS;

FEATURE VECTORS;

INFORMATION RETRIEVAL;

EID: 0034509866     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. The R*-tree: An efficient and robust access method for points and rectangles
2. The X-tree: An index structure for high-dimensional data
3. M-tree: An efficient access method for similarity search in metric spaces
4. The five-minute rule ten years later, and other computer storage rules of thumb
5. R-trees: A dynamic index structure for spatial searching
6. Generalized search trees for databases systems
7. Slim-trees: High performance metric trees miniminzing overlap between nodes
8. The SR-tree: An index structure for high-dimensional nearest neighbor queries
9. The TV-tree: An index structure for high-dimensional data
10. Nearest neighbor queries
11. Similarity indexing with the SS-tree