Affiliation:
1. Novosibirsk State University Novosibirsk
2. Novosibirsk State University Novosibirsk;
Federal Research Center for Informational and Computational Technologies
Abstract
This article considers simultaneous attainability of consistency and availability. The approaches to determining the maximum possible levels of accessibility for different consistency models are compared. The necessity of introducing quantitative metrics for these two indicators and review the prior articles with quantitative estimates of consistency is advocated. The importance of this problem is confirmed, and directions for modeling the parameters of the applied problem using numerical experiments are proposed.
Publisher
Novosibirsk State University (NSU)
Reference23 articles.
1. Eswaran K. P., Gray J. N., Lorie R. A., Traiger I. L., The notions of consistency and predicate locks in a database system, Communications of the ACM, vol. 19, № 11, 1976.
2. Papadimitriou C. H., The serializability of concurrent database updates, Journal of ACM, vol. 26, № 4, 1979.
3. Rothnie J. B., Goodman N., A survey of research and development in distributed database management, Proceedings of the third international conference on Very large data bases, vol. 3, 1977.
4. Bernstein P. A., Goodman N., Timestamp-based algorithms for concurrency control in distributed database systems, Proceedings of the sixth international conference on Very Large Data Bases, vol. 6, 1980.
5. Bernstein P. A., Goodman N., Concurrency control in distributed database systems, ACM Computer Surveys, vol. 13, № 2, 1981.