Relational transducers for declarative networking

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 of “oblivious” transducers we define also captures the same class of monotone queries. Transducer networks that are not coordination-free are much more powerful.

[1]  Hagit Attiya,et al.  Distributed Computing: Fundamentals, Simulations and Advanced Topics , 1998 .

[2]  Leslie Lamport,et al.  Fairness and hyperfairness , 2000, Distributed Computing.

[3]  Joseph M. Hellerstein,et al.  The declarative imperative: experiences and conjectures in distributed logic , 2010, SGMD.

[4]  Serge Abiteboul,et al.  A rule-based language for web data management , 2011, PODS.

[5]  Mihalis Yannakakis,et al.  On Datalog vs. Polynomial Time , 1995, J. Comput. Syst. Sci..

[6]  Jan Van den Bussche,et al.  Converting untyped formulas to typed ones , 1998, Acta Informatica.

[7]  Joseph M. Hellerstein,et al.  Consistency Analysis in Bloom: a CALM and Collected Approach , 2011, CIDR.

[8]  Alin Deutsch,et al.  Automatic verification of data-centric business processes , 2009, ICDT '09.

[9]  Serge Abiteboul,et al.  Computing with First-Order Logic , 1995, J. Comput. Syst. Sci..

[10]  Anne-Marie Kermarrec,et al.  Epidemic information dissemination in distributed systems , 2004, Computer.

[11]  Serge Abiteboul,et al.  Generic Computation and its complexity , 1991, STOC '91.

[12]  Serge Abiteboul,et al.  Fundamental Properties of Deterministic and Nondeterministic Extensions of Datalog , 1991, Theor. Comput. Sci..

[13]  Bertram Ludäscher,et al.  Win-move is coordination-free (sometimes) , 2012, ICDT '12.

[14]  Ion Stoica,et al.  Declarative networking: language, execution and optimization , 2006, SIGMOD Conference.

[15]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[16]  Fang Wang,et al.  Netlog, a Rule-Based Language for Distributed Programming , 2010, PADL.

[17]  Nissim Francez,et al.  Appraising fairness in languages for distributed programming , 2005, Distributed Computing.

[18]  Limin Jia,et al.  Maintaining distributed logic programs incrementally , 2012, Comput. Lang. Syst. Struct..

[19]  Jan Van den Bussche,et al.  Deciding eventual consistency for a simple class of relational transducer networks , 2012, ICDT '12.

[20]  Marc Spielmann,et al.  Verification of relational transducers for electronic commerce , 2003, J. Comput. Syst. Sci..

[21]  David Maier,et al.  Dedalus: Datalog in Time and Space , 2010, Datalog.

[22]  Alin Deutsch,et al.  Specification and verification of data-driven Web applications , 2007, J. Comput. Syst. Sci..

[23]  Jan Van den Bussche,et al.  On the CRON Conjecture , 2012, Datalog.

[24]  Jan Van den Bussche,et al.  Abstract State Machines and Computationally Complete Query Languages , 2002, Inf. Comput..

[25]  Alin Deutsch,et al.  Verification of communicating data-driven web services , 2006, PODS '06.

[26]  Jim Gray,et al.  Notes on Data Base Operating Systems , 1978, Advanced Course: Operating Systems.

[27]  Joseph M. Hellerstein.  Datalog redux: experience and conjecture , 2010, PODS '10.

[28]  Frank Neven,et al.  Relational transducers for declarative networking , 2010, JACM.

[29]  Serge Abiteboul,et al.  Datalog Extensions for Database Queries and Updates , 1991, J. Comput. Syst. Sci..