Simple Analysis of Priority Sampling
Data Structures and Algorithms
2024-08-21 v2 Databases
Abstract
We prove a tight upper bound on the variance of the priority sampling method (aka sequential Poisson sampling). Our proof is significantly shorter and simpler than the original proof given by Mario Szegedy at STOC 2006, which resolved a conjecture by Duffield, Lund, and Thorup.
Keywords
Cite
@article{arxiv.2308.05907,
title = {Simple Analysis of Priority Sampling},
author = {Majid Daliri and Juliana Freire and Christopher Musco and Aécio Santos and Haoxiang Zhang},
journal= {arXiv preprint arXiv:2308.05907},
year = {2024}
}
Comments
7 pages