scientific article
From MaRDI portal
Publication:4023862
zbMath0777.68014MaRDI QIDQ4023862
Heikki Mannila, Kari-Jouko Raeihae
Publication date: 23 January 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
query languagesdatabase designphysical designschema transformationobject-oriented data modelsrelational data modellogical designentity-relationship model
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Database theory (68P15)
Related Items (32)
Computing Dependencies Using FCA ⋮ Attribute-incremental construction of the canonical implication basis ⋮ Lattices, closures systems and implication bases: a survey of structural aspects and algorithms ⋮ Discovering functional and inclusion dependencies in relational databases ⋮ Asymptotic properties of keys and functional dependencies in random databases ⋮ Some Remarks on Relational Database Schemes Having Few Minimal Keys ⋮ BCNF via Attribute Splitting ⋮ Computations with finite closure systems and implications ⋮ Controlling entity integrity with key sets ⋮ Three views on dependency covers from an FCA perspective ⋮ Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements ⋮ Autonomous sets for the hypergraph of all canonical covers ⋮ Tableaux for functional dependencies and independencies ⋮ Output-polynomial enumeration of all fixed-cardinality ideals of a poset, respectively all fixed-cardinality subtrees of a tree. ⋮ Approximate inference of functional dependencies from relations ⋮ Some decision and counting problems of the Duquenne-Guigues basis of implications ⋮ Closure via functional dependence simplification ⋮ The joy of implications, aka pure Horn formulas: mainly a survey ⋮ Succinctness and tractability of closure operator representations ⋮ Optimizations in computing the Duquenne-Guigues basis of implications ⋮ Functional dependencies are helpful for partial materialization of data cubes ⋮ The multiple facets of the canonical direct unit implicational basis ⋮ Guaranteeing no interaction between functional dependencies and tree-like inclusion dependencies ⋮ Functional and approximate dependency mining: database and FCA points of view ⋮ Minimal-change integrity maintenance using tuple deletions ⋮ Normal forms and syntactic completeness proofs for functional independencies ⋮ Translating between the representations of a ranked convex geometry ⋮ Inclusion dependencies and their interaction with functional dependencies in SQL ⋮ Characterizing approximate-matching dependencies in formal concept analysis with pattern structures ⋮ On Dependence Logic ⋮ Horn approximations of empirical data ⋮ On functional dependencies in \(q\)-Horn theories
This page was built for publication:
