Processing distance-based queries in multidimensional data spaces using R-trees

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

Volumn 2563, Issue , 2003, Pages 1-18

  Corral, Antonio ^a   Cañadas, Joaquin ^a   Vassilakopoulos, Michael ^b  

^a UNIVERSITY OF ALMERÍA   (Spain)

^b ALEXANDER TECHNOLOGICAL EDUCATIONAL INSTITUTE OF THESSALONIKI   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; BRANCH AND BOUND METHOD; DECISION TREES; NEAREST NEIGHBOR SEARCH; QUERY LANGUAGES; QUERY PROCESSING;

BRANCH-AND-BOUND ALGORITHMS; DATABASE APPLICATIONS; DISTANCE-BASED QUERIES; K NEAREST NEIGHBOR QUERIES; MULTIDIMENSIONAL ACCESS METHODS; MULTIDIMENSIONAL DATA; TREE-LIKE STRUCTURES; UNIFORM AND GAUSSIAN DISTRIBUTIONS;

TREES (MATHEMATICS);

EID: 35248858354     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-38076-0_1     Document Type: Article

References (26)

1. S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman and A. Y. Wu: "An Optimal Algorithm for Approximate Nearest Neighbor Searching Fixed Dimensions", Journal of the ACM, Vol.45, No.6, pp.891-923, 1998.
2. B. Braunmuller, M. Ester, H. P. Kriegel and J. Sander: "Efficiently Supporting Multiple Similarity Queries for Mining in Metric Databases", Proceedings ICDE Conference, pp.256-267, 2000.
3. K. S. Beyer, J. Goldstein, R. Ramakrishnan and U. Shaft: "When Is "Nearest Neighbor" Meaningful?", Proceedings 7th ICDT Conference, pp.217-235, 1999.
4. N. Beckmann, H. P. Kriegel, R. Schneider and B. Seeger: "The R*-tree: and Efficient and Robust Access Method for Points and Rectangles", Proceedings 1990 ACM SIGMOD Conference, pp.322-331, 1990.
5. S. Berchtold, D. Kiem and H. P. Kriegel: "The X-tree: An Index Structure for High-Dimensional Data", Proceedings 22nd VLDB Conference, pp.28-39, 1996.
6. K. L. Cheung and A. W. Fu: "Enhanced Nearest Neighbour Search on the R-tree", ACM SIGMOD Record, Vol.27, No.3, pp.16-21, 1998.
7. P. Ciaccia and M. Patella; "PAC Nearest Neighbor Queries: Approximate and Controlled Search in High-Dimensional and Metric Spaces", Proceedings ICDE Conference, pp. 244-255, San Diego, CA, 2000.
8. A. Corral, J. Cañadas and M. Vassilakopoulos: "Approximate Algorithms for Distance-Based Queries in High-Dimensional Data Spaces Using R-Trees", Proceedings 6th ADBIS Conference, pp. 163-176, 2002.
9. A. Corral, Y. Manolopoulos, Y. Theodoridis and M. Vassilakopoulos: "Closest Pair Queries in Spatial Databases", Proceedings 2000 ACM SIGMOD Conference, pp.189-200, 2000.
10. A. Corral, J. Rodriguez and M. Vassilakopoulos: "Distance-Based Queries in Multidimensional Data Spaces using R-trees", Proceedings 8th Panhellenic Conference on Informatics, Vol.I, pp.237-246, Nicosia, Cyprus, 2001.
11. T. Dean and M. S. Boddy: "An Analysis of Time-Dependent Planning", Proceedings AAAI Conference, pp.49-54, St. Paul, MN, 1988.
12. C. Faloutsos, R. Barber, M. Flickner, J. Hafner, W. Niblack, D. Petkovic, and W. Equitz: "Efficient and Effective Querying by Image Content", Journal of Intelligent Information Systems, Vol.3, No.3-4, pp.231-262, 1994.
13. V. Gaede and O. Gunther: "Multidimensional Access Methods", ACM Computing Surveys, Vol.30, No.2, pp.170-231, 1998.
14. A. Guttman: "R-trees: A Dynamic Index Structure for Spatial Searching", Proceedings 1984 ACM SIGMOD Conference, pp.47-57, 1984.
15. G. R. Hjaltason and H. Samet: "Ranking in Spatial Databases", Proceedings 4th SSD Conference, pp.83-95, 1995.
16. G. R. Hjaltason and H. Samet: "Incremental Distance Join Algorithms for Spatial Databases", Proceedings 1998 ACM SIGMOD Conference, pp.237-248, 1998.
17. G. R. Hjaltason and H. Samet: "Distance Browsing in Spatial Databases", ACM Transactions on Database Systems, Vol.24, No.2, pp.265-318, 1999.
18. H. V. Jagadish: "A Retrieval Technique for Similar Shapes", Proceedings 1991 ACM SIGMOD Conference, pp.208-217, 1991.
19. N. Katayama and S. Satoh: "The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries", Proceedings 1997 ACM SIGMOD Conference, pp.369-380, 1997.
20. N. Koudas and K. C. Sevcik: "High Dimensional Similarity Joins: Algorithms and Performance Evaluation", Proceedings ICDE Conference, pp. 466-475, Orlando, FL, 1998.
21. F. Korn, N. Sidiropoulos, C. Faloutsos, C. Siegel and Z. Protopapas: "Fast Nearest Neighbor Search in Medical Images Databases", Proceedings 22nd VLDB Conference, pp.215-226, 1996.
22. K. I. Lin, H. V. Jagadish and C. Faloutsos: "The TV-tree: an Index Structure for High-Dimensional Data", The VLDB Journal, Vol.3, No.4, pp.517-542, 1994.
23. F. P. Preparata and M. I. Shamos: "Computational Geometry: an Introduction", Springer, 1985.
24. N. Roussopoulos, S. Kelley and F. Vincent: "Nearest Neighbor Queries", Proceedings 1995 ACM SIGMOD Conference, pp.71-79, 1995.
25. H. Shin, B. Moon and S. Lee: "Adaptive Multi-Stage Distance Join Processing", Proceedings 2000 ACM SIGMOD Conference, pp.343-354, 2000.
26. Y. Sakurai, M. Yoshikawa, S. Uemura and H. Kojima: "The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation", Proceedings 26th VLDB Conference, pp.516-526, 2000.