Collection Nexus Trimester - 2016 - Inference Problems Theme
Organisateur(s)
Date(s)
04/05/2024
New Algorithms for Heavy Hitters in Data Streams 1/2
An old and fundamental problem in databases and data streams is that of finding the heavy hitters, also known as the top-k, most popular items, frequent items, elephants, or iceberg queries. There are several variants of this problem, which quantify what it means for an item to be frequent, including what are known as the ℓ1-heavy hitters and ℓ2-heavy hitters. There are a number of algorithmic solutions for these problems, starting with the work of Misra and Gries, as well as the CountMin and CountSketch data structures, among others. In this talk we cover several recent results developed in this area, which improve upon the classical solutions to these problems. In particular, we develop new algorithms for finding ℓ1-heavy hitters and ℓ2-heavy hitters, with significantly less memory required than what was known, and which are optimal in a number of parameter regimes.
