Minimal Armstrong databases for cardinality constraints

DOI10.1007/978-3-031-56940-1_4MaRDI QIDQ6630187

Attila Sen. Sali, Bence Király

Publication date: 30 October 2024

zbMATH Keywords

line graphscardinality constraintcomplete \(k\)-partite graphsArmstrong instancefeasible edge colorings

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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on minimal matrix representation of closure operations
• Minimum matrix representation of closure operations
• The characterization of branching dependencies
• Design type problems motivated by database theory
• A survey of some combinatorial results concerning functional dependencies in database relations.
• New type of coding problem motivated by database theory
• Constructing Armstrong tables for general cardinality constraints and not-null constraints
• Possibilistic keys
• A characterization of clique graphs
• Coding Theory Motivated by Relational Databases
• Mathematical recreations

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