skip to main content
10.1145/1989284.1989321acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
research-article

Relational transducers for declarative networking

Authors Info & Claims
Published:13 June 2011Publication History

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.

References

  1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. S. Abiteboul and E. Simon. Fundamental properties of deterministic and nondeterministic extensions of Datalog. Theoretical Computer Science, 78:137--158, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. S. Abiteboul and V. Vianu. Datalog extensions for database queries and updates. Journal of Computer and System Sciences, 43(1):62--124, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  5. S. Abiteboul and V. Vianu. Computing with first-order logic. Journal of Computer and System Sciences, 50(2):309--335, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. S. Abiteboul, V. Vianu, et al. Relational transducers for electronic commerce. Journal of Computer and System Sciences, 61(2):236--269, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  8. P. Alvaro, W. Marczak, et al. Dedalus: Datalog in time and space. Technical Report EECS-2009--173, University of California, Berkeley, 2009.Google ScholarGoogle ScholarCross RefCross Ref
  9. H. Attiya and J. Welch. Distributed Computing: Fundamentals, Simulations, and Advanced Topics. Wiley, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  11. J. Chomicki and T. Imielinski. Finite representation of infinite query answers. ACM Transactions on Database Systems, 18(2):181--223, June 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  13. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  14. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  15. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  16. J.M. Hellerstein. The declarative imperative: experiences and conjectures in distributed logic. SIGMOD Record, 39(1):5--19, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. N. Immerman. Descriptive Complexity. Springer, 1999.Google ScholarGoogle Scholar
  18. B.T. Loo et al. Declarative networking. Communications of the ACM, 52(11):87--95, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. C.H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.Google ScholarGoogle Scholar
  20. M. Spielmann. Verification of relational transducers for electronic commerce. Journal of Computer and System Sciences, 66(1):40--65, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. W. Thomas. Languages, automata, and logic. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 3, chapter 7. Springer, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Relational transducers for declarative networking

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in
            • Published in

              cover image ACM Conferences
              PODS '11: Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
              June 2011
              332 pages
              ISBN:9781450306607
              DOI:10.1145/1989284

              Copyright © 2011 ACM

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 13 June 2011

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • research-article

              Acceptance Rates

              Overall Acceptance Rate476of1,835submissions,26%

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader
            About Cookies On This Site

            We use cookies to ensure that we give you the best experience on our website.

            Learn more

            Got it!