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.
Bercea, and Rasmus Pagh
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
MountDB extends RocksDB with Memtable-level model reuse and a block-aware learned disk index, reporting up to 1.5X write and 2.1X read throughput over state-of-the-art on large-scale workloads.
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.
-
A Pragmatic Approach to Learned Indexing in RocksDB: Targeted Optimizations with Minimal System Modification
MountDB extends RocksDB with Memtable-level model reuse and a block-aware learned disk index, reporting up to 1.5X write and 2.1X read throughput over state-of-the-art on large-scale workloads.