About: On the efficiency of multiple range query processing in multidimensional data structures

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: On the efficiency of multiple range query processing in multidimensional data structures Goto Sponge Distinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
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. (en)
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 (en)
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 (en)
skos:notation	RIV/61989100:27240/13:86088698!RIV14-GA0-27240___
http://linked.open...avai/riv/aktivita	P S
http://linked.open...avai/riv/aktivity	P(GA102/09/1842), S
http://linked.open...vai/riv/dodaniDat	2014
http://linked.open...aciTvurceVysledku	Krátký, Michal Chovanec, Peter
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Vysoká škola báňská - Technická univerzita Ostrava / Fakulta elektrotechniky a informatiky
http://linked.open...dnocenehoVysledku	93866
http://linked.open...ai/riv/idVysledku	RIV/61989100:27240/13:86088698
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	multidimensional data structures, R-tree, multiple range query processing, range query batch, Cartesian range query (en)
http://linked.open.../riv/klicoveSlovo	R-tree Cartesian range query multidimensional data structures multiple range query processing range query batch
http://linked.open...ontrolniKodProRIV	[6D8468ABF719]
http://linked.open...v/mistoKonaniAkce	Barcelona
http://linked.open...i/riv/mistoVydani	New York
http://linked.open...i/riv/nazevZdroje	ACM International Conference Proceeding Series
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	Reliable Electric Power Network with Connected Alternative Power Sources
http://linked.open...UplatneniVysledku	2013
http://linked.open...iv/tvurceVysledku	Krátký, Michal Chovanec, Peter
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2013-10-09 (xsd:date)
number of pages	14 (xsd:int)
http://bibframe.org/vocab/doi	10.1145/2513591.2513656
http://purl.org/ne...btex#hasPublisher	ACM
https://schema.org/isbn	978-1-4503-2025-2
http://localhost/t...ganizacniJednotka	27240

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software