Istituto di Scienza e Tecnologie dell'Informazione     
Gennaro C., Savino P., Zezula P. Similarity Search in Metric Databases through Hashing. In: Multimedia Information Retrieval - the ACM Multimedia 2001 Workshops (Ottawa, Canada, 5 October 2001). Proceedings, pp. 1-5. ACM, 2001. 2001.
A novel access structure for similarity search in metric databases,called Similarity Hashing (SH), is proposed. It is a multi-level hash structure, consisting of search-separable bucket sets on each level. The structure supports easy insertion and bounded search costs, because at most one bucket needs to be accessed at each level for range queries up to a pre-defined value of search radius. At the same time, the pivot-based strategy significantly reduces the number of distance computations. Contrary to tree organizations, the SH structure is suitable for distributed and parallel implementations
Subject Algorithms
H.2.2 Physical Design
H.3.3 Information Search and Retrieval

Icona documento 1) Download Document PDF

Icona documento Open access Icona documento Restricted Icona documento Private


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional