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

DOI10.1093/COMJNL/39.2.124zbMATH Open0852.68024OpenAlexW2119631806MaRDI QIDQ4886686FDOQ4886686

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

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

zbMATH Keywords

functional dependenciesrelational database

Mathematics Subject Classification ID

Database theory (68P15)

Cited In (15)

• Decision implication canonical basis: a logical perspective
• Polynomial time algorithms for computing a minimum hull set in distance-hereditary and chordal graphs
• An efficient algorithm for 3NF determination
• Autonomous sets for the hypergraph of all canonical covers
• A Port Graph Rewriting Approach to Relational Database Modelling
• One algorithm for optimizing relational database schemas
• Autonomous Sets – A Method for Hypergraph Decomposition with Applications in Database Theory
• VERIFIER-BASED ALGORITHM FOR UNSORTED DATABASE SEARCH PROBLEM
• Title not available (Why is that?)
• Title not available (Why is that?)
• Analysis of fuzzy \(n\)-ary relations with the use of interval-valued fuzzy functional dependencies
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Polynomial delay hybrid algorithms to enumerate candidate keys for a relation

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)