원문정보
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
Modern large distributed Systems at wide scale have adopted new types of databases that are not subject to the features which ensure strong Consistency. In this paper, we discuss the CAP theorem, its evolution and its influence on these systems. After, we talk about the misunderstandings and problems aroused by this theorem. Finally, we give the updates on CAP brought by some researchers.
목차
Abstract
1. Introduction
2. The CAP Theorem
2.1. Yield and Harvest [2, 9]
2.2. Brewer’s Conjecture
3. Problems, Misleadings and Claims on the CAP Theorem
3.1. Errors on the Conception of Eventual Consistency
3.2. PACELC instead of CAP [10]
3.3. You Can’t Sacrifice Partition Tolerance [19]
4. The CAP Theorem Fifty Years Later
4.1. How Rules have changed [3]
4.2. Other New Issues
5. Conclusion
Acknowledgements
References
1. Introduction
2. The CAP Theorem
2.1. Yield and Harvest [2, 9]
2.2. Brewer’s Conjecture
3. Problems, Misleadings and Claims on the CAP Theorem
3.1. Errors on the Conception of Eventual Consistency
3.2. PACELC instead of CAP [10]
3.3. You Can’t Sacrifice Partition Tolerance [19]
4. The CAP Theorem Fifty Years Later
4.1. How Rules have changed [3]
4.2. Other New Issues
5. Conclusion
Acknowledgements
References
저자정보
참고문헌
자료제공 : 네이버학술정보