Database Paper Browser

Back to papers

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)

Paper ID
1878
Venue
PODS
Year
2023
Pagerank
4.1945683e-05
Overall Rank
11,160 | 22.37%
DOI
10.1145/3584372.3588659

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

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.

Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
1,490 On the Decidability of Query Containment under Constraints 1998 PODS 0.00011699154
11,553 All-Instances Restricted Chase Termination 2020 PODS 4.1945683e-05
10,356 Restricted Chase Termination: You Want More than Fairness 2025 PODS 4.1945683e-05
3,489 On Chase Termination Beyond Stratification 2009 VLDB 7.0468114e-05
11,386 Rewriting the Infinite Chase 2022 VLDB 4.1945683e-05
9,046 Non-Uniformly Terminating Chase: Size and Complexity 2022 PODS 4.4039656e-05
3,909 Chase Termination for Guarded Existential Rules 2015 PODS 6.6375375e-05
9,045 Semi-Oblivious Chase Termination for Linear Existential Rules: An Experimental Study 2023 VLDB 4.4039656e-05
10,908 Chase Termination Beyond Polynomial Time 2024 PODS 4.1945683e-05
698 The Chase Revisited 2008 PODS 0.00018030148