Urn Models and Yao's Formula

Authors:
Danièle Gardy;Laurent Némirovski
Affiliations:
-;-
Venue:
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Year:
1999

Citing 5
Cited 0

Normal limiting distributions for projection and semijoin sizes

SIAM Journal on Discrete Mathematics
An introduction to the analysis of algorithms

An introduction to the analysis of algorithms
Approximating block accesses in database organizations

Communications of the ACM
Analysis and performance of inverted data base structures

Communications of the ACM
A Cost Model for Clustered Object-Oriented Databases

VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

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 efficient approximation of Yao's formula.