Theory of Computing Systems

, Volume 57, Issue 4, pp 1038–1111 | Cite as

Deciding Confluence for a Simple Class of Relational Transducer Networks

Article

Abstract

Networks 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 not depend on the message delays and reorderings caused by the network. Here, we formalize eventual consistency as a confluence notion, meaning that finite executions of the system can always be extended to yield the desired output. We show that confluence is decidable when the transducers satisfy some syntactic restrictions, some of which have also been considered in earlier work on automated verification of relational transducers. This simple class of transducer networks computes exactly all distributed queries expressible by unions of conjunctive queries with negation.

Keywords

Relational transducer Eventual consistency Confluence Decidability Conjunctive query 

References

  1. 1.
    Abiteboul, S., Bienvenu, M., Galland, A., et al.: A rule-based language for Web data management. In: Proceedings 30th ACM Symposium on Principles of Database Systems, pp. 293–304. ACM Press (2011)Google Scholar
  2. 2.
    Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)MATHGoogle Scholar
  3. 3.
    Abiteboul, S., Vianu, V., et al.: Relational transducers for electronic commerce. J. Comput. Syst. Sci. 61(2), 236–269 (2000)MATHMathSciNetCrossRefGoogle Scholar
  4. 4.
    Alvaro, P., Conway, N., Hellerstein, J., Marczak, W.R.: Consistency analysis in Bloom: a CALM and collected approach. In: Proceedings 5th Biennial Conference on Innovative Data Systems Research, pp. 249–260. www.cidrdb.org (2011)
  5. 5.
    Alvaro, P., Marczak, W., et al.: Dedalus: datalog in time and space. Technical Report EECS-2009-173, University of California, Berkeley (2009)Google Scholar
  6. 6.
    Ameloot, T.J.: Deciding correctness with fairness for simple transducer networks. In: Proceedings of the 17th International Conference on Database Theory, pp. 84–95. OpenProceedings.org (2014)Google Scholar
  7. 7.
    Ameloot, T.J., Ketsman, B., Neven, F., Zinn, D.: Weaker forms of monotonicity for declarative networking: a more fine-grained answer to the CALM-conjecture. In: Proceedings of the 33rd ACM Symposium on Principles of Database Systems, pp. 64–75. ACM Press (2014)Google Scholar
  8. 8.
    Ameloot, T.J., Neven, F., Van den Bussche, J: Relational transducers for declarative networking. In: Proceedings 30th ACM Symposium on Principles of Database Systems, pp. 283–292. ACM Press (2011)Google Scholar
  9. 9.
    Ameloot, T.J., Van den Bussche, J.: Deciding eventual consistency for a simple class of relational transducer networks. In: Proceedings of the 15th International Conference on Database Theory, pp. 86–98. ACM Press (2012)Google Scholar
  10. 10.
    Chandra, A.K., Vardi, M.Y.: The implication problem for functional and inclusion dependencies is undecidable. SIAM J. Comput. 14(3), 671–677 (1985)MATHMathSciNetCrossRefGoogle Scholar
  11. 11.
    Deutsch, A.: Personal communication (2011)Google Scholar
  12. 12.
    Deutsch, A., Hull, R., Patrizi, F., Vianu, V.: Automatic verification of data-centric business processes. In: Proceedings 12th International Conference on Database Theory (2009)Google Scholar
  13. 13.
    Deutsch, A., Sui, L., Vianu, V.: Specification and verification of data-driven Web applications. J. Comput. Syst. Sci. 73(3), 442–474 (2007)MATHMathSciNetCrossRefGoogle Scholar
  14. 14.
    Deutsch, A., Sui, L., Vianu, V., Zhou, D.: Verification of communicating data-driven Web services. In: Proceedings 25th ACM Symposium on Principles of Database Systems, pp. 90–99. ACM Press (2006)Google Scholar
  15. 15.
    Grumbach, S., Wang, F.: Netlog, a rule-based language for distributed programming. In: Carro, M., Peña, R (eds.) Proceedings 12th International Symposium on Practical Aspects of Declarative Languages, volume 5937 of Lecture Notes in Computer Science, pp. 88–103 (2010)Google Scholar
  16. 16.
    Hellerstein, J.M.: Datalog redux: experience and conjecture. Video available (under the title “The Declarative Imperative”) from http://db.cs.berkeley.edu/jmh/. PODS 2010 keynote (2010)
  17. 17.
    Hellerstein, J.M.: The declarative imperative: experiences and conjectures in distributed logic. SIGMOD Rec. 39(1), 5–19 (2010)CrossRefGoogle Scholar
  18. 18.
    Loo, B.T., et al.: Declarative networking. Commun. ACM 52(11), 87–95 (2009)CrossRefGoogle Scholar
  19. 19.
    Marczak, W.R., Alvaro, P., Conway, N., Hellerstein, J.M., Maier, D.: Confluence analysis for distributed programs: a model-theoretic approach. In: Barceló, P., Pichler, R. (eds.) Datalog, volume 7494 of Lecture Notes in Computer Science, pp. 135–147. Springer, Berlin (2012)Google Scholar
  20. 20.
    Navarro, J.A., Rybalchenko, A.: Operational semantics for declarative networking. In: Gill, A., Swift, T. (eds.) Proceedings 11th International Symposium on Practical Aspects of Declarative Languages, volume 5419 of Lecture Notes in Computer Science, pp. 76–90 (2009)Google Scholar
  21. 21.
    Post, E.L.: A variant of a recursively unsolvable problem. Bull. Am. Math. Soc. 52(4), 264–268 (1946)MATHMathSciNetCrossRefGoogle Scholar
  22. 22.
    Sipser, M.: Introduction to the Theory of Computation, Second Edition, International Edition. Thomson Course Technology, Boston (2006)Google Scholar
  23. 23.
    Spielmann, M.: Verification of relational transducers for electronic commerce. J. Comput. Syst. Sci. 66(1), 40–65 (2003)MATHMathSciNetCrossRefGoogle Scholar
  24. 24.
    Vogels, W.: Eventual consistency. Commun. ACM 52(1), 40–44 (2009)CrossRefGoogle Scholar
  25. 25.
    Zinn, D., Green, T.J., Ludaescher, B.: Win-move is coordination-free. In: Proceedings of the 15th International Conference on Database Theory, pp. 99–113. ACM Press (2012)Google Scholar

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  1. 1.Hasselt University and Transnational University of LimburgHasseltBelgium
  2. 2.Transnational University of LimburgDiepenbeekBelgium

Personalised recommendations