Database Paper Browser

Back to papers

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)

Paper ID
1855
Venue
PODS
Year
2022
Pagerank
4.3341665e-05
Overall Rank
9,493 | 33.96%
DOI
10.1145/3517804.3524167

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
10,235 Repairing Property Graphs under PG-Constraints 2026 VLDB 4.1945683e-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
1,037 Querying Graph Databases 2013 PODS 0.00014502493
1,812 Expressive Languages for Path Queries over Graph-Structured Data 2010 PODS 0.00010467069
6,820 Conjunctive Regular Path Queries with String Variables 2020 PODS 4.9157306e-05
Previous Page 1 / 1 Next

Semantically Similar Papers