The Tractability Frontier of Well-designed SPARQL Queries
Summary: Characterizes tractable evaluation for well-designed SPARQL queries using only AND, OPTIONAL, and UNION. Introduces domination width—a treewidth-based structural measure—and shows bounded domination width exactly captures polynomial-time evaluability under standard complexity assumptions. (summarized by gpt-5.6-luna on Jul 26 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Miguel Romero (University of Oxford)
BibTeX Citation
@inproceedings{romero_pods18,
address = {New York, NY, USA},
series = {{PODS} '18},
title = {{The Tractability Frontier of Well-designed SPARQL Queries}},
url = {https://dl.acm.org/doi/10.1145/3196959.3196973},
doi = {10.1145/3196959.3196973},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Romero, Miguel},
year = {2018}
}
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
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 |
|---|---|---|---|---|
| 3,463 | Efficient Evaluation and Approximation of Well-designed Pattern Trees | 2015 | PODS | 7.3921264e-05 |
| 3,556 | Static Analysis and Optimization of Semantic Web Queries | 2012 | PODS | 7.3113256e-05 |
| 5,832 | Containment and Equivalence of Well-Designed SPARQL | 2014 | PODS | 6.0733071e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,452 | The Complexity of Evaluating Path Expressions in SPARQL | 2012 | PODS |
| 2 | 11,753 | The Limits of Efficiency for Open- and Closed-World Query Evaluation Under Guarded TGDs | 2020 | PODS |
| 3 | 8,098 | Designing a Query Language for RDF: Marrying Open and Closed Worlds | 2016 | PODS |
| 4 | 7,622 | Adding Logical Operators to Tree Pattern Queries on Graph-Structured Data | 2012 | VLDB |
| 5 | 12,229 | The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space Complexity | 2013 | PODS |
| 6 | 10,182 | The Space-Time Complexity of Sum-Product Queries | 2026 | PODS |
| 7 | 3,556 | Static Analysis and Optimization of Semantic Web Queries | 2012 | PODS |
| 8 | 4,393 | Bounded Conjunctive Queries | 2014 | VLDB |
| 9 | 11,787 | SPARQL Rewriting: Towards Desired Results | 2020 | SIGMOD |
| 10 | 5,832 | Containment and Equivalence of Well-Designed SPARQL | 2014 | PODS |