Pages that link to "Item:Q2361352"
From MaRDI portal
The following pages link to On the data complexity of consistent query answering over graph databases (Q2361352):
Displaying 9 items.
- Foreword: Journal of Computer and System Sciences special issue on query answering on graph-structured data (Q891672) (← links)
- Answering ``why empty?'' and ``why so many?'' queries in graph databases (Q891677) (← links)
- Containment of queries for graphs with data (Q1678169) (← links)
- Consistent query answering for primary keys in Datalog (Q2035471) (← links)
- Nesting Depth of Operators in Graph Database Queries: Expressiveness Vs. Evaluation Complexity (Q4598259) (← links)
- (Q5091138) (← links)
- On the Complexity of Finding Set Repairs for Data-Graphs (Q6135957) (← links)
- An epistemic approach to model uncertainty in data-graphs (Q6137843) (← links)
- Computing repairs under functional and inclusion dependencies via argumentation (Q6630184) (← links)