Similarity Grid for searching in metric spaces

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

Volumn 3664 LNCS, Issue , 2005, Pages 25-44

  Batko, Michal ^a   Gennaro, Claudio ^b   Zezula, Pavel ^a  

^a MASARYK UNIVERSITY   (Czech Republic)

^b ISTI CNR   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DATA ACQUISITION; DATA STRUCTURES; NONBIBLIOGRAPHIC RETRIEVAL SYSTEMS; QUERY LANGUAGES; RESPONSE TIME (COMPUTER SYSTEMS); ROUTERS;

DIGITAL LIBRARY ARCHITECTURES; METRIC SPACES;

CONTENT BASED RETRIEVAL;

EID: 33646160219     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11549819_3     Document Type: Conference Paper

References (15)

1. G. Amato, F. Rabitti, P. Savino, and P. Zezula, Region proximity in metric spaces and its use for approximate similarity search. ACM TOIS, 11 (2): 192-227, 2003.
2. B. Bustos, G. Navarro, and E. Chávez. Pivot selection techniques for proximity searching in metric spaces. In Proc. of the XXI Conference of the Chilean Computer Science Society (SCCC '01), pages 33-40, 2001.
3. E. Chavez, G. Navarro, R. Baeza-Yates, and J. Marroquin. Proximity searching in metric spaces, ACM Computing Surveys, 33(3):273-321, 2001.
4. P. Ciaccia, M Patella, and P. Zezula. M-tree: An efficient access method for similarity search in metric spaces. In Proc. of 23rd International Conference on Very Large Data Bases (VLDB), pages 426-435, 1997.
5. R. Devine. Design and implementation of DDH: A distributed dynamic hashing algorithm. In Proc. of the 4th International Conference on Foundations of Data Organization and Algorithms (FODO), volume 730, pages 101-114, Chicago, 1993.
6. V. Dohnal, C. Gennaro, P. Savino, and P. Zezula. D-index: Distance searching index for metric data sets. Multimedia Tools and Applications, 21(1):9-13, 2003.
7. C. Gennaro, P. Savino, and P. Zezula. Similarity search in metric databases through hashing. In Proc. of the 3rd Work. on Multimedia Inf. Retrieval, pages 1-5, 2001.
8. G. R. Hjaltason and H. Samet. Index-driven similarity search in metric spaces. ACM Transactions on Database Systems, 28(4):517-580, 2003.
9. T. Johnson and P. Krishna. Lazy updates for distributed search structure. In Proc. of the ACM SIGMOD, volume 22(2), pages 337-346, 1993.
10. B. Kröll and P. Widmayer. Distributing a search tree among a growing number of processors. In Proc. of the ACM SIGMOD, volume 23(2), pages 265-276, 1994.
11. W. Litwin, M. Neimat, and D. A. Schneider. LH* - a scalable, distributed data structure. ACM Transactions on Database Systems, 21(4):480-525, 1996.
12. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content addressable network. In Proc. of ACM SIGCOMM 2001, pages 161-172, 2001.
13. C. Tang, Z. Xu, and S. Dwarkadas. Peer-to-peer information retrieval using self-organizing semantic overlay networks. In Proc. of Conference on Applications, tech., archit., and protocols for computer communications, pages 175-186, 2003.
14. J. K. Uhlmann. Satisfying general proximity / similarity queries with metric trees. IPL: Information Processing Letters, 40:175-179, 1991.
15. P. Zezula, P. Savino, F. Rabitti, G. Amato, and P. Ciaccia. Processing m-trees with parallel resources. In Proc. of the 8th International Workshop on Research Issues in Data Engineering (RIDE'98), pages 147-154, Orlando, FL, February 1998.