Optimal Allocation for Partially Replicated Database Systems on Ring Networks

Authors:
A. B. Stephens;Y. Yesha;K. Humenik
Affiliations:
-;-;-
Venue:
IEEE Transactions on Knowledge and Data Engineering
Year:
1994

Citing 13
Cited 5

Optimism and consistency in partitioned distributed database systems

ACM Transactions on Database Systems (TODS)
Serializability theory for replicated databases

Journal of Computer and System Sciences
Computing on an anonymous ring

Journal of the ACM (JACM)
Maintaining availability in partitioned replicated databases

ACM Transactions on Database Systems (TODS)
The multicast policy and its relationship to replicated data placement

ACM Transactions on Database Systems (TODS)
Achieving robustness in distributed database systems

ACM Transactions on Database Systems (TODS)
Optimal allocation of resources in distributed information networks

ACM Transactions on Database Systems (TODS) - Special issue: papers from the international conference on very large data bases: September 22–24, 1975, Framingham, MA
Database Location in Computer Networks

Journal of the ACM (JACM)
Comparative Models of the File Assignment Problem

ACM Computing Surveys (CSUR)
Optimal program and data locations in computer networks

Communications of the ACM
The Combinatorics of Network Reliability

The Combinatorics of Network Reliability
Weighted voting for replicated data

SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
On the complexity of computation in the presence of link failures: the case of a ring

Distributed Computing

Processing Distributed Mobile Queries with Interleaved Remote Mobile Joins

IEEE Transactions on Computers
Reliability and cost optimization in distributed computing systems

Computers and Operations Research
Distributed Query Processing in the Internet: Exploring Relation Replication and Network Characteristics

ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Optimal placements of replicas in a ring network with majority voting protocol

Journal of Parallel and Distributed Computing
Cost-oriented task allocation and hardware redundancy policies in heterogeneous distributed computing systems considering software reliability

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Considers 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 for k-terminal reliability and expected minimal path length for read-only and write-only operations.