Relational transducers for declarative networking

DOI10.1145/2450142.2450151MaRDI QIDQ5395713zbMATH OpenOpenAlexFDO

Authors Tom J. Ameloot, Frank Neven, Jan Van den Bussche

Publication date 17 February 2014

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1012.2858

zbMATH Keywords

cloud programmingdistributed databaseexpressive powermonotonicityrelational transducer

Mathematics Subject Classification ID

Database theory (68P15)

Abstract: Motivated by a recent conjecture concerning the expressiveness of declarative networking, we propose a formal computation model for "eventually consistent" distributed querying, based on relational transducers. A tight link has been conjectured between coordination-freeness of computations, and monotonicity of the queries expressed by such computations. Indeed, we propose a formal definition of coordination-freeness and confirm that the class of monotone queries is captured by coordination-free transducer networks. Coordination-freeness is a semantic property, but the syntactic class that we define of "oblivious" transducers also captures the same class of monotone queries. Transducer networks that are not coordination-free are much more powerful.

Recommendations

• Deciding confluence for a simple class of relational transducer networks
• Weaker forms of monotonicity for declarative networking: a more fine-grained answer to the CALM-conjecture
• Declarative distributed computing
• A datalog-based computational model for coordination-free, data-parallel systems
• Putting logic-based distributed systems on stable grounds

Cited in

(12)

• Relational transducers for electronic commerce
• Optimal broadcasting strategies for conjunctive queries over distributed data
• Positive Dedalus programs tolerate non-causality
• Deciding confluence for a simple class of relational transducer networks
• Cardinality Abstraction for Declarative Networking Applications
• A datalog-based computational model for coordination-free, data-parallel systems
• Putting logic-based distributed systems on stable grounds
• Weaker forms of monotonicity for declarative networking: a more fine-grained answer to the CALM-conjecture
• Modern Datalog Engines
• A Case for Stale Synchronous Distributed Model for Declarative Recursive Computation
• Datalog queries distributing over components
• The free termination property of queries over time

This page was built for publication: Relational transducers for declarative networking

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5395713)