File systems: structures and algorithms
File systems: structures and algorithms
Algorithms (2nd ed.)
Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
An overview of query optimization in relational systems
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Proceedings of the ninth international conference on Information and knowledge management
Database System Implementation
Database System Implementation
Experiments with B-tree reorganization
SIGMOD '80 Proceedings of the 1980 ACM SIGMOD international conference on Management of data
Probabilistic Model and Optimal Reorganization of B+-Tree with Physical Clustering
IEEE Transactions on Knowledge and Data Engineering
Generalized Search Trees for Database Systems
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Similarity among melodies for music information retrieval
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
Proceedings of the 2nd international conference on Ubiquitous information management and communication
Online monitoring and visualisation of database structural deterioration
International Journal of Autonomic Computing
| Hi-index | 0.00 |
In this investigation, we address a reordering technique that improves sequential processing to B-tree files dramatically. We show conventional reorganization is not fully helpful, and propose reordering of blocks reflecting logical order. First we obtain all the data in a logical order, and then we put them into pre-order. Here we show some experimental results that says how this technique works well.