A Hashed Schema for Similarity Search in Metric Spaces

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F00%3A00002859" target="_blank" >RIV/00216224:14330/00:00002859 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
A Hashed Schema for Similarity Search in Metric Spaces
Original language description
A hashing schema for similarity search in generic metric spaces is investigated, assuming that only distances for pairs of objects are known. Similarity Hashing partitions data objects in bounding regions without overlapping. The proposed structure aimsat reducing both the I/O and the CPU search costs. Contrary to the traditional tree-based approaches, specific upper-bounds on the search cost can be determined and the data organized in such way that the I/O costs never exceed those needed for sequential scan. Though the current version is static, it can be modified for dynamic data; it is also suitable for parallel implementations. Insertion is fast, and once the computed distances in the search phase are reused to significantly reduce the number of distance computations, that is proportional to the CPU costs. Experiments with the current prototype provide very encouraging results, especially for small similarity ranges.
Czech name
—
Czech description
—

Publication year
2000
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
Proceedings of the First DELOS Network of Excellence Workshop on "Information Seeking, Searching and Querying in Digital Libraries"
ISBN
ERCIM-01-W01
ISSN
—
e-ISSN
—
Number of pages
5
Pages from-to
—
Publisher name
ERCIM
Place of publication
Zurich
Event location
—
Event date
—
Type of event by nationality
—
UT code for WoS article
—

Similar results(10)