2000
A Hashed Schema for Similarity Search in Metric Spaces
ZEZULA, PavelZákladní údaje
Originální název
A Hashed Schema for Similarity Search in Metric Spaces
Autoři
Vydání
1. vyd. Zurich, Proceedings of the First DELOS Network of Excellence Workshop on "Information Seeking, Searching and Querying in Digital Libraries" s. 83-87, Wokshop series, 2000
Nakladatel
ERCIM
Další údaje
Jazyk
angličtina
Typ výsledku
Stať ve sborníku
Obor
10000 1. Natural Sciences
Stát vydavatele
Švýcarsko
Utajení
není předmětem státního či obchodního tajemství
Kód RIV
RIV/00216224:14330/00:00002859
Organizační jednotka
Fakulta informatiky
ISBN
ERCIM-01-W01
Změněno: 19. 2. 2001 17:11, prof. Ing. Pavel Zezula, CSc.
Anotace
V originále
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 aims at 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.
Návaznosti
| MSM 143300004, záměr |
|