Abstract
The combinatorial results about the maximal number of minimal keys are summarized. It is shown that the result of J. Demetrovics about the maximal number of minimal keys on unbounded domains does not hold for finite domains. Using this result lower bounds on the size of minimal-sized Armstrong relations are derived. Finally also shown is that the maximal number of minimal keys in databases on nonuniform domains is also precisely exponential in the number of attributes.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
