An Efficient Algorithm to Compute the Candidate Keys of a Relational Database Schema

DOI10.1093/COMJNL/39.2.124MaRDI QIDQ4886686zbMATH OpenOpenAlexFDO

Authors Hossein Saiedian, Thomas H. Spencer

Publication date 11 December 1996

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/39.2.124

zbMATH Keywords

functional dependenciesrelational database

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• scientific article; zbMATH DE number 962407
• scientific article; zbMATH DE number 3913729
• scientific article; zbMATH DE number 515654
• An improved algorithm based on subset closures for synthesizing a relational database scheme

Cited in

(15)

• scientific article; zbMATH DE number 3978449 (Why is no real title available?)
• scientific article; zbMATH DE number 4209578 (Why is no real title available?)
• scientific article; zbMATH DE number 4049168 (Why is no real title available?)
• Autonomous Sets – A Method for Hypergraph Decomposition with Applications in Database Theory
• A port graph rewriting approach to relational database modelling
• scientific article; zbMATH DE number 962435 (Why is no real title available?)
• Autonomous sets for the hypergraph of all canonical covers
• Decision implication canonical basis: a logical perspective
• Polynomial delay hybrid algorithms to enumerate candidate keys for a relation
• An efficient algorithm for 3NF determination
• One algorithm for optimizing relational database schemas
• Analysis of fuzzy \(n\)-ary relations with the use of interval-valued fuzzy functional dependencies
• Polynomial time algorithms for computing a minimum hull set in distance-hereditary and chordal graphs
• VERIFIER-BASED ALGORITHM FOR UNSORTED DATABASE SEARCH PROBLEM
• scientific article; zbMATH DE number 7450014 (Why is no real title available?)

This page was built for publication: An Efficient Algorithm to Compute the Candidate Keys of a Relational Database Schema

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