Cover Image

LMQ-Sketch: Lagom Multi-Query Sketch for High-Rate Online Analytics

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hilgendorf, Martin, Papatriantafilou, Marina
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries
by: Cohen, Edith, et al.
Published: (2025)

The Case for External Graph Sketching
by: Bender, Michael A., et al.
Published: (2025)

On Sketching Trimmed Statistics
by: Lin, Honghao, et al.
Published: (2025)

On Sketching Quadratic Forms
by: Andoni, Alexandr, et al.
Published: (2015)

Average-Distortion Sketching
by: Bao, Yiqiao, et al.
Published: (2024)

Fast Similarity Sketching
by: Dahlgaard, Søren, et al.
Published: (2017)

Sketching and Streaming for Dictionary Compression
by: Becker, Ruben, et al.
Published: (2023)

Sketching Cuts in Graphs and Hypergraphs
by: Kogan, Dmitry, et al.
Published: (2014)

Correlation Sketches for Approximate Join-Correlation Queries
by: Santos, Aécio, et al.
Published: (2021)

One Attack to Rule Them All: Tight Quadratic Bounds for Adaptive Queries on Cardinality Sketches
by: Cohen, Edith, et al.
Published: (2024)

Approximating Tensor Network Contraction with Sketches
by: Heddes, Mike, et al.
Published: (2026)

Fast Sampling Based Sketches for Tensors
by: Swartworth, William, et al.
Published: (2024)

Fast and Compact Sketch-Based Dynamic Connectivity
by: De Man, Quinten, et al.
Published: (2025)

Almost Linear Size Edit Distance Sketch
by: Koucký, Michal, et al.
Published: (2024)

Cuckoo Heavy Keeper and the balancing act of maintaining heavy hitters in stream processing
by: Ngo, Vinh Quang, et al.
Published: (2024)

Multipass Linear Sketches for Geometric LP-Type Problems
by: Çekirge, N. Efe, et al.
Published: (2025)

Lifting Linear Sketches: Optimal Bounds and Adversarial Robustness
by: Gribelyuk, Elena, et al.
Published: (2025)

MagnifierSketch: Quantile Estimation Centered at One Point
by: Guo, Jiarui, et al.
Published: (2025)

SimiSketch: Efficiently Estimating Similarity of streaming Multisets
by: Dong, Fenghao, et al.
Published: (2024)

Unmasking Vulnerabilities: Cardinality Sketches under Adaptive Inputs
by: Ahmadian, Sara, et al.
Published: (2024)

Sampling Methods for Inner Product Sketching
by: Daliri, Majid, et al.
Published: (2023)

On Differential Privacy for Adaptively Solving Search Problems via Sketching
by: Feng, Shiyuan, et al.
Published: (2025)

Near-optimal Size Linear Sketches for Hypergraph Cut Sparsifiers
by: Khanna, Sanjeev, et al.
Published: (2024)

Carbonyl4: A Sketch for Set-Increment Mixed Updates
by: Zhao, Yikai, et al.
Published: (2024)

Learning the Positions in CountSketch
by: Li, Yi, et al.
Published: (2023)

A (Very) Nearly Optimal Sketch for $k$-Edge Connectivity Certificates
by: Sawettamalya, Pachara, et al.
Published: (2025)

Hybrid Sketching Methods for Dynamic Connectivity on Sparse Graphs
by: De Man, Quinten, et al.
Published: (2026)

QSketch: An Efficient Sketch for Weighted Cardinality Estimation in Streams
by: Qi, Yiyan, et al.
Published: (2024)

Profile Reconstruction from Private Sketches
by: Wu, Hao, et al.
Published: (2024)

Correlation Clustering and (De)Sparsification: Graph Sketches Can Match Classical Algorithms
by: Assadi, Sepehr, et al.
Published: (2025)

Near-optimal Linear Sketches and Fully-Dynamic Algorithms for Hypergraph Spectral Sparsification
by: Khanna, Sanjeev, et al.
Published: (2025)

Sketching Meets Differential Privacy: Fast Algorithm for Dynamic Kronecker Projection Maintenance
by: Song, Zhao, et al.
Published: (2022)

A Strong Separation for Adversarially Robust $\ell_0$ Estimation for Linear Sketches
by: Gribelyuk, Elena, et al.
Published: (2024)

Approaching 100% Confidence in Stream Summary through ReliableSketch
by: Wu, Yuhan, et al.
Published: (2024)

Count-Min Sketch with Conservative Updates: Worst-Case Analysis
by: Mazziane, Younes Ben, et al.
Published: (2024)

The $\ell_p$-Subspace Sketch Problem in Small Dimensions with Applications to Support Vector Machines
by: Li, Yi, et al.
Published: (2022)

Quantum Sketches, Hashing, and Approximate Nearest Neighbors
by: Hashemian, Sajjad
Published: (2026)

Weighted Minwise Hashing Beats Linear Sketching for Inner Product Estimation
by: Bessa, Aline, et al.
Published: (2023)

Sampling Space-Saving Set Sketches
by: Lee, Homin K., et al.
Published: (2024)

Preserving Extreme Singular Values with One Oblivious Sketch
by: Mango, John M., et al.
Published: (2025)