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

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

Namespace Prefixes

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

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F08%3A00101229%21RIV09-AV0-11320___
rdf:type
n20:Vysledek skos:Concept
dcterms:description
In this paper we introduce a new M-tree building method, utilizing the classic idea of forced reinsertions. In case a leaf is about to split, some distant objects are removed from the leaf (reducing the covering radius), and then again inserted into the M-tree in a usual way. A regular leaf split is performed only after a series of unsuccessful reinsertion attempts. We expect the forced reinsertions will result in more compact M-tree hierarchies (i.e., more efficient query processing), while the index construction costs should be kept as low as possible. Considering both low construction costs and low querying costs, we examine several combinations of construction policies with reinsertions. The experiments show that forced reinsertions could significantly decrease the number of distance computations, thus speeding up indexing as well as querying. In this paper we introduce a new M-tree building method, utilizing the classic idea of forced reinsertions. In case a leaf is about to split, some distant objects are removed from the leaf (reducing the covering radius), and then again inserted into the M-tree in a usual way. A regular leaf split is performed only after a series of unsuccessful reinsertion attempts. We expect the forced reinsertions will result in more compact M-tree hierarchies (i.e., more efficient query processing), while the index construction costs should be kept as low as possible. Considering both low construction costs and low querying costs, we examine several combinations of construction policies with reinsertions. The experiments show that forced reinsertions could significantly decrease the number of distance computations, thus speeding up indexing as well as querying. O znovuvkládání v M-stromu
dcterms:title
O znovuvkládání v M-stromu On Reinsertions in M-tree On Reinsertions in M-tree
skos:prefLabel
On Reinsertions in M-tree O znovuvkládání v M-stromu On Reinsertions in M-tree
skos:notation
RIV/00216208:11320/08:00101229!RIV09-AV0-11320___
n3:aktivita
n13:Z n13:P
n3:aktivity
P(1ET100300419), Z(MSM0021620838)
n3:dodaniDat
n7:2009
n3:domaciTvurceVysledku
n4:3885364 n4:5851726
n3:druhVysledku
n18:D
n3:duvernostUdaju
n8:S
n3:entitaPredkladatele
n15:predkladatel
n3:idSjednocenehoVysledku
384662
n3:idVysledku
RIV/00216208:11320/08:00101229
n3:jazykVysledku
n16:eng
n3:klicovaSlova
Reinsertions; M-tree
n3:klicoveSlovo
n14:Reinsertions n14:M-tree
n3:kontrolniKodProRIV
[C4BA0FA34452]
n3:mistoKonaniAkce
Cancun, Mexico
n3:mistoVydani
Cancun, Mexico
n3:nazevZdroje
SISAP 2008: First international workshop on similarity search and applications
n3:obor
n5:JC
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
2
n3:projekt
n21:1ET100300419
n3:rokUplatneniVysledku
n7:2008
n3:tvurceVysledku
Skopal, Tomáš Lokoč, Jakub
n3:typAkce
n9:WRD
n3:wos
000255509900014
n3:zahajeniAkce
2008-01-01+01:00
n3:zamer
n12:MSM0021620838
s:numberOfPages
8
n19:hasPublisher
IEEE
n22:isbn
0-7695-3101-6
n10:organizacniJednotka
11320