Designing a Query Language for RDF: Marrying Open and Closed Worlds
Summary: Proves that well-designed SPARQL ⊂ weakly-monotone but not conversely (even with disjunction), showing well-designedness cannot fully capture open-world-compatible queries. Introduces a new interpolation-based SPARQL operator yielding a larger syntactic weakly-monotone fragment (finite/infinite RDFs), gives a simple characterization of monotone CONSTRUCT queries, and settles evaluation complexity. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Marcelo Arenas (Center for Semantic Web Research; Pontifical Catholic University of Chile)
- 2. Martín Ugarte (Free University of Brussels)
BibTeX Citation
@inproceedings{arenas_pods16,
address = {New York, NY, USA},
series = {{PODS} '16},
title = {{Designing a Query Language for RDF: Marrying Open and Closed Worlds}},
url = {https://dl.acm.org/doi/10.1145/2902251.2902298},
doi = {10.1145/2902251.2902298},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Arenas, Marcelo and Ugarte, Martín},
year = {2016}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,365 | Certain Answers Meet Zero-One Laws | 2018 | PODS | 6.1604893e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,198 | Outerjoins as Disjunctions | 1994 | SIGMOD | 0.00011565328 |
| 2,483 | Querying Semantic Web Data with SPARQL | 2011 | PODS | 8.3997473e-05 |
| 3,474 | The Complexity of Evaluating Path Expressions in SPARQL | 2012 | PODS | 7.2718547e-05 |
| 3,531 | Efficient Evaluation and Approximation of Well-designed Pattern Trees | 2015 | PODS | 7.2274159e-05 |
| 3,633 | Static Analysis and Optimization of Semantic Web Queries | 2012 | PODS | 7.1484281e-05 |
| 5,948 | Containment and Equivalence of Well-Designed SPARQL | 2014 | PODS | 5.9370407e-05 |
| 7,714 | Generating Low-cost Plans From Proofs | 2014 | PODS | 5.4702268e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 8,831 | Graph Data Models, Query Languages and Programming Paradigms | 2018 | VLDB |
| 2 | 12,195 | The Tractability Frontier of Well-designed SPARQL Queries | 2018 | PODS |
| 3 | 1,468 | Expressive Languages for Path Queries over Graph-Structured Data | 2010 | PODS |
| 4 | 4,222 | Foundations of Semantic Web Databases | 2004 | PODS |
| 5 | 12,089 | SPARQL Rewriting: Towards Desired Results | 2020 | SIGMOD |
| 6 | 719 | Querying Graph Databases | 2013 | PODS |
| 7 | 5,948 | Containment and Equivalence of Well-Designed SPARQL | 2014 | PODS |
| 8 | 2,483 | Querying Semantic Web Data with SPARQL | 2011 | PODS |
| 9 | 3,633 | Static Analysis and Optimization of Semantic Web Queries | 2012 | PODS |
| 10 | 9,357 | Expressive Languages for Querying the Semantic Web | 2014 | PODS |