arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0601043cs.AIcs.LO
收藏

结合关系代数、SQL、约束建模和局部搜索

Combining Relational Algebra, SQL, Constraint Modelling, and Local Search

Marco Cadoli, Toni Mancini

摘要:

本文的目标是提供一个强大的约束建模和关系数据库管理系统之间的集成。为此,我们建议扩展标准的查询语言,如关系代数和SQL,通过添加约束建模功能。特别是,我们提出了两种语言,这是特别适合于组合问题的非确定性扩展。非确定性是通过猜测算子引入的,它声明一组关系具有任意扩展。这个新的运算符导致语言具有更高的表达能力,能够表达复杂性类NP中的所有问题。给出了使数据复杂度多项式化的一些语法限制。这两个扩展的有效性证明了通过几个例子。目前的实现,用Java编写的本地搜索技术,描述。逻辑程序设计理论与实践(Theory and Practice of Logic Programming,TPLP)

英文摘要:

The goal of this paper is to provide a strong integration between constraint modelling and relational DBMSs. To this end we propose extensions of standard query languages such as relational algebra and SQL, by adding constraint modelling capabilities to them. In particular, we propose non-deterministic extensions of both languages, which are specially suited for combinatorial problems. Non-determinism is introduced by means of a guessing operator, which declares a set of relations to have an arbitrary extension. This new operator results in languages with higher expressive power, able to express all problems in the complexity class NP. Some syntactical restrictions which make data complexity polynomial are shown. The effectiveness of both extensions is demonstrated by means of several examples. The current implementation, written in Java using local search techniques, is described. To appear in Theory and Practice of Logic Programming (TPLP)

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

↑