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

Errata注释:通过订单兼容性发现订单依赖关系

Errata Note: Discovering Order Dependencies through Order Compatibility

Parke Godfrey, Lukasz Golab, Mehdi Kargar, Divesh Srivastava, Jaroslaw Szlichta

摘要:

已经提出了对函数依赖的经典概念的许多扩展来表达和实施应用程序语义。这些扩展之一是顺序依赖性(OD),它表示涉及顺序的规则。Consonni等人的题为“通过顺序兼容性发现顺序兼容性”的文章,发表在2019年3月的EDBT会议论文集上,研究了OD发现问题。他们声称证明他们的OD发现算法OCDDISCOVER是完整的,并且在实践中比最先进的算法效率更高。他们进一步声称,现有的FASOD算法(我们的)的实现-我们与作者分享了我们的代码库-他们的基准是有缺陷的,因为OCDDISCOVER和FASOD在相同的数据集上报告了不同的OD集。在这个反驳中,我们表明,他们声称的完整性实际上是不正确的。OCDDISCOVER的修剪规则建立在他们不正确的声明上,过于激进,并修剪了包含合法OD的部分搜索空间。这就是为什么他们的方法在实践中似乎“更快”。最后,我们表明,Consonni等人误解了我们的基于集合的标准形式的OD,导致一个不正确的说法,我们的FASOD实现有一个错误。

英文摘要:

A number of extensions to the classical notion of functional dependencies have been proposed to express and enforce application semantics. One of these extensions is that of order dependencies (ODs), which express rules involving order. The article entitled "Discovering Order Dependencies through Order Compatibility" by Consonni et al., published in the EDBT conference proceedings in March 2019, investigates the OD discovery problem. They claim to prove that their OD discovery algorithm, OCDDISCOVER, is complete, as well as being significantly more efficient in practice than the state-of-the-art. They further claim that the implementation of the existing FASTOD algorithm (ours)-we shared our code base with the authors-which they benchmark against is flawed, as OCDDISCOVER and FASTOD report different sets of ODs over the same data sets. In this rebuttal, we show that their claim of completeness is, in fact, not true. Built upon their incorrect claim, OCDDISCOVER's pruning rules are overly aggressive, and prune parts of the search space that contain legitimate ODs. This is the reason their approach appears to be "faster" in practice. Finally, we show that Consonni et al. misinterpret our set-based canonical form for ODs, leading to an incorrect claim that our FASTOD implementation has an error.

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

↑