On the data complexity of consistent query answering over graph databases
From MaRDI portal
Publication:2361352
Recommendations
Cites work
- A dichotomy in the complexity of consistent query answering for queries with two atoms
- Conjunctive query containment and answering under description logic constraints
- Data exchange: semantics and query answering
- First-order query rewriting for inconsistent databases
- scientific article; zbMATH DE number 176243 (Why is no real title available?)
- scientific article; zbMATH DE number 1953144 (Why is no real title available?)
- scientific article; zbMATH DE number 789389 (Why is no real title available?)
- Integrity constraints for XML
- Minimal-change integrity maintenance using tuple deletions
- On the Complexity of Verifying Consistency of XML Specifications
- On the data complexity of consistent query answering over graph databases
- Path constraints in semistructured databases
- Regular path queries with constraints
- Rewriting of regular expressions and regular path queries
- Taming the infinite chase: query answering under expressive relational constraints
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Verification of evolving graph-structured data under expressive path constraints
- Why is it hard to obtain a dichotomy for consistent query answering?
Cited in
(19)- Containment of queries for graphs with data
- Consistent query answering for primary keys in Datalog
- Why is it hard to obtain a dichotomy for consistent query answering?
- Proceedings of the 15th international conference on database theory, ICDT 2012, Berlin, Germany, March 26--29, 2012
- Nesting Depth of Operators in Graph Database Queries: Expressiveness Vs. Evaluation Complexity
- Consistent query answering for primary keys in logspace
- Complexity of repair checking and consistent query answering
- A survey of the data complexity of consistent query answering under key constraints
- On the relationship between consistent query answering and constraint satisfaction problems
- On the data complexity of consistent query answering over graph databases
- On the Complexity of Finding Set Repairs for Data-Graphs
- An epistemic approach to model uncertainty in data-graphs
- Reasoning on property graphs with graph generating dependencies
- Computing repairs under functional and inclusion dependencies via argumentation
- Containment of regular path queries under path constraints
- On measuring inconsistency in graph databases with regular path constraints
- Inconsistency-tolerant semantics based on (preferred) repairs (invited paper)
- Foreword: Journal of Computer and System Sciences special issue on query answering on graph-structured data
- Answering ``why empty? and ``why so many? queries in graph databases
This page was built for publication: On the data complexity of consistent query answering over graph databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2361352)
