Chained declustering: a new availability strategy for multiprocessor database machines
- 4 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 6, 456-465
- https://doi.org/10.1109/icde.1990.113499
Abstract
A new strategy for increasing the availability of data in multiprocessor, shared-nothing database machines is presented. This technique, termed chained declustering, is demonstrated to provide superior performance in the event of failures while maintaining a very high degree of data availability. Furthermore, unlike most earlier replication strategies, the implementation of chained declustering requires no special hardware and only minimal modifications to existing softwareKeywords
This publication has 10 references indexed in Scilit:
- Arm scheduling in shadowed disksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Failure correction techniques for large disk arraysPublished by Association for Computing Machinery (ACM) ,1989
- A comparison of high-availability media recovery techniquesPublished by Association for Computing Machinery (ACM) ,1989
- A performance analysis of the gamma database machinePublished by Association for Computing Machinery (ACM) ,1988
- Data placement in BubbaPublished by Association for Computing Machinery (ACM) ,1988
- A case for redundant arrays of inexpensive disks (RAID)Published by Association for Computing Machinery (ACM) ,1988
- Multi-disk management algorithmsACM SIGMETRICS Performance Evaluation Review, 1987
- Synchronized Disk InterleavingIEEE Transactions on Computers, 1986
- Load balancing in a locally distributed DB systemACM SIGMOD Record, 1986
- Implementation of integrity constraints and views by query modificationPublished by Association for Computing Machinery (ACM) ,1975