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

A rule-based language for web data management

Published:13 June 2011Publication History

ABSTRACT

There is a new trend to use Datalog-style rule-based languages to specify modern distributed applications, notably on the Web. We introduce here such a language for a distributed data model where peers exchange messages (i.e. logical facts) as well as rules. The model is formally defined and its interest for distributed data management is illustrated through a variety of examples. A contribution of our work is a study of the impact on expressiveness of "delegations" (the installation of rules by a peer in some other peer) and explicit timestamps. We also validate the semantics of our model by showing that under certain natural conditions, our semantics converges to the same semantics as the centralized system with the same rules. Indeed, we show this is even true when updates are considered.

References

  1. S. Abiteboul, Z. Abrams, S. Haar, and T. Milo. Diagnosis of asynchronous discrete event systems: datalog to the rescue! In PODS, pages 358--367, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. S. Abiteboul, O. Benjelloun, and T. Milo. Positive active xml. In PODS, pages 35--45, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. S. Abiteboul, O. Benjelloun, and T. Milo. The active xml project: an overview. The VLDB Journal, 17:1019--1040, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. S. Abiteboul, M. Bienvenu, A. Galland, and M.-C. Rousset. Distributed datalog revisited. In Datalog 2.0 Workshop, 2010.Google ScholarGoogle Scholar
  5. S. Abiteboul, A. Galland, and A. Polyzotis. Web information management with access control. In preparation, 2011.Google ScholarGoogle Scholar
  6. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. S. Abiteboul, L. Segoufin, and V. Vianu. Static analysis of Active XML systems. In PODS, pages 221--230, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 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
  9. P. Alvaro, T. Condie, N. Conway, K. Elmeleegy, J. M. Hellerstein, and R. Sears. Boom analytics: exploring data-centric, declarative programming for the cloud. In EuroSys, pages 223--236, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. E. Antoine, A. Galland, K. Lyngbaek, A. Marian, and N. Polyzotis. Social networking on top of the WebdamExchange system. In ICDE, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. F. Bancilhon, D. Maier, Y. Sagiv, and J. D. Ullman. Magic sets and other strange ways to implement logic programs. In PODS, pages 1--15, 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. A. K. Chandra and D. Harel. Horn clauses queries and generalizations. J. Log. Program., 2(1):1--15, 1985.Google ScholarGoogle ScholarCross RefCross Ref
  13. Proceedings of the Datalog 2.0 Workshop, Oxford, 2010.Google ScholarGoogle Scholar
  14. J. Field, M.-C. Marinescu, and C. Stefansen. Reactors: A data-oriented synchronous/asynchronous programming model for distributed applications. Theoretical Computer Science, 410(2-3):168--201, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In ICLP/SLP, pages 1070--1080, 1988.Google ScholarGoogle Scholar
  16. S. Grumbach and F. Wang. Netlog, a rule-based language for distributed programming. In PADL, pages 88--103, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. J. Hellerstein. The declarative imperative: experiences and conjectures in distributed logic. ACM SIGMOD Record, 39(1):5--19, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. G. Hulin. Parallel processing of recursive queries in distributed architectures. In VLDB, pages 87--96, 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. G. Lausen, B. Ludäscher, and W. May. On Active Deductive Databases: The Statelog Approach, volume 1472 of Lecture Notes in Computer Science, pages 69--106. Birkhauser Basel, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. C. Liu, Y. Mao, M. Oprea, P. Basu, and B. T. Loo. A declarative perspective on adaptive manet routing. In PRESTO, pages 63--68, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. B. T. Loo, T. Condie, M. Garofalakis, D. E. Gay, J. M. Hellerstein, P. Maniatis, R. Ramakrishnan, T. Roscoe, and I. Stoica. Declarative networking: language, execution and optimization. In SIGMOD, pages 97--108, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. B. T. Loo, T. Condie, M. N. Garofalakis, D. E. Gay, J. M. Hellerstein, P. Maniatis, R. Ramakrishnan, T. Roscoe, and I. Stoica. Declarative networking. Commun. ACM, 52(11):87--95, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. B. T. Loo, T. Condie, J. M. Hellerstein, P. Maniatis, T. Roscoe, and I. Stoica. Implementing declarative overlays. SIGOPS Oper. Syst. Rev., 39:75--90, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. B. T. Loo, J. M. Hellerstein, I. Stoica, and R. Ramakrishnan. Declarative routing: extensible routing with declarative queries. In SIGCOMM, pages 289--300, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. J. Navarro and A. Rybalchenko. Operational semantics for declarative networking. In A. Gill and T. Swift, editors, Practical Aspects of Declarative Languages, volume 5418 of Lecture Notes in Computer Science, pages 76--90. Springer Berlin / Heidelberg, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. W. Nejdl, S. Ceri, and G. Wiederhold. Evaluating recursive queries in distributed databases. IEEE Trans. Knowl. Data Eng., 5(1):104--121, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. T. C. Przymusinski. The well-founded semantics coincides with the three-valued stable semantics. Fundam. Inform., 13(4):445--463, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. B. Rossman. On the constant-depth complexity of k-clique. In STOC, pages 721--730, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. L. Vieille. Recursive axioms in deductive databases: The query-subquery approach. In Proc. 1st Int. Conf. on Expert Database Systems, pages 179--193, 1986.Google ScholarGoogle Scholar
  30. ERC grant Webdam. http://webdam.inria.fr.Google ScholarGoogle Scholar

Index Terms

  1. A rule-based language for web data management

    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!