Parallel dynamic batch loading in the M-tree
The result's identifiers
Result code in 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>
Result on the web
<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>
Alternative languages
Result language
angličtina
Original language name
Parallel dynamic batch loading in the M-tree
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2009
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
ISBN
978-0-7695-3765-8
ISSN
—
e-ISSN
—
Number of pages
7
Pages from-to
117-123
Publisher name
IEEE Computer Society
Place of publication
LOS ALAMITOS
Event location
Prague
Event date
Aug 29, 2009
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000282087600014