Distributed Consistency Beyond Queries
Gespeichert in:
| Titel: | Distributed Consistency Beyond Queries |
|---|---|
| Autoren: | Tim Baccaert, Bas Ketsman |
| Weitere Verfasser: | FORMER_Software Languages Lab, Informatics and Applied Informatics, Faculty of Sciences and Bioengineering Sciences, Software Languages Lab |
| Quelle: | Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. :47-58 |
| Verlagsinformationen: | ACM, 2023. |
| Publikationsjahr: | 2023 |
| Schlagwörter: | computability, Relational transducer, coordination, 0202 electrical engineering, electronic engineering, information engineering, Distributed database, Consistency, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences |
| Beschreibung: | Programming asynchronous distributed systems is a challenging task in which consistency is often achieved by use of expensive coordination protocols like Paxos and 2PC. The CALM theorem, first conjectured by Hellerstein, is one of the first results to challenge this practice by stating that a problem can have a consistent, coordination-free distributed implementation if (and only if) the problem is monotonic. This result was proven for queries and shown to extend beyond monotonic (yet monotonic-like) queries for data systems having specific knowledge about the partitioning of data over the network. In this article, we extend the latter results in several ways. We consider problems that can be modeled as mappings from distributed instances to distributed instances, enabling insights into a much broader range of problems than queries. Furthermore, our model can express arbitrary system configurations, allowing us to reason about the expressiveness of any particular distributed system and thereby revealing a nuanced gradient of problems with increasing coordination-needs. Finally, we apply our model to a recent question about the expressiveness of coordination-free queries, raised by Hellerstein and Alvaro. |
| Publikationsart: | Article Conference object |
| DOI: | 10.1145/3584372.3588657 |
| Zugangs-URL: | https://biblio.vub.ac.be/vubir/distributed-consistency-beyond-queries(ddaeb829-7f5e-4be7-bd04-e22c653ebe63).html https://doi.org/10.1145/3584372.3588657 https://hdl.handle.net/20.500.14017/ddaeb829-7f5e-4be7-bd04-e22c653ebe63 |
| Rights: | URL: https://www.acm.org/publications/policies/copyright_policy#Background |
| Dokumentencode: | edsair.doi.dedup.....f996cc3aa796505e51e16b3aa91db3d6 |
| Datenbank: | OpenAIRE |
Nájsť tento článok vo Web of Science | Abstract: | Programming asynchronous distributed systems is a challenging task in which consistency is often achieved by use of expensive coordination protocols like Paxos and 2PC. The CALM theorem, first conjectured by Hellerstein, is one of the first results to challenge this practice by stating that a problem can have a consistent, coordination-free distributed implementation if (and only if) the problem is monotonic. This result was proven for queries and shown to extend beyond monotonic (yet monotonic-like) queries for data systems having specific knowledge about the partitioning of data over the network. In this article, we extend the latter results in several ways. We consider problems that can be modeled as mappings from distributed instances to distributed instances, enabling insights into a much broader range of problems than queries. Furthermore, our model can express arbitrary system configurations, allowing us to reason about the expressiveness of any particular distributed system and thereby revealing a nuanced gradient of problems with increasing coordination-needs. Finally, we apply our model to a recent question about the expressiveness of coordination-free queries, raised by Hellerstein and Alvaro. |
|---|---|
| DOI: | 10.1145/3584372.3588657 |