Similarity Search in Metric Databases through Hashing

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F01%3A00005101" target="_blank" >RIV/00216224:14330/01:00005101 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Similarity Search in Metric Databases through Hashing

Original language 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.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

BD - Information theory

OECD FORD branch

—

Project

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2001

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

ACM Multimedia 2001 Workshops

ISBN

1-58113-395-2

ISSN

—

e-ISSN

—

Number of pages

5

Pages from-to

1

Publisher name

ACM Press

Place of publication

USA

Event location

USA

Event date

Jan 1, 2001

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—