Containment and Equivalence of Well-Designed SPARQL
Summary: Comprehensive complexity classification of query containment and equivalence for well‑designed SPARQL fragments (AND, OPTIONAL) and extensions with UNION and projection. Maps decidable cases (as low as NP‑complete) versus undecidability, pinpointing the boundary for static analysis. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,058 | Efficient Evaluation and Approximation of Well-designed Pattern Trees | 2015 | PODS | 6.4866036e-05 |
| 11,657 | An Efficient Index for RDF Query Containment | 2019 | SIGMOD | 4.1945683e-05 |
| 11,828 | Designing a Query Language for RDF: Marrying Open and Closed Worlds | 2016 | PODS | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 144 | Testing Containment of Conjunctive Queries Under Functional and Inclusion Dependencies (Extended Abstract) | 1982 | PODS | 0.00041462501 |
| 2,304 | Querying Semantic Web Data with SPARQL | 2011 | PODS | 9.0648775e-05 |
| 4,251 | Static Analysis and Optimization of Semantic Web Queries | 2012 | PODS | 6.3235328e-05 |
Previous
Page 1 / 1
Next