文章基本信息

标题：The Parameterized Complexity of Dependency Detection in Relational Databases
本地全文：下载
作者：Thomas Bl{\"a}sius ; Tobias Friedrich ; Martin Schirneck 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2016
卷号：63
页码：6:1-6:13
DOI：10.4230/LIPIcs.IPEC.2016.6
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：We study the parameterized complexity of classical problems that arise in the profiling of relational data. Namely, we characterize the complexity of detecting unique column combinations (candidate keys), functional dependencies, and inclusion dependencies with the solution size as parameter. While the discovery of uniques and functional dependencies, respectively, turns out to be W[2]-complete, the detection of inclusion dependencies is one of the first natural problems proven to be complete for the class W[3]. As a side effect, our reductions give insights into the complexity of enumerating all minimal unique column combinations or functional dependencies.
关键词：parameterized complexity; unique column combination; functional dependency; inclusion dependency; profiling relational data