Approximating Constraint Propagation in Datalog

LogicBlox academic collaborators Tom Schrijvers, Dario Campagna, and Beata Sarna-Starosta discuss a new technique of exploiting Datalog with aggregates to improve the performance of programs with arithmetic (in)equalities. This approach employs a source-to-source program transformation which approximates the propagation technique from Constraint Programming. The experimental evaluation of the approach shows good run time speed-ups on a range of non-recursive as well as recursive programs. Furthermore, this technique improves upon the previously reported in the literature constraint magic set transformation approach.

0 Comments

Leave a reply

© Copyright 2020. Infor. All rights reserved.

Log in with your credentials

Forgot your details?