Data Streams as Random Permutations: the Distinct Element Problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2012

Data Streams as Random Permutations: the Distinct Element Problem


In this paper, we show that data streams can sometimes usefully be studied as random permutations. This simple observation allows a wealth of classical and recent results from combinatorics to be recycled, with minimal effort, as estimators for various statistics over data streams. We illustrate this by introducing RECORDINALITY, an algorithm which estimates the number of distinct elements in a stream by counting the number of $k$-records occurring in it. The algorithm has a score of interesting properties, such as providing a random sample of the set underlying the stream. To the best of our knowledge, a modified version of RECORDINALITY is the first cardinality estimation algorithm which, in the random-order model, uses neither sampling nor hashing.
Fichier principal
Vignette du fichier
dmAQ0124.pdf (497.33 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01197221 , version 1 (11-09-2015)



Ahmed Helmi, Jérémie Lumbroso, Conrado Martínez, Alfredo Viola. Data Streams as Random Permutations: the Distinct Element Problem. 23rd International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'12), Jun 2012, Montreal, Canada. pp.323-338, ⟨10.46298/dmtcs.3002⟩. ⟨hal-01197221⟩
321 View
934 Download



Gmail Facebook Twitter LinkedIn More