# On the complexity of finding set repairs for data-graphs

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

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- Builds on 5 of its 52 references that are in the map.
- First posted on arXiv 15 Jun 2022.

## Builds on (most cited first, 5 of 5)

- [Knowledge Graphs](https://mlsanity.com/paper/2003.02320/) (2020)
- [Foundations of Modern Query Languages for Graph Databases](https://mlsanity.com/paper/1610.06264/) (2016)
- [G-CORE: A Core for Future Graph Query Languages](https://mlsanity.com/paper/1712.01550/) (2017)
- [Complexity of Consistent Query Answering in Databases under Cardinality-Based and Incremental Repair Semantics (extended version)](https://mlsanity.com/paper/1605.07159/) (2016)
- [Finite Query Answering in Expressive Description Logics with Transitive Roles](https://mlsanity.com/paper/1808.03130/) (2018)

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

- [Computational Complexity of Preferred Subset Repairs on Data-Graphs](https://mlsanity.com/paper/2402.09265/) (2024)

## Abstract (arXiv)

In the deeply interconnected world we live in, pieces of information link domains all around us. As graph databases embrace effectively relationships among data and allow processing and querying these connections efficiently, they are rapidly becoming a popular platform for storage that supports a wide range of domains and applications. As in the relational case, it is expected that data preserves a set of integrity constraints that define the semantic structure of the world it represents. When a database does not satisfy its integrity constraints, a possible approach is to search for a 'similar' database that does satisfy the constraints, also known as a repair. In this work, we study the problem of computing subset and superset repairs for graph databases with data values using a notion of consistency based on a set of Reg-GXPath expressions as integrity constraints. We show that for positive fragments of Reg-GXPath these problems admit a polynomial-time algorithm, while the full expressive power of the language renders them intractable.