Extremal problems in relational data bases

DOI10.1007/BF01072167zbMATH Open0577.68085OpenAlexW2073541168MaRDI QIDQ3698337FDOQ3698337

Authors: J. Demetrovics, Gyula O. H. Katona 

Publication date: 1984

Published in: Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01072167

Recommendations

• Extremal theorems for databases
• scientific article; zbMATH DE number 2080031
• Estimates of the sizes of relations in relational datamodel
• scientific article; zbMATH DE number 4083037
• scientific article; zbMATH DE number 4215353

zbMATH Keywords

functional dependenciescombinatorial complexityminimal keysSperner system

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Cites Work

• A relational model of data for large shared data banks
• The Existence and Construction of Balanced Incomplete Block Designs
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the number of maximal dependencies in a data base relation of fixed order

Cited In (13)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An extremal problem on trees and database theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Foundations of Information and Knowledge Systems
• Extremal theorems for databases
• Extremal combinatorics of SQL keys

This page was built for publication: Extremal problems in relational data bases

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