The Complexity of Evaluating Path Expressions in SPARQL
Summary: Formalizes W3C SPARQL1.1 property‑path semantics (limited negation, numerical occurrence sugar, nonstandard graph semantics) and frames decision/counting of path matches between nodes in edge‑labeled graphs. Shows W3C semantics makes existence and counting queries intractable for very small expression fragments (contrasting with a polytime alternative semantics), while membership for regular expressions with negation and numerical occurrence indicators is in P. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Katja Losemann (University of Bayreuth)
- 2. Wim Martens (University of Bayreuth)
BibTeX Citation
@inproceedings{losemann_pods12,
address = {New York, NY, USA},
series = {{PODS} '12},
title = {{The Complexity of Evaluating Path Expressions in SPARQL}},
url = {https://dl.acm.org/doi/10.1145/2213556.2213573},
doi = {10.1145/2213556.2213573},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Losemann, Katja and Martens, Wim},
year = {2012}
}Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 747 | Querying Graph Databases | 2013 | PODS | 0.00014400452 |
| 3,649 | Query Planning for Evaluating SPARQL Property Paths | 2016 | SIGMOD | 7.2251335e-05 |
| 4,981 | A Trichotomy for Regular Simple Path Queries on Graphs | 2013 | PODS | 6.4127882e-05 |
| 7,410 | TriAL for RDF: Adapting Graph Query Languages for RDF Data | 2013 | PODS | 5.6242786e-05 |
| 8,098 | Designing a Query Language for RDF: Marrying Open and Closed Worlds | 2016 | PODS | 5.4874656e-05 |
| 10,830 | PlanRGCN: Predicting SPARQL Query Performance | 2025 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 124 | A Query Language and Optimization Techniques for Unstructured Data | 1996 | SIGMOD | 0.00030950263 |
| 300 | GraphLog: a Visual Formalism for Real Life Recursion | 1990 | PODS | 0.00022046803 |
| 312 | A Graphical Query Language Supporting Recursion | 1987 | SIGMOD | 0.00021733819 |
| 348 | Regular Path Queries with Constraints | 1997 | PODS | 0.00020518814 |
| 686 | Query Containment for Conjunctive Queries With Regular Expressions | 1998 | PODS | 0.00014948634 |
| 2,446 | Querying Semantic Web Data with SPARQL | 2011 | PODS | 8.5728114e-05 |
| 2,957 | Graph-Theoretic Methods In Database Theory | 1990 | PODS | 7.9200375e-05 |
| 3,103 | View-Based Query Processing for Regular Path Queries with Inverse | 2000 | PODS | 7.7562264e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 7,289 | Conjunctive Regular Path Queries with String Variables | 2020 | PODS |
| 2 | 3,556 | Static Analysis and Optimization of Semantic Web Queries | 2012 | PODS |
| 3 | 9,181 | Expressive Languages for Querying the Semantic Web | 2014 | PODS |
| 4 | 3,067 | Evaluating Queries with Generalized Path Expressions | 1996 | SIGMOD |
| 5 | 4,981 | A Trichotomy for Regular Simple Path Queries on Graphs | 2013 | PODS |
| 6 | 747 | Querying Graph Databases | 2013 | PODS |
| 7 | 11,225 | Efficient Regular Simple Path Queries under Transitive Restricted Expressions | 2024 | VLDB |
| 8 | 1,658 | Finding Regular Simple Paths in Graph Databases | 1989 | VLDB |
| 9 | 3,649 | Query Planning for Evaluating SPARQL Property Paths | 2016 | SIGMOD |
| 10 | 1,575 | Expressive Languages for Path Queries over Graph-Structured Data | 2010 | PODS |