An efficient algorithm for 3NF determination

DOI10.1016/J.INS.2003.06.004MaRDI QIDQ558039zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• An efficient algorithm for the 3-satisfiability problem
• An improved generator for 3-CNF formulas
• scientific article; zbMATH DE number 5613969
• scientific article; zbMATH DE number 515744
• Guided Search and a Faster Deterministic Algorithm for 3-SAT
• An efficient fixed-parameter algorithm for 3-hitting set
• A numerical approach to 3-SAT
• Algorithms for \((n,3)\)-MAXSAT and parameterization above the all-true assignment
• An algorithm for reducibility of 3-arrangements
• Improved polynomial algorithm for 3-SAT

Cites work

• scientific article; zbMATH DE number 4043324 (Why is no real title available?)
• An Efficient Algorithm to Compute the Candidate Keys of a Relational Database Schema
• Candidate keys for relations
• Graph Algorithms for Functional Dependency Manipulation
• The complexity of recognizing 3NF relation schemes

Cited in

(3)

• scientific article; zbMATH DE number 5613969 (Why is no real title available?)
• Efficient algorithms for three variants of the LPF table
• scientific article; zbMATH DE number 1927179 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q558039)