English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The chase procedure is a fundamental algorithmic tool in databases thatallows us to reason with constraints, such as existential rules, with aplethora of applications. It takes as input a database and a set ofconstraints, and iteratively completes the database as dictated by theconstraints. A key challenge, though, is the fact that it may not terminate,which leads to the problem of checking whether it terminates given a databaseand a set of constraints. In this work, we focus on the semi-oblivious versionof the chase, which is well-suited for practical implementations, and linearexistential rules, a central class of constraints with several applications. Inthis setting, there is a mature body of theoretical work that providessyntactic characterizations of when the chase terminates, algorithms forchecking chase termination, precise complexity results, and worst-case optimalbounds on the size of the result of the chase (whenever is finite). Our mainobjective is to experimentally evaluate the existing chase terminationalgorithms with the aim of understanding which input parameters affect theirperformance, clarifying whether they can be used in practice, and revealingtheir performance limitations.

Semi-Oblivious Chase Termination for Linear Existential Rules: An Experimental Study