The characterization of branching dependencies
From MaRDI portal
Publication:1202887
DOI10.1016/0166-218X(92)90027-8zbMath0767.68030OpenAlexW2047921246WikidataQ114684114 ScholiaQ114684114MaRDI QIDQ1202887
Attila Sali, Janos Demetrovics, Gyula O. H. Katona
Publication date: 31 January 1993
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(92)90027-8
Related Items
New type of coding problem motivated by database theory, A survey of some combinatorial results concerning functional dependencies in database relations., SPT(q, k, n)-Codes, Codes that attain minimum distance in every possible direction, Optimal Codes in the Enomoto-Katona Space, Constructing Armstrong tables for general cardinality constraints and not-null constraints, Checking inference-proofness of attribute-disjoint and duplicate-preserving fragmentations, On the Existence of Armstrong Instances with Bounded Domains, Coding Theory Motivated by Relational Databases, Design type problems motivated by database theory
Cites Work