Compact scheme forests in nested normal form

DOI10.1080/00207169208804116zbMATH Open0796.68079OpenAlexW2051967970MaRDI QIDQ4032905FDOQ4032905

Authors:

Publication date: 16 May 1993

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169208804116

Recommendations

• Finding compact scheme forests in nested normal form is NP-hard
• A Design Theory for Solving the Anomalies Problem
• Foundations of Information and Knowledge Systems
• Restructuring Partitioned Normal Form Relations without Information Loss
• scientific article; zbMATH DE number 4108210

zbMATH Keywords

database designupdate anomaliesnested relational structures

Mathematics Subject Classification ID

Database theory (68P15)

Cites Work

• Title not available (Why is that?)
• An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational Database
• On the Desirability of Acyclic Database Schemes
• Title not available (Why is that?)
• On the menbership problem for functional and multivalued dependencies in relational databases
• On the Equivalence of Database Models
• Extended algebra and calculus for nested relational databases
• Non first normal form relations: An algebra allowing data restructuring
• Whether a Set of Multivalued Dependencies Implies a Join Dependency is NP-hard
• Multilevel nested relational structures
• On finding a worst-case optimal fourth normal form database decomposition

Cited In (3)

• Title not available (Why is that?)
• Finding compact scheme forests in nested normal form is NP-hard
• A Design Theory for Solving the Anomalies Problem

This page was built for publication: Compact scheme forests in nested normal form

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4032905)