On the Complexity of Finding Set Repairs for Data-Graphs
From MaRDI portal
Publication:6135957
DOI10.1613/JAIR.1.13994arXiv2206.07504OpenAlexW4362457061WikidataQ130979495 ScholiaQ130979495MaRDI QIDQ6135957FDOQ6135957
Authors: Sergio Abriola, Maria Vanina Martinez, Nina Pardal 
Publication date: 28 August 2023
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Abstract: 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.
Full work available at URL: https://arxiv.org/abs/2206.07504
Recommendations
- On the data complexity of consistent query answering over graph databases
- On the data complexity of consistent query answering over graph databases
- On the data complexity of consistent query answering
- Complexity of repair checking and consistent query answering
- Database Repairing and Consistent Query Answering
Cites Work
- XML data exchange
- On the data complexity of consistent query answering
- Answer sets for consistent query answering in inconsistent databases
- Regular path queries with constraints
- Prioritized repairing and consistent query answering in relational databases
- Title not available (Why is that?)
- Path constraints in semistructured databases
- On the data complexity of consistent query answering over graph databases
- Querying Graphs with Data
- Computing and explaining query answers over inconsistent DL-Lite knowledge bases
- Inconsistency-tolerant query answering for existential rules
- Verification of evolving graph-structured data under expressive path constraints
Cited In (2)
This page was built for publication: On the Complexity of Finding Set Repairs for Data-Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6135957)
