Linear sketches have been widely adopted to process fast data streams, and they can be
used to accurately answer frequency estimation, approximate top K items, and summarize …

System operators are often interested in extracting different feature streams from multi-
dimensional data streams; and reporting their distributions at regular intervals, including the …

Identifying heavy hitters and estimating the frequencies of flows are fundamental tasks in
various network domains. Existing approaches to this challenge can broadly be categorized …

A Sketch is an excellent probabilistic data structure, which records the approximate statistics
of data streams. Linear additivity is an important property of sketches. This paper studies …

The Log Structured Merge Trees (LSM-tree) based key-value stores are widely used in
many storage systems to support a variety of operations such as updates, point reads, and …

In this paper, we present an advanced analysis of near optimal deterministic algorithms
using a small space budget to solve the frequency estimation, heavy hitters, frequent items …

This errata article points out an implicit assumption in the work of four of us published in
VLDB 2022. The SpaceSaving±algorithm in bounded deletion data stream presented in the …

In data stream mining, monitoring high-speed users and segregating their excessive use,
known as “Overspeed items,” is crucial for preventing system overload and maintaining …

Large, distributed data streams are now ubiquitous. High-accuracy sketches with low
memory overhead have become the de facto method for analyzing this data. For instance, if …

To approximate sums of values in key-value data streams, sketches are widely used in
databases and networking systems. They offer high-confidence approximations for any …