Semi-Oblivious Chase Termination for Linear Existential Rules: An Experimental Study
Summary: Comprehensive experimental evaluation of semi-oblivious chase termination algorithms for linear existential rules, bridging mature theoretical characterizations and practical implementation concerns. Measures how input parameters affect performance and scalability, exposing practical bottlenecks of existing decision procedures and guiding when syntactic termination tests are usable in practice. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Marco Calautti (University of Milan)
- 2. Mostafa Milani (University of Western Ontario)
- 3. Andreas Pieris (University of Cyprus; University of Edinburgh)
BibTeX Citation
@article{calautti_vldb23,
title = {{Semi-Oblivious Chase Termination for Linear Existential Rules: An Experimental Study}},
author = {Calautti, Marco and Milani, Mostafa and Pieris, Andreas},
journal = {PVLDB},
series = {{VLDB} '23},
volume = {16},
number = {11},
pages = {2858--2870},
doi = {10.14778/3611479.3611493},
url = {https://doi.org/10.14778/3611479.3611493},
year = {2023}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11,129 | Chase Termination Beyond Polynomial Time | 2024 | PODS | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 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 |
| 1,541 | Generalized Schema-Mappings: From Termination To Tractability | 2009 | PODS | 0.00010427058 |
| 1,652 | The iBench Integration Metadata Generator | 2016 | VLDB | 0.00010109142 |
| 2,634 | Benchmarking the Chase | 2017 | PODS | 8.3210907e-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 | 7,045 | Exploiting Equality Generating Dependencies in Checking Chase Termination | 2016 | VLDB |
| 2 | 11,366 | Bounded Treewidth and the Infinite Core Chase: Complications and Workarounds toward Decidable Querying | 2023 | PODS |
| 3 | 11,750 | All-Instances Restricted Chase Termination | 2020 | PODS |
| 4 | 525 | The Chase Revisited | 2008 | PODS |
| 5 | 8,779 | Chase Termination: A Constraints Rewriting Approach | 2010 | VLDB |
| 6 | 11,129 | Chase Termination Beyond Polynomial Time | 2024 | PODS |
| 7 | 10,649 | Restricted Chase Termination: You Want More than Fairness | 2025 | PODS |
| 8 | 3,247 | On Chase Termination Beyond Stratification | 2009 | VLDB |
| 9 | 9,196 | Non-Uniformly Terminating Chase: Size and Complexity | 2022 | PODS |
| 10 | 4,353 | Chase Termination for Guarded Existential Rules | 2015 | PODS |