Some results about normal forms for functional dependency in the relational datamodel

DOI10.1016/0166-218X(95)00076-4zbMath0855.68025MaRDI QIDQ1923601

Vu Duc Thi, Janos Demetrovics

Publication date: 25 November 1996

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

zbMATH Keywords

polynomial-time algorithmBoyce-Codd normal formSperner systemrelation schemes

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (2)

Closure via functional dependence simplification ⋮ Non-deterministic ideal operators: an adequate tool for formalization in data bases

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Design by example: An application of Armstrong relations
• The poset of closures as a model of changing databases
• Candidate keys for relations
• Testing for existence of a covering Boyce-Codd normal form
• On the Structure of Armstrong Relations for Functional Dependencies
• Minimum Covers in Relational Database Model

This page was built for publication: Some results about normal forms for functional dependency in the relational datamodel