Converging to the Chase - a Tool for Finite Controllability

TL;DR

This paper proves that Sticky Datalog, a logic programming language within the Datalog± framework, has the finite controllability property by developing a novel approximation technique for the Chase procedure.

Contribution

It introduces a new method for approximating the Chase with finite models, establishing finite controllability for Sticky Datalog.

Findings

Proves finite controllability of Sticky Datalog.

Develops a technique to approximate Chase with finite models.

Provides a foundation for further applications in database theory.

Abstract

We solve a problem, stated in [CGP10], showing that Sticky Datalog, defined in the cited paper as an element of the Datalog\pm project, has the finite controllability property. In order to do that, we develop a technique, which we believe can have further applications, of approximating Chase(D, T), for a database instance D and some sets of tuple generating dependencies T, by an infinite sequence of finite structures, all of them being models of T.