Sublime generalizes Count-Min and Count Sketch with dynamically elongating counters and expanding counter arrays to deliver sublinear error growth and lower memory use on skewed unbounded streams.
Title resolution pending
2 Pith papers cite this work, alongside 7 external citations. Polarity classification is still indexing.
2
Pith papers citing it
7
external citations · OpenAlex
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Ring-buffer shuffle achieves amortized O(1) synchronization per batch and O(M) memory use, outperforming prior methods by up to 300% on 192-core systems in query engine benchmarks.
citing papers explorer
-
Sublime: Sublinear Error & Space for Unbounded Skewed Streams
Sublime generalizes Count-Min and Count Sketch with dynamically elongating counters and expanding counter arrays to deliver sublinear error growth and lower memory use on skewed unbounded streams.
-
One Ring to Shuffle Them All: Scalable Intra-Process Data Redistribution with Ring-Buffer Shuffle in Redpanda Oxla
Ring-buffer shuffle achieves amortized O(1) synchronization per batch and O(M) memory use, outperforming prior methods by up to 300% on 192-core systems in query engine benchmarks.