Distinct Elements in Streams: An Algorithm for the (Text) Book

Given a data stream \(\mathcal{A} = \langle a_1, a_2, \ldots, a_m \rangle\) of \(m\) elements where each \(a_i \in [n]\), the Distinct Elements problem is to estimate the number of distinct elements in \(\mathcal{A}\).Distinct Elements has been a subject of theoretical and empirical investigations o...

Full description

Bibliographic Details

Published in:	arXiv.org
Main Authors:	Chakraborty, Sourav, Vinodchandran, N V, Meel, Kuldeep S
Format:	Paper
Language:	English
Published:	Ithaca Cornell University Library, arXiv.org 24.05.2023
Subjects:	Data transmission Hash based algorithms Probability theory
ISSN:	2331-8422
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!