On finding a worst-case optimal fourth normal form database decomposition

DOI10.1007/BF01934180zbMath0642.68069MaRDI QIDQ1101219

George Loizou, Peter Thanisch

Publication date: 1987

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

computational complexitydecomposition algorithmsrelational databasefourth normal form

Mathematics Subject Classification ID

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

Related Items (1)

Compact scheme forests in nested normal form

Cites Work

• Unnamed Item
• Unnamed Item
• An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational Database
• Decision Problems for Multivalued Dependencies in Relational Databases

This page was built for publication: On finding a worst-case optimal fourth normal form database decomposition