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
- 2. Wim Martens
Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,037 | Querying Graph Databases | 2013 | PODS | 0.00014502493 |
| 4,280 | Query Planning for Evaluating SPARQL Property Paths | 2016 | SIGMOD | 6.2948356e-05 |
| 5,424 | A Trichotomy for Regular Simple Path Queries on Graphs | 2013 | PODS | 5.5126983e-05 |
| 6,847 | TriAL for RDF: Adapting Graph Query Languages for RDF Data | 2013 | PODS | 4.9089877e-05 |
| 10,564 | PlanRGCN: Predicting SPARQL Query Performance | 2025 | VLDB | 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 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 |
|---|---|---|---|---|
| 114 | A Query Language and Optimization Techniques for Unstructured Data | 1996 | SIGMOD | 0.00046339735 |
| 256 | GraphLog: a Visual Formalism for Real Life Recursion | 1990 | PODS | 0.00030259041 |
| 274 | Regular Path Queries with Constraints | 1997 | PODS | 0.00029390022 |
| 363 | A Graphical Query Language Supporting Recursion | 1987 | SIGMOD | 0.00025715157 |
| 810 | Query Containment for Conjunctive Queries With Regular Expressions | 1998 | PODS | 0.00016428374 |
| 2,304 | Querying Semantic Web Data with SPARQL | 2011 | PODS | 9.0648775e-05 |
| 2,474 | Graph-Theoretic Methods In Database Theory | 1990 | PODS | 8.7135761e-05 |
| 3,228 | View-Based Query Processing for Regular Path Queries with Inverse | 2000 | PODS | 7.3405281e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,820 | Conjunctive Regular Path Queries with String Variables | 2020 | PODS | 4.9157306e-05 |
| 4,251 | Static Analysis and Optimization of Semantic Web Queries | 2012 | PODS | 6.3235328e-05 |
| 9,739 | Expressive Languages for Querying the Semantic Web | 2014 | PODS | 4.2936538e-05 |
| 2,503 | Evaluating Queries with Generalized Path Expressions | 1996 | SIGMOD | 8.6379665e-05 |
| 5,424 | A Trichotomy for Regular Simple Path Queries on Graphs | 2013 | PODS | 5.5126983e-05 |
| 1,037 | Querying Graph Databases | 2013 | PODS | 0.00014502493 |
| 11,014 | Efficient Regular Simple Path Queries under Transitive Restricted Expressions | 2024 | VLDB | 4.1945683e-05 |
| 1,444 | Finding Regular Simple Paths in Graph Databases | 1989 | VLDB | 0.00011946075 |
| 4,280 | Query Planning for Evaluating SPARQL Property Paths | 2016 | SIGMOD | 6.2948356e-05 |
| 1,812 | Expressive Languages for Path Queries over Graph-Structured Data | 2010 | PODS | 0.00010467069 |