Highly available systems for database applications
ACM Computing Surveys (CSUR)
Synchronized Disk Interleaving
IEEE Transactions on Computers
Multi-disk management algorithms
SIGMETRICS '87 Proceedings of the 1987 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Physical database design for relational databases
ACM Transactions on Database Systems (TODS)
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
Guide to parallel programming on Sequent computer systems: 2nd edition
Guide to parallel programming on Sequent computer systems: 2nd edition
Vertical partitioning for database design: a graphical algorithm
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
ACM Transactions on Database Systems (TODS)
Design of Database Structures
Proceedings of the Seventh International Conference on Data Engineering
Proceedings of the Second International Conference on Data Engineering
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
File Assignment in Parallel I/O Systems with Minimal Variance of Service Time
IEEE Transactions on Computers
A Hypergraph Based Approach to Declustering Problems
Distributed and Parallel Databases
Variable-size data item placement for load and storage balancing
Journal of Systems and Software
An optimal workload-based data allocation approach for multidisk databases
Data & Knowledge Engineering
Workload-aware storage layout for database systems
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Load and storage balanced posting file partitioning for parallel information retrieval
Journal of Systems and Software
Hi-index | 0.00 |
This paper deals with I/O throughput maximization in a single processor/multidisk database system, by means of optimal allocation of entire relations (or other nonfragmented data objects) to disks. We examine the cases in which such allocation is beneficial, and present a mathematical formulation of the problem. This formulation is shown to be flexible enough to accommodate various objectives and constraints of a typical system design.