Advanced search
1 file | 295.51 KB
Author
Organization
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.
Keywords
Prolog, query optimization, Datalog, logic programming, databases, program transformation, business rules, constraint programming

Downloads

  • paper.pdf
    • full text
    • |
    • open access
    • |
    • PDF
    • |
    • 295.51 KB

Citation

Please use this url to cite or link to this publication:

Chicago
Campagna, Dario, Beata Sarna-Starosta, and Tom Schrijvers. 2011. “Approximating Constraint Propagation in Datalog.” In Proceedings of CICLOPS 2011 : 11th International Colloquium on Implementation of Constraint and Logic Programming Systems, ed. Salvador Abreu and Vitor Santos Costa.
APA
Campagna, D., Sarna-Starosta, B., & Schrijvers, T. (2011). Approximating constraint propagation in Datalog. In S. Abreu & V. Santos Costa (Eds.), Proceedings of CICLOPS 2011 : 11th international colloquium on implementation of constraint and logic programming systems. Presented at the 11th International colloquium on Implementation of Constraint and Logic Programming Systems.
Vancouver
1.
Campagna D, Sarna-Starosta B, Schrijvers T. Approximating constraint propagation in Datalog. In: Abreu S, Santos Costa V, editors. Proceedings of CICLOPS 2011 : 11th international colloquium on implementation of constraint and logic programming systems. 2011.
MLA
Campagna, Dario, Beata Sarna-Starosta, and Tom Schrijvers. “Approximating Constraint Propagation in Datalog.” Proceedings of CICLOPS 2011 : 11th International Colloquium on Implementation of Constraint and Logic Programming Systems. Ed. Salvador Abreu & Vitor Santos Costa. 2011. Print.
@inproceedings{1259252,
  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.},
  author       = {Campagna, Dario and Sarna-Starosta, Beata and Schrijvers, Tom},
  booktitle    = {Proceedings of CICLOPS 2011 : 11th international colloquium on implementation of constraint and logic programming systems},
  editor       = {Abreu, Salvador and Santos Costa, Vitor},
  keyword      = {Prolog,query optimization,Datalog,logic programming,databases,program transformation,business rules,constraint programming},
  language     = {eng},
  location     = {Lexington, KY, USA},
  pages        = {16},
  title        = {Approximating constraint propagation in Datalog},
  url          = {http://arxiv.org/html/1112.4993v1},
  year         = {2011},
}