On the Complexity of Finding Set Repairs for Data-Graphs

DOI10.1613/JAIR.1.13994MaRDI QIDQ6135957zbMATH OpenOpenAlexWikidataFDO

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)

Full work available at URL https://arxiv.org/abs/2206.07504

zbMATH Keywords

uncertaintyknowledge representationautomated reasoning

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

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.

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

• scientific article; zbMATH DE number 1953144 (Why is no real title available?)
• Answer sets for consistent query answering in inconsistent databases
• Computing and explaining query answers over inconsistent DL-Lite knowledge bases
• Inconsistency-tolerant query answering for existential rules
• On the data complexity of consistent query answering
• On the data complexity of consistent query answering over graph databases
• Path constraints in semistructured databases
• Prioritized repairing and consistent query answering in relational databases
• Querying Graphs with Data
• Regular path queries with constraints
• Verification of evolving graph-structured data under expressive path constraints
• XML data exchange

Cited in

(2)

• Algorithmic Applications in Management
• A logic-based incremental approach to graph repair

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)