Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7260))

  • 816 Accesses

Abstract

A model of random databases is given, with arbitrary correlations among the data of one individual. This is given by a joint distribution function. The individuals are chosen independently, their number m is considered to be (approximately) known. The probability of the event that a given functional dependency A → b holds (A is a set of attributes, b is an attribute) is determined in a limiting sense. This probability is small if m is much larger than \(2^{H_2(A\rightarrow b)/2}\) and is large if m is much smaller than \(2^{H_2(A\rightarrow b)/2}\) where H 2(A → b) is an entropy like functional of the probability distribution of the data.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

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., Miklós, D., Seleznjev, O., Thalheim, B.: Asymptotic properties of keys and functional dependencies in random databases. Theoretical Computer Sciences 190, 151–166 (1998)

    Article  MATH  Google Scholar 

  2. Demetrovics, J., Katona, G.O.H., Miklós, D., Seleznjev, O., Thalheim, B.: Functional dependencies in random databases. Studia Sci. Math. Hungar. 34, 127–140 (1998)

    MATH  Google Scholar 

  3. Katona, G.O.H.: Testing functional connection between two random variables. Prokhorov Festschrift (accepted)

    Google Scholar 

  4. Rényi, A.: Some fundamental questions of information theory. MTA III Oszt. Közl. 10, 251–282 (1960) (in Hungarian)

    Google Scholar 

  5. Rényi, A.: On measures of information and entropy. In: Proc. of the 4th Berkeley Symposium on Mathematics, Statistics and Probability, pp. 547–561 (1960/1961)

    Google Scholar 

  6. Seleznjev, O., Thalheim, B.: Average Case Analysis in Database Problems. Methodology and Computing in Applied Probability 5(4), 395–418 (2003)

    Article  MATH  Google Scholar 

  7. Seleznjev, O., Thalheim, B.: Random Databases with Approximate Record Matching. Methodology and Computing in Applied Probability 12(1), 63–89 (2010)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Antje Düsterhöft Meike Klettke Klaus-Dieter Schewe

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Katona, G.O.H. (2012). Random Databases with Correlated Data. In: Düsterhöft, A., Klettke, M., Schewe, KD. (eds) Conceptual Modelling and Its Theoretical Foundations. Lecture Notes in Computer Science, vol 7260. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28279-9_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-28279-9_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28278-2

  • Online ISBN: 978-3-642-28279-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics