Distributed Datalog Revisited

The emergence of Web 2.0 and social network applications has enabled more and more users to share sensitive information over the Web. The information they manipulate has many facets: personal data (e.g., pictures, movies, music, contacts, emails), social data (e.g., annotations, recommendations, contacts), localization information (e.g., bookmarks), access information (e.g., login, keys), web services (e.g., legacy data, search engines), access rights, ontologies, beliefs, time and provenance information, etc. The tasks they perform are very diverse: search, query, update, authentication, data extraction, etc. We believe that all this should be viewed in the holistic context of the management of a distributed knowledge base. Furthermore, we believe that datalog (and its extensions) forms the sound formal basis for representing such information and supporting these tasks. In this paper, we revisit datalog with this goal in mind. The focus of the presentation is on the formal extension of the model of distributed datalog and does not consider the implementation or the evaluation of the corresponding system [8].

[1]  Alon Y. Halevy,et al.  Answering queries using views: A survey , 2001, The VLDB Journal.

[2]  Ronald Fagin,et al.  Reasoning about knowledge , 1995 .

[3]  François Goasdoué,et al.  Distributed Reasoning in a Peer-to-Peer Setting , 2004, ECAI.

[4]  Raghu Ramakrishnan,et al.  Review - Magic Sets and Other Strange Ways to Implement Logic Programs , 1999, ACM SIGMOD Digit. Rev..

[5]  Serge Abiteboul,et al.  Web information management with access control , 2011, WebDB.

[6]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[7]  StoicaIon,et al.  Implementing declarative overlays , 2005 .

[8]  Serge Abiteboul,et al.  Diagnosis of asynchronous discrete event systems: datalog to the rescue! , 2005, PODS.

[9]  Ion Stoica,et al.  Implementing declarative overlays , 2005, SOSP '05.

[10]  Haim Gaifman,et al.  Decidable optimization problems for database logic programs , 1988, STOC '88.

[11]  David Maier,et al.  Magic sets and other strange ways to implement logic programs (extended abstract) , 1985, PODS '86.

[12]  Laurent Vieille,et al.  Recursive Axioms in Deductive Databases: The Query/Subquery Approach , 1986, Expert Database Conf..

[13]  Georg Gottlob,et al.  Datalog±: a unified approach to ontologies and integrity constraints , 2009, ICDT '09.

[14]  Wolfgang Nejdl,et al.  Evaluating Recursive Queries in Distributed Databases , 1993, IEEE Trans. Knowl. Data Eng..

[15]  Serge Abiteboul,et al.  The Active XML project: an overview , 2008, The VLDB Journal.

[16]  Amélie Marian,et al.  Social networking on top of the WebdamExchange system , 2011, 2011 IEEE 27th International Conference on Data Engineering.

[17]  Guy Hulin,et al.  Parallel Processing of Recursive Queries in Distributed Architectures , 1989, VLDB.

[18]  Ion Stoica,et al.  Declarative routing: extensible routing with declarative queries , 2005, SIGCOMM '05.

[19]  Serge Abiteboul,et al.  Static analysis of active XML systems , 2008, TODS.

[20]  François Goasdoué,et al.  SomeWhere in the Semantic Web , 2005, PPSWR.

[21]  Joseph M. Hellerstein,et al.  The declarative imperative: experiences and conjectures in distributed logic , 2010, SGMD.

[22]  Joseph M. Hellerstein,et al.  Boom analytics: exploring data-centric, declarative programming for the cloud , 2010, EuroSys '10.

[23]  François Goasdoué,et al.  SomeWhere in the Semantic Web , 2005, SOFSEM.

[24]  Haim Gaifman,et al.  Decidable Optimization Problems for Database Logic Programs (Preliminary Report) , 1988, STOC 1988.