Optimum data base reorganization points
Communications of the ACM
ACM Transactions on Computer Systems (TOCS)
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
IEEE Transactions on Software Engineering
SAC '92 Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing: technological challenges of the 1990's
Mathematical models of database degradation
ACM Transactions on Database Systems (TODS)
Performance and Stability Analysis of Multilevel Data Structures with Deferred Reorganization
IEEE Transactions on Software Engineering
Database Reorganization—Principles and Practice
ACM Computing Surveys (CSUR)
Optimal storage allocation for serial files
Communications of the ACM
Database cost analysis: a top-down approach
SIGMOD '77 Proceedings of the 1977 ACM SIGMOD international conference on Management of data
Modeling and Analysis of Concurrent Maintenance Policies for Data Structures Using Pointers
IEEE Transactions on Software Engineering
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
ACM '77 Proceedings of the 1977 annual conference
QoSMig: Adaptive Rate-Controlled Migration of Bulk Data in Storage Systems
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
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
Online reorganization of databases
ACM Computing Surveys (CSUR)
Online monitoring and visualisation of database structural deterioration
International Journal of Autonomic Computing
| Hi-index | 48.23 |
In most database organizations, the cost of accessing the database will increase due to structural changes caused by updates and insertions. By reorganizing the database, the access costs can be reduced. A basic problem is to establish the proper tradeoff between performance, storage costs, and reorganization costs. This paper considers the optimum points at which to reorganize a database. A disk file organization which allows for distributed free space is described. A cost function describing the excess costs due to physical disorganization is defined, and this function is minimized to obtain the optimum reorganization points. Numerical examples based on the characteristics of existing disk storage devices are given.