On the data complexity of consistent query answering over graph databases
From MaRDI portal
Publication:5738946
Recommendations
Cited in
(13)- Containment of queries for graphs with data
- On the data complexity of consistent query answering over graph databases
- Proceedings of the 15th international conference on database theory, ICDT 2012, Berlin, Germany, March 26--29, 2012
- Proceedings of the 16th international conference on database theory, ICDT 2013, Genoa, Italy, March 18--22, 2013
- Semantic acyclicity on graph databases
- Nesting Depth of Operators in Graph Database Queries: Expressiveness Vs. Evaluation Complexity
- Complexity of repair checking and consistent query answering
- On the relationship between consistent query answering and constraint satisfaction problems
- On the Complexity of Finding Set Repairs for Data-Graphs
- Reasoning on property graphs with graph generating dependencies
- Corrections to: ``On the data complexity of consistent query answering over graph databases
- 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 Q5738946)