DOHNAL, Vlastislav, Claudio GENNARO, Pasquale SAVINO and Pavel ZEZULA. Similarity Join in Metric Spaces. In Proceedings of the European Conference on Information Retrieval Research. LNCS 2633. Berlin: Springer-Verlag. p. 452-467. ISBN 3-540-01274-5. 2003.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Similarity Join in Metric Spaces
Name in Czech Podobnostní spojení v metrických prostorech
Authors DOHNAL, Vlastislav (203 Czech Republic, belonging to the institution), Claudio GENNARO (380 Italy), Pasquale SAVINO (380 Italy) and Pavel ZEZULA (203 Czech Republic, guarantor, belonging to the institution).
Edition LNCS 2633. Berlin, Proceedings of the European Conference on Information Retrieval Research, p. 452-467, 16 pp. 2003.
Publisher Springer-Verlag
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 20206 Computer hardware and architecture
Country of publisher Italy
Confidentiality degree is not subject to a state or trade secret
Publication form printed version "print"
RIV identification code RIV/00216224:14330/03:00008670
Organization unit Faculty of Informatics
ISBN 3-540-01274-5
UT WoS 000184816000032
Keywords in English similarity join; index structures; performance; text management
Tags DISA, index structures, performance, similarity join, text management
Tags International impact, Reviewed
Changed by Changed by: doc. RNDr. Vlastislav Dohnal, Ph.D., učo 2952. Changed: 12/12/2022 12:59.
Abstract
Similarity join in distance spaces constrained by the metric postulates is the necessary complement of more famous similarity range and the nearest neighbors search primitives. However, the quadratic computational complexity of similarity joins prevents from applications on large data collections. We first study the underlying principles of such joins and suggest three categories of implementation strategies based on filtering, partitioning, or similarity range searching. Then we study an application of the D-index to implement the most promising alternative of range searching. Though also this approach is not able to eliminate the intrinsic quadratic complexity of similarity joins, significant performance improvements are confirmed by experiments.
Abstract (in Czech)
Článek se zabývá problematikou podobnostního spojení, které je doplňkem ke známějším rozsahovým dotazům a dotazům na nejbližší sousedy. Navrhujeme tři kategorie algoritmů pro vyhodnocování podobnostních spojení a studujeme možnosti využití indexové struktury D-Index.
Links
MSM 143300004, plan (intention)Name: Digitální knihovny
Investor: Ministry of Education, Youth and Sports of the CR, Digital libraries
PrintDisplayed: 29/3/2024 12:36