The Chase Revisited
Summary: Shows standard chase termination is undecidable and provides strictly improved sufficient termination criteria. Defines F‑universal model sets and a complete extended‑core chase that uniformly handles mapping classes (incl. existential/∀∃ FO), restoring completeness for containment, implication, and certain‑answer computation. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Alin Deutsch (University of California San Diego)
- 2. Alan Nash (IBM; Tradeworx)
- 3. Jeff Remmel (University of California San Diego)
BibTeX Citation
@inproceedings{deutsch_pods08,
address = {New York, NY, USA},
series = {{PODS} '08},
title = {{The Chase Revisited}},
url = {https://dl.acm.org/doi/10.1145/1376916.1376938},
doi = {10.1145/1376916.1376938},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Deutsch, Alin and Nash, Alan and Remmel, Jeff},
year = {2008}
}Incoming Citations (Sorted by Pagerank)
Showing 36 of 36 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 22 | Data Integration: A Theoretical Perspective | 2002 | PODS | 0.00056204792 |
| 40 | Testing Implications Of Data Dependencies | 1979 | SIGMOD | 0.00046918506 |
| 225 | Complexity of Answering Queries Using Materialized Views | 1998 | PODS | 0.00024101949 |
| 377 | Data Exchange: Getting to the Core | 2003 | PODS | 0.00019643793 |
| 879 | Constraint-Based XML Query Rewriting for Data Integration | 2004 | SIGMOD | 0.00013456577 |
| 1,317 | MARS: A System for Publishing XML from Mixed and Redundant Storage | 2003 | VLDB | 0.00011179293 |
| 2,510 | Peer Data Exchange | 2005 | PODS | 8.4855313e-05 |
| 3,302 | Data Exchange: Computing Cores in Polynomial Time | 2006 | PODS | 7.5406585e-05 |
| 3,485 | The Complexity of Data Exchange | 2006 | PODS | 7.3703451e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 6,740 | Stratification Criteria and Rewriting Techniques for Checking Chase Termination | 2011 | VLDB |
| 2 | 9,196 | Non-Uniformly Terminating Chase: Size and Complexity | 2022 | PODS |
| 3 | 11,129 | Chase Termination Beyond Polynomial Time | 2024 | PODS |
| 4 | 11,366 | Bounded Treewidth and the Infinite Core Chase: Complications and Workarounds toward Decidable Querying | 2023 | PODS |
| 5 | 9,195 | Semi-Oblivious Chase Termination for Linear Existential Rules: An Experimental Study | 2023 | VLDB |
| 6 | 11,750 | All-Instances Restricted Chase Termination | 2020 | PODS |
| 7 | 4,353 | Chase Termination for Guarded Existential Rules | 2015 | PODS |
| 8 | 10,649 | Restricted Chase Termination: You Want More than Fairness | 2025 | PODS |
| 9 | 8,779 | Chase Termination: A Constraints Rewriting Approach | 2010 | VLDB |
| 10 | 3,247 | On Chase Termination Beyond Stratification | 2009 | VLDB |