This HTML5 document contains 41 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n8http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n12http://localhost/temp/predkladatel/
n9http://purl.org/net/nknouf/ns/bibtex#
n14http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n15http://linked.opendata.cz/ontology/domain/vavai/
n17https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/
n3http://bibframe.org/vocab/
n18http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216208%3A11320%2F09%3A10089824%21RIV12-MSM-11320___/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n5http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n16http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n21http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n6http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F09%3A10089824%21RIV12-MSM-11320___
rdf:type
n15:Vysledek skos:Concept
dcterms: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 is justified 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. 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 is justified 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.
dcterms:title
Parallel dynamic batch loading in the M-tree Parallel dynamic batch loading in the M-tree
skos:prefLabel
Parallel dynamic batch loading in the M-tree Parallel dynamic batch loading in the M-tree
skos:notation
RIV/00216208:11320/09:10089824!RIV12-MSM-11320___
n4:aktivita
n16:S
n4:aktivity
S
n4:dodaniDat
n6:2012
n4:domaciTvurceVysledku
n14:3885364
n4:druhVysledku
n11:D
n4:duvernostUdaju
n20:S
n4:entitaPredkladatele
n18:predkladatel
n4:idSjednocenehoVysledku
332635
n4:idVysledku
RIV/00216208:11320/09:10089824
n4:jazykVysledku
n13:eng
n4:klicovaSlova
M-tree; indexing; similarity search; Parallel processing
n4:klicoveSlovo
n5:M-tree n5:indexing n5:Parallel%20processing n5:similarity%20search
n4:kontrolniKodProRIV
[D2F38DF8161B]
n4:mistoKonaniAkce
Prague
n4:mistoVydani
LOS ALAMITOS
n4:nazevZdroje
Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
n4:obor
n21:IN
n4:pocetDomacichTvurcuVysledku
1
n4:pocetTvurcuVysledku
1
n4:rokUplatneniVysledku
n6:2009
n4:tvurceVysledku
Lokoč, Jakub
n4:typAkce
n8:WRD
n4:wos
000282087600014
n4:zahajeniAkce
2009-08-29+02:00
s:numberOfPages
7
n3:doi
10.1109/SISAP.2009.27
n9:hasPublisher
IEEE Computer Society
n17:isbn
978-0-7695-3765-8
n12:organizacniJednotka
11320