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 of "oblivious" transducers we define also captures the same class of monotone queries. Transducer networks that are not coordination-free are much more powerful.
- S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995. Google Scholar
Digital Library
- S. Abiteboul and E. Simon. Fundamental properties of deterministic and nondeterministic extensions of Datalog. Theoretical Computer Science, 78:137--158, 1991. Google Scholar
Digital Library
- S. Abiteboul and V. Vianu. Datalog extensions for database queries and updates. Journal of Computer and System Sciences, 43(1):62--124, 1991. Google Scholar
Digital Library
- S. Abiteboul and V. Vianu. Generic computation and its complexity. In Proceedings 23rd ACM Symposium on the Theory of Computing, pages 209--219, 1991. Google Scholar
Digital Library
- S. Abiteboul and V. Vianu. Computing with first-order logic. Journal of Computer and System Sciences, 50(2):309--335, 1995. Google Scholar
Digital Library
- S. Abiteboul, V. Vianu, et al. Relational transducers for electronic commerce. Journal of Computer and System Sciences, 61(2):236--269, 2000. Google Scholar
Digital Library
- F.N. Afrati, S.C. Cosmadakis, and M. Yannakakis. On Datalog vs polynomial time. Journal of Computer and System Sciences, 51(2):177--196, 1995. Google Scholar
Digital Library
- P. Alvaro, W. Marczak, et al. Dedalus: Datalog in time and space. Technical Report EECS-2009--173, University of California, Berkeley, 2009.Google Scholar
Cross Ref
- H. Attiya and J. Welch. Distributed Computing: Fundamentals, Simulations, and Advanced Topics. Wiley, 2004. Google Scholar
Digital Library
- A. Blass, Y. Gurevich, and J. Van den Bussche. Abstract state machines and computationally complete query languages. Information and Computation, 174(1):20--36, 2002. Google Scholar
Digital Library
- J. Chomicki and T. Imielinski. Finite representation of infinite query answers. ACM Transactions on Database Systems, 18(2):181--223, June 1993. Google Scholar
Digital Library
- A. Deutsch, R. Hull, F. Patrizi, and V. Vianu. Automatic verification of data-centric business processes. In Proceedings 12th International Conference on Database Theory, 2009. Google Scholar
Digital Library
- A. Deutsch, L. Sui, and V. Vianu. Specification and verification of data-driven Web applications. Journal of Computer and System Sciences, 73(3):442--474, 2007. Google Scholar
Digital Library
- A. Deutsch, L. Sui, V. Vianu, and D. Zhou. Verification of communicating data-driven Web services. In Proceedings 25th ACM Symposium on Principles of Database Systems, pages 90--99. ACM Press, 2006. Google Scholar
Digital Library
- J.M. Hellerstein. Datalog redux: experience and conjecture. In Proceedings 29th ACM Symposium on Principles of Database Systems, pages 1--2. ACM Press, 2010. Google Scholar
Digital Library
- J.M. Hellerstein. The declarative imperative: experiences and conjectures in distributed logic. SIGMOD Record, 39(1):5--19, 2010. Google Scholar
Digital Library
- N. Immerman. Descriptive Complexity. Springer, 1999.Google Scholar
- B.T. Loo et al. Declarative networking. Communications of the ACM, 52(11):87--95, 2009. Google Scholar
Digital Library
- C.H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.Google Scholar
- M. Spielmann. Verification of relational transducers for electronic commerce. Journal of Computer and System Sciences, 66(1):40--65, 2003. Google Scholar
Digital Library
- W. Thomas. Languages, automata, and logic. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 3, chapter 7. Springer, 1997. Google Scholar
Digital Library
Index Terms
Relational transducers for declarative networking
Recommendations
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 ...
Weaker Forms of Monotonicity for Declarative Networking: A More Fine-Grained Answer to the CALM-Conjecture
Special Issue: Invited 2014 PODS and EDBT Revised ArticlesThe CALM-conjecture, first stated by Hellerstein [2010] and proved in its revised form by Ameloot et al. [2013] within the framework of relational transducer networks, asserts that a query has a coordination-free execution strategy if and only if the ...
Deciding eventual consistency for a simple class of relational transducer networks
ICDT '12: Proceedings of the 15th International Conference on Database TheoryNetworks of relational transducers can serve as a formal model for declarative networking, focusing on distributed database querying applications. In declarative networking, a crucial property is eventual consistency, meaning that the final output does ...






Comments