Database Paper Browser

Back to papers

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)

Paper ID
13128
Venue
VLDB
Year
2023
Pagerank
4.4039656e-05
Overall Rank
9,045 | 37.08%
DOI
10.14778/3611479.3611493

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
10,908 Chase Termination Beyond Polynomial Time 2024 PODS 4.1945683e-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
38 Testing Implications Of Data Dependencies 1979 SIGMOD 0.00075110004
58 Efficient Optimization of a Class of Relational Expressions 1978 SIGMOD 0.00064826446
698 The Chase Revisited 2008 PODS 0.00018030148
1,736 Generalized Schema-Mappings: From Termination To Tractability 2009 PODS 0.00010720323
1,883 The iBench Integration Metadata Generator 2016 VLDB 0.00010215862
3,004 Benchmarking the Chase 2017 PODS 7.7314538e-05
9,046 Non-Uniformly Terminating Chase: Size and Complexity 2022 PODS 4.4039656e-05
Previous Page 1 / 1 Next

Semantically Similar Papers