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

具有目标约束的组合

Composition with Target Constraints

Marcelo Arenas, Ronald Fagin, Alan Nash

摘要:

众所周知,模式映射的组合,每个由源到目标tgds(st-tgds)指定,可以由二阶tgd(SO tgd)指定。我们考虑的问题时,会发生什么目标的限制是允许的。具体来说,我们考虑的问题,指定的标准模式映射的组合(那些指定的st-tgds,目标egds,和一个弱非循环的目标tgds集)。我们表明,SO tgds,即使与任意的源约束和目标约束的协助下,不能指定一般的两个标准模式映射的组成。因此,我们引入了源到目标的二阶依赖关系(st-SO依赖关系),它类似于SO tgds,但允许在结论中的方程。我们表明,ST-SO依赖(随着目标EGDS和目标TGDS)是足以表达的标准模式映射的每一个有限序列的组成,并进一步,每个ST-SO依赖指定这样的组合。除了这种表达能力,我们表明,ST-SO依赖享有其他可取的属性。特别是,它们具有生成普适解的多项式时间追踪。该通用解可用于在多项式时间内求出合取查询并的确定答案。很容易证明任意数量的标准模式映射的组合等价于仅两个标准模式映射的组合。我们发现,令人惊讶的是,类似的结果也适用于模式映射指定的只是ST-TGDS(没有目标约束)。这一点可以通过证明每个SO tgd都等价于一个非嵌套的SO tgd(一个没有函数符号嵌套的SO tgd)来证明。同样,我们证明了st-SO依赖的解嵌套结果,具有相同类型的后果。

英文摘要:

It is known that the composition of schema mappings, each specified by source-to-target tgds (st-tgds), can be specified by a second-order tgd (SO tgd). We consider the question of what happens when target constraints are allowed. Specifically, we consider the question of specifying the composition of standard schema mappings (those specified by st-tgds, target egds, and a weakly acyclic set of target tgds). We show that SO tgds, even with the assistance of arbitrary source constraints and target constraints, cannot specify in general the composition of two standard schema mappings. Therefore, we introduce source-to-target second-order dependencies (st-SO dependencies), which are similar to SO tgds, but allow equations in the conclusion. We show that st-SO dependencies (along with target egds and target tgds) are sufficient to express the composition of every finite sequence of standard schema mappings, and further, every st-SO dependency specifies such a composition. In addition to this expressive power, we show that st-SO dependencies enjoy other desirable properties. In particular, they have a polynomial-time chase that generates a universal solution. This universal solution can be used to find the certain answers to unions of conjunctive queries in polynomial time. It is easy to show that the composition of an arbitrary number of standard schema mappings is equivalent to the composition of only two standard schema mappings. We show that surprisingly, the analogous result holds also for schema mappings specified by just st-tgds (no target constraints). This is proven by showing that every SO tgd is equivalent to an unnested SO tgd (one where there is no nesting of function symbols). Similarly, we prove unnesting results for st-SO dependencies, with the same types of consequences.

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

↑