Modeling Cooperation in P2P Data Management Systems

Caroprese, Luciano; Zumpano, Ester

doi:10.1007/978-3-540-68123-6_25

Cited by 17 publications

(25 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The decision by a peer on what other data to consider (besides its local data) does not depend only on its data exchange constraints, but also on the trust relationship that it has with other peers. The data exchange problem among distributed independent sources has been investigated in [9,14,11,15]. In [9] the authors define a declarative semantics for P2P systems that allows to import in each peer maximal subsets of atoms which do not violate the local integrity constraints.…”

Section: Related Workmentioning

confidence: 99%

“…In [9] the authors define a declarative semantics for P2P systems that allows to import in each peer maximal subsets of atoms which do not violate the local integrity constraints. The framework has been extended in [14] where a mechanism to set different degrees of reliability for neighbor peers has been provided and in [11,15] in which 'dynamic' preferences allow to import, in the case of conflicting sets of atoms, looking at the properties of data provided by the peers. The work in [10] stems from this different perspective.…”

Section: Related Workmentioning

confidence: 99%

“…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%

See 2 more Smart Citations

Dealing with incompleteness and inconsistency in P2P deductive databases

Caroprese

Zumpano

2014

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

Self Cite

View full text Add to dashboard Cite

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

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Dealing with incompleteness and inconsistency in P2P deductive databases

Caroprese

Zumpano

2014

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

Self Cite

View full text Add to dashboard Cite

show abstract

“…The data exchange problem among distributed independent sources has been investigated in (Caroprese et al 2006;Caroprese and Zumpano 2008;Zumpano 2011). In (Caroprese et al 2006) the authors define a declarative semantics for P2P systems that allows one to import, into each peer, maximal subsets of atoms that do not violate the local integrity constraints.…”

Section: Fig 7 Integration Systems As Peersmentioning

confidence: 99%

Consistency and trust in peer data exchange systems

Bertossi

Bravo

2016

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

We propose and investigate a semantics for peer data exchange systems where different peers are related by data exchange constraints and trust relationships. These two elements plus the data at the peers' sites and their local integrity constraints are made compatible via a semantics that characterizes sets of solution instances for the peers. They are the intended -possibly virtual-instances for a peer that are obtained through a data repair semantics that we introduce and investigate. The semantically correct answers from a peer to a query, the so-called peer consistent answers, are defined as those answers that are invariant under all its different solution instances. We show that solution instances can be specified as the models of logic programs with a stable model semantics. The repair semantics is based on null values as used in SQL databases, and is also of independent interest for repairs of single databases with respect to integrity constraints.

show abstract

“…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.…”

mentioning

confidence: 99%

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

Caroprese

Zumpano

2014

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

Self Cite

View full text Add to dashboard Cite

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

Modeling Cooperation in P2P Data Management Systems

Cited by 17 publications

References 13 publications

Dealing with incompleteness and inconsistency in P2P deductive databases

Dealing with incompleteness and inconsistency in P2P deductive databases

Consistency and trust in peer data exchange systems

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

Contact Info

Product

Resources

About