Coding Theory Motivated by Relational Databases
From MaRDI portal
Publication:3092324
DOI10.1007/978-3-642-23441-5_6zbMath1323.94158OpenAlexW1870408408MaRDI QIDQ3092324
Publication date: 16 September 2011
Published in: Semantics in Data and Knowledge Bases (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-23441-5_6
Related Items (4)
Optimal Codes in the Enomoto-Katona Space ⋮ Proceedings of the conference on finite geometries, Oberwolfach, Germany, December 2--7, 2001 ⋮ Note on the size of binary Armstrong codes ⋮ Minimal Armstrong databases for cardinality constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Chordality properties on graphs and minimal conceptual connections in semantic data models
- A note on minimal matrix representation of closure operations
- Orthogonal covers by multiplication graphs
- Minimum matrix representation of closure operations
- Two conjectures of Demetrovics, Füredi, and Katona, concerning partitions
- The characterization of branching dependencies
- The number of keys in relational and nested relational databases
- Design type problems motivated by database theory
- Orthogonal double covers of complete graphs by trees of small diameter
- A survey of some combinatorial results concerning functional dependencies in database relations.
- On equidistant constant weight codes
- Perfect error-correcting databases
- On minimum matrix representation of closure operations
- Codes that attain minimum distance in every possible direction
- More orthogonal double covers of complete graphs by Hamiltonian paths
- Upper bounds for constant-weight codes
- On the Desirability of Acyclic Database Schemes
- Degrees of acyclicity for hypergraphs and relational database schemes
- Combinatorial problems in the Enomoto-Katona space
- A new type of coding problem
- Self-orthogonal decompositions of graphs into matchings
- Types and boundary uniqueness of polypentagons
- Normalization and axiomatization for numerical dependencies
- Lower bounds for constant weight codes
- Horn clauses and database dependencies
- New upper bounds on Enomoto Katona’s coding type problem
- On the Existence of Armstrong Instances with Bounded Domains
- The Closest Packing of Spherical Caps in n Dimensions
- On orthogonal double covers of graphs
- Foundations of Information and Knowledge Systems
- Foundations of Information and Knowledge Systems
- On orthogonal double covers of graphs
- Pairs of disjoint \(q\)-element subsets far from each other
This page was built for publication: Coding Theory Motivated by Relational Databases
