Advertisement

P2P Deductive Databases: Well Founded Semantics and Distributed Computation

  • L. Caroprese
  • E. ZumpanoEmail author
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 767)

Abstract

This paper stems from previous works of the same authors in which a declarative semantics for Peer-to-Peer (P2P) systems, defined in terms of Preferred Weak Models, is proposed. Under this semantics only facts not making the local databases inconsistent can be imported. As in the general case a P2P system may admit many preferred weak models whose computational complexity is prohibitive, the paper looks for a more pragmatic solution. It assigns to a P2P system its Well Founded Model, a partial deterministic model that captures the intuition that if an atom is true in a preferred weak model, but it is false in another one, then it is undefined in the well founded model. The paper presents a distributed algorithm for the computation of the well founded model and a system prototype.

References

  1. 1.
    Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Boston (1994)Google Scholar
  2. 2.
    Bertossi, L., Bravo, L.: Query answering in peer-to-peer data exchange systems. In: Lindner, W., Mesiti, M., Türker, C., Tzitzikas, Y., Vakali, A.I. (eds.) EDBT 2004. LNCS, vol. 3268, pp. 476–485. Springer, Heidelberg (2004). doi: 10.1007/978-3-540-30192-9_47 CrossRefGoogle Scholar
  3. 3.
    Ben-Eliyahu, R., Dechter, R.: Propositional Semantics for Disjunctive Logic Programs. In: JICSLP, pp. 813–827 (1992)Google Scholar
  4. 4.
    Calì, A., Calvanese, D., De Giacomo, G., Lenzerini, M.: On the decidability and complexity of query answering over inconsistent and incomplete databases. In: PODS, pp. 260–271 (2003)Google Scholar
  5. 5.
    Calvanese, D., De Giacomo, G., Lenzerini, M., Rosati, R.: Logical foundations of peer-to-peer data integration. In: PODS, pp. 241–251 (2004)Google Scholar
  6. 6.
    Caroprese, L., Greco, S., Zumpano, E.: A logic programming approach to querying and integrating P2P deductive databases. In: FLAIRS, pp. 31–36 (2006)Google Scholar
  7. 7.
    Caroprese, L., Molinaro, C., Zumpano, E.: Integrating and querying P2P deductive databases. In: IDEAS, pp. 285–290 (2006)Google Scholar
  8. 8.
    Caroprese, L., Zumpano, E.: Consistent data integration in P2P deductive databases. In: Prade, H., Subrahmanian, V.S. (eds.) SUM 2007. LNCS (LNAI), vol. 4772, pp. 230–243. Springer, Heidelberg (2007). doi: 10.1007/978-3-540-75410-7_17 CrossRefGoogle Scholar
  9. 9.
    Caroprese, L., Zumpano, E.: Modeling cooperation in P2P data management systems. In: An, A., Matwin, S., Raś, Z.W., Ślęzak, D. (eds.) ISMIS 2008. LNCS (LNAI), vol. 4994, pp. 225–235. Springer, Heidelberg (2008). doi: 10.1007/978-3-540-68123-6_25 CrossRefGoogle Scholar
  10. 10.
    Caroprese, L., Zumpano, E.: Handling preferences in P2P systems. In: Lukasiewicz, T., Sali, A. (eds.) FoIKS 2012. LNCS, vol. 7153, pp. 91–106. Springer, Heidelberg (2012). doi: 10.1007/978-3-642-28472-4_6 CrossRefGoogle Scholar
  11. 11.
    Franconi, E., Kuper, G., Lopatenko, A., Serafini, L.: A robust logical and computational characterisation of peer-to-peer database systems. In: Aberer, K., Koubarakis, M., Kalogeraki, V. (eds.) DBISP2P 2003. LNCS, vol. 2944, pp. 64–76. Springer, Heidelberg (2004). doi: 10.1007/978-3-540-24629-9_6 CrossRefGoogle Scholar
  12. 12.
    Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of Fifth Conference on Logic Programming, pp. 1070–1080 (1998)Google Scholar
  13. 13.
    Halevy, A., Ives, Z., Suciu, D., Tatarinov, I.: Schema mediation in peer data management systems. In: Interenational Conference on Database Theory, pp. 505–516 (2003)Google Scholar
  14. 14.
  15. 15.
    Project JXTA. http://www.jxta.org/
  16. 16.
    Lone, Z., Truszczyński, M.: On the problem of computing the well-founded semantics. In: Lloyd, J., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Palamidessi, C., Pereira, L.M., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS, vol. 1861, pp. 673–687. Springer, Heidelberg (2000). doi: 10.1007/3-540-44957-4_45 CrossRefGoogle Scholar
  17. 17.
    Lloyd, J.W.: Foundations of Logic Programming. Springer-Verlag, Heidelberg (1987)CrossRefzbMATHGoogle Scholar
  18. 18.
    Madhavan, J., Halevy, A.Y.: Composing mappings among data sources. In: VLDB, pp. 572–583 (2003)Google Scholar
  19. 19.
    Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Boston (1994)zbMATHGoogle Scholar
  20. 20.
    Tatarinov, I., Halevy., A.: Efficient Query reformulation in peer data management systems. In: SIGMOD, pp. 539–550 (2004)Google Scholar
  21. 21.

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.DIMESUniversity of CalabriaRendeItaly

Personalised recommendations