arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1404.4468cs.DBcs.LO
收藏

关于独立原子和键

On Independence Atoms and Keys

Miika Hannula, Juha Kontinen, Sebastian Link

摘要:

唯一性和独立性是数据的两个基本属性。它们在数据库系统中的实施可以导致更高质量的数据、更快的数据服务响应时间、更好的数据驱动决策和从数据中发现知识。通过对密钥和独立原子的隐含问题提供有效的解决方案,可以有效地解锁应用程序。事实上,对于唯一的一类键和唯一的一类独立原子,相关的有限和一般蕴涵问题重合,并享有简单的公理化。然而,当密钥和独立原子结合时,情况发生了巨大的变化。我们表明,有限和一般的蕴涵问题已经不同的关键和一元独立原子。此外,我们建立了一般蕴涵问题的有限公理化,并证明了有限蕴涵问题对任何k都不具有k元公理化。

英文摘要:

Uniqueness and independence are two fundamental properties of data. Their enforcement in database systems can lead to higher quality data, faster data service response time, better data-driven decision making and knowledge discovery from data. The applications can be effectively unlocked by providing efficient solutions to the underlying implication problems of keys and independence atoms. Indeed, for the sole class of keys and the sole class of independence atoms the associated finite and general implication problems coincide and enjoy simple axiomatizations. However, the situation changes drastically when keys and independence atoms are combined. We show that the finite and the general implication problems are already different for keys and unary independence atoms. Furthermore, we establish a finite axiomatization for the general implication problem, and show that the finite implication problem does not enjoy a k-ary axiomatization for any k.

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

↑