A measure of transaction processing power
Datamation
Multi-disk management algorithms
SIGMETRICS '87 Proceedings of the 1987 ACM SIGMETRICS conference on Measurement and modeling of computer systems
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
A case for redundant arrays of inexpensive disks (RAID)
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Proceedings of the 2nd International Workshop on High Performance Transaction Systems
GAMMA - A High Performance Dataflow Database Machine
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
Dynamic file allocation in disk arrays
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Parity declustering for continuous operation in redundant disk arrays
ASPLOS V Proceedings of the fifth international conference on Architectural support for programming languages and operating systems
Using rotational mirrored declustering for replica placement in a disk-array-based video server
Proceedings of the third ACM international conference on Multimedia
A Performance Evaluation of RAID Architectures
IEEE Transactions on Computers
Dynamic Data Reallocation for Skew Management inShared-Nothing Parallel Databases
Distributed and Parallel Databases
Failure recovery algorithms for multimedia servers
Multimedia Systems
Asynchronous scheduling of redundant disk arrays
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Design of Fault-Tolerant Large-Scale VOD Servers: With Emphasis on High-Performance and Low-Cost
IEEE Transactions on Parallel and Distributed Systems
Multi-level transaction management for complex objects: implementation, performance, parallelism
The VLDB Journal — The International Journal on Very Large Data Bases
Analytic Modeling and Comparisons of Striping Strategies for Replicated Disk Arrays
IEEE Transactions on Computers
Prototyping Bubba, A Highly Parallel Database System
IEEE Transactions on Knowledge and Data Engineering
The Gamma Database Machine Project
IEEE Transactions on Knowledge and Data Engineering
The Effect of Index Partitioning Schemes on the Performance of Distributed Query Processing
IEEE Transactions on Knowledge and Data Engineering
Performance Analysis of Disk Arrays under Failure
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
NCR 3700 - The Next-Generation Industrial Database Computer
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Disk Mirroring with Alternating Deferred Updates
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Data partitioning and load balancing in parallel disk systems
The VLDB Journal — The International Journal on Very Large Data Bases
Data and knowledge in database systems: parallel databases
Handbook of data mining and knowledge discovery
Asynchronous Scheduling of Redundant Disk Arrays
IEEE Transactions on Computers
Survey of Architectures of Parallel Database Systems
Programming and Computing Software
Shifted declustering: a placement-ideal layout scheme for multi-way replication storage architecture
Proceedings of the 22nd annual international conference on Supercomputing
Understanding the Value of Countermeasure Portfolios in Information Systems Security
Journal of Management Information Systems
Hi-index | 0.01 |
We compare two high-availability techniques for recovery from media failures in database systems. Both techniques achieve high availability by having two copies of all data and indexes, so that recovery is immediate. “Mirrored declustering” spreads two copies of each relation across two identical sets of disks. “Interleaved declustering” spreads two copies of each relation across one set of disks while keeping both copies of each tuple on separate disks. Both techniques pay the same costs of doubling storage requirements and requiring updates to be applied to both copies.Mirroring offers greater simplicity and universality. Recovery can be implemented at lower levels of the system software (e.g., the disk controller). For architectures that do not share disks globally, it allows global and local cluster indexes to be independent. Also, mirroring does not require data to be declustered (i.e., spread over multiple disks).Interleaved declustering offers significant improvements in recovery time, mean time to loss of both copies of some data, throughput during normal operation, and response time during recovery. For all architectures, interleaved declustering enables data to be spread over twice as many disks for improved load balancing. We show how tuning for interleaved declustering is simplified because it is dependent only on a few parameters that are usually well known for a specific workload and system configuration.