arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1112.3787cs.PL
收藏

数据库中约束传播的逼近

Approximating Constraint Propagation in Datalog

Dario Campagna, Beata Sarna-Starosta, Tom Schrijvers

摘要:

我们提出了一种技术,利用数据库与聚合,以提高性能的程序与算术(在)平等。我们的方法采用了一个源到源程序的转换,它近似于约束编程的传播技术。该方法的实验评估表明,良好的运行时间加速范围内的非递归以及递归程序。此外,我们的技术改进了文献中先前报道的约束魔集变换方法。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑