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

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

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n8http://localhost/temp/predkladatel/
n14http://linked.opendata.cz/resource/domain/vavai/projekt/
n5http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n12http://linked.opendata.cz/ontology/domain/vavai/
n13http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n11http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n19http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F61989100%3A27240%2F06%3A00021161%21RIV11-GA0-27240___/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n15http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F61989100%3A27240%2F06%3A00021161%21RIV11-GA0-27240___
rdf:type
n12:Vysledek skos:Concept
dcterms:description
In multi-dimensional databases the essential tool for accessing data is the range query (or window query). In this paper we introduce a new algorithm of processing range query in Universal B-tree (UB-tree), which is an index structure for searching in multi-dimensional databases. The new range query algorithm (called the DRU algorithm) works efficiently, even for processing high-dimensional databases. In particular, using the DRU algorithm many of the UB-tree inner nodes need not to be accessed. We explain the DRU algorithm using a simple geometric model, providing a clear insight into the problem. More specifically, the model exploits an interesting relation between the Z-curve and generalized quad-trees. We also present experimental results for the DRU algorithm implementation. In multi-dimensional databases the essential tool for accessing data is the range query (or window query). In this paper we introduce a new algorithm of processing range query in Universal B-tree (UB-tree), which is an index structure for searching in multi-dimensional databases. The new range query algorithm (called the DRU algorithm) works efficiently, even for processing high-dimensional databases. In particular, using the DRU algorithm many of the UB-tree inner nodes need not to be accessed. We explain the DRU algorithm using a simple geometric model, providing a clear insight into the problem. More specifically, the model exploits an interesting relation between the Z-curve and generalized quad-trees. We also present experimental results for the DRU algorithm implementation.
dcterms:title
A New Range Query Algorithm for Universal B-trees A New Range Query Algorithm for Universal B-trees
skos:prefLabel
A New Range Query Algorithm for Universal B-trees A New Range Query Algorithm for Universal B-trees
skos:notation
RIV/61989100:27240/06:00021161!RIV11-GA0-27240___
n4:aktivita
n7:Z n7:P
n4:aktivity
P(GA201/03/0912), P(GA201/06/0756), Z(MSM0021620838)
n4:cisloPeriodika
6
n4:dodaniDat
n15:2011
n4:domaciTvurceVysledku
n5:4347269 n5:9614389
n4:druhVysledku
n16:J
n4:duvernostUdaju
n18:S
n4:entitaPredkladatele
n19:predkladatel
n4:idSjednocenehoVysledku
463663
n4:idVysledku
RIV/61989100:27240/06:00021161
n4:jazykVysledku
n9:eng
n4:klicovaSlova
spatial access methods, multi-dimensional indexing, range query, UB-tree, DRU algorithm, Z-region, space filling curves
n4:klicoveSlovo
n11:space%20filling%20curves n11:spatial%20access%20methods n11:multi-dimensional%20indexing n11:range%20query n11:UB-tree n11:Z-region n11:DRU%20algorithm
n4:kodStatuVydavatele
NL - Nizozemsko
n4:kontrolniKodProRIV
[A62F3EE4DCDA]
n4:nazevZdroje
Information Systems
n4:obor
n17:IN
n4:pocetDomacichTvurcuVysledku
2
n4:pocetTvurcuVysledku
4
n4:projekt
n14:GA201%2F06%2F0756 n14:GA201%2F03%2F0912
n4:rokUplatneniVysledku
n15:2006
n4:svazekPeriodika
31
n4:tvurceVysledku
Skopal, Tomáš Krátký, Michal Pokorný, Jaroslav Snášel, Václav
n4:wos
000238591200004
n4:zamer
n13:MSM0021620838
s:issn
0306-4379
s:numberOfPages
22
n8:organizacniJednotka
27240