On the relationship of minimum and optimum covers for a set of functional dependencies

DOI10.1007/BF00289412zbMath0504.68060OpenAlexW2016687162WikidataQ61450090 ScholiaQ61450090MaRDI QIDQ1836314

Heikki Mannila, Kari-Jouko Raeihae

Publication date: 1983

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00289412

zbMATH Keywords

NP-completenessequivalence classesalgorithms in relational database theory

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Information storage and retrieval of data (68P20)

Related Items (1)

Optimal covers in the relational database model

Cites Work

• Candidate keys for relations
• An improved third normal form for relational databases
• Minimum Covers in Relational Database Model
• A relational model of data for large shared data banks
• Unnamed Item

This page was built for publication: On the relationship of minimum and optimum covers for a set of functional dependencies