EFFICIENT MANIPULATION OF A SET OF FRAGMENTS

被引:4
作者
PAVLIDES, GS
机构
[1] University of Patras, School of Engineering, Department of Computer Engineering and Informatics, 26500 Rio, Patras
关键词
PARTITIONING; FRAGMENTS; HEURISTIC ALGORITHMS; PERFORMANCE TUNING; DISTRIBUTED DATABASES;
D O I
10.1016/0950-5849(95)90815-C
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 [计算机科学与技术];
摘要
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.
引用
收藏
页码:233 / 243
页数:11
相关论文
共 20 条
[1]
DATA ALLOCATION IN DISTRIBUTED DATABASE-SYSTEMS [J].
APERS, PMG .
ACM TRANSACTIONS ON DATABASE SYSTEMS, 1988, 13 (03) :263-304
[2]
DISTRIBUTION DESIGN OF LOGICAL DATABASE SCHEMAS [J].
CERI, S ;
NAVATHE, S ;
WIEDERHOLD, G .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1983, 9 (04) :487-504
[3]
CERI S, 1982, ACM SIGMOD
[4]
CERI S, 1983, IEEE COPCON, P122
[5]
CORNELL P, 1987, 3RD P INT C DDAT ENG
[6]
DISTANTE F, 1987, DEC P REAL TIM SYST, P114
[7]
GARCIAMOLINA H, 1986, 5TH S REL DISTR SYST, P13
[8]
GAVISH B, 1986, IEEE T COMPUT, V35, P583, DOI 10.1109/TC.1986.1676799
[9]
DISTRIBUTED DATA ALLOCATION STRATEGIES [J].
HEVNER, AR ;
RAO, A .
ADVANCES IN COMPUTERS, 1988, 27 :121-155
[10]
IRANI K, 1979, 1ST P INT C DISTR CO, P15