A global approach to record clustering and file reorganization
Proc. of the third joint BCS and ACM symposium on Research and development in information retrieval
ACM Transactions on Database Systems (TODS)
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Concurrent file conversion between B+-tree and linear hash files
Information Systems
Proceedings of the sixteenth international conference on Very large databases
Models for studying concurrency control performance: alternatives and implications
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
ACM Transactions on Database Systems (TODS)
System R: relational approach to database management
ACM Transactions on Database Systems (TODS)
Differential files: their application to the maintenance of large databases
ACM Transactions on Database Systems (TODS)
Database Reorganization—Principles and Practice
ACM Computing Surveys (CSUR)
Approximating block accesses in database organizations
Communications of the ACM
Probability and Statistics with Reliability, Queuing and Computer Science Applications
Probability and Statistics with Reliability, Queuing and Computer Science Applications
An Analytical Model of a Deferred and Incremental Update Strategy for Secondary Indexes
FOFO '89 Proceedings of the 3rd International Conference on Foundations of Data Organization and Algorithms
Two techniques for on-line index modification in shared nothing parallel databases
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
A method for on-line reorganization of a database
IBM Systems Journal
Database Reorganization in Parallel Disk Arrays with I/O Service Stealing
IEEE Transactions on Knowledge and Data Engineering
Safely and Efficiently Updating References During On-line Reorganization
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Online reorganization of databases
ACM Computing Surveys (CSUR)
Online monitoring and visualisation of database structural deterioration
International Journal of Autonomic Computing
| Hi-index | 0.00 |
Presents a simulation-based performance analysis of a concurrent file reorganization algorithm. We examine the effect on throughput of (a) buffer size, (b) degree of reorganization, (c) write probability of transactions, (d) multiprogramming level, and (e) degree of clustered transactions. The problem of file reorganization that we consider involves altering the placement of records on pages of a secondary storage device. In addition, we want this reorganization to be done in place, i.e. using the file's original storage space for the newly reorganized file. Our approach is appropriate for a non-in-place reorganization as well. The motivation for such a physical change, i.e. record clustering, is to improve the database system's performance, i.e. minimizing the number of page accesses made in answering a set of queries. There are numerous record clustering algorithms, but they usually do not solve the entire problem, i.e., they do not specify how to efficiently reorganize the file to reflect the clustering assignment that they determine. In previous work, we have presented an algorithm that is a companion to general record clustering algorithms, i.e. it actually transforms the file. In this work we show through simulation that our algorithm, when run concurrently with user transactions, provides an acceptable level of overall database system performance.