Dynamic spatial approximation trees

Proceedings - International Conference of the Chilean Computer Science Society, SCCC

Volumn 2001-January, Issue , 2001, Pages 213-222

  Navarro, G ^a   Reyes, N ^b  

^a UNIVERSITY OF CHILE   (Chile)

^b UNIVERSIDAD NACIONAL DE SAN LUIS   (Argentina)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; FORESTRY;

CLASSICAL SOLUTIONS; DYNAMIC SPATIAL; HIGH DIMENSIONS; METRIC SPACES; SEARCH EFFICIENCY;

TREES (MATHEMATICS);

EID: 0012972610     PISSN: 15224902     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SCCC.2001.972650     Document Type: Conference Paper

References (25)

1. +-trees with Partial Expansions. IEEE Transactions on Knowledge and Data Engineering, 1(2):248-257, 1989.
2. J. Bentley. Multidimensional binary search trees in database applications. IEEE Transactions on Software Engineering, 5(4):333-340, 1979.
3. W. Burkhard and R. Keller. Some approaches to best-match file searching. Communications of the ACM, 16(4):230-236, 1973.
4. T. Bozkaya and M. Ozsoyoglu. Distance-based indexing for high-dimensional metric spaces. In Proc. ACM Conference on Management of Data (SIGMOD'97), pages 357-368, 1997. Sigmod Record 26(2).
5. S. Brin. Near neighbor search in large metric spaces. In Proc. of the 21st Conference on Very Large Databases (VLDB'95), pages 574-584, 1995.
6. R. Baeza-Yates, W. Cunto, U. Manber, and S. Wu. Proximity matching using fixed-queries trees. In Proc. 5th Conference on Combinatorial Pattern Matching (CPM'94), LNCS 807, pages 198-212, 1994.
7. E. Chávez, J. Marroquín, and R. Baeza-Yates. Spaghettis: an array based algorithm for similarity queries in metric spaces. In Proc. 6th International Symposium on String Processing and Information Retrieval (SPIRE'99), pages 38-46. IEEE CS Press, 1999.
8. E. Chávez, J. Marroquín, and G. Navarro. Fixed queries array: A fast and economical data structure for proximity searching. Multimedia Tools and Applications, 14(2):113-135, 2001. Kluwer.
9. E. Chávez and G. Navarro. An effective clustering algorithm to index high dimensional metric spaces. In Proc. 7th International Symposium on String Processing and Information Retrieval (SPIRE'00), pages 75-86. IEEE CS Press, 2000.
10. E. Chávez, G. Navarro, R. Baeza-Yates, and J. Marroquín. Searching in metric spaces. ACM Computing Surveys, 2001. To appear.
11. P. Ciaccia, M. Patella, and P. Zezula. M-tree: an efficient access method for similarity search in metric spaces. In Proc. of the 23rd Conference on Very Large Databases (VLDB'97), pages 426-435, 1997.
12. F. Dehne and H. Nolteimer. Voronoi trees and clustering problems. Information Systems, 12(2):171-175, 1987. Pergamon Journals.
13. A. Guttman. R-trees: a dynamic index structure for spatial searching. In Proc. ACM Conference on Management of Data (SIGMOD'84), pages 47-57, 1984.
14. L. Micó, J. Oncina, and R. Carrasco. A fast branch and bound nearest neighbor classifier in metric spaces. Pattern Recognition Letters, 17:731-739, 1996. Elsevier.
15. L. Micó, J. Oncina, and E. Vidal. A new version of the nearest-neighbor approximating and eliminating search (aesa) with linear preprocessing-time and memory requirements. Pattern Recognition Letters, 15:9-17, 1994. Elsevier.
16. G. Navarro. Searching in metric spaces by spatial approximation. In Proc. 6th International Symposium on String Processing and Information Retrieval (SPIRE'99), pages 141-148. IEEE CS Press, 1999.
17. G. Navarro. Searching in metric spaces by spatial approximation. Technical Report TR/DCC-2001-4, Dept. of Computer Science, Univ. of Chile, 2001. ftp://ftp.dcc.uchile.cl/pub/users/gnavarro/jsat.ps.gz.
18. S. Nene and S. Nayar. A simple algorithm for nearest neighbor search in high dimensions. IEEE Transactions on Pattern Analysis and Machine Intelligence, 19(9):989-1003, 1997.
19. H. Nolteimer, K. Verbarg, and C. Zirkelbach. Monotonous Bisector∗ Trees - a tool for efficient partitioning of complex schenes of geometric objects. In Data Structures and Efficient Algorithms, LNCS 594, pages 186-203, 1992.
20. N. Reyes. Dynamic data structures for searching metric spaces. MSc. Thesis, Univ. Nac. de San Luis, Argentina, 2001. In progress. G. Navarro, advisor.
21. J. Uhlmann. Implementing metric trees to satisfy general proximity/similarity queries. Manuscript, 1991.
22. J. Uhlmann. Satisfying general proximity/similarity queries with metric trees. Information Processing Letters, 40:175-179, 1991. Elsevier.
23. E. Vidal. An algorithm for finding nearest neighbors in (approximately) constant average time. Pattern Recognition Letters, 4:145-157, 1986.
24. P. Yianilos. Data structures and algorithms for nearest neighbor search in general metric spaces. In Proc. 4th ACM-SIAM Symposium on Discrete Algorithms (SODA'93), pages 311-321, 1993.
25. P. Yianilos. Locally lifting the curse of dimensionality for nearest neighbor search. In Proc. 11th ACM-SIAM Symposium on Discrete Algorithms (SODA'00), 2000.