Effective nearest neighbor indexing with the Euclidean metric

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2001, Pages 9-16

  Kim, Sang Wook ^a   Aggarwal, Charu C ^a   Yu, Philip S ^a  

^a Kangwon National University   (South Korea)

Author keywords

Euclidean metric; High dimensional indexes; Multimedia databases; Nearest neighbor queries; Similarity search

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL METHODS; DATABASE SYSTEMS; MULTIMEDIA SYSTEMS; QUERY LANGUAGES;

EUCLIDEAN METRIC;

INDEXING (OF INFORMATION);

EID: 0035747552     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/502585.502588     Document Type: Conference Paper

References (19)

1. QBISM: Extending a DBMS to support 3D medical images
2. Fast nearest neighbor search in high-dimensional space
3. A cost model for nearest neighbor search in high-dimensional spaces
4. Fast parallel similarity search in Multimedia Databases
5. The X-tree: An index structure for high dimensional data
6. Independent quantization: An index compression technique for high-dimensional data spaces
7. The r&z.ast;-tree: An efficient and robust access method for points and rectangles
8. M-tree: An efficient access method for similarity search in metric spaces
9. What is the nearest neighbor in high dimensional space
10. A retrieval technique for similar shapes
11. The SR-tree: An index structure for high-dimensional nearest neighbor queries
12. Fast nearest neighbor search in medical image databases
13. The TV-Tree: An index structure for high dimensional data
14. An efficient branch-and-bound nearest neighbour classifier
15. Nearest neighbor queries
16. A quantitative analysis and performance study for similarity search methods in high-dimensional spaces
17. Similarity indexing with the SS-tree