Theory of nearest neighbors indexability

ACM Transactions on Database Systems

Volumn 31, Issue 3, 2006, Pages 814-838

  Shaft, Uri ^a,c   Ramakrishnan, Raghu ^b,d  

^a Oracle USA ^*  (United States)

^b UNIVERSITY OF WISCONSIN MADISON   (United States)

^c ORACLE CORPORATION   (United States)

^d University of Wisconsin Madison   (United States)

Author keywords

Multidimensional indexing; Nearest neighbors

Indexed keywords

MULTIDIMENSIONAL INDEXING; NEAREST NEIGHBORS;

DATA TRANSFER; DATABASE SYSTEMS; INDEXING (OF INFORMATION); PROBLEM SOLVING; TREES (MATHEMATICS);

DATA STRUCTURES;

EID: 33750197371     PISSN: 03625915     EISSN: 03625915     Source Type: Journal    
DOI: 10.1145/1166074.1166077     Document Type: Conference Paper

References (17)

1. BECKMANN, N., KRIEGEL, H., SCHNEIDER, R., AND SEEGER, B. 1992. The R*-Tree: An efficient and robust access method for points and rectangles. In Proceedings of SIGMOD. 322-331.
2. BERCHTOLD, S., KEIM, D. A., AND KRIEGEL, H. 1996. The x-tree: An index structure for high-dimensional data. In Proceedings of VLDB. 28-39.
3. BEYER, K., GOLDSTEIN, J., RAMAKRISHNAN, R., AND SHAFT, U. 1999. When is nearest neighbors meaningful? In Proceedings of ICDT.
4. GIONIS, A., INDYK, P., AND MOTWANI, R. 1999. Similarity search in high dimensions via hashing. In Proceedings of VLDB. 518-529.
5. GOLDSTEIN, J. 1999. Improved query processing and data representation techniques. Ph.D. dissertation. University of Wisconsin-Madison, Madison, WI.
6. GOLDSTEIN, J. AND RAMAKRISHNAN, R. 2000. Contrast plots and P-Sphere trees: Space vs. time in nearest neighbour searches. In Proceedings of VLDB. 429-440.
7. GUTTMAN, A. 1984. R-Trees: A dynamic index structure for spatial searching. In Proceedings of SIGMOD. 47-57.
8. HELLERSTEIN, J. M., KOUTSOUPIAS, E., AND PAPADIMITRIOU, C. H. 1997. On the analysis of indexing schemes. In Proceedings of PODS. 249-256.
9. KATAYAMA, N. AND SATOH, S. 1997. The SR-tree: An index structure for high-dimensional nearest neighbor queries. In Proceedings of SIGMOD. 369-380.
10. LIN, K., JAGADISH, H. V., AND FALOUTSOS, C. H. 1994. The TV-Tree-an index structure for high-dimensional data. VLDB J. (Special Issue on Spatial Database Systems) 3, 4, 517-542.
11. PESTOV, V. 2000. On the geometry of similarity search: Dimensionality curse and concentration of measure. Inf. Process. Lett. 73, 1-2, 47-51.
12. ROBINSON, J. T. 1981. A search structure for large multi-dimensional dynamic indexes. In Proceedings of SIGMOD. 10-18.
13. SELLIS, T. K., ROUSSOPOULOS, N., AND FALOUTSOS, C. H. 1987. The R+-Tree: A dynamic index for multi-dimensional objects. In Proceedings of VLDB. 507-518.
14. SHAFT, U. AND RAMAKRISHNAN, R. 2005. When is nearest neighbors indexable? In Proceedings of ICDT.
15. SMITH, J. R. 1998. Query vector projection access method. In Proceedings of SPIE 3656: Storage and Retrieval for Image and Video Databases VII. 511-522.
16. WEBER, R., SCHEK, H., AND BLOTT, S. A. 1998. Quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In Proceedings of VLDB, 194-205.
17. WHITE, D. A. AND JAIN, R. C. 1996. Similarity indexing with the SS-tree. In Proceedings of ICDE. 516-523.