Abstract
Data Integration in Peer-to-Peer (P2P) systems is concerned with the ability of physically connect autonomous sources (peer) for sharing and reuse information and for the creation of new information from existing one. In a P2P system a query can be posed to any peer and the answer is provided by integrating locally stored data with data provided from its neighbors. Anyhow, while collecting data for answering queries, imported data may corrupt the local database due to the violation of some integrity constraint, therefore inconsistencies have to be managed. This paper contributes to the proposal of a logic based framework for data integration and query answering in a Peer-to-Peer environment. It is based on [11,12] in which the Preferred Weak Model Semantics, capturing a different perspective for P2P data integration, has been proposed: just data not violating integrity constraints are exchanged among peers by using mapping rules. The motivation of this work stems from the observation that the complexity of computing preferred weak models in [11,12] does not let the approach to be implemented in practical applications. Therefore, a more pragmatic solution seems to be desirable for assigning semantics to a P2P system. First, the paper proposes a rewriting technique that allows modeling a P2P system, \({\mathcal {PS}}\), as a unique logic program, Rew t (\({\mathcal {PS}}\)), whose stable models correspond to the preferred weak models of \({\mathcal {PS}}\). Then, it presents the Well Founded Model Semantics, that allows obtaining a deterministic model whose computation is polynomial time. This is a (partial) stable model obtained by evaluating with a three-value semantics a logic program obtained from Rew t (\({\mathcal {PS}})\). Finally, the paper provides results on the complexity of answering queries in a P2P system.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arenas, M., Bertossi, L., Chomicki, J.: Consistent Query Answers in Inconsistent Databases. In: Symposium on Principles of Database Systems, pp. 68–79 (1999)
Baral, C., Lobo, J., Minker, J.: Generalized Disjunctive Well-Founded Semantics for Logic Programs. Annals of Mathematics and Artificial Intelligence 5(2-4), 89–131 (1992)
Ben-Eliyahu, R., Dechter, R.: Propositional Sematics for Disjunctive Logic Programs. In: Joint International Conference and Symposium on Logic Programming, pp. 813–827 (1992)
Bernstein, P.A., Giunchiglia, F., Kementsietsidis, A., Mylopulos, J., Serafini, L., Zaihrayen, I.: Data Management for Peer-to-Peer Computing: A Vision. In: WebDB, pp. 89–94 (2002)
Bertossi, L., Bravo, L.: Query Answering in Peer-to-Peer Data Exchange Systems. In: Extending Database Technology Workshops (2004)
Brewka, G., Eiter, T.: Preferred Answer Sets for Extended Logic Programs. Artificial Intelligence 109(1-2), 297–356 (1999)
Brewka, G., Niemela, I., Truszczynski, M.: Answer Set Optimization. In: International Joint Conference on Artificial Intelligence, pp. 867–872 (2003)
Calì, A., Calvanese, D., De Giacomo, G., Lenzerini, M.: On the decidability and complexity of query answering over inconsistent and incomplete databases. In: Symposium on Principles of Database Systems, pp. 260–271 (2003)
Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Inconsistency Tolerance in P2P Data Integration: an Epistemic Logic Approach. In: International Symposium on Database Programming Languages, pp. 692–697 (2004)
Calvanese, D., De Giacomo, G., Lenzerini, M., Rosati, R.: Logical foundations of peer-to-peer data integration. In: Symposium on Principles of Database Systems, pp. 241–251 (2004)
Caroprese, L., Greco, S., Zumpano, E.: A Logic Programming Approach to Querying and Integrating P2P Deductive Databases. In: The International Florida AI Research Society Conference, pp. 31–36 (2006)
Caroprese, L., Molinaro, C., Zumpano, E.: Integrating and Querying P2P Deductive Databases. In: International Database Engineering & Applications Symposium, pp. 285–290 (2006)
Fernà ndez, J.A., Lobo, J., Minker, J., Subrahmanian, V.S.: Disjunctive LP + Integrity Constraints = Stable Model Semantics. Annals of Mathematics and Artificial Intelligence 8(3-4), 449–474 (1993)
Franconi, E., Kuper, G.M., Lopatenko, A., Zaihrayeu, I.: Queries and Updates in the coDB Peer to Peer Database System. In: International Conference on Very large Data Bases, pp. 1277–1280 (2004)
Franconi, E., Kuper, G.M., Lopatenko, A., Zaihrayeu, I.: A Robust Logical and Computational Characterisation of Perto-Peer Database Systems. In: International Workshop on Databases, Information Systems and Peer-to-Peer Computing, pp. 64–76 (2003)
Gelfond, M., Lifschitz, V.: The Stable Model Semantics for Logic Programming. In: Joint International Conference and Symposium on Logic Programming, pp. 1070–1080 (1988)
Van Gelder, A.: The Alternating Fixpoint of Logic Programs with Negation. In: Symposium on Principles of Database Systems, pp. 1–10 (1989)
Greco, G., Greco, S., Zumpano, E.: Repairing and Querying Inconsistent Databases. Transactions on Knowledge and Data Engineering, 1389–1408 (2003)
Gribble, S., Halevy, A., Ives, Z., Rodrig, M., Suciu, D.: What can databases do for peer-to-peer? In: WebDB, pp. 31–36 (2001)
Lonc, Z., Truszczynski, M.: On the Problem of Computing the Well-Founded Semantics. Computational Logic, 673–687 (2000)
Halevy, A., Ives, Z., Suciu, D., Tatarinov, I.: Schema mediation in peer data management systems. In: International Conference on Database Theory, pp. 505–516 (2003)
Lenzerini, M.: Data integration: A theoretical perspective. In: Symposium on Principles of Database Systems, pp. 233–246 (2002)
Madhavan, J., Halevy, A.Y.: Composing mappings among data sources. In: International Conference on Very Large Data Bases, pp. 572–583 (2003)
Pradhan, S., Minker, J.: Using Priorities to Combine Knowledge Bases. International Journal of Cooperative Information Systems 5(2-3), 333 (1996)
Sakama, C., Inoue, K.: Prioritized logic programming and its application to commonsense reasoning. Artificial Intelligence 123(1-2), 185–222 (2000)
Seipel, D., Minker, J., Ruiz, C.: Model Generation and State Generation for Disjunctive Logic Programs. Journal of Logic Programming 32(1), 49–69 (1997)
Tatarinov, I., Halevy, A.: Efficient Query reformulation in Peer Data Management Systems. In: SIGMOD, pp. 539–550 (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Caroprese, L., Zumpano, E. (2007). Consistent Data Integration in P2P Deductive Databases. In: Prade, H., Subrahmanian, V.S. (eds) Scalable Uncertainty Management. SUM 2007. Lecture Notes in Computer Science(), vol 4772. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75410-7_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-75410-7_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75407-7
Online ISBN: 978-3-540-75410-7
eBook Packages: Computer ScienceComputer Science (R0)