全限制追踪终止
All-Instances Restricted Chase Termination
摘要:
Chase过程是数据库理论中的一个基本算法工具,具有多种应用。关于追逐过程的一个关键问题是所有实例的终止:对于一组给定的元组生成依赖(TGD),追逐是否对每个输入数据库都终止?鉴于这个问题是不可判定的,很自然地要问,已知的行为良好的TGD类是否确保可判定性。我们在这里考虑的主要范式,导致强大的基于TGD的形式主义,即,guardedness和粘性。虽然所有实例终止对于不经意的追逐版本来说是很好理解的,但更微妙的限制(也称为标准)追逐是相当未探索的。我们发现,所有的情况下,限制追逐终止守卫和粘性单头TGD是可判定的。
英文摘要:
The chase procedure is a fundamental algorithmic tool in database theory with a variety of applications. A key problem concerning the chase procedure is all-instances termination: for a given set of tuple-generating dependencies (TGDs), is it the case that the chase terminates for every input database? In view of the fact that this problem is undecidable, it is natural to ask whether known well-behaved classes of TGDs ensure decidability. We consider here the main paradigms that led to robust TGD-based formalisms, that is, guardedness and stickiness. Although all-instances termination is well-understood for the oblivious version of the chase, the more subtle case of the restricted (a.k.a. the standard) chase is rather unexplored. We show that all-instances restricted chase termination for guarded and sticky single-head TGDs is decidable.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。