Autonomous Sets – A Method for Hypergraph Decomposition with Applications in Database Theory

DOI10.1007/978-3-540-77684-0_8zbMath1138.68393OpenAlexW1555054986WikidataQ62043132 ScholiaQ62043132MaRDI QIDQ5445294

Henning Koehler

Publication date: 4 March 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77684-0_8

Mathematics Subject Classification ID

Database theory (68P15) Hypergraphs (05C65)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing unique canonical covers for simple FDs via transitive reduction
• On the size of nonredundant FD-covers
• Candidate keys for relations
• Testing for existence of a covering Boyce-Codd normal form
• Minimal Representation of Directed Hypergraphs
• Minimum Covers in Relational Database Model
• A new normal form for the design of relational database schemata
• An Efficient Algorithm to Compute the Candidate Keys of a Relational Database Schema
• Algorithm Theory - SWAT 2004
• Finding Faithful Boyce-Codd Normal Form Decompositions

This page was built for publication: Autonomous Sets – A Method for Hypergraph Decomposition with Applications in Database Theory