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.
- 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 Scholar
Digital Library
- S. Abiteboul, O. Benjelloun, and T. Milo. Positive active xml. In PODS, pages 35--45, 2004. Google Scholar
Digital Library
- S. Abiteboul, O. Benjelloun, and T. Milo. The active xml project: an overview. The VLDB Journal, 17:1019--1040, 2008. Google Scholar
Digital Library
- S. Abiteboul, M. Bienvenu, A. Galland, and M.-C. Rousset. Distributed datalog revisited. In Datalog 2.0 Workshop, 2010.Google Scholar
- S. Abiteboul, A. Galland, and A. Polyzotis. Web information management with access control. In preparation, 2011.Google Scholar
- S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995. Google Scholar
Digital Library
- S. Abiteboul, L. Segoufin, and V. Vianu. Static analysis of Active XML systems. In PODS, pages 221--230, 2008. 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
- 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 Scholar
Digital Library
- E. Antoine, A. Galland, K. Lyngbaek, A. Marian, and N. Polyzotis. Social networking on top of the WebdamExchange system. In ICDE, 2011. Google Scholar
Digital Library
- 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 Scholar
Digital Library
- A. K. Chandra and D. Harel. Horn clauses queries and generalizations. J. Log. Program., 2(1):1--15, 1985.Google Scholar
Cross Ref
- Proceedings of the Datalog 2.0 Workshop, Oxford, 2010.Google Scholar
- 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 Scholar
Digital Library
- M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In ICLP/SLP, pages 1070--1080, 1988.Google Scholar
- S. Grumbach and F. Wang. Netlog, a rule-based language for distributed programming. In PADL, pages 88--103, 2010. Google Scholar
Digital Library
- J. Hellerstein. The declarative imperative: experiences and conjectures in distributed logic. ACM SIGMOD Record, 39(1):5--19, 2010. Google Scholar
Digital Library
- G. Hulin. Parallel processing of recursive queries in distributed architectures. In VLDB, pages 87--96, 1989. Google Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- W. Nejdl, S. Ceri, and G. Wiederhold. Evaluating recursive queries in distributed databases. IEEE Trans. Knowl. Data Eng., 5(1):104--121, 1993. Google Scholar
Digital Library
- T. C. Przymusinski. The well-founded semantics coincides with the three-valued stable semantics. Fundam. Inform., 13(4):445--463, 1990. Google Scholar
Digital Library
- B. Rossman. On the constant-depth complexity of k-clique. In STOC, pages 721--730, 2008. Google Scholar
Digital Library
- 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 Scholar
- ERC grant Webdam. http://webdam.inria.fr.Google Scholar
Index Terms
A rule-based language for web data management
Recommendations
A rule-based framework for role-based delegation and revocation
Delegation is the process whereby an active entity in a distributed environment authorizes another entity to access resources. In today's distributed systems, a user often needs to act on another user's behalf with some subset of his/her rights. Most ...
Rule-Based Operational Semantics for an Imperative Language
Operational semantics for programming languages usually come in two flavours: big-step and small-step. Both are defined using deduction rules with a congruence rule allowing reduction in certain contexts. For a description based on rewrite rules, known ...
Tierless Web Programming in the Large
WWW '18: Companion Proceedings of the The Web Conference 2018Tierless Web programming languages allow combining client-side and server-side programming in a single program. This allows defining expressions with both client and server parts, and at the same time provides good static guarantees regarding client-...






Comments