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

DOI10.1093/comjnl/39.2.124zbMath0852.68024OpenAlexW2119631806MaRDI QIDQ4886686

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

relational databasefunctional dependencies

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (8)

Analysis of fuzzy -ary relations with the use of interval-valued fuzzy functional dependencies ⋮ A Port Graph Rewriting Approach to Relational Database Modelling ⋮ Autonomous sets for the hypergraph of all canonical covers ⋮ Unnamed Item ⋮ An efficient algorithm for 3NF determination ⋮ Autonomous Sets – A Method for Hypergraph Decomposition with Applications in Database Theory ⋮ Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs ⋮ Decision implication canonical basis: a logical perspective

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