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

From MaRDI portal
Revision as of 20:06, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 907011
Language Label Description Also known as
English
An Efficient Algorithm to Compute the Candidate Keys of a Relational Database Schema
scientific article; zbMATH DE number 907011

    Statements

    An Efficient Algorithm to Compute the Candidate Keys of a Relational Database Schema (English)
    0 references
    0 references
    0 references
    11 December 1996
    0 references
    0 references
    functional dependencies
    0 references
    relational database
    0 references
    0 references