A case for redundant arrays of inexpensive disks (RAID)
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Performance analysis of disk arrays under failure
Proceedings of the sixteenth international conference on Very large databases
Parallel database systems: the future of high performance database systems
Communications of the ACM
The HP AutoRAID hierarchical storage system
ACM Transactions on Computer Systems (TOCS) - Special issue on operating system principles
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
Hot mirroring: a method of hiding parity update penalty and degradation during rebuilds for RAID5
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Towards self-tuning data placement in parallel database systems
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Adaptive Load Balancing in Disk Arrays
FODO '93 Proceedings of the 4th International Conference on Foundations of Data Organization and Algorithms
Chained Declustering: A New Availability Strategy for Multiprocessor Database Machines
Proceedings of the Sixth International Conference on Data Engineering
GAMMA - A High Performance Dataflow Database Machine
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
DASFAA '01 Proceedings of the 7th International Conference on Database Systems for Advanced Applications
DEXA '00 Proceedings of the 11th International Conference on Database and Expert Systems Applications
Autonomous Disks for Advanced Database Applications
DANTE '99 Proceedings of the 1999 International Symposium on Database Applications in Non-Traditional Environments
Fat-Btree: An Update-Conscious Parallel Directory Structure
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Performance availability for networks of workstations
Performance availability for networks of workstations
Dynamic Data Migration Policies for Query-Intensive Distributed Data Environments
APWeb/WAIM '09 Proceedings of the Joint International Conferences on Advances in Data and Web Management
PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
Selection of nodes for distributing relations in parallel database
CAR'10 Proceedings of the 2nd international Asia conference on Informatics in control, automation and robotics - Volume 1
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part II
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part III
CEA: A Cyclic Expansion Algorithm for data migration in parallel video servers
Journal of Parallel and Distributed Computing
RTP: robust tenant placement for elastic in-memory database clusters
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Hi-index | 0.00 |
This paper proposes a new data-placement method named Adaptive Overlapped Declustering, which can be applied to a parallel storage system using a value range partitioning-based distributed directory and primary-backup data replication, to improve the space utilization by balancing their access loads. The proposed method reduces data skews generated by data migration for balancing access load. While some data-placement methods capable of balancing access load or reducing data skew have been proposed, both requirements satisfied simultaneously. The proposed method also improves the reliability and availability of the system because it reduces recovery time for damaged backups after a disk failure. The method achieves this acceleration by reducing a large amount of network communications and disk I/O. Mathematical analysis shows the efficiency of space utilization under skewed access workloads. Queuing simulations demonstrated that the proposed method halves backup restoration time, compared with the traditional chained declustering method.