Consistent Data Integration in P2P Deductive Databases

Proceedings of the 19th International Database Engineering &Amp; Applications Symposium on - IDEAS '15

2014

This paper proposes a logic framework for modeling the interaction among incomplete and inconsistent deductive databases in a P2P environment. It stems from the work in [9,13,14,16,17] in which the declarative semantics of a P2P system is defined in terms of maximal weak models and the work in [15] in which the declarative semantics of a P2P system is defined in terms of minimal weak models. The maximal weak models semantics is based on the idea to use the mapping rules to import in each peer as much knowledge as possible without violating local integrity constraints. On the other hand under the Minimal Weak Models Semantics each peer uses its mapping rules to import minimal sets of mapping atoms allowing to satisfy its local integrity constraints. This latter behavior turns out to be useful in real world P2P systems in which peers often use the available import mechanisms to extract knowledge from the rest of the system only if this knowledge is strictly needed to repair an inconsistent local database. Therefore, each peer can be thought of as a resource used either to enrich (integrate) the knowledge (Maximal Weak Model Semantics) or to fix (repair) the knowledge (Minimal Weak Model Semantics). This paper extends previous works in [9,13,14,16,17] and in [15] by proposing a rewriting technique that allows modeling a P2P system, PS, as a unique logic program whose stable models correspond either to the maximal or minimal weak models of PS.

show abstract

Section: Introductionmentioning

confidence: 68%

Section: P2p Systems: Syntax and Seman-ticsmentioning

confidence: 98%

mentioning

confidence: 92%

mentioning

confidence: 99%

See 2 more Smart Citations

A Logic Based Approach for Managing Incompleteness and Inconsistencies in P2P Deductive Databases

Proceedings of the 19th International Database Engineering &Amp; Applications Symposium on - IDEAS '15

2014

show abstract

“…In [9,12,13,14,15] the interaction among deductive databases in a P2P system has been modeled by importing, by means of mapping rules, maximal sets of atoms not violating integrity constraints, that is maximal sets of atoms that allow the peer to enrich its knowledge while preventing inconsistency anomalies.…”

Section: Introductionmentioning

confidence: 99%

Dealing with incompleteness and inconsistency in P2P deductive databases

Proceedings of the 18th International Database Engineering &Amp; Applications Symposium on - IDEAS '14

2014

This paper proposes a logic framework for modeling the interaction among incomplete and inconsistent deductive databases in a P2P environment. Each peer joining a P2P system provides or imports data from its neighbors by using a set of mapping rules, i.e. a set of semantic correspondences to a set of peers belonging to the same environment. By using mapping rules, as soon as it enters the system, a peer can participate and access all data available in its neighborhood, and through its neighborhood it becomes accessible to all the other peers in the system. Two different types of mapping rules are defined: a first type allowing to import maximal sets of atoms and a second type allowing to import minimal sets of atoms from source peers to target peers. In the proposed setting, each peer can be thought of as a resource used either to enrich (integrate) the knowledge or to fix (repair) the knowledge. The declarative semantics of a P2P system is defined in terms of preferred weak models. An equivalent and alternative characterization of preferred weak model semantics, in terms of prioritized logic programs, is also introduced. The paper also presents preliminary results about complexity of P2P logic queries.

show abstract

A Logic Based Approach for Restoring Consistency in P2P Deductive Databases

Lecture Notes in Computer Science

2015