Optimization of disk accesses for multidimensional range queries

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F10%3A86081759" target="_blank" >RIV/61989100:27240/10:86081759 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1007/978-3-642-15364-8_31" target="_blank" >http://dx.doi.org/10.1007/978-3-642-15364-8_31</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-642-15364-8_31" target="_blank" >10.1007/978-3-642-15364-8_31</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Optimization of disk accesses for multidimensional range queries

Popis výsledku v původním jazyce

Multidimensional data structures have become very popular in recent years. Their importance lies in efficient indexing of data, which have naturally multidimensional characteristics like navigation data, drawing specifications etc. The R-tree is a well-known structure based on the bounding of spatial near points by rectangles. Although efficient query processing of multidimensional data is requested, the R-tree has been shown to be inefficient in many cases. From the disk access cost point of view, themain issue of range query processing is the expensive cost of random accesses during the tree traversal. In the case of queries with low selectivity, the sequential scan of all tuples may be more efficient than the range query processing. We focus on efficiency of the disk access cost and we present an optimization of the disk access cost during range query processing. Our method focuses on a leaf node retrieval and it can be simply adopted by any tree. We put forward our tests using the

Název v anglickém jazyce

Optimization of disk accesses for multidimensional range queries

Popis výsledku anglicky

Multidimensional data structures have become very popular in recent years. Their importance lies in efficient indexing of data, which have naturally multidimensional characteristics like navigation data, drawing specifications etc. The R-tree is a well-known structure based on the bounding of spatial near points by rectangles. Although efficient query processing of multidimensional data is requested, the R-tree has been shown to be inefficient in many cases. From the disk access cost point of view, themain issue of range query processing is the expensive cost of random accesses during the tree traversal. In the case of queries with low selectivity, the sequential scan of all tuples may be more efficient than the range query processing. We focus on efficiency of the disk access cost and we present an optimization of the disk access cost during range query processing. Our method focuses on a leaf node retrieval and it can be simply adopted by any tree. We put forward our tests using the

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/GAP202%2F10%2F0573" target="_blank" >GAP202/10/0573: Zpracování XML dat v heterogenních a dynamických prostředích</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2010

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 periodika

Lecture Notes in Computer Science

ISSN

0302-9743

e-ISSN

—

Svazek periodika

2010

Číslo periodika v rámci svazku

6261

Stát vydavatele periodika

DE - Spolková republika Německo

Počet stran výsledku

10

Strana od-do

358-367

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—