Skip to main content
SpringerLink
Log in

On the number of keys in relational databases

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1987)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 278))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Demetrovics J., Katona G.O.H., Combinatorial problems of database models. Colloquia Mathematica Societatis Janos Bolyai 42. Algebra, Combinatorics and Logic in Computer Science, Györ (Hungary), 1983, 331–352.

    Google Scholar 

  2. Knopp K., Schur I., Elementarer Beweis einiger asymptotischer Formeln der Additiven Zahlentheorie. Mathematische Zeitschrift 24, 1925, 559–574.

    Google Scholar 

  3. Mac Williams F.J., Sloane N.J.A., The theory of error-correcting codes. North-Holland, Amsterdam 1977.

    Google Scholar 

  4. Mitalauskas A.A., Statuljavitschus W.A., Lokalnije predelnije teoremi i asimptotitscheskije rasloshenija dlja summ nesawisimich retschetschatich welitschin. Litowskij matematitscheskij sbornik 1966, t. 6, N. 4, 569–583 (in russian)

    Google Scholar 

  5. Selesnjew O., Thalheim B., On the number of minimal keys in relational databases on nonuniform domains. Submitted for publication.

    Google Scholar 

  6. Thalheim B., Dependencies in Relational Databases. Teubner, Leipzig 1987.

    Google Scholar 

  7. Thalheim B., Abhängigkeiten in Relationen. Dissertation, TU Dresden, Dresden 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sektion Mathematik, Technische Universität Dresden, Mommsenstr. 13, GDR 8027, Dresden

    B. Thalheim

Authors
  1. B. Thalheim
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Lothar Budach Rais Gatič Bukharajev Oleg Borisovič Lupanov

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Thalheim, B. (1987). On the number of keys in relational databases. In: Budach, L., Bukharajev, R.G., Lupanov, O.B. (eds) Fundamentals of Computation Theory. FCT 1987. Lecture Notes in Computer Science, vol 278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18740-5_99

Download citation

  • DOI: https://doi.org/10.1007/3-540-18740-5_99

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18740-0

  • Online ISBN: 978-3-540-48138-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation