Performance analysis of AB-tree

IEEE International Conference on Multi-Media and Expo

Volumn , Issue III/WEDNESDAY, 2000, Pages 1701-1704

  Pramanik, S ^a   Li, J ^a   Ruan, J ^a  

^a Michigan State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA COMMUNICATION SYSTEMS; HEURISTIC METHODS; INDEXING (OF INFORMATION); MATHEMATICAL MODELS; TREES (MATHEMATICS);

DATA DISTRIBUTION PROPERTIES;

DATABASE SYSTEMS;

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

References (12)

1. The K-D-B-tree: A search structure for large multidimensional dynamic indexes
2. The hB-tree: Amultiattribute indexing mechanism with good guaranteed performance
3. R-trees: A dynamic index structure for spatial searching
4. The R*-tree: An efficient and robust access method for points and rectangles
5. The SR-tree: An index structure for high-dimensional nearest neighbor queries
6. Similarity indexing with the SS-tree
7. An efficient searching algoritm for approximate nearest neighbor queries in high dimensions
8. The hybrid tree: An index structure for high dimensional feature spaces
9. A quantitative analysis and performance study for similarity-search methods in high dimensional spaces
10. Approximate similarity retrieval with M-trees
11. Fast approximate search algorithm for nearest neighbor queries in high dimensions