A nearly optimal and deterministic summary structure for update data streams
Sumit Ganguly
TL;DR
This paper proposes a nearly optimal and deterministic data summary structure designed for update data streams, aiming to improve efficiency and accuracy in data summarization tasks.
Contribution
It introduces a novel deterministic summary structure that approaches optimality for update data streams, addressing limitations of previous probabilistic methods.
Findings
Achieves near-optimal space complexity
Provides deterministic guarantees
Improves data stream summarization accuracy
Abstract
The paper has been withdrawn due to an error in Lemma 1.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Database Systems and Queries · Data Management and Algorithms · Data Mining Algorithms and Applications