Weaker Forms of Monotonicity for Declarative Networking

DOI10.1145/2809784zbMath1474.68071OpenAlexW2658699200WikidataQ123285991 ScholiaQ123285991MaRDI QIDQ5012540

Frank Neven, Bas Ketsman, Daniel Zinn, Tom J. Ameloot

Publication date: 25 November 2021

Published in: ACM Transactions on Database Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2809784

zbMATH Keywords

consistencycoordinationexpressive powerdistributed databaserelational transducercloud programming

Mathematics Subject Classification ID

Database theory (68P15) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed systems (68M14) Internet topics (68M11)

Related Items (6)

Deciding confluence for a simple class of relational transducer networks ⋮ Optimal broadcasting strategies for conjunctive queries over distributed data ⋮ Modern Datalog Engines ⋮ A Case for Stale Synchronous Distributed Model for Declarative Recursive Computation ⋮ Unnamed Item ⋮ A framework for comparing query languages in their ability to express Boolean queries

This page was built for publication: Weaker Forms of Monotonicity for Declarative Networking