InfoQ Homepage Consistency Content on InfoQ
Articles
RSS Feed-
/articles/rig-data-consistent-microservices/en/smallimage/GettyImages-637899158-small-1716883672077.jpg)
Introducing the RIG Model - the Puzzle of Designing Guaranteed Data-Consistent Microservice Systems
The RIG model formulates three rules for a saga call chain. Using a gamified RIG tool, consisting of three main RIG puzzle pieces, teams can model a microservice system that guarantees eventual data consistency.
-
/articles/cloud-trust-fail/en/smallimage/can-we-trust-cloud-not-to-fail-small-1620291566105.jpg)
Can We Trust the Cloud Not to Fail?
I will start with the theory behind failure detection, and then review a couple of real-world examples of how the mechanism works in a real cloud - on Azure. Even though this article includes real-world applications of failure detection within Azure, the same notions could also apply to GCP, AWS, or any other distributed system.
-
/articles/relational-nosql-fauna/en/smallimage/relational-nosql-fauna-s-1543858323385.jpeg)
Back to the Future with Relational NoSQL
This article outlines some of the consistency issues NoSQL databases have with distributed transactions, showing how FaunaDB has solved the problems using the Calvin protocol and a virtual clock.
-
/articles/cap-twelve-years-later-how-the-rules-have-changed/en/smallimage/logo.jpg)
CAP Twelve Years Later: How the "Rules" Have Changed
The CAP theorem asserts that any networked shared-data system can have only two of three desirable properties (Consistency, Availability and Partition Tolerance). In this IEEE article, author Eric Brewer discusses how designers can optimize consistency and availability by explicitly handling partitions, thereby achieving some trade-off of all three.