Bläsius, Thomas ;
Friedrich, Tobias ;
Schirneck, Martin
The Parameterized Complexity of Dependency Detection in Relational Databases
Abstract
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.
BibTeX - Entry
@InProceedings{blsius_et_al:LIPIcs:2017:6920,
author = {Thomas Bl{\"a}sius and Tobias Friedrich and Martin Schirneck},
title = {{The Parameterized Complexity of Dependency Detection in Relational Databases}},
booktitle = {11th International Symposium on Parameterized and Exact Computation (IPEC 2016)},
pages = {6:1--6:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-023-1},
ISSN = {1868-8969},
year = {2017},
volume = {63},
editor = {Jiong Guo and Danny Hermelin},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/6920},
URN = {urn:nbn:de:0030-drops-69202},
doi = {10.4230/LIPIcs.IPEC.2016.6},
annote = {Keywords: parameterized complexity, unique column combination, functional dependency, inclusion dependency, profiling relational data}
}
|
Keywords: |
|
parameterized complexity, unique column combination, functional dependency, inclusion dependency, profiling relational data |
|
Seminar: |
|
11th International Symposium on Parameterized and Exact Computation (IPEC 2016)
|
|
Issue date: |
|
2017 |
|
Date of publication: |
|
2017 |
2017
