Some generalized type functional dependencies formalized as equality set on matrices

DOI10.1016/0166-218X(83)90098-7zbMath0534.68068OpenAlexW2070963424WikidataQ114684116 ScholiaQ114684116MaRDI QIDQ790628

Gy. Gyepesi, Janos Demetrovics

Publication date: 1983

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

Full work available at URL: https://doi.org/10.1016/0166-218x(83)90098-7

zbMATH Keywords

functional dependenciescandidate keyequality- sets of matricesrelational data bases

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items

Positive Boolean dependencies ⋮ On a general class of data dependencies in the relational model and its implication problems

Cites Work

• Unnamed Item
• Unnamed Item
• On the number of maximal dependencies in a data base relation of fixed order
• On the complexity of finding the set of candidate keys for a given set of functional dependencies
• Contribution to the theory of data base relations
• Candidate Keys and Antichains
• On Axiomatizing Multivalued Dependencies in Relational Databases
• On a Combinatorial Problem of Erdos
• A relational model of data for large shared data banks
• Decomposition of a Data Base and the Theory of Boolean Switching Functions

This page was built for publication: Some generalized type functional dependencies formalized as equality set on matrices