OPTIMAL ALLOCATION FOR PARTIALLY REPLICATED DATABASE-SYSTEMS ON RING NETWORKS

被引：15

作者：

STEPHENS, AB

YESHA, Y

HUMENIK, KE

机构：

[1] Department of Computer Science., University of Maryland, Baltimore, MD

[2] Department of Computer Science Maryland Baltimore County, Department of Mathematics., Indiana University, Baltimore, South Bend., ME

来源：

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING | 1994年 / 6卷 / 06期

关键词：

OPTIMALITY; DISTRIBUTED DATABASES; PARTITIONS; REPLICATION; RING TOPOLOGY;

D O I：

10.1109/69.334886

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

We consider a distributed database with partial replication of data objects located on a ring network. Certain placements of replicated objects are shown to optimize the probability of read-only success and the probability of write only success. We also obtain optimal placements far k-terminal reliability and expected minimal path length for read-only and write-only operations.

引用

页码：975 / 982

页数：8

共 18 条

[1]

ABBADI AL, 1989, ACM T DATABASE SYST, V14, P264

[2] COMPUTING ON AN ANONYMOUS RING [J].

ATTIYA, H ;

SNIR, M ;

WARMUTH, MK .

JOURNAL OF THE ACM, 1988, 35 (04) :845-875

[3]

BERNSTEIN P, 1986, J COMPUT SYST SCI, V31, P355

[4]

CASEY RG, 1972, 1972 P SPRING JOINT

[5] OPTIMAL FILE ALLOCATION IN A COMPUTER NETWORK - A SOLUTION METHOD BASED ON THE KNAPSACK-PROBLEM [J].

CERI, S ;

MARTELLA, G ;

PELAGATTI, G .

COMPUTER NETWORKS AND ISDN SYSTEMS, 1982, 6 (05) :345-357

[6]

Colbourn C.J., 1987, COMBINATORICS NETWOR

[7]

DAVIDSON SB, 1984, ACM T DATABASE SYST, V14, P341

[8] ACHIEVING ROBUSTNESS IN DISTRIBUTED DATABASE-SYSTEMS [J].

EAGER, DL ;

SEVCIK, KC .

ACM TRANSACTIONS ON DATABASE SYSTEMS, 1983, 8 (03) :354-381

[9] DATABASE LOCATION IN COMPUTER-NETWORKS [J].

FISHER, ML ;

HOCHBAUM, DS .

JOURNAL OF THE ACM, 1980, 27 (04) :718-735

[10]

GIFFORD DK, 1979, 7TH P S OP SYST PRIN, P150

← 1 2 →