Data Partitioning For Multicomputer Database-Systems - A Cell-Based Approach

    Authors

    K. A. Hua; C. Lee;H. C. Young

    Comments

    Authors: contact us about adding a copy of your work at STARS@ucf.edu

    Abbreviated Journal Title

    Inf. Syst.

    Keywords

    Parallel Database; Data Partition; Load Balancing; Performance; Evaluation; Computer Science, Information Systems

    Abstract

    This paper deals with load balancing in distributed memory parallel database computers. In such an environment, a relation is typically partitioned and distributed across a set of processing nodes. An efficient load balancing strategy, therefore, is the determining factor for the performance improvement of such systems. We introduce the notion of cell as the unit of data partition and data movement, and devise a greedy algorithm for the initial data distribution and an iterative method for subsequent rebalancing. A directory is used to map a cell to a processing node, thus, two logically consecutive cells can be assigned independently. We also develop an analytical model to compare our scheme to two known methods. The results indicate that the proposed technique exhibits significant rebalancing costs reduction (in terms of response time and throughput) over existing approaches. We show that, for a given set of system parameters, the maximum possible tuple distribution imbalance that the initial data distribution algorithm and the subsequent data rebalancing algorithm may cause. We then attain a mechanism to determine the appropriate number of cells that considers both the processing overhead and the maximum possible data partition imbalance.

    Journal Title

    Information Systems

    Volume

    18

    Issue/Number

    5

    Publication Date

    1-1-1993

    Document Type

    Article

    Language

    English

    First Page

    329

    Last Page

    342

    WOS Identifier

    WOS:A1993MB04500004

    ISSN

    0306-4379

    Share

    COinS