论文信息 - Ensuring Data Consistency

Ensuring Data Consistency

Chapter 4 is the chapter of consistency concepts. First, the classical transactional concept of relational databases is given, including ACID (atomicity, consistency, isolation, and durability), followed by pessimistic and optimistic concurrency control mechanisms. Second, consistency issues of NoSQL databases are discussed such as the BASE (basically available, soft state, eventually consistent) concept and the CAP theorem (consistency, availability, and partition tolerance). In addition, vector clocks are introduced in order to serialize parallel transactions. A comparison between ACID and BASE closes the chapter.

Andreas Meier | Michael Kaufmann | Andreas Meier | M. Kaufmann

[1] Andreas Reuter,et al. Principles of transaction-oriented database recovery , 1983, CSUR.

[2] Irving L. Traiger,et al. The notions of consistency and predicate locks in a database system , 1976, CACM.

[3] Gerhard Weikum,et al. CHAPTER FOUR – Concurrency Control Algorithms , 2002 .

[4] Eric A. Brewer,et al. Towards robust distributed systems (abstract) , 2000, PODC '00.

[5] Silvana Castano,et al. Database Security , 1997, IFIP Advances in Information and Communication Technology.

[6] Uta Störl. Backup und Recovery in Datenbanksystemen , 2001 .

[7] Werner Vogels,et al. Building reliable distributed systems at a worldwide scale demands trade-offs between consistency and availability. , 2022 .

[8] Nancy A. Lynch,et al. Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services , 2002, SIGA.

[9] Uta Störl. Backup und Recovery in Datenbanksystemen: Verfahren, Klassifikation, Implementierung und Bewerrtung , 1999, Datenbank Rundbr..

[10] David K. Gifford,et al. Weighted voting for replicated data , 1979, SOSP '79.