Quantitative system performance: computer system analysis using queueing network models
Quantitative system performance: computer system analysis using queueing network models
The AMVA priority approximation
Performance Evaluation
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Dynamic file allocation in disk arrays
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Parallel database systems: the future of high performance database systems
Communications of the ACM
On-line processing in large-scale transaction systems
On-line processing in large-scale transaction systems
Data placement in shared-nothing parallel database systems
Data placement in shared-nothing parallel database systems
IBM Systems Journal
The difficulty of optimum index selection
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)
The MVA priority approximation
ACM Transactions on Computer Systems (TOCS)
Exact and Approximate Algorithms for the Index Selection Problem in Physical Database Design
IEEE Transactions on Knowledge and Data Engineering
Concurrent File Reorganization for Record Clustering: A Performance Study
Proceedings of the Eighth International Conference on Data Engineering
Principles of Transaction-Based On-Line Reorganization
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
The MVA Pre-empt resume priority approximation
SIGMETRICS '83 Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems
EXPERIMENTAL EVALUATION OF DYNAMIC DATA ALLOCATION STRATEGIES IN A DISTRIBUTED DATABASE WITH CHANGING WORKLOADS
Online reorganization of databases
ACM Computing Surveys (CSUR)
| Hi-index | 0.01 |
Because changes to the database (DB) and workload occur during a DB system's lifetime, the physical DB design must evolve to sustain good performance. These changes are carried out by on-line reorganizations which access the DB and execute concurrently with the DB workload. Different performance intrusions are placed on the workload when a reorganization is assigned different priorities compared to the workload processes. Our work studies the effects of the reorganization priority-level on performance. There are two performance aspects of interest: the time taken for a reorganization and the intrusion the reorganization places on the workload. The reorganization we consider is a redistribution (rebalancing) of a relation across the nodes of a parallel sharednothing system. A shared-nothing system contains multiple processors with their own local memory and disks, and these processors share only the interconnection network. We have seen that heavily loaded systems or highly imbalanced relations across the disks indicates the choice of a higher reorganization priority-level than the workload's. This paper also presents a metric and an analytic modeling method that can be useful for comparing reorganizations in general.