Minimal Armstrong databases for cardinality constraints

DOI10.1007/978-3-031-56940-1_4MaRDI QIDQ6630187zbMATH OpenFDO

Authors Bence Király, Attila Sen. Sali

Publication date 30 October 2024

Full work available at URL https://doi.org/10.1007/978-3-031-56940-1_4

zbMATH Keywords

Armstrong instancecardinality constraintcomplete \(k\)-partite graphsfeasible edge coloringsline graphs

Mathematics Subject Classification ID

Database theory (68P15) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)

Cites work

• A characterization of clique graphs
• A note on minimal matrix representation of closure operations
• A survey of some combinatorial results concerning functional dependencies in database relations.
• Coding theory motivated by relational databases
• Constructing Armstrong tables for general cardinality constraints and not-null constraints
• Design type problems motivated by database theory
• scientific article; zbMATH DE number 3876648 (Why is no real title available?)
• scientific article; zbMATH DE number 4057058 (Why is no real title available?)
• scientific article; zbMATH DE number 3731387 (Why is no real title available?)
• scientific article; zbMATH DE number 3325507 (Why is no real title available?)
• Mathematical recreations
• Minimum matrix representation of closure operations
• New type of coding problem motivated by database theory
• Possibilistic keys
• The characterization of branching dependencies

This page was built for publication: Minimal Armstrong databases for cardinality constraints

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