On the number of maximal dependencies in a data base relation of fixed order

DOI10.1016/0012-365X(80)90108-9zbMath0452.68098OpenAlexW1976130757WikidataQ114686149 ScholiaQ114686149MaRDI QIDQ1148702

A. Bekessy, L. Hannak, Peter Frankl, Gyula O. H. Katona, Janos Demetrovics

Publication date: 1980

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

Full work available at URL: https://doi.org/10.1016/0012-365x(80)90108-9

zbMATH Keywords

functional dependencymaximal elementsdata base relation

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Information storage and retrieval of data (68P20) Discrete mathematics in relation to computer science (68R99)

Related Items (8)

Extremal problems in relational data bases ⋮ A survey of some combinatorial results concerning functional dependencies in database relations. ⋮ Functional dependencies among Boolean dependencies ⋮ Asymptotic properties of keys and functional dependencies in random databases ⋮ The number of keys in relational and nested relational databases ⋮ Some generalized type functional dependencies formalized as equality set on matrices ⋮ Axiomatization of generalized functional dependences in relational data bases ⋮ Minimum matrix representation of closure operations

Cites Work

• Unnamed Item
• Contribution to the theory of data base relations
• A relational model of data for large shared data banks

This page was built for publication: On the number of maximal dependencies in a data base relation of fixed order