Optimal placement of data replicas in distributed database with majority voting protocol

Theoretical Computer Science

Volumn 258, Issue 1-2, 2001, Pages 555-571

  Shekhar, Shashi ^a   Wu, Weili ^a  

^a University of Minnesota   (United States)

Author keywords

Cycle and tree; Distributed database; Majority voting protocol; Optimal placement of data replicas

Indexed keywords

DATA COMMUNICATION SYSTEMS; DATA REDUCTION; DISTRIBUTED DATABASE SYSTEMS; NETWORK PROTOCOLS;

DATA REPLICAS;

DATA STRUCTURES;

EID: 0034923549     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00161-4     Document Type: Article

References (13)

1. Concurrency control is distributed database system
2. Location of facilities on a network subject to a single edge failure
3. An efficient-, fault-tolerant protocol for replicated data management
4. The dangers of replication and a solution
5. Complexity of network reliability and optimal resource placement problems
6. Falt-tolerant replication in networks with asynchronous communication link failures
7. Location a broadcast gacility in an unreliable network
8. Optimal allocation for partially replicated database systems on ring networks
9. Optimal allocation for partially replicated database systems on tree networks
10. A solution to the concurrency control problem for multiple copy database