Balanced multidimensional extendible hash tree
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
The BANG file: A new kind of grid file
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
File structures: an analytic approach
File structures: an analytic approach
Efficient structures for geometric data management
Efficient structures for geometric data management
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Advances in the design of the BANG file
3rd International Conference, FODO 1989 on Foundations of Data Organization and Algorithms
Query processing method for multi-attribute clustered relations
Proceedings of the sixteenth international conference on Very large databases
The hB-tree: a multiattribute indexing method with good guaranteed performance
ACM Transactions on Database Systems (TODS)
Flexible buffer allocation based on marginal gains
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Research issues in spatial databases
ACM SIGMOD Record - Directions for future database research & development
Spatial database access methods
ACM SIGMOD Record
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
The K-D-B-tree: a search structure for large multidimensional dynamic indexes
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
7 ± 2 Criteria for Assessing and Comparing Spatial data Structures
SSD '89 Proceedings of the First Symposium on Design and Implementation of Large Spatial Databases
Astronomical Tables, 2-D Indexing, and Fuzzy-joins
SSDBM '96 Proceedings of the Eighth International Conference on Scientific and Statistical Database Management
| Hi-index | 0.00 |
Disk input/output (I/O) efficient query execution is an important topic with respect to DBMS performance. In this context, we elaborate on the construction of disk access plans for sort order queries in balanced and nested grid files. The key idea is to use the order information contained in the directory of the multiattribute search structure. The presented algorithms are shown to yield a significant decrease in the number of disk I/O operations by appropriate use of the order information.Two algorithms for the construction of appropriate disk access plans are proposed, namely a greedy approach and a heuristic divide-and-conquer approach. Both approaches yield considerable I/O savings compared to straightforward query processing without consideration of any directory order information. The former performs well for small buffer page allocations, i.e., for a small number of buffer pages relative to the number of data buckets processed in the query. The latter is superior to the greedy algorithm with respect to the total number of I/O operations and with respect to the overall maximum of buffer pages needed to achieve the minimal number of disk I/O operations.Both approaches rely on a binary trie as a temporary data structure. This trie is used as an explicit representation of the order information. The storage consumption of the temporary data structure is shown to be negligible in realistic cases. Even for pathological cases with respect to degenerated balanced and nested grid files, reasonable upper bounds can be given.