DDSketch gives the first fully mergeable quantile sketch whose estimates carry formal relative-error guarantees, using logarithmic buckets and bounded memory for heavy-tailed data.
It is straightforward to insert items into this sketch as well as delete items and merge sketches
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DB 1years
2019 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
DDSketch: A fast and fully-mergeable quantile sketch with relative-error guarantees
DDSketch gives the first fully mergeable quantile sketch whose estimates carry formal relative-error guarantees, using logarithmic buckets and bounded memory for heavy-tailed data.