The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
A general solution of the n-dimensional B-tree problem
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Database tuning: principles, experiments, and troubleshooting techniques
Database tuning: principles, experiments, and troubleshooting techniques
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
The X-tree: An Index Structure for High-Dimensional Data
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
The Universal B-Tree for Multidimensional Indexing: general Concepts
WWCA '97 Proceedings of the International Conference on Worldwide Computing and Its Applications
Relational Database Index Design and the Optimizers
Relational Database Index Design and the Optimizers
Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)
R-Trees: Theory and Applications (Advanced Information and Knowledge Processing)
R-Trees: Theory and Applications (Advanced Information and Knowledge Processing)
Efficient Processing of Narrow Range Queries in Multi-dimensional Data Structures
IDEAS '06 Proceedings of the 10th International Database Engineering and Applications Symposium
Physical Database Design: the database professional's guide to exploiting indexes, views, storage, and more
Storing semi-structured data on disk drives
ACM Transactions on Storage (TOS)
Construction of tree-based indexes for level-contiguous buffering support
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
On the efficient processing regular path expressions of an enormous volume of XML data
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
Multidimensional implementation of stream ADT
WAIM'11 Proceedings of the 2011 international conference on Web-Age Information Management
On the efficiency of multiple range query processing in multidimensional data structures
Proceedings of the 17th International Database Engineering & Applications Symposium
| Hi-index | 0.00 |
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, the main 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 R-tree since it is the most common multidimensional data structure.