Chase Termination Beyond Polynomial Time
Summary: New chase termination criterion tolerates some cycles, yet guarantees termination under reasonable conditions. Expands decidable tgd fragments beyond existing acyclicity, with k-ExpTime data complexity; enables optimized chase for PSpace or k-ExpSpace entailment. (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. Philipp Hanisch (Technical University of Dresden)
- 2. Markus Krötzsch (Technical University of Dresden)
BibTeX Citation
@inproceedings{hanisch_pods24,
address = {New York, NY, USA},
series = {{PODS} '24},
title = {{Chase Termination Beyond Polynomial Time}},
url = {https://dl.acm.org/doi/10.1145/3651594},
doi = {10.1145/3651594},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Hanisch, Philipp and Krötzsch, Markus},
year = {2024}
}
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 10 of 10 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 40 | Testing Implications Of Data Dependencies | 1979 | SIGMOD | 0.00046918506 |
| 97 | Efficient Optimization of a Class of Relational Expressions | 1978 | SIGMOD | 0.00034574497 |
| 525 | The Chase Revisited | 2008 | PODS | 0.00017118255 |
| 874 | On the Decidability and Complexity of Query Answering over Inconsistent and Incomplete Databases | 2003 | PODS | 0.00013481551 |
| 1,541 | Generalized Schema-Mappings: From Termination To Tractability | 2009 | PODS | 0.00010427058 |
| 2,634 | Benchmarking the Chase | 2017 | PODS | 8.3210907e-05 |
| 4,750 | That's All Folks! LLUNATIC Goes Open Source | 2014 | VLDB | 6.5247192e-05 |
| 8,236 | PDQ: Proof-driven Query Answering over Web-based Data | 2014 | VLDB | 5.460452e-05 |
| 9,195 | Semi-Oblivious Chase Termination for Linear Existential Rules: An Experimental Study | 2023 | VLDB | 5.3058708e-05 |
| 9,196 | Non-Uniformly Terminating Chase: Size and Complexity | 2022 | PODS | 5.3058708e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 11,366 | Bounded Treewidth and the Infinite Core Chase: Complications and Workarounds toward Decidable Querying | 2023 | PODS |
| 2 | 10,649 | Restricted Chase Termination: You Want More than Fairness | 2025 | PODS |
| 3 | 525 | The Chase Revisited | 2008 | PODS |
| 4 | 7,045 | Exploiting Equality Generating Dependencies in Checking Chase Termination | 2016 | VLDB |
| 5 | 11,584 | Rewriting the Infinite Chase | 2022 | VLDB |
| 6 | 11,750 | All-Instances Restricted Chase Termination | 2020 | PODS |
| 7 | 3,247 | On Chase Termination Beyond Stratification | 2009 | VLDB |
| 8 | 9,195 | Semi-Oblivious Chase Termination for Linear Existential Rules: An Experimental Study | 2023 | VLDB |
| 9 | 4,353 | Chase Termination for Guarded Existential Rules | 2015 | PODS |
| 10 | 9,196 | Non-Uniformly Terminating Chase: Size and Complexity | 2022 | PODS |