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)
Incoming Non-self Citations Over Time
Authors
- 1. Pablo Barceló (University of Chile)
- 2. Miguel Romero (University of Chile)
- 3. Moshe Y. Vardi (Rice University)
BibTeX Citation
@inproceedings{barcelo_pods13,
address = {New York, NY, USA},
series = {{PODS} '13},
title = {{Semantic Acyclicity on Graph Databases}},
url = {https://dl.acm.org/doi/10.1145/2463664.2463671},
doi = {10.1145/2463664.2463671},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Barceló, Pablo and Romero, Miguel and Vardi, Moshe Y.},
year = {2013}
}
Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 720 | Querying Graph Databases | 2013 | PODS | 0.00014522278 |
| 819 | Hypertree Decompositions: Questions and Answers | 2016 | PODS | 0.00013660715 |
| 3,531 | Efficient Evaluation and Approximation of Well-designed Pattern Trees | 2015 | PODS | 7.2239947e-05 |
| 10,119 | Semantic Acyclicity Under Constraints | 2016 | PODS | 5.0765311e-05 |
| 12,462 | Does Query Evaluation Tractability Help Query Containment? | 2014 | PODS | 4.9769913e-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 |
|---|---|---|---|---|
| 298 | GraphLog: a Visual Formalism for Real Life Recursion | 1990 | PODS | 0.00021830158 |
| 305 | A Graphical Query Language Supporting Recursion | 1987 | SIGMOD | 0.00021580917 |
| 391 | Conjunctive-Query Containment and Constraint Satisfaction | 1998 | PODS | 0.00019245666 |
| 421 | On the Complexity of Database Queries (Extended Abstract) | 1997 | PODS | 0.00018507815 |
| 699 | Query Containment for Conjunctive Queries With Regular Expressions | 1998 | PODS | 0.00014680086 |
| 1,150 | Graph Pattern Matching: From Intractable to Polynomial Time | 2010 | VLDB | 0.00011804185 |
| 1,468 | Expressive Languages for Path Queries over Graph-Structured Data | 2010 | PODS | 0.00010561507 |
| 9,177 | Efficient Approximations of Conjunctive Queries | 2012 | PODS | 5.2117841e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,461 | Semantic Query Optimization in the Presence of Types | 2010 | PODS |
| 2 | 10,216 | Conjunctive Queries with Negation and Aggregation: A Linear Time Characterization | 2024 | PODS |
| 3 | 12,462 | Does Query Evaluation Tractability Help Query Containment? | 2014 | PODS |
| 4 | 11,102 | Rewriting Consistent Answers on Annotated Data | 2025 | PODS |
| 5 | 2,517 | On the Enumeration Complexity of Unions of Conjunctive Queries | 2019 | PODS |
| 6 | 10,375 | Acyclic Conjunctive Regular Path Queries are no Harder than Corresponding Conjunctive Queries | 2026 | PODS |
| 7 | 6,469 | Output-sensitive Conjunctive Query Evaluation | 2024 | PODS |
| 8 | 9,177 | Efficient Approximations of Conjunctive Queries | 2012 | PODS |
| 9 | 720 | Querying Graph Databases | 2013 | PODS |
| 10 | 10,119 | Semantic Acyclicity Under Constraints | 2016 | PODS |