Probabilistic proximity searching algorithms based on compact partitions

Journal of Discrete Algorithms

Volumn 2, Issue 1 SPEC. ISS., 2004, Pages 115-134

  Bustos, Benjamin ^a   Navarro, Gonzalo ^b  

^a UNIVERSITY OF KONSTANZ   (Germany)

^b UNIVERSITY OF CHILE   (Chile)

Author keywords

Approximate algorithms; Metric spaces; Probabilistic algorithms; Range queries; Similarity searching

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DATABASE SYSTEMS; FUNCTIONS; IMAGE COMPRESSION; INFORMATION RETRIEVAL; LEARNING SYSTEMS; MEASUREMENT THEORY; MULTIMEDIA SYSTEMS; PROBABILITY; QUERY LANGUAGES;

APPROXIMATE ALGORITHMS; METRIC SPACES; PROBABILISTIC ALGORITHMS; RANGE QUERIES; SIMILARITY SEARCHING;

METRIC SYSTEM;

EID: 10644227003     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1570-8667(03)00067-4     Document Type: Article

References (23)

1. S. Arya, D. Mount, Approximate range searching, in: Proc. 11th Annual ACM Symposium on Computational Geometry, 1995, pp. 172-181.
2. S. Arya, D. Mount, N. Netanyahu, R. Silverman, A. Wu, An optimal algorithm for approximate nearest neighbor searching in fixed dimension, in: Proc. 5th ACM-SIAM Symposium on Discrete Algorithms (SODA'94), 1994, pp. 573-583.
3. R. Baeza-Yates, B. Ribeiro-Neto, Modern Information Retrieval, Addison-Wesley, Reading, MA, 1999.
4. S. Brin, Near neighbor search in large metric spaces, in: Proc. 21st Conference on Very Large Databases (VLDB'95), Morgan Kaufmann, 1995, pp. 574-584.
5. B. Bustos, G. Navarro, E. Chávez, Pivot selection techniques for proximity searching in metric spaces, Pattern Recognition Letters 24 (14) (2003) 2357-2366.
6. E. Chávez, G. Navarro, An effective clustering algorithm to index high dimensional metric spaces, in: Proc. 7th Symposium on String Processing and Information Retrieval (SPIRE'00), IEEE CS Press, 2000, pp. 75-86.
7. E. Chávez, G. Navarro, Probabilistic proximity search: fighting the curse of dimensionality in metric spaces, Inform. Process. Lett. 85 (2003) 39-46.
8. E. Chávez, G. Navarro, R. Baeza-Yates, J. Marroquín, Searching in metric spaces, ACM Comput. Surv. 33 (3) (2001) 273-321.
9. P. Ciaccia, M. Patella, PAC nearest neighbor queries: approximate and controlled search in high-dimensional and metric spaces, in: Proc. 16th International Conference on Data Engineering (ICDE'00), 2000, pp. 244-255.
10. P. Ciaccia, M. Patella, Approximate similarity queries: a survey, Technical Report CSITE-08-01, Department of Electronics, Computer Science and Systems, University of Bologna, May 2001.
11. P. Ciaccia, M. Patella, P. Zezula, M-tree: an efficient access method for similarity search in metric spaces, in: Proc. 23rd Conference on Very Large Databases (VLDB'97), Morgan Kaufmann, 1997, pp. 426-435.
12. K. Clarkson, Nearest neighbor queries in metric spaces, Discrete Comput. Geom. 22 (1) (1999) 63-93.
13. F. Dehne, H. Noltemeier, Voronoi trees and clustering problems, Inform. Syst. 12 (2) (1987) 171-175.
14. J. Goldstein, R. Ramakrishnan, Contrast plots and P-sphere trees: space vs. time in nearest neighbor searches, in: Proc. 26th International Conference on Very Large Databases (VLDB'00), Morgan Kaufmann, 2000, pp. 429-440.
15. D. Harman, Overview of the third text REtrieval conference, in: Proc. Third Text REtrieval Conference (TREC-3), 1995, pp. 1-19, NIST Special Publication 500-207.
16. G. Hjaltason, H. Samet, Incremental similarity search in multimedia databases, Technical Report TR 4199, Department of Computer Science, University of Maryland, November 2000.
17. I. Kalantari, G. McDonald, A data structure and an algorithm for the nearest point problem, IEEE Trans. Software Engrg. 9 (5) (1983) 631-634.
18. G. Navarro, Searching in metric spaces by spatial approximation, VLDB J. 11 (1) (2002) 28-46.
19. H. Noltemeier, K. Verbarg, C. Zirkelbach, Monotonous Bisector* Trees - a tool for efficient partitioning of complex schemes of geometric objects, in: Data Structures and Efficient Algorithms, in: Lecture Notes in Comput. Sci., vol. 594, Springer, Berlin, 1992, pp. 186-203.
20. J. Uhlmann, Satisfying general proximity/similarity queries with metric trees, Inform. Process. Lett. 40 (1991) 175-179.
21. D. White, R. Jain, Algorithms and strategies for similarity retrieval, Technical Report VCL-96-101, Visual Computing Laboratory, University of California, La Jolla, California, July 1996.
22. P. Yianilos, Locally lifting the curse of dimensionality for nearest neighbor search, in: Proc. 11th ACM-SIAM Symposium on Discrete Algorithms (SODA'00), 2000, pp. 361-370.
23. P. Zezula, P. Savino, G. Amato, F. Rabitti, Approximate similarity retrieval with M-trees, VLDB J. 7 (4) (1998) 275-293.