Urn Models and Yao’s Formula

  • Danièle Gardy
  • Laurent Némirovski
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1540)

Abstract

Yao’s formula is one of the basic tools in any situation where one wants to estimate the number of blocks to be read in answer to some query. We show that such situations can be modelized by probabilistic urn models. This allows us to fully characterize the distribution probability of the number of selected blocks under uniformity assumptions, and to consider extensions to non-uniform block probabilities. We also obtain a computationnally effcient approximation of Yao’s formula.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. BR.
    A. Bender and L.B. Richmond Multivariate asymptotique for product of large powers with applications to Lagrange inversion. Technical report, University of Waterloo, April 1998.Google Scholar
  2. Ca.
    A.F. Cardenas Analysis and performance of inverted data base structures. Comm. ACM, 19(5), 1975.Google Scholar
  3. Ch1.
    S. Christodoulakis Issues in query evaluation Database Engineering, 5(3) 220–223 September 1982.Google Scholar
  4. Ch2.
    S. Christodoulakis Estimating block selectivities Information Systems, 9(1) 69–79 1983.CrossRefGoogle Scholar
  5. FS.
    P. Flajolet and R. Sedgewick. An introduction to the analysis of algorithms. Addison-Wesley, 1996.Google Scholar
  6. GGT.
    G. Gardarin, J.-R. Gruser, and Z.H. Tang. A cost model for clustered object oriented databases. In 21st VLDB Conference, Zürich, Switzerland, pages 323–334, 1995.Google Scholar
  7. Ga.
    D. Gardy. Normal limiting distributions for projection and semijoin sizes. SIAM Journal on Discrete Mathematics, 5(2):219–248, May 1992.MATHCrossRefMathSciNetGoogle Scholar
  8. GN1.
    D. Gardy and L. Nemirovski. Formule de Yao et modeles d’urnes. In 14st BDA Conference, Hammamet, Tunisia, (to appear) 1998.Google Scholar
  9. GN2.
    D. Gardy and L. Nemirovski. Une application des modèles d’urnes aux bases de données: la formule de Yao et ses extensions. Technical report, Laboratoire PRISM, Université de Versailles, October 1998.Google Scholar
  10. JK.
    N.L. Johnson and S. Kotz. Urn models and their application. Wiley & Sons, 1977.Google Scholar
  11. KSC.
    V. KOLCHIN, B. SEVAST'YANOV, and V. CHISTYAKOV Random Allocations. Wiley & Sons, 1978.Google Scholar
  12. Ya.
    S.B. Yao. Approximating block accesses in data base organizations. Comm. ACM, 20(4), 1977.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Danièle Gardy
    • 1
  • Laurent Némirovski
    • 1
  1. 1.Laboratoire PRiSMUniversité de Versailles Saint-QuentinVersaillesFrance

Personalised recommendations