Search space reductions for nearest-neighbor queries

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

Volumn 4978 LNCS, Issue , 2008, Pages 554-567

  Adler, Micah ^a   Heeringa, Brent ^b  

^a The Manning College of Information and Computer Sciences   (United States)

^b WILLIAMS COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; DECISION TREES; FORESTRY; QUERY PROCESSING; TREES (MATHEMATICS);

BEST FIRST SEARCH; DEPTH FIRST SEARCH; FUNDAMENTAL OPERATIONS; K NEAREST NEIGHBOR QUERIES; NEAREST NEIGHBOR QUERIES; NEAREST NEIGHBORS; SEARCH SPACE REDUCTION; TIME SPACE TRADEOFFS;

NEAREST NEIGHBOR SEARCH;

EID: 70349313065     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-79228-4_48     Document Type: Conference Paper

References (11)

1. Manolopoulos, Y., Nanopoulos, A., Papadopoulos, A.N., Theodoridis, Y.: R-Trees: Theory and Applications. In: Advanced Information and Knowledge Processing, 1st edn., Springer, Heidelberg (2006)
2. Papadopoulos, A., Manolopoulos, Y.: Performance of nearest neighbor queries in r-trees. In: Proceedings of the 6th International Conference on Database Theory, pp. 394-408 (1997)
3. Berchtold, S., Böhm, C., Keim, D.A., Krebs, F., Kriegel, H.P.: On optimizing nearest neighbor queries in high-dimensional data spaces. In: Van den Bussche, J., Vianu, V. (eds.) ICDT 2001. LNCS, vol. 1973, pp. 435-449. Springer, Heidelberg (2000)
4. Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 47-57 (1984)
5. Sellis, T., Roussopoulos, N., Faloutsos, C.: R+-tree: A dynamic index for multidimensional objects. In: Proceedings of the 13th International Conference on Very Large Databases, pp. 507-518 (1988)
6. Beckmann, N., Kriegel, H., Schneider, R., Seeger, B.: R*-tree: An efficient and robust access method for points and rectangles. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 322-331 (1990)
7. Hjaltason, G.R., Samet, H.: Distance browsing in spatial databases. ACM Transactions on Database Systems 24, 265-318 (1999)
8. Berchtold, S., Böhm, C., Keim, D.A., Kriegel, H.P.: A cost model for nearest neighbor search in high-dimensional data space. In: Proceedings of the Sixteenth ACM Symposium on Principles of Database Systems, pp. 78-86. ACM Press, New York (1997)
9. Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: Proceedings ACM SIGMOD Internaiontal Conference on the Management of Data, pp. 71-79 (1995)
10. Böhm, C., Berchtold, S., Keim, D.A.: Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. ACM Computing Surveys (CSUR) 33, 322-373 (2001)
11. Cheung, K.L., Fu, A.W.C.: Enhanced nearest neighbour search on the r-tree. SIGMOD Record 27, 16-21 (1998)