Database Paper Browser

Back to papers

Rewriting the Infinite Chase

Summary: GTGDs rewritten as Datalog with shortcut rules that skip chase steps, enabling queries without the infinite chase. We present algorithms to compute rewritings by simulating chase steps, with guidance and empirical validation on GTGD benchmarks. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
12786
Venue
VLDB
Year
2022
Pagerank
4.1945683e-05
Overall Rank
11,386 | 20.79%
DOI
10.14778/3551793.3551851

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 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
144 Testing Containment of Conjunctive Queries Under Functional and Inclusion Dependencies (Extended Abstract) 1982 PODS 0.00041462501
893 Data Integration: The Teenage Years 2006 VLDB 0.00015558352
3,004 Benchmarking the Chase 2017 PODS 7.7314538e-05
5,057 Queries with Guarded Negation 2012 VLDB 5.7294436e-05
5,165 The Vadalog System: Datalog-based Reasoning for Knowledge Graphs 2018 VLDB 5.6529675e-05
7,956 Expressiveness of Guarded Existential Rule Languages 2014 PODS 4.613363e-05
Previous Page 1 / 1 Next

Semantically Similar Papers