Optimal cost design of replicated data in distributed database systems

International Journal of Systems Science

Volumn 29, Issue 8, 1998, Pages 795-804

  Pham, Hoang ^a  

^a DEPARTMENT OF INDUSTRIAL AND SYSTEMS ENGINEERING   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AVAILABILITY; COSTS; DISTRIBUTED DATABASE SYSTEMS; FAULT TOLERANT COMPUTER SYSTEMS; NETWORK PROTOCOLS; NUMERICAL METHODS;

OPTIMAL READ QUORUM; QUORUM CONSENSUS REPLICATION PROTOCOL; REPLICATED DATA;

OPTIMAL SYSTEMS;

EID: 0032139520     PISSN: 00207721     EISSN: 14645319     Source Type: Journal    
DOI: 10.1080/00207729808929572     Document Type: Article

References (13)

1. Amamad, M., and Ammar, M., 1989, Performance characterization of quorum consensus algorithms for replicated data. IEEE Transactions of Software Engineering, 15, 492-496.
2. Chanc, H., and Yuan, S., 1994, Designing a minimal cost replicated lilc system wilh an availability constraint. Proceedings of the ISSAT International Conference on Reliability and Quality in Design, Seattle, Washington, U.S.A., pp. 254-258.
3. Cheung, S., Amamad, M., and Ammar, M., 1989, Optimizing vote and quorum assignments for reading and writing replicated data. Proceedings of the Fifth InternationaI Conference on Data Engineering, pp. 135-139.
4. Davcev, D., and Burkhard, W., 1985, Consistency and recovery control for replicated data. Proceedings of the Tenth Symposium on Operating Systems Principles, pp. 83-90.
5. Garcia-Molina, H., and Barbara, D., 1984, Optimizing the reliability provided by voting mechanisms. Proceedings of the Fourth International Conference on Distributed Computing Systems, pp. 340-346
6. Garcia-Molina, H., and Barbara, D 1985, How to assign votes in a distributed system. Communications of the ACM, 32, 841-860.
7. Gifford, D. K., 1979, Weighted voting for replicated data. Proceedings of the Seventh Symposium on Operating System Principles, pp. 150-159.
8. Jajodia, S., and Mutchler, D., 1987, Dynamic voting. Proceedings of SIGMOD, pp. 227-238.
9. Paris, J., and Long, D., 1988, Efficient dynamic voting algorithms. Proceedings of the Fourth International Conference on Data Engineering, pp. 268-275
10. Paris, J., and Long, D., 1991, Voting with regenerable volatile witnesses. Proceedings of the Seventh InternationaI Conference on Data Engineering, pp. 112-119.
11. Pham, H., and Potoski, D., 1994, An optimal static pessimistic scheme for distributed database systems. Proceedings of the Third International Conference on Reliability, Quality Control and Risk Assessment, Washington, DC, pp. 23-26.
12. Spasojevic, M., and Berman, P., 1994, Voting as the optimal static pessimistic scheme for managing replicated data. IEEE Transactions on Parallel and Distributed Systems, 5, 64-73.
13. Thomas, R. H., 1979, A majority consensus approach to concurrency control for multiple copy databases. ACM Transactions on Database Systems, 4, pp. 180-209.