arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0911.0801cs.DScs.CCcs.DBcs.DM
收藏

用于约束满足和合取查询的易处理超图性质

Tractable hypergraph properties for constraint satisfaction and conjunctive queries

Dániel Marx

摘要:

约束满足问题研究中的一个重要问题是理解描述约束关联结构的图或超图对问题复杂性的影响。对于二进制CSP实例(即,其中每个约束仅涉及两个变量),情况很好理解:问题的复杂性基本上取决于约束图的树宽。然而,这是不正确的答案,如果约束与无限数量的变量是允许的,特别是,CSP实例所产生的查询评估问题,在数据库理论。形式上,如果H是一类超图,则令CSP(H)是限制于其超图在H中的实例的CSP。我们的目标是刻画那些类的超图,其中CSP(H)是多项式时间可解的或固定参数易处理的,参数化的变量的数量。注意,在与数据库查询评估相关的应用中,我们通常假设变量的数量远小于实例的大小,因此通过变量的数量进行参数化是一个有意义的问题。使CSP(H)多项式时间可解的H的最普遍的已知性质是有界分数超树宽度。本文引入了一个新的超图测度子模宽度,并证明了H的有界子模宽度蕴涵CSP(H)是固定参数易处理的。在匹配硬度的结果,我们表明,如果H有无界的子模宽度,那么CSP(H)是不是固定参数易处理的,除非指数时间假设失败。

英文摘要:

An important question in the study of constraint satisfaction problems (CSP) is understanding how the graph or hypergraph describing the incidence structure of the constraints influences the complexity of the problem. For binary CSP instances (i.e., where each constraint involves only two variables), the situation is well understood: the complexity of the problem essentially depends on the treewidth of the graph of the constraints. However, this is not the correct answer if constraints with unbounded number of variables are allowed, and in particular, for CSP instances arising from query evaluation problems in database theory. Formally, if H is a class of hypergraphs, then let CSP(H) be CSP restricted to instances whose hypergraph is in H. Our goal is to characterize those classes of hypergraphs for which CSP(H) is polynomial-time solvable or fixed-parameter tractable, parameterized by the number of variables. Note that in the applications related to database query evaluation, we usually assume that the number of variables is much smaller than the size of the instance, thus parameterization by the number of variables is a meaningful question. The most general known property of H that makes CSP(H) polynomial-time solvable is bounded fractional hypertree width. Here we introduce a new hypergraph measure called submodular width, and show that bounded submodular width of H implies that CSP(H) is fixed-parameter tractable. In a matching hardness result, we show that if H has unbounded submodular width, then CSP(H) is not fixed-parameter tractable, unless the Exponential Time Hypothesis fails.

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

↑