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
n13http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n10http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F61989100%3A27240%2F13%3A86088698%21RIV14-GA0-27240___/
n14http://purl.org/net/nknouf/ns/bibtex#
n11http://localhost/temp/predkladatel/
n23http://linked.opendata.cz/resource/domain/vavai/projekt/
n5http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n16http://linked.opendata.cz/resource/domain/vavai/subjekt/
n15http://linked.opendata.cz/ontology/domain/vavai/
n6https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n9http://bibframe.org/vocab/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n8http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n20http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n22http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F61989100%3A27240%2F13%3A86088698%21RIV14-GA0-27240___
rdf:type
n15:Vysledek skos:Concept
dcterms:description
Multidimensional data are commonly utilized in many application areas like electronic shopping, cartography and many others. These data structures support various types of queries, e.g. point or range query. The range query retrieves all tuples of a multidimensional space matched by a query rectangle. Processing range queries in a multidimensional data structure has some performance issues, especially in the case of a higher space dimension or a lower query selectivity. As result, these data are often stored in an array or one-dimensional index like B-tree and range queries are processed with a sequence scan. Many real world queries can be transformed to a multiple range query: the query including more than one query rectangle. In this article, we aim our effort to processing of this type of the range query. First, we show an algorithm processing a sequence of range queries. Second, we introduce a special type of the multiple range query, the Cartesian range query. We show optimality of these algorithms from the IO and CPU costs point of view and we compare their performance with current methods. Although we introduce these algorithms for the R-tree, we show that these algorithms are appropriate for all multidimensional data structures with nested regions. Multidimensional data are commonly utilized in many application areas like electronic shopping, cartography and many others. These data structures support various types of queries, e.g. point or range query. The range query retrieves all tuples of a multidimensional space matched by a query rectangle. Processing range queries in a multidimensional data structure has some performance issues, especially in the case of a higher space dimension or a lower query selectivity. As result, these data are often stored in an array or one-dimensional index like B-tree and range queries are processed with a sequence scan. Many real world queries can be transformed to a multiple range query: the query including more than one query rectangle. In this article, we aim our effort to processing of this type of the range query. First, we show an algorithm processing a sequence of range queries. Second, we introduce a special type of the multiple range query, the Cartesian range query. We show optimality of these algorithms from the IO and CPU costs point of view and we compare their performance with current methods. Although we introduce these algorithms for the R-tree, we show that these algorithms are appropriate for all multidimensional data structures with nested regions.
dcterms:title
On the efficiency of multiple range query processing in multidimensional data structures On the efficiency of multiple range query processing in multidimensional data structures
skos:prefLabel
On the efficiency of multiple range query processing in multidimensional data structures On the efficiency of multiple range query processing in multidimensional data structures
skos:notation
RIV/61989100:27240/13:86088698!RIV14-GA0-27240___
n15:predkladatel
n16:orjk%3A27240
n3:aktivita
n12:S n12:P
n3:aktivity
P(GA102/09/1842), S
n3:dodaniDat
n22:2014
n3:domaciTvurceVysledku
n5:9614389 Chovanec, Peter
n3:druhVysledku
n18:D
n3:duvernostUdaju
n4:S
n3:entitaPredkladatele
n10:predkladatel
n3:idSjednocenehoVysledku
93866
n3:idVysledku
RIV/61989100:27240/13:86088698
n3:jazykVysledku
n20:eng
n3:klicovaSlova
multidimensional data structures, R-tree, multiple range query processing, range query batch, Cartesian range query
n3:klicoveSlovo
n8:multiple%20range%20query%20processing n8:range%20query%20batch n8:multidimensional%20data%20structures n8:Cartesian%20range%20query n8:R-tree
n3:kontrolniKodProRIV
[6D8468ABF719]
n3:mistoKonaniAkce
Barcelona
n3:mistoVydani
New York
n3:nazevZdroje
ACM International Conference Proceeding Series
n3:obor
n7:IN
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
2
n3:projekt
n23:GA102%2F09%2F1842
n3:rokUplatneniVysledku
n22:2013
n3:tvurceVysledku
Krátký, Michal Chovanec, Peter
n3:typAkce
n13:WRD
n3:zahajeniAkce
2013-10-09+02:00
s:numberOfPages
14
n9:doi
10.1145/2513591.2513656
n14:hasPublisher
ACM
n6:isbn
978-1-4503-2025-2
n11:organizacniJednotka
27240