Rewriting the Infinite Chase
Summary: Recasts query answering under guarded TGDs as practical Datalog rewriting, identifying shortcut rules that bypass chase steps. Provides chase-simulation algorithms and implementation techniques, with experiments showing scalability on complex synthetic and real-world dependencies. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Michael Benedikt (University of Oxford)
- 2. Maxime Buron (INRIA; Laboratory of Computer Science, Robotics and Microelectronics of Montpellier; University of Montpellier)
- 3. Stefano Germano (University of Oxford)
- 4. Kevin Kappelmann (Technical University of Munich)
- 5. Boris Motik (University of Oxford)
BibTeX Citation
@article{benedikt_vldb22,
title = {{Rewriting the Infinite Chase}},
author = {Benedikt, Michael and Buron, Maxime and Germano, Stefano and Kappelmann, Kevin and Motik, Boris},
journal = {PVLDB},
series = {{VLDB} '22},
volume = {15},
number = {11},
pages = {3045--3057},
doi = {10.14778/3551793.3551851},
url = {https://doi.org/10.14778/3551793.3551851},
year = {2022}
}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 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 136 | Testing Containment of Conjunctive Queries Under Functional and Inclusion Dependencies (Extended Abstract) | 1982 | PODS | 0.0002972645 |
| 824 | Data Integration: The Teenage Years | 2006 | VLDB | 0.00013641217 |
| 2,675 | Benchmarking the Chase | 2017 | PODS | 8.1442721e-05 |
| 4,246 | Queries with Guarded Negation | 2012 | VLDB | 6.7032723e-05 |
| 5,037 | The Vadalog System: Datalog-based Reasoning for Knowledge Graphs | 2018 | VLDB | 6.3008628e-05 |
| 6,919 | Expressiveness of Guarded Existential Rule Languages | 2014 | PODS | 5.6435526e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 9,384 | Semi-Oblivious Chase Termination for Linear Existential Rules: An Experimental Study | 2023 | VLDB |
| 2 | 539 | The Chase Revisited | 2008 | PODS |
| 3 | 6,886 | Stratification Criteria and Rewriting Techniques for Checking Chase Termination | 2011 | VLDB |
| 4 | 9,709 | Exploiting the Power of Equality-generating Dependencies in Ontological Reasoning | 2022 | VLDB |
| 5 | 3,324 | On Chase Termination Beyond Stratification | 2009 | VLDB |
| 6 | 12,059 | All-Instances Restricted Chase Termination | 2020 | PODS |
| 7 | 9,385 | Non-Uniformly Terminating Chase: Size and Complexity | 2022 | PODS |
| 8 | 2,647 | Chasing Constrained Tuple-Generating Dependencies | 1996 | PODS |
| 9 | 4,447 | Chase Termination for Guarded Existential Rules | 2015 | PODS |
| 10 | 11,483 | Chase Termination Beyond Polynomial Time | 2024 | PODS |