Bounded Treewidth and the Infinite Core Chase: Complications and Workarounds toward Decidable Querying
Summary: Demonstrates that, due to the non-monotonic infinite core chase, existence of a treewidth-bounded universal model and a treewidth-bounded core-chase sequence can fail to coincide, via counterexamples in both directions. Proposes an aggregation scheme that preserves treewidth to produce a finitely universal model and defines a chase-based bounded-treewidth class (subsuming fes) that yields decidable CQ entailment. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Jean-François Baget (INRIA; National Center for Scientific Research; University of Montpellier)
- 2. Marie-Laure Mugnier (INRIA; National Center for Scientific Research; University of Montpellier)
- 3. Sebastian Rudolph (Technical University of Dresden)
BibTeX Citation
@inproceedings{baget_pods23,
address = {New York, NY, USA},
series = {{PODS} '23},
title = {{Bounded Treewidth and the Infinite Core Chase: Complications and Workarounds toward Decidable Querying}},
url = {https://dl.acm.org/doi/10.1145/3584372.3588659},
doi = {10.1145/3584372.3588659},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Baget, Jean-François and Mugnier, Marie-Laure and Rudolph, Sebastian},
year = {2023}
}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 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 525 | The Chase Revisited | 2008 | PODS | 0.00017118255 |
| 1,541 | Generalized Schema-Mappings: From Termination To Tractability | 2009 | PODS | 0.00010427058 |
| 1,673 | Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width | 2001 | PODS | 0.00010040854 |
| 7,930 | Optimizing the Chase: Scalable Data Integration under Constraints | 2014 | VLDB | 5.5181056e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,630 | On the Decidability of Query Containment under Constraints | 1998 | PODS |
| 2 | 11,750 | All-Instances Restricted Chase Termination | 2020 | PODS |
| 3 | 10,649 | Restricted Chase Termination: You Want More than Fairness | 2025 | PODS |
| 4 | 3,247 | On Chase Termination Beyond Stratification | 2009 | VLDB |
| 5 | 11,584 | Rewriting the Infinite Chase | 2022 | VLDB |
| 6 | 9,196 | Non-Uniformly Terminating Chase: Size and Complexity | 2022 | PODS |
| 7 | 4,353 | Chase Termination for Guarded Existential Rules | 2015 | PODS |
| 8 | 9,195 | Semi-Oblivious Chase Termination for Linear Existential Rules: An Experimental Study | 2023 | VLDB |
| 9 | 11,129 | Chase Termination Beyond Polynomial Time | 2024 | PODS |
| 10 | 525 | The Chase Revisited | 2008 | PODS |