When is nearest neighbors indexable?

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3363 LNCS, Issue , 2005, Pages 158-172

  Shaft, Uri ^a   Ramakrishnan, Raghu ^b  

^a ORACLE CORPORATION   (United States)

^b UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARBITRARY NUMBER; CROSS-OVER; DATA DISTRIBUTION; DATA POINTS; DATA SETS; INDEX STRUCTURE; MULTI-DIMENSIONAL INDEX STRUCTURES; NEAREST NEIGHBORS; R-TREES; X-TREES;

DECISION TREES; PROBLEM SOLVING;

EXPERIMENTS;

EID: 77049127103     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30570-5_11     Document Type: Conference Paper

References (14)

1. Beckmann, N., Kriegel H.-P., Schneider, R. and Seeger, B.: The R*-Tree: An Effi-cient and Robust Access Method for Points and Rectangles. Proc. SIGMOD (1992) 322-331
2. Berchtold, S., Keim, D. A. and Kriegel H.-P.: The x-tree : An Index Structure for High-Dimensional Data. Proc. VLDB (1996) 28-39
3. Beyer, K., Goldstein, J., Ramakrishnan, R. and Shaft, U.: When Is Nearest Neighbors Meaningful? Proc. ICDT (1999)
4. Gionis, A., Indyk, P. and Motwani, R.: Similarity search in high dimensions via hashing. Proc. VLDB (1999) 518-529
5. Goldstein, J.: mproved Query Processing and Data Representation Techniques. Ph.D. Thesis, Univ. of Wisconsin-Madison (1999)
6. Guttman, A." R-Trees: A Dynamic Index Structure for Spatial Searching. Proc. SIGMOD (1984) 47-57
7. Hellerstein, J. M., Koutsoupias, E. and Papadimitriou, C. H.: On the analysis of indexing schemes. Proc. PODS (1997) 249-256
8. Katayama, N.,and Satoh, S.: The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries. Proc. SIGMOD (1997) 369-380
9. Lin K.-I., Jagadish, H. V. and Faloutsos, C.: The TV-Tree - An Index Structure for High-Dimensional Data. VLDB J.: Special Issue on Spatial Database Systems 3/4 (1994) 517-542
10. Robinson, J. T.: The K-D-B Tree: A Search Structure for Large Multi-dimensional Dynamic Indexes. Proc. SIGMOD (1981) 10-18
11. Sellis, T. K., Roussopoulos, N. and Faloutsos, C.: The R+-Tree: A Dynamic Index for Multi-Dimensional Objects. Proc. VLDB (1987) 507-518
12. Shaft, U.: Database Support for Queries by Image Content. Ph.D. Thesis, Univ. of Wisconsin-Madison (2002)
13. Smith, J. R.: Query vector projection access method. In Storage and Retrieval for Image and Video Databases VII (1998) 511-522
14. White, D. A. and Jain R. C.: Similarity Indexing with the SS-tree. Proc. ICDE (1996) 516-523