Distributed Datalog Revisited

  • Serge Abiteboul
  • Meghyn Bienvenu
  • Alban Galland
  • Marie-Christine Rousset
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6702)

Introduction

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].

Keywords

Provenance Information Close World Assumption Rock Climbing Datalog Program VLDB Journal 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Abiteboul, S., Abrams, Z., Haar, S., Milo, T.: Diagnosis of asynchronous discrete event systems: datalog to the rescue! In: PODS, pp. 358–367 (2005)Google Scholar
  2. 2.
    Abiteboul, S., Benjelloun, O., Milo, T.: The Active XML project: an overview. The VLDB Journal 17, 1019–1040 (2008)CrossRefGoogle Scholar
  3. 3.
    Abiteboul, S., Galland, A., Marian, A., Polyzotis, A.: A model for web information management with access control (2010) (in preparation)Google Scholar
  4. 4.
    Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)MATHGoogle Scholar
  5. 5.
    Abiteboul, S., Segoufin, L., Vianu, V.: Static analysis of Active XML systems. In: PODS, pp. 221–230 (2008)Google Scholar
  6. 6.
    Adjiman, P., Chatalic, P., Goasdoué, F., Rousset, M.-C., Simon, L.: Distributed reasoning in a peer-to-peer setting: Application to the semantic web. J. Artif. Intell. Res. (JAIR) 25, 269–314 (2006)MathSciNetMATHGoogle Scholar
  7. 7.
    Alvaro, P., Condie, T., Conway, N., Elmeleegy, K., Hellerstein, J.M., Sears, R.: Boom analytics: exploring data-centric, declarative programming for the cloud. In: EuroSys, pp. 223–236 (2010)Google Scholar
  8. 8.
    Antoine, E., Galland, A., Lyngbaek, K., Marian, A., Polyzotis, N.: Social networking on top of the WebdamExchange system. In: ICDE (to appear, 2011)Google Scholar
  9. 9.
    Bancilhon, F., Maier, D., Sagiv, Y., Ullman, J.D.: Magic sets and other strange ways to implement logic programs. In: PODS, pp. 1–15 (1986)Google Scholar
  10. 10.
    Calì, A., Gottlob, G., Lukasiewicz, T.: Datalog±: a unified approach to ontologies and integrity constraints. In: ICDT, pp. 14–30 (2009)Google Scholar
  11. 11.
    Cosmadakis, S.S., Gaifman, H., Kanellakis, P.C., Vardi, M.Y.: Decidable optimization problems for database logic programs (preliminary report). In: STOC, pp. 477–490 (1988)Google Scholar
  12. 12.
    Datalog 2.0. Oxford Univ. (2010), http://www.datalog20.org/
  13. 13.
    Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning about knowledge. The MIT Press, Cambridge (2003)MATHGoogle Scholar
  14. 14.
    Halevy, A.Y.: Answering queries using views: A survey. The VLDB Journal 10, 270–294 (2001)CrossRefMATHGoogle Scholar
  15. 15.
    Hellerstein, J.: The declarative imperative: Experiences and conjectures in distributed logic. SIGMOD Rec. 39, 5–19 (2010)CrossRefGoogle Scholar
  16. 16.
    Hulin, G.: Parallel processing of recursive queries in distributed architectures. In: VLDB, pp. 87–96 (1989)Google Scholar
  17. 17.
    Loo, B.T., Condie, T., Hellerstein, J.M., Maniatis, P., Roscoe, T., Stoica, I.: Implementing declarative overlays. In: SOSP, pp. 75–90 (2005)Google Scholar
  18. 18.
    Loo, B.T., Hellerstein, J.M., Stoica, I., Ramakrishnan, R.: Declarative routing: extensible routing with declarative queries. In: SIGCOMM, pp. 289–300 (2005)Google Scholar
  19. 19.
    Nejdl, W., Ceri, S., Wiederhold, G.: Evaluating recursive queries in distributed databases. IEEE Trans. Knowl. Data Eng. 5, 104–121 (1993)CrossRefGoogle Scholar
  20. 20.
    Vieille, L.: Recursive axioms in deductive databases: The query/subquery approach. In: Expert Database Conf., pp. 253–267 (1986)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Serge Abiteboul
    • 1
  • Meghyn Bienvenu
    • 2
  • Alban Galland
    • 1
  • Marie-Christine Rousset
    • 3
  1. 1.INRIA Saclay & ENS CachanFrance
  2. 2.CNRS & Univ. Paris-SudFrance
  3. 3.Univ. GrenobleFrance

Personalised recommendations