改写《无限追逐》
Rewriting the Infinite Chase
摘要：
保护元组生成依赖（GTGD）是描述逻辑和引用约束的自然扩展。人们早就知道，对GTGD的查询可以通过chase的一种变体来回答-这是一种典型的依赖推理技术。然而，很少有具体的算法，甚至更少的实施工作。为了解决这一差距，我们重新审视数据库重写方法的查询回答，GTGD被转换为一个数据库程序，需要在每个基本实例相同的基本事实。我们表明，重写可以被视为包含“捷径”规则，规避某些追逐步骤，我们提出了几种算法，计算重写模拟特定类型的追逐步骤，我们讨论了重要的实现问题。最后，我们的经验表明，我们的技术可以处理复杂的GTGD来自合成和真实的基准，因此适合于实际使用。
英文摘要：
Guarded tuple-generating dependencies (GTGDs) are a natural extension of description logics and referential constraints. It has long been known that queries over GTGDs can be answered by a variant of the chase - a quintessential technique for reasoning with dependencies. However, there has been little work on concrete algorithms and even less on implementation. To address this gap, we revisit Datalog rewriting approaches to query answering, where GTGDs are transformed to a Datalog program that entails the same base facts on each base instance. We show that the rewriting can be seen as containing "shortcut" rules that circumvent certain chase steps, we present several algorithms that compute the rewriting by simulating specific types of chase steps, and we discuss important implementation issues. Finally, we show empirically that our techniques can process complex GTGDs derived from synthetic and real benchmarks and are thus suitable for practical use.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
