Optimization of disk accesses for multidimensional range queries

Result code in 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>

Result on the web

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

Result language

angličtina

Original language name

Optimization of disk accesses for multidimensional range queries

Original language description

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

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

IN - Informatics

OECD FORD branch

—

Project

<a href="/en/project/GAP202%2F10%2F0573" target="_blank" >GAP202/10/0573: Handling XML Data in Heterogeneous and Dynamic Environments</a><br>

Continuities

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

Publication year

2010

Confidentiality

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

Name of the periodical

Lecture Notes in Computer Science

ISSN

0302-9743

e-ISSN

—

Volume of the periodical

2010

Issue of the periodical within the volume

6261

Country of publishing house

DE - GERMANY

Number of pages

10

Pages from-to

358-367

UT code for WoS article

—

EID of the result in the Scopus database

—