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 |
|---|---|---|---|---|
| 747 | Querying Graph Databases | 2013 | PODS | 0.00014400452 |
| 814 | Hypertree Decompositions: Questions and Answers | 2016 | PODS | 0.00013841737 |
| 3,463 | Efficient Evaluation and Approximation of Well-designed Pattern Trees | 2015 | PODS | 7.3921264e-05 |
| 9,933 | Semantic Acyclicity Under Constraints | 2016 | PODS | 5.1955087e-05 |
| 12,165 | Does Query Evaluation Tractability Help Query Containment? | 2014 | PODS | 5.093636e-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 |
|---|---|---|---|---|
| 300 | GraphLog: a Visual Formalism for Real Life Recursion | 1990 | PODS | 0.00022046803 |
| 312 | A Graphical Query Language Supporting Recursion | 1987 | SIGMOD | 0.00021733819 |
| 382 | Conjunctive-Query Containment and Constraint Satisfaction | 1998 | PODS | 0.00019546431 |
| 414 | On the Complexity of Database Queries (Extended Abstract) | 1997 | PODS | 0.00018893507 |
| 686 | Query Containment for Conjunctive Queries With Regular Expressions | 1998 | PODS | 0.00014948634 |
| 1,128 | Graph Pattern Matching: From Intractable to Polynomial Time | 2010 | VLDB | 0.0001206219 |
| 1,575 | Expressive Languages for Path Queries over Graph-Structured Data | 2010 | PODS | 0.00010318258 |
| 9,009 | Efficient Approximations of Conjunctive Queries | 2012 | PODS | 5.3335287e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,369 | Semantic Query Optimization in the Presence of Types | 2010 | PODS |
| 2 | 10,020 | Conjunctive Queries with Negation and Aggregation: A Linear Time Characterization | 2024 | PODS |
| 3 | 12,165 | Does Query Evaluation Tractability Help Query Containment? | 2014 | PODS |
| 4 | 10,650 | Rewriting Consistent Answers on Annotated Data | 2025 | PODS |
| 5 | 2,468 | On the Enumeration Complexity of Unions of Conjunctive Queries | 2019 | PODS |
| 6 | 10,146 | Acyclic Conjunctive Regular Path Queries are no Harder than Corresponding Conjunctive Queries | 2026 | PODS |
| 7 | 6,678 | Output-sensitive Conjunctive Query Evaluation | 2024 | PODS |
| 8 | 9,009 | Efficient Approximations of Conjunctive Queries | 2012 | PODS |
| 9 | 747 | Querying Graph Databases | 2013 | PODS |
| 10 | 9,933 | Semantic Acyclicity Under Constraints | 2016 | PODS |