Integrating Datalog and Constraint Solving

TL;DR

This paper explores the relationship between Datalog and constraint programming at the implementation level, demonstrating how to derive an efficient Datalog execution algorithm from a generic constraint programming scheme.

Contribution

It presents a novel method to connect Datalog's execution algorithm with constraint programming, enhancing understanding of their practical integration.

Findings

Derived Leapfrog Triejoin algorithm from a generic CP scheme

Established implementation-level correspondence between Datalog and CSP

Improved efficiency insights for Datalog execution

Abstract

LP is a common formalism for the field of databases and CSP, both at the theoretical level and the implementation level in the form of Datalog and CLP. In the past, close correspondences have been made between both fields at the theoretical level. Yet correspondence at the implementation level has been much less explored. In this article we work towards relating them at the implementation level. Concretely, we show how to derive the efficient Leapfrog Triejoin execution algorithm of Datalog from a generic CP execution scheme.