Asymptotic properties of keys and functional dependencies in random databases

DOI10.1016/S0304-3975(97)00089-3zbMath0893.68052MaRDI QIDQ1389444

Gyula O. H. Katona, Janos Demetrovics, Oleg Seleznjev, Dezsö Miklós, Bernhard Thalheim

Publication date: 30 June 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

keysPoisson approximationfunctional dependencyBonferroni inequalityminimal keysrandom database

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (9)

On the finite and general implication problems of independence atoms and keys ⋮ Networks beyond pairwise interactions: structure and dynamics ⋮ Recent combinatorial results in the theory of relational databases ⋮ Some Remarks on Relational Database Schemes Having Few Minimal Keys ⋮ Random Databases with Correlated Data ⋮ Statistical Inference for Rényi Entropy Functionals ⋮ Foundations for a Fourth Normal Form over SQL-Like Databases ⋮ Unnamed Item ⋮ Random databases with approximate record matching

Cites Work

• A probabilistic analysis of the height of tries and of the complexity of triesort
• On the height of digital trees and related problems
• On the size of nonredundant FD-covers
• On the number of maximal dependencies in a data base relation of fixed order
• On the Structure of Armstrong Relations for Functional Dependencies
• Asymptotic Methods in Enumeration
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Asymptotic properties of keys and functional dependencies in random databases