# Consistency and Trust in Peer Data Exchange Systems

arXiv: https://arxiv.org/abs/1606.01930 · HTML: https://mlsanity.com/paper/1606.01930/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 6 Jun 2016.

## Built on by (most cited first, 3 of 3)

- [Relational Algebra and Calculus with SQL Null Values](https://mlsanity.com/paper/2202.10898/) (2022)
- [Answer-Set Programs for Repair Updates and Counterfactual Interventions](https://mlsanity.com/paper/2209.12110/) (2022)
- [Database Querying under Missing Values Governed by Missingness Mechanisms](https://mlsanity.com/paper/2604.06520/) (2026)

## Abstract (arXiv)

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.