Parallel dynamic batch loading in the M-tree

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F09%3A10089824" target="_blank" >RIV/00216208:11320/09:10089824 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1109/SISAP.2009.27" target="_blank" >http://dx.doi.org/10.1109/SISAP.2009.27</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/SISAP.2009.27" target="_blank" >10.1109/SISAP.2009.27</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Parallel dynamic batch loading in the M-tree

Popis výsledku v původním jazyce

Although metric access methods (MAMs) proved their capabilities when performing efficient similarity search, their further performance improvement is needed due to extreme growth of data volumes. Since multi core processors become widely available, it isjustified to exploit parallelism. However, taking into account the Gustafson's law, it is necessary to find tasks suitable for parallelization. Such a task could be M-tree construction. Unfortunately, parallelism during an object insertion in hierarchical index structures is limited by a node capacity. It is much less restrictive to run several independent insertions in parallel. In this paper we present our new technique of M-tree construction. The technique postpones splitting of overfull nodes and thus allows simple parallelization of M-tree construction. Our experiments confirm the new technique guarantees significant speed up of M-tree construction and also improves the quality of the index.

Název v anglickém jazyce

Parallel dynamic batch loading in the M-tree

Popis výsledku anglicky

Although metric access methods (MAMs) proved their capabilities when performing efficient similarity search, their further performance improvement is needed due to extreme growth of data volumes. Since multi core processors become widely available, it isjustified to exploit parallelism. However, taking into account the Gustafson's law, it is necessary to find tasks suitable for parallelization. Such a task could be M-tree construction. Unfortunately, parallelism during an object insertion in hierarchical index structures is limited by a node capacity. It is much less restrictive to run several independent insertions in parallel. In this paper we present our new technique of M-tree construction. The technique postpones splitting of overfull nodes and thus allows simple parallelization of M-tree construction. Our experiments confirm the new technique guarantees significant speed up of M-tree construction and also improves the quality of the index.

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2009

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

Proceedings of the 2009 Second International Workshop on Similarity Search and Applications

ISBN

978-0-7695-3765-8

ISSN

—

e-ISSN

—

Počet stran výsledku

7

Strana od-do

117-123

Název nakladatele

IEEE Computer Society

Místo vydání

LOS ALAMITOS

Místo konání akce

Prague

Datum konání akce

29. 8. 2009

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

WRD - Celosvětová akce

Kód UT WoS článku

000282087600014