An optimal workload-based data allocation approach for multidisk databases

Authors:
Ming-Hua Lin
Affiliations:
Department of Information Technology and Management, Shih Chien University, No. 70, Ta-Chih Street, Taipei 10462, Taiwan
Venue:
Data & Knowledge Engineering
Year:
2009

Citing 10
Cited 1

Synchronized Disk Interleaving

IEEE Transactions on Computers
Introduction to operations research, 4th ed.

Introduction to operations research, 4th ed.
A Microeconomic Approach to Optimal Resource Allocation in Distributed Computer Systems

IEEE Transactions on Computers
An integer linear programming approach to data allocation with the minimum total communication cost in distributed database systems

Information Sciences—Informatics and Computer Science: An International Journal
Evaluating approximately balanced parity-declustered data layouts for disk arrays

Parallel Computing - Special double issue: parallel I/O
Overlay striping and optimal parallel I/O for modern applications

Parallel Computing - Special issues on applications: parallel data servers and applications
Semantic partitioning as a basis for parallel I/O in database management systems

Parallel Computing
An efficient workload-based data layout scheme for multidimensional data

Data & Knowledge Engineering - Data warehousing
Data Allocation for Multidisk Databases

IEEE Transactions on Knowledge and Data Engineering
Database design in the modern organization: identifying robust structures under changing query patterns and arrival rate conditions

Decision Support Systems

A formal characterization of SI-based ROWA replication protocols

Data & Knowledge Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Parallel processing mechanisms and data layout approaches that significantly affect access performance of database systems have received increased attention in the last few decades. Multidisk allocation problems try to find an allocation of relations to disks such that expected query cost is minimized. Solving this NP-complete problem is extremely time-consuming, especially because the need for solution time rises exponentially as the number of 0-1 variables increases. This study presents a novel and efficient approach for deriving an optimal layout of relations on disks based on database statistics of access patterns and relation sizes. In addition to minimizing query cost, the proposed model allows replication of relations, minimizes storage cost, and enhances computational efficiency by reducing the number of 0-1 variables and constraints. Illustrative examples and experimental results demonstrate the advantages and efficiency of the proposed method.