Title :
The reliability problem in distributed database systems
Author :
Lin, Min-Sheng ; Chen, Deng-Jyi
Author_Institution :
Dept. of Manage. Inf. Syst., Tamsui Oxford Univ. Coll., Taipei, Taiwan
Abstract :
The reliability of a distributed database systems is the probability that a program which runs on multiple processing elements and needs to communicate with other processing elements for remote database will be executed successfully. This reliability varies according to (1) the topology of the distributed database system, (2) the reliability of the communication links, (3) the databases and program distribution among processing elements, and (4) the databases required to execute a program. This paper shows that solving this reliability problem is NP-hard even when the distributed database system is restricted to a series-parallel, a 2-tree, a tree, or a star structure. Two polynomial-time algorithms are proposed for computing the reliability of a distributed program which runs on a linear and a ring distributed database system, respectively
Keywords :
computational complexity; database theory; distributed databases; software reliability; 2-tree structure; NP-hard problem; communication links reliability; computational complexity; database topology; distributed program; linear distributed database system; multiple processing elements; polynomial-time algorithms; program distribution; reliability problem; remote database; ring distributed database system; series-parallel database; star structure; tree structure; Computer science; Data engineering; Database systems; Distributed databases; Educational institutions; Management information systems; Polynomials; Reliability engineering; Telecommunication network reliability; Topology;
Conference_Titel :
Information, Communications and Signal Processing, 1997. ICICS., Proceedings of 1997 International Conference on
Print_ISBN :
0-7803-3676-3
DOI :
10.1109/ICICS.1997.652088
