Optimizing binary trees grown with a sorting algorithm
Communications of the ACM
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Performance of a two-headed disk system when serving database queries under the scan policy
ACM Transactions on Database Systems (TODS)
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)
A dynamic database reorganization algorithm
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)
Optimal storage allocation for serial files
Communications of the ACM
Optimal reorganization of distributed space disk files
Communications of the ACM
SIGMOD '78 Proceedings of the 1978 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
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
An architecture for fault tolerance in database systems
ACM '80 Proceedings of the ACM 1980 annual conference
ACM '77 Proceedings of the 1977 annual conference
Opportunities for data base reorganization
ACM SIGMOD Record
Optimal choice of data restructuring points
VLDB '75 Proceedings of the 1st International Conference on Very Large Data Bases
Reorganization points for file designs with nonlinear processing costs
VLDB '75 Proceedings of the 1st International Conference on Very Large Data Bases
A survey of physical database design methodology and techniques
VLDB '78 Proceedings of the fourth international conference on Very Large Data Bases - Volume 4
Virtual hashing: a dynamically changing hashing
VLDB '78 Proceedings of the fourth international conference on Very Large Data Bases - Volume 4
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
Linear hashing: a new tool for file and table addressing
VLDB '80 Proceedings of the sixth international conference on Very Large Data Bases - Volume 6
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)
Data structures and data accessing in data base systems past, present, future
IBM Systems Journal
Online monitoring and visualisation of database structural deterioration
International Journal of Autonomic Computing
| Hi-index | 48.25 |
In certain data base organization schemes the cost per access may increase due to structural inefficiencies caused by update. By reorganizing the data base the cost per access may be reduced. However, the high cost of a reorganization prohibits frequent reorganizations. This paper examines strategies for selecting the optimum reorganization points.