Varianty M-stromu v metrických a nemetrických prostorech

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F08%3A00101285" target="_blank" >RIV/00216208:11320/08:00101285 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

On M-tree Variants in Metric and Non-metric Spaces

Popis výsledku v původním jazyce

Although there have been many metric access methods (MAMs) developed so far to solve the problem of similarity searching, there is still big need for gapping retrieval efficiency. One of the most acceptable MAMs is M-tree which meets the essential features important for large, persistent and dynamic databases. M-tree?s retrieval inefficiency is hidden in overlaps of its regions, therefore, its overlaps should be as small as possible. Slim-tree [Traina Jr. et al., 2000] (the M-tree variant), solves thisproblem by post-processing slim-down algorithm which is too expensive. We briefly mention our new reinserting algorithm which is dynamic with acceptable construction costs and which reorganizes efficiently index. Another approach how to improve similarity searching has been introduced with the TriGen algorithm [Skopal, 2006] which enables MAMs to perform also non-metric similarity search or faster approximate search. With the TriGen, far more problems of similarity searching can be solve

Název v anglickém jazyce

On M-tree Variants in Metric and Non-metric Spaces

Popis výsledku anglicky

Although there have been many metric access methods (MAMs) developed so far to solve the problem of similarity searching, there is still big need for gapping retrieval efficiency. One of the most acceptable MAMs is M-tree which meets the essential features important for large, persistent and dynamic databases. M-tree?s retrieval inefficiency is hidden in overlaps of its regions, therefore, its overlaps should be as small as possible. Slim-tree [Traina Jr. et al., 2000] (the M-tree variant), solves thisproblem by post-processing slim-down algorithm which is too expensive. We briefly mention our new reinserting algorithm which is dynamic with acceptable construction costs and which reorganizes efficiently index. Another approach how to improve similarity searching has been introduced with the TriGen algorithm [Skopal, 2006] which enables MAMs to perform also non-metric similarity search or faster approximate search. With the TriGen, far more problems of similarity searching can be solve

Druh

D - Stať ve sborníku

CEP obor

JC - Počítačový hardware a software

OECD FORD obor

—

Projekt

<a href="/cs/project/1ET100300419" target="_blank" >1ET100300419: Inteligentní modely, algoritmy, metody a nástroje pro vytváření sémantického webu</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2008

Kód důvěrnosti údajů

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

Název statě ve sborníku

WDS'08 Proceedings of Contributed Papers: Part I - Mathematics and Computer Sciences

ISBN

978-80-7378-065-4

ISSN

—

e-ISSN

—

Počet stran výsledku

5

Strana od-do

—

Název nakladatele

Matfyzpress

Místo vydání

Praha

Místo konání akce

Praha

Datum konání akce

1. 1. 2008

Typ akce podle státní příslušnosti

CST - Celostátní akce

Kód UT WoS článku

—