
ddsketchy
This is a Rust implementation of the DDSketch quantile sketch algorithm. DDSketch is a fully-mergeable quantile sketch with relative-error guarantees.
ddsketchy Features
- Implements the DDSketch algorithm with configurable relative error guarantees
- Optimized for high-throughput data collection scenarios
- Designed for distributed systems with efficient sketch merging
Usage
use ;
Serialization Support
ddsketchy supports optional serialization via serde. Serialization is disabled by default to keep the library dependency-free. To enable it, add the serde feature
use DDSketch;
The serialization handles all internal state including infinity values for min/max bounds in empty sketches. Empty sketches serialize min/max as null values, while sketches with data serialize them as numbers.
References
- DDSketch: A Fast and Fully-Mergeable Quantile Sketch with Relative-Error Guarantees - The original paper describing the DDSketch algorithm