Coding theory motivated by relational databases

DOI10.1007/978-3-642-23441-5_6MaRDI QIDQ3092324zbMATH OpenOpenAlexFDO

Authors Attila Sali

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

Mathematics Subject Classification ID

Database theory (68P15) Linear codes (general theory) (94B05)

Recommendations

• On the Existence of Armstrong Instances with Bounded Domains
• Recent developments in Armstrong codes
• New type of coding problem motivated by database theory
• Design by example: An application of Armstrong relations
• scientific article; zbMATH DE number 4049168

Cites work

• A new type of coding problem
• A note on minimal matrix representation of closure operations
• A survey of some combinatorial results concerning functional dependencies in database relations.
• Chordality properties on graphs and minimal conceptual connections in semantic data models
• Codes that attain minimum distance in every possible direction
• Combinatiorial problems in the Enomoto-Katona space
• Counter-free keys and functional dependencies in higher-order datamodels
• Degrees of acyclicity for hypergraphs and relational database schemes
• Design type problems motivated by database theory
• Foundations of Information and Knowledge Systems
• Foundations of Information and Knowledge Systems
• Horn clauses and database dependencies
• scientific article; zbMATH DE number 3666227 (Why is no real title available?)
• scientific article; zbMATH DE number 3731387 (Why is no real title available?)
• scientific article; zbMATH DE number 1355186 (Why is no real title available?)
• scientific article; zbMATH DE number 638683 (Why is no real title available?)
• scientific article; zbMATH DE number 812581 (Why is no real title available?)
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• Keys and Armstrong databases in trees with restructuring
• Lower bounds for constant weight codes
• Minimum matrix representation of closure operations
• More orthogonal double covers of complete graphs by Hamiltonian paths
• New upper bounds on Enomoto Katona’s coding type problem
• Normalization and axiomatization for numerical dependencies
• On equidistant constant weight codes
• On minimum matrix representation of closure operations
• On orthogonal double covers of graphs
• On orthogonal double covers of graphs
• On the Desirability of Acyclic Database Schemes
• On the Existence of Armstrong Instances with Bounded Domains
• Orthogonal covers by multiplication graphs
• Orthogonal double covers of complete graphs by trees of small diameter
• Pairs of disjoint \(q\)-element subsets far from each other
• Perfect error-correcting databases
• Self-orthogonal decompositions of graphs into matchings
• The characterization of branching dependencies
• The Closest Packing of Spherical Caps in n Dimensions
• The number of keys in relational and nested relational databases
• Two conjectures of Demetrovics, Füredi, and Katona, concerning partitions
• Types and boundary uniqueness of polypentagons
• Upper bounds for constant-weight codes

Cited in

(10)

• Proceedings of the conference on finite geometries, Oberwolfach, Germany, December 2--7, 2001
• New type of coding problem motivated by database theory
• Note on the size of binary Armstrong codes
• The performance of difference coding for sets and relational tables
• A Formal Coding Structure for Database Record Processing
• scientific article; zbMATH DE number 1507280 (Why is no real title available?)
• Recent developments in Armstrong codes
• Optimal codes in the Enomoto-Katona space
• On the Existence of Armstrong Instances with Bounded Domains
• Minimal Armstrong databases for cardinality constraints

This page was built for publication: Coding theory motivated by relational databases

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