The complexity of recognizing 3NF relation schemes

DOI10.1016/0020-0190(82)90034-5zbMath0488.68062OpenAlexW2022890809MaRDI QIDQ1166279

Jiann H. Jou, Patrick C. Fischer

Publication date: 1982

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(82)90034-5

zbMATH Keywords

relational databaseBoyce-Codd normal formthird normal form

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (4)

Succinctness in dependency systems ⋮ Polynomial tests of normal forms and some related results ⋮ Functional dependencies in relational databases: A lattice point of view ⋮ An efficient algorithm for 3NF determination

Cites Work

• On the complexity of finding the set of candidate keys for a given set of functional dependencies
• Candidate keys for relations
• Testing for existence of a covering Boyce-Codd normal form
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The complexity of recognizing 3NF relation schemes