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

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F13%3A86088698" target="_blank" >RIV/61989100:27240/13:86088698 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1145/2513591.2513656" target="_blank" >http://dx.doi.org/10.1145/2513591.2513656</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1145/2513591.2513656" target="_blank" >10.1145/2513591.2513656</a>

Jazyk výsledku

angličtina

Název v původním jazyce

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

Popis výsledku v původním jazyce

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 aimour 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 o

Název v anglickém jazyce

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

Popis výsledku anglicky

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 aimour 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 o

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/GA102%2F09%2F1842" target="_blank" >GA102/09/1842: Spolehlivá elektroenergetická soustava s připojenými netradičními zdroji</a><br>

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2013

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

ACM International Conference Proceeding Series

ISBN

978-1-4503-2025-2

ISSN

—

e-ISSN

—

Počet stran výsledku

14

Strana od-do

14-27

Název nakladatele

ACM

Místo vydání

New York

Místo konání akce

Barcelona

Datum konání akce

9. 10. 2013

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—