Corrections to: ``On the data complexity of consistent query answering over graph databases
From MaRDI portal
Corrections to: ``On the data complexity of consistent query answering over graph databases''
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?)
- 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
- Why is it hard to obtain a dichotomy for consistent query answering?
This page was built for publication: Corrections to: ``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 Q6924408)