Database Paper Browser

Back to papers

Semantic Acyclicity on Graph Databases

Summary: Characterize semantic acyclicity for UC2RPQs over graph databases: decidable in 2EXPSPACE and EXPSPACE-hard (even without inverses). Evaluation of semantically acyclic UC2RPQs is FPT; provide a robust approximation theory when no equivalent acyclic UC2RPQ exists. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1594
Venue
PODS
Year
2013
Pagerank
4.8898337e-05
Overall Rank
6,948 | 51.67%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Rank Citing Paper Year Venue Pagerank
1,037 Querying Graph Databases 2013 PODS 0.00014502493
1,328 Hypertree Decompositions: Questions and Answers 2016 PODS 0.00012565612
4,058 Efficient Evaluation and Approximation of Well-designed Pattern Trees 2015 PODS 6.4866036e-05
11,829 Semantic Acyclicity Under Constraints 2016 PODS 4.1945683e-05
11,967 Does Query Evaluation Tractability Help Query Containment? 2014 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.

Previous Page 1 / 1 Next

Semantically Similar Papers