Functional dependencies in relational databases: A lattice point of view

DOI10.1016/0166-218X(92)90028-9zbMath0767.68029WikidataQ114684113 ScholiaQ114684113MaRDI QIDQ1202888

Ilya B. Muchnik, Janos Demetrovics, Leonid O. Libkin

Publication date: 31 January 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

relational databasesfunctional dependencies

Mathematics Subject Classification ID

Database theory (68P15) Semilattices (06A12)

Related Items

The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey ⋮ Recursive decomposition and bounds of the lattice of Moore co-families. ⋮ Unnamed Item ⋮ Horn axiomatizations for sequential data ⋮ Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements ⋮ The presence of lattice theory in discrete problems of mathematical social sciences. Why. ⋮ A dimension-related metric on the lattice of knowledge spaces ⋮ On critical sets of a finite Moore family ⋮ Quasi-concave functions on meet-semilattices ⋮ Some problems concerning keys for relation schemes and relations in the relational datamodel ⋮ Recursive decomposition tree of a Moore co-family and closure algorithm. ⋮ Non-deterministic ideal operators: an adequate tool for formalization in data bases ⋮ Constructing Armstrong tables for general cardinality constraints and not-null constraints ⋮ Contact, closure, topology, and the linking of row and column types of relations ⋮ Functional and approximate dependency mining: database and FCA points of view ⋮ On the Merge of Factor Canonical Bases ⋮ Link key candidate extraction with relational concept analysis ⋮ Computing and Visualizing Closure Objects Using Relation Algebra and RelView ⋮ A study of algorithms relating distributive lattices, median graphs, and Formal Concept Analysis ⋮ Moore systems and Moore convergence classes of families of nets ⋮ Enumerating maximal consistent closed sets in closure systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Design by example: An application of Armstrong relations
• Convexity lattices
• The theory of convex geometries
• Minimum matrix representation of closure operations
• A property of algebraic lattices whose compact elements have complements
• Biatomic lattices
• The poset of closures as a model of changing databases
• On the size of nonredundant FD-covers
• Boyce-Codd normal form and object normal forms
• Bisemilattices of subsemilattices
• The complexity of recognizing 3NF relation schemes
• Parallel axiom in convexity lattices
• Extremal properties of collections of subsets containing no two sets and their union
• Candidate keys for relations
• Contribution to the theory of data base relations
• Minimal sets of choice functions generating the basic classes
• On the Structure of Armstrong Relations for Functional Dependencies
• Candidate Keys and Antichains
• A relational model of data for large shared data banks
• Maximal Sublattices of Finite Distributive Lattices. II