# Data Streams as Random Permutations: the Distinct Element Problem

2 APR - Algorithmes, Programmes et Résolution
LIP6 - Laboratoire d'Informatique de Paris 6
3 ALGORITHMS - Algorithms
Inria Paris-Rocquencourt
Abstract : 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.
Keywords :
Document type :
Conference papers
Domain :

Cited literature [27 references]

https://hal.inria.fr/hal-01197221
Contributor : Coordination Episciences Iam <>
Submitted on : Friday, September 11, 2015 - 12:54:37 PM
Last modification on : Friday, January 8, 2021 - 5:32:06 PM
Long-term archiving on: : Tuesday, December 29, 2015 - 12:32:26 AM

### File

dmAQ0124.pdf
Publisher files allowed on an open archive

### Identifiers

• HAL Id : hal-01197221, version 1

### Citation

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. ⟨hal-01197221⟩

Record views