We give an improved algorithm for drawing a random sample from a large data stream when the input elements are distributed across multiple sites which communicate via a central coordinator. At any point in time the set of elements held by the coordinator represent a uniform random sample from the set of all the elements observed so far. When compared with prior work, our algorithms asymptotically improve the total number of messages sent in the system as well as the computation required of the coordinator. We also present a matching lower bound, showing that our protocol sends the optimal number of messages up to a constant factor with large probability. As a byproduct, we obtain an improved algorithm for finding the heavy hitters across multiple distributed sites. © 2011 Springer-Verlag.
CITATION STYLE
Tirthapura, S., & Woodruff, D. P. (2011). Optimal random sampling from distributed streams revisited. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6950 LNCS, pp. 283–297). https://doi.org/10.1007/978-3-642-24100-0_27
Mendeley helps you to discover research relevant for your work.