Similarity Search in Metric Databases through Hashing
| Authors | |
|---|---|
| Year of publication | 2001 |
| Type | Article in Proceedings |
| Conference | ACM Multimedia 2001 Workshops |
| MU Faculty or unit | |
| Citation | |
| Field | Information theory |
| Description | A novel access structure for similarity search in metric data-bases, 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. |
| Related projects: |