scientific article; zbMATH DE number 6857802
From MaRDI portal
Publication:4634389
DOI10.4230/LIPIcs.IPEC.2016.6zbMath1398.68215MaRDI QIDQ4634389
Thomas Bläsius, Tobias Friedrich, Martin Schirneck
Publication date: 10 April 2018
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
functional dependencyinclusion dependencyparameterized complexityunique column combinationprofiling relational data
Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (7)
Controlling entity integrity with key sets ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Parameterised complexity of model checking and satisfiability in propositional dependence logic ⋮ Efficiently enumerating hitting sets of hypergraphs arising in data profiling ⋮ The complexity of dependency detection and discovery in relational databases ⋮ Possibilistic keys
This page was built for publication:
