Constructing Armstrong tables for general cardinality constraints and not-null constraints

DOI10.1007/s10472-014-9423-9zbMath1319.68072OpenAlexW2057537938MaRDI QIDQ2254637

Bernhard Thalheim, Jing Wang, Sven Hartmann, Uwe Leck, Sebastian Link, Henning Koehler

Publication date: 5 February 2015

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-014-9423-9

zbMATH Keywords

implicationcardinality constraintsinferenceArmstrong databaseincomplete databasenull-free subschemaSQL table

Mathematics Subject Classification ID

Database theory (68P15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A fast algorithm for equitable coloring
• Design by example: An application of Armstrong relations
• Graphs, networks and algorithms
• Numerical constraints on XML data
• Database relations with null values
• Armstrong databases for functional and inclusion dependencies
• The characterization of branching dependencies
• Functional dependencies in relational databases: A lattice point of view
• Axiomatisation of functional dependencies in incomplete relations
• New type of coding problem motivated by database theory
• On the implication problem for cardinality constraints and functional dependencies
• A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
• Functional dependencies and constraints on null values in database relations
• Horn clauses and database dependencies
• Cardinality constraints in semantic data models
• On the Existence of Armstrong Instances with Bounded Domains
• A relational model of data for large shared data banks

This page was built for publication: Constructing Armstrong tables for general cardinality constraints and not-null constraints