Consistency and trust in peer data exchange systems

@article{Bertossi2016ConsistencyAT,
  title={Consistency and trust in peer data exchange systems},
  author={L. Bertossi and L. Bravo},
  journal={Theory and Practice of Logic Programming},
  year={2016},
  volume={17},
  pages={148 - 204}
}
Abstract 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… Expand
Declarative Semantics for P2P Data Management System
TLDR
This paper enhances the basic semantics of Maximal Weak Models by using priority levels among mapping rules in order to select the weak models containing a maximum number of mapping atoms according to their importance. Expand
A Declarative Semantics for P2P Systems
TLDR
This paper investigates the problem of data integration among Peer-to-Peer (P2P) deductive databases and presents a declarative semantics that generalizes previous proposals in the literature and allows each peer to select between two different settings. Expand
Computing a Deterministic Semantics for P2P Deductive Databases
TLDR
A logic based framework for data integration and query answering for deductive databases in a P2P environment based on a special interpretation of mapping rules that leads to a declarative semantics for P1P systems defined in terms of preferred weak models is proposed. Expand
A Logic Framework for P2P Deductive Databases
TLDR
Three different declarative semantics of a P2P system are presented, in which mapping rules are used to import as much knowledge as possible from a peer’s neighborhood without violating local integrity constraints, and each allows to characterize each peer in the neighborhood as a resource used to enrich (integrate) or to fix (repair) the knowledge. Expand
Characterizing Causes for Query Answers in Databases via Database Repairs and their Computation through Repair Programs
TLDR
Answer-set programs that specify repairs of databases are used as a basis for solving computational and reasoning problems about causes, and causes are also introduced at the attribute level by appealing to a both null-based and attribute-based repair semantics. Expand
Specifying and computing causes for query answers in databases via database repairs and repair-programs
TLDR
In this work, answer-set programs that specify database repairs are used as a basis for solving computational and reasoning problems around causality in databases, including causal responsibility. Expand
Repair-Based Degrees of Database Inconsistency
TLDR
It is shown that the computation of this measure of the inconsistency of a database can be intractable in data complexity, but answer-set programs are exhibited that can be used to compute it. Expand
Integration of Unsound Data in P2P Systems
TLDR
A different perspective in which a peer of a P2P system may consider its own data to be more trustable with respect to data provided by external peers or less trustable (unsound peer). Expand
Characterizing and Computing Causes for Query Answers in Databases from Database Repairs and Repair Programs
TLDR
Answer-set programs that specify repairs of databases are used as a basis for solving computational and reasoning problems about causes and causes are also introduced at the attribute level by appealing to a both null-based and attribute-based repair semantics. Expand
A Formal Semantics of SQL Queries, Its Validation, and Applications
TLDR
The first formal proof of the equivalence of basic SQL and relational algebra that extends to bag semantics and nulls is given, and it is proved that three-valued logic employed by SQL does not add expressive power, as every SQL query can be evaluated under the usual two-valued Boolean semantics of conditions. Expand
...
1
2
...

References

SHOWING 1-10 OF 111 REFERENCES
The Semantics of Consistency and Trust in Peer Data Exchange Systems
TLDR
It is shown that solution instances can be specified as the models of logic programs with a stable model semantics and the semantically correct answers from a peer to a query are defined as those answers that are invariant under all its different solution instances. Expand
Logical foundations of peer-to-peer data integration
TLDR
This paper argues that the approach based on epistemic logic is superior with respect to modularity, generality, and decidability in peer-to-peer systems, and shows that, in systems in which peers have decidable schemas and conjunctive mappings, but are arbitrarily interconnected, the first-order approach may lead to undecidability of query answering, while the epistemic approach always preservesDecidability. Expand
Query Answering in Peer-to-Peer Data Exchange Systems
TLDR
A semantics for peer consistent answers under exchange constraints and trust relationships is introduced and some techniques for obtaining those answers are presented. Expand
Consistent Query Answers in Virtual Data Integration Systems
TLDR
This chapter considers the problem of defining and computing those answers that are consistent wrt the global ICs when global queries are posed to virtual data integration systems whose sources are specified following the local-as-view approach. Expand
Inconsistency Tolerance in P2P Data Integration: An Epistemic Logic Approach
TLDR
This work proposes a multi-modal epistemic semantics based on the idea that each peer is conceived as a rational agent that exchanges knowledge/belief with other peers, thus nicely modeling the modular structure of the system. Expand
Mapping data in peer-to-peer systems: semantics and algorithmic issues
TLDR
This paper motivates why reasoning capabilities are needed to manage mapping tables and shows the importance of inferring new mapping tables from existing ones, and presents an implementation along with experimental results that show that mapping tables may be managed efficiently in practice. Expand
Modeling Cooperation in P2P Data Management Systems
TLDR
This paper enhances previous semantics by using priority levels among mapping rules in order to select the weak models containing a maximum number of mapping atoms according to their importance, and it is shown these weak models can be computed as stable models of a logic program with weak constraints. Expand
Inconsistency tolerance in P2P data integration: An epistemic logic approach
TLDR
A nonmonotonic extension of logic is defined that is able to reason on the beliefs of peers under both local and P2P inconsistency tolerance, and it is shown that, under reasonable assumptions on peer schemas, query answering is decidable, and is coNP-complete with respect to data complexity. Expand
Peer data exchange
TLDR
The boundary between tractability andintractability for the problem of deciding the existence of a solution is explored, and broad syntactic conditions on the constraints between the peers under which testing for solutions is solvable in polynomial time are identified. Expand
Handling inconsistency in databases and data integration systems
TLDR
In this research, the connection with virtual data integration systems and peer data management systems is explored in more depth and a semantics of satisfaction of constraints in the presence of null is given that generalizes the one used in commercial DBMS. Expand
...
1
2
3
4
5
...