Design type problems motivated by database theory

DOI10.1016/S0378-3758(98)00029-9zbMath0932.68038OpenAlexW1993714359MaRDI QIDQ1299042

Attila Sali, Janos Demetrovics

Publication date: 21 March 2000

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0378-3758(98)00029-9

zbMATH Keywords

orthogonal double covers

Mathematics Subject Classification ID

Database theory (68P15) Combinatorics in computer science (68R05) Extremal set theory (05D05)

Related Items (9)

New type of coding problem motivated by database theory ⋮ The perfect matching and tight Hamilton cycle decomposition of complete \(n\)-balanced \(mk\)-partite \(k\)-uniform hypergraphs ⋮ SPT(q, k, n)-Codes ⋮ Codes that attain minimum distance in every possible direction ⋮ Optimal Codes in the Enomoto-Katona Space ⋮ On the Existence of Armstrong Instances with Bounded Domains ⋮ Coding Theory Motivated by Relational Databases ⋮ Partitions with certain intersection properties ⋮ Constructions via Hamiltonian theorems

Cites Work

• A note on minimal matrix representation of closure operations
• Minimum matrix representation of closure operations
• Two conjectures of Demetrovics, Füredi, and Katona, concerning partitions
• The characterization of branching dependencies
• The \(p\)-intersection number of a complete bipartite graph and orthogonal double coverings of a clique
• A survey of some combinatorial results concerning functional dependencies in database relations.
• Perfect error-correcting databases
• On minimum matrix representation of closure operations
• On orthogonal double covers of k_n and a conjecture of chung and west
• A relational model of data for large shared data banks
• Some Theorems on Abstract Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Design type problems motivated by database theory