When is the Evaluation of Extended CRPQ Tractable?
Summary: Characterizes structural conditions on ECRPQs (CRPQs extended with synchronous/regular/automatic relations) that govern evaluation complexity. Establishes a fine-grained trichotomy: classical evaluation can be PSPACE/NP/P and parameterized evaluation XNL/W[1]/FPT depending on query structure. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Diego Figueira (Bordeaux Institute of Technology; Laboratory of Bordeaux Research in Computer Science; National Centre for Scientific Research; University of Bordeaux)
- 2. Varun Ramanathan (Bordeaux Institute of Technology; Laboratory of Bordeaux Research in Computer Science; National Centre for Scientific Research; University of Bordeaux)
BibTeX Citation
@inproceedings{figueira_pods22,
address = {New York, NY, USA},
series = {{PODS} '22},
title = {{When is the Evaluation of Extended CRPQ Tractable?}},
url = {https://dl.acm.org/doi/10.1145/3517804.3524167},
doi = {10.1145/3517804.3524167},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Figueira, Diego and Ramanathan, Varun},
year = {2022}
}
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,167 | A Logical View of GNN-Style Computation and the Role of Activation Functions | 2026 | PODS | 5.093636e-05 |
| 10,523 | Repairing Property Graphs under PG-Constraints | 2026 | VLDB | 5.093636e-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 |
|---|---|---|---|---|
| 747 | Querying Graph Databases | 2013 | PODS | 0.00014400452 |
| 1,575 | Expressive Languages for Path Queries over Graph-Structured Data | 2010 | PODS | 0.00010318258 |
| 7,289 | Conjunctive Regular Path Queries with String Variables | 2020 | PODS | 5.654364e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,467 | The Complexity of Evaluating Relational Queries | 1983 | PODS |
| 2 | 7,028 | Semantic Acyclicity on Graph Databases | 2013 | PODS |
| 3 | 11,895 | The Tractability Frontier of Well-designed SPARQL Queries | 2018 | PODS |
| 4 | 12,229 | The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space Complexity | 2013 | PODS |
| 5 | 12,165 | Does Query Evaluation Tractability Help Query Containment? | 2014 | PODS |
| 6 | 6,718 | Minimizing Conjunctive Regular Path Queries | 2025 | PODS |
| 7 | 1,575 | Expressive Languages for Path Queries over Graph-Structured Data | 2010 | PODS |
| 8 | 8,190 | Conjunctive Regular Path Queries under Injective Semantics | 2023 | PODS |
| 9 | 7,289 | Conjunctive Regular Path Queries with String Variables | 2020 | PODS |
| 10 | 10,146 | Acyclic Conjunctive Regular Path Queries are no Harder than Corresponding Conjunctive Queries | 2026 | PODS |