An efficient algorithm for 3NF determination

DOI10.1016/j.ins.2003.06.004zbMath1094.68560OpenAlexW1975110618MaRDI QIDQ558039

Peter B. Worland

Publication date: 30 June 2005

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2003.06.004

zbMATH Keywords

Candidate keyClosureFunctional dependencyPrime attributeRelationSuperkeyThird normal form

Mathematics Subject Classification ID

Database theory (68P15) Nonnumerical algorithms (68W05)

Cites Work

• Unnamed Item
• The complexity of recognizing 3NF relation schemes
• Candidate keys for relations
• Graph Algorithms for Functional Dependency Manipulation
• An Efficient Algorithm to Compute the Candidate Keys of a Relational Database Schema

This page was built for publication: An efficient algorithm for 3NF determination