Approximating Constraint Propagation in Datalog
Programming Languages
2011-12-19 v1
Abstract
We present a technique exploiting Datalog with aggregates to improve the performance of programs with arithmetic (in)equalities. Our 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, our technique improves upon the previously reported in the literature constraint magic set transformation approach.
Cite
@article{arxiv.1112.3787,
title = {Approximating Constraint Propagation in Datalog},
author = {Dario Campagna and Beata Sarna-Starosta and Tom Schrijvers},
journal= {arXiv preprint arXiv:1112.3787},
year = {2011}
}
Comments
Online Proceedings of the 11th International Colloquium on Implementation of Constraint LOgic Programming Systems (CICLOPS 2011), Lexington, KY, U.S.A., July 10, 2011