Resilience for Regular Path Queries: Towards a Complexity Classification
Summary: Resilience for RPQs on graphs: min deletions to falsify an RPQ. Classification: resilience is tractable for local-language RPQs; non-local languages yield data-complexity hardness (four-legged, non-star-free, neutral letter), suggesting a partial dichotomy. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Antoine Amarilli (CNRS; INRIA; Télécom Paris; University of Lille; École Centrale de Lille)
- 2. Wolfgang Gatterbauer (Northeastern University)
- 3. Neha Makhija (Northeastern University)
- 4. Mikaël Monet (CNRS; INRIA; University of Lille; École Centrale de Lille)
BibTeX Citation
@inproceedings{amarilli_pods25,
address = {New York, NY, USA},
series = {{PODS} '25},
title = {{Resilience for Regular Path Queries: Towards a Complexity Classification}},
url = {https://dl.acm.org/doi/10.1145/3725245},
doi = {10.1145/3725245},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Amarilli, Antoine and Gatterbauer, Wolfgang and Makhija, Neha and Monet, Mikaël},
year = {2025}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 620 | On Propagation of Deletions and Annotations Through Views | 2002 | PODS | 0.00015703409 |
| 3,991 | The Complexity of Resilience and Responsibility for Self-Join-Free Conjunctive Queries | 2016 | VLDB | 6.9695922e-05 |
| 4,248 | Multi-Tuple Deletion Propagation: Approximations and Complexity | 2013 | VLDB | 6.8052749e-05 |
| 4,670 | New Results for the Complexity of Resilience for Binary Conjunctive Queries with Self-Joins | 2020 | PODS | 6.5734205e-05 |
| 7,269 | A Unified Approach for Resilience and Causal Responsibility with Integer Linear Programming (ILP) and LP Relaxations | 2023 | SIGMOD | 5.6595955e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 11,121 | Consistent Query Answering for Primary Keys on Rooted Tree Queries | 2024 | PODS |
| 2 | 7,706 | Conjunctive Queries on Probabilistic Graphs: Combined Complexity | 2017 | PODS |
| 3 | 7,658 | The Complexity of Regular Trail and Simple Path Queries on Undirected Graphs | 2022 | PODS |
| 4 | 11,225 | Efficient Regular Simple Path Queries under Transitive Restricted Expressions | 2024 | VLDB |
| 5 | 747 | Querying Graph Databases | 2013 | PODS |
| 6 | 11,525 | Data Path Queries over Embedded Graph Databases | 2022 | PODS |
| 7 | 1,575 | Expressive Languages for Path Queries over Graph-Structured Data | 2010 | PODS |
| 8 | 3,991 | The Complexity of Resilience and Responsibility for Self-Join-Free Conjunctive Queries | 2016 | VLDB |
| 9 | 4,981 | A Trichotomy for Regular Simple Path Queries on Graphs | 2013 | PODS |
| 10 | 4,670 | New Results for the Complexity of Resilience for Binary Conjunctive Queries with Self-Joins | 2020 | PODS |