An improved data stream summary: the count-min sketch and its applications
From MaRDI portal
Publication:4675489
Recommendations
Cited in
(95)- An Approximate L1 -Difference Algorithm for Massive Data Streams
- Sketched learning for image denoising
- Multiscale matrix sampling and sublinear-time PageRank computation
- Sparsifying count sketch
- scientific article; zbMATH DE number 7559089 (Why is no real title available?)
- Buffered Count-Min Sketch on SSD: Theory and Experiments
- Space-efficient estimation of statistics over sub-sampled streams
- Time-decaying sketches for robust aggregation of sensor data
- Randomized counter-based algorithms for frequency estimation over data streams in \(O(\log \log N)\) space
- Mining frequent itemsets over distributed data streams by continuously maintaining a global synopsis
- Labeled graph sketches: keeping up with real-time graph streams
- A randomized online quantile summary in \(O(\frac 1\varepsilon\log\frac 1\varepsilon)\) words
- Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time
- Space‐efficient tracking of persistent items in a massive data stream
- Learned sketches for frequency estimation
- Adaptive spatial partitioning for multidimensional data streams
- Fast and accurate mining of correlated heavy hitters
- A Note on Estimating Hybrid Frequency Moment of Data Streams
- A parallel space saving algorithm for frequent items and the Hurwitz zeta distribution
- Range counting over multidimensional data streams
- Deterministic \(k\)-set structure
- Efficient sketches for the set query problem
- Calculating Max and Min with exemplary sketch algorithm in data stream management system
- Improved range-summable random variable construction algorithms
- Estimating hybrid frequency moments of data streams
- A sketch algorithm for estimating two-way and multi-way associations
- On deterministic sketching and streaming for sparse recovery and norm estimation
- Loda: lightweight on-line detector of anomalies
- Tracking the l_2 Norm with Constant Update Time
- Stochastic reformulations of linear systems: algorithms and convergence theory
- Improved Sketching of Hamming Distance with Error Correcting
- Compressed sensing and best \(k\)-term approximation
- A statistical analysis of probabilistic counting algorithms
- Hierarchical sampling from sketches: Estimating functions over data streams
- Simplified Planar Coresets for Data Streams
- Sublinear-space streaming algorithms for estimating graph parameters on sparse graphs
- Algorithms and Computation
- Phase transition in count approximation by count-min sketch with conservative updates
- Compressive statistical learning with random feature moments
- Sketching information divergences
- A randomized online quantile summary in \(O((1/\varepsilon) \log(1/\varepsilon))\) words
- On approximating matrix norms in data streams
- Beating CountSketch for heavy hitters in insertion streams
- Data streams: algorithms and applications.
- Chirp sensing codes: Deterministic compressed sensing measurements for fast recovery
- Joint tracking of multiple quantiles through conditional quantiles
- Arithmetic sketching
- scientific article; zbMATH DE number 7758315 (Why is no real title available?)
- The range 1 query (R1Q) problem
- LATIN 2004: Theoretical Informatics
- Accuracy vs. Lifetime: Linear sketches for aggregate queries in sensor networks
- Streaming techniques and data aggregation in networks of tiny artefacts
- Finding frequent items over sliding windows with constant update time
- Generalizing the layering method of Indyk and Woodruff: recursive sketches for frequency-based vectors on streams
- The eternal sunshine of the sketch data structure
- Time-decaying sketches for sensor data aggregation
- Expander \(\ell_0\)-decoding
- An Implicit Representation and Iterative Solution of Randomly Sketched Linear Systems
- Forty years of frequent items
- scientific article; zbMATH DE number 1947403 (Why is no real title available?)
- Distributed mining of time-faded heavy hitters
- On the power of multiple anonymous messages: frequency estimation and selection in the shuffle model of differential privacy
- Adversarially robust property-preserving hash functions
- Compressive learning for patch-based image denoising
- Voting almost maximizes social welfare despite limited communication
- Nearly optimal distinct elements and heavy hitters on sliding windows
- Range Majority in Constant Time and Linear Space
- Identifying correlated heavy-hitters in a two-dimensional data stream
- Local differentially private frequency estimation based on learned sketches
- Optimizing the confidence bound of count-min sketches to estimate the streaming big data query results more precisely
- Streaming algorithms via precision sampling
- A framework for clustering massive graph streams
- Frugal Streaming for Estimating Quantiles
- Improved algorithms for distributed entropy monitoring
- Evaluating Bayesian networks via data streams
- Deterministic heavy hitters with sublinear query time
- On low-risk heavy hitters and sparse recovery schemes
- Intermediate value linearizability: a quantitative correctness criterion
- Spiking neural networks through the lens of streaming algorithms
- Computer science and decision theory
- scientific article; zbMATH DE number 7370523 (Why is no real title available?)
- The frequent items problem, under polynomial decay, in the streaming model
- Data streams and applications in computer science
- RidgeSketch: a fast sketching based solver for large scale ridge regression
- Fast identification of heavy hitters by cached and packed group testing
- Summary data structures for massive data
- Periodicity and cyclic shifts via linear sketches
- Streaming algorithms with one-sided estimation
- Top-\(k\) frequent items and item frequency tracking over sliding windows of any size
- Sublinear algorithms for MAXCUT and correlation clustering
- Count-min sketch with variable number of hash functions: an experimental study
- Adversarially robust streaming algorithms via differential privacy
- Indexing for summary queries
- Summarizing data using bottom-k sketches
- CR-precis: A Deterministic Summary Structure for Update Data Streams
This page was built for publication: An improved data stream summary: the count-min sketch and its applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4675489)
