Distributed and Parallel Databases

, Volume 10, Issue 3, pp 269–288

A Hypergraph Based Approach to Declustering Problems

Authors

  • Duen-Ren Liu
    • Institute of Information ManagementNational Chiao Tung University
  • Mei-Yu Wu
    • Institute of Information ManagementNational Chiao Tung University
Article

DOI: 10.1023/A:1019269409432

Cite this article as:
Liu, D. & Wu, M. Distributed and Parallel Databases (2001) 10: 269. doi:10.1023/A:1019269409432

Abstract

Parallelizing I/O operations via effective declustering of data is becoming essential to scale up the performance of parallel databases or high performance systems. Declustering has been shown to be a NP-complete problem in some contexts. Some heuristic methods have been proposed to solve this problem. However, most methods are not effective in several cases such as queries with different access frequencies or data with different sizes. In this paper, we propose a hypergraph model to formulate the declustering problem. Several interesting theoretical results are achieved by analyzing the proposed model. The proposed approach will allow modeling a wide range of declustering problems. Furthermore, the hypergraph declustering model is used as the basis to develop new heuristic methods, including a greedy method and a hybrid declustering method. Experiments show that the proposed methods can achieve better performance than several declustering methods.

declustering data allocation parallel databases hypergraph high performance systems

Copyright information

© Kluwer Academic Publishers 2001