Optimum data base reorganization points
Communications of the ACM
Evaluation and selection of file organization—a model and system
Communications of the ACM
Evaluation and optimization of file organizations through analytic modeling.
Evaluation and optimization of file organizations through analytic modeling.
Opportunities for data base reorganization
ACM SIGMOD Record
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Adaptive information system design: one query at a time
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Optimal file designs and reorganization points
ACM Transactions on Database Systems (TODS)
Mathematical models of database degradation
ACM Transactions on Database Systems (TODS)
Optimum reorganization points for linearly growing files
ACM Transactions on Database Systems (TODS)
An attribute based model for database access cost analysis
ACM Transactions on Database Systems (TODS)
Optimal policy for batch operations: backup, checkpointing, reorganization, and updating
ACM Transactions on Database Systems (TODS)
Database Reorganization—Principles and Practice
ACM Computing Surveys (CSUR)
Comparison of loading costs for various file organizations
ACM-SE 16 Proceedings of the 16th annual Southeast regional conference
Application of an analytical model to evaluate storage structures
SIGMOD '76 Proceedings of the 1976 ACM SIGMOD international conference on Management of data
Database cost analysis: a top-down approach
SIGMOD '77 Proceedings of the 1977 ACM SIGMOD international conference on Management of data
Database Reorganization in Parallel Disk Arrays with I/O Service Stealing
IEEE Transactions on Knowledge and Data Engineering
Principles of Transaction-Based On-Line Reorganization
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
File Allocation in Distributed Databases with Interaction between Files
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
Performance Analysis of Database Systems
Performance Evaluation: Origins and Directions
Modeling on-line rebalancing with priorities and executing on parallel database systems
CASCON '96 Proceedings of the 1996 conference of the Centre for Advanced Studies on Collaborative research
Evaluation of concurrent physical database reorganization through simulation modeling
SIGMETRICS '81 Proceedings of the 1981 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Design and performance tools for data base systems
VLDB '77 Proceedings of the third international conference on Very large data bases - Volume 3
A survey of physical database design methodology and techniques
VLDB '78 Proceedings of the fourth international conference on Very Large Data Bases - Volume 4
Incremental file reorganization schemes
VLDB '85 Proceedings of the 11th international conference on Very Large Data Bases - Volume 11
Concurrent data base reorganization - assessment of a powerful technique through modeling
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Proceedings of the 2nd international conference on Ubiquitous information management and communication
Adaptive structuring of distributed databases
AFIPS '82 Proceedings of the June 7-10, 1982, national computer conference
Online reorganization of databases
ACM Computing Surveys (CSUR)
Online monitoring and visualisation of database structural deterioration
International Journal of Autonomic Computing
Online reorganization in read optimized MMDBS
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
| Hi-index | 0.00 |
Reorganization is necessary in some databases for overcoming the performance deterioration caused by updates. The paper presents a dynamic reorganization algorithm which makes the reorganization decision by measuring the database search costs. Previously, the reorganization intervals could only be determined for linear deterioration and known database lifetime. It is shown that the dynamic reorganization algorithm is near optimum for constant reorganization cost and is superior for increasing reorganization cost. In addition, it can be applied to cases of unknown database lifetime and nonlinear performance deterioration. The simplicity, generality, and efficiency appear to make this good heuristic for database reorganization.