On the Existence of Armstrong Instances with Bounded Domains

DOI10.1007/978-3-540-77684-0_12zbMath1138.68395OpenAlexW1549217443MaRDI QIDQ5445299

László A. Székely, Attila Sali

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_12

zbMATH Keywords

functional dependencyspherical codebounded domainArmstrong instanceArmstrong-codeLovász' Local Lemma

Mathematics Subject Classification ID

Database theory (68P15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items

Proceedings of the conference on finite geometries, Oberwolfach, Germany, December 2--7, 2001, Note on the size of binary Armstrong codes, Constructing Armstrong tables for general cardinality constraints and not-null constraints, Coding Theory Motivated by Relational Databases

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• The number of keys in relational and nested relational databases
• Design type problems motivated by database theory
• A survey of some combinatorial results concerning functional dependencies in database relations.
• Perfect error-correcting databases
• Codes that attain minimum distance in every possible direction
• Horn clauses and database dependencies
• On Packings of Spheres in Hilbert Space
• Foundations of Information and Knowledge Systems