EFFICIENT MANIPULATION OF A SET OF FRAGMENTS

In this paper the relation partitioning and the data allocation problem in a partially replicated distributed database system are discussed. A common method for: (i) the definition and allocation of a set of different types of data-items (fragments); and (ii) the construction and the allocation of groups of fragments to the system nodes, is presented. The method gives a high degree of control over the whole design process. Heuristic algorithms, based on both the cost/benefit computations and the inter-data communication concept, are developed. During the allocation phase, system constraints are taken under consideration. An example demonstrates the general usage of the proposed method, The aim of the study is the minimization of the communication cost, and, at the same time, the improvement of the system performance.