Optimal pivots to minimize the index size for metric access methods

2009 2nd International Workshop on Similarity Search and Applications, SISAP 2009

Volumn , Issue , 2009, Pages 74-80

  Ares, Luis G ^a   Brisaboa, Nieves R ^a   Esteller, María F ^a   Pedreira, Óscar ^a   Places, Ángeles S ^a  

^a UNIVERSITY OF A CORUÑA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

AMOUNT OF INFORMATION; COMPETITIVE STRATEGY; DISTANCE FUNCTIONS; LARGE DATABASE; METRIC ACCESS METHODS; METRIC SPACES; REAL PROBLEMS; SIMILARITY SEARCH; SPACE REQUIREMENTS;

SET THEORY;

TOPOLOGY;

EID: 70449922322     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SISAP.2009.21     Document Type: Conference Paper

References (22)

1. E. Chávez, G. Navarro, R. Baeza-Yates, and J. L. Marroquín, "Searching in metric spaces," ACM Computing Surveys, vol. 33, no. 3, pp. 273-321, September 2001, aCM Press.
2. P. Zezula, G. Amato, V. Dohnal, and M. Batko, Similarity search. The metric space approach, ser. Advances in Database Systems. Springer, 2006, vol. 32.
3. E. Chávez, J. L. Marroquín, and G. Navarro, "Fixed queries array: A fast and economical data structure for proximity searching," Multimedia Tools and Applications, vol. 14, no. 2, pp. 113-135, 2001, elsevier.
4. K. Figueroa and K. Fredriksson, "Simple space-time trade-offs for aesa," in Proc. of Int. Workshop on Experimental Algorithms (WEA'07), ser. LNCS(4525). Springer, 2007, pp. 229-241.
5. C. Celik, "Priority vantage points structures for similarity queries in metric spaces," in Proc. of EurAsia-ICT 2002: Information and Communication Technology, ser. LNCS(2510). Springer, 2002.
6. E. Vidal, "An algorithm for finding nearest neighbors in (approximately) constant average time," Pattern Recognition Letters, vol. 4, pp. 145-157, 1986, elsevier.
7. L. Micó, J. Oncina, and R. E. Vidal, "A new version of the nearest-neighbor approximating and eliminating search (aesa) with linear pre-processing time and memory requirements," Pattern Recognition Letters, vol. 15, pp. 9-17, 1994, elsevier.
8. W. A. Burkhard and R. M. Keller, "Some approaches to best-match file searching," Communications of the ACM, vol. 16, no. 4, pp. 230-236, April 1973, aCM Press.
9. R. Baeza-Yates, W. Cunto, U. Manber, and S. Wu, "Proximity matching using fixed-queries trees," in Proc. of the 5th Symposium on Combinatorial Pattern Matching (CPM'94), ser. LNCS(807). Springer-Verlag, 1994, pp. 198-212.
10. P. Yianilos, "Data structures and algorithms for nearest-neighbor search in general metric spaces," in Proc. of the 4th ACM-SIAM Symposium on Discrete Algorithms (SODA'93). ACM Press, 1993, pp. 311-321.
11. T. Bozkaya and M. Ozsoyoglu, "Distance-based indexing for high-dimensional metric spaces," in Proc. of the ACM Int. Conf. on Management of Data (SIGMOD'97), A. Press, Ed., 1997, pp. 357-368.
12. N. R. Brisaboa, A. Fariña, O. Pedreira, and N. Reyes, "Similarity search using sparse pivots for efficient multimedia information retrieval," in Proc. of the 8th IEEE Int. Symposium on Multimedia (ISM'06). IEEE Press, 2006, pp. 881-888.
13. C. Celik, "Effective use of space for pivot-based metric indexing structures," in Proc. of Int. Workshop on Similarity Search and Applications (SISAP'08). IEEE Press, 2008, pp. 402-409.
14. B. Bustos, G. Navarro, and E. Chávez, "Pivot selection techniques for proximity searching in metric spaces," Pattern Recognition Letters, vol. 24, no. 14, pp. 2357-2366, 2003, elsevier.
15. S. Brin, "Near neighbor search in large metric spaces," in Proc. of 21st Conf. on Very Large Databases (VLDB'95). ACM Press, 1995, pp. 11-15.
16. J. Vleugels and R. C. Veltkamp, "Efficient image retrieval through vantage objects," Pattern Recognition, vol. 35, no. 1, pp. 69-80, 2002, elsevier.
17. C. Hennig and L. J. Latecki, "The choice of vantage objects for image retrieval," Pattern Recognition, vol. 36(9), pp. 2187-2196, September 2003, elsevier.
18. R. H. van Leuken, R. C. Veltkamp, and R. Typke, "Selecting vantage objects for similarity indexing," in Proc. of the 18th International Conference on Pattern Recognition (ICPR'06). IEEE Press, 2006, pp. 453-456.
19. J. Venkateswaran, T. Kahveci, C. M. Jermaine, and D. Lachwani, "Reference-based indexing for metric spaces with costly distance measures," The VLDB Journal, vol. 17, no. 5, pp. 1231-1251, 2008, springer.
20. B. Bustos, O. Pedreira, and N. R. Brisaboa, "A dynamic pivot selection technique for similarity search in metric spaces," in Proc. of 1st Int. Workshop on Similarity Search and Applications (SISAP'08). IEEE Press, 2008, pp. 105-112.
21. SISAP, "Metric spaces library (http://sisap.org)." [Online]. Available: http://sisap.org/Metric-Space-Library.html
22. E. Chávez and G. Navarro, "A compact space decomposition for effective metric indexing," Pattern Recognition Letters, vol. 26, no. 9, pp. 1363-1376, 2005.