1 citations · 1 across the 2 of their papers we have counts for
3 papers
cs.DS2024★ 1 cited
FlipHash: A Constant-Time Consistent Range-Hashing Algorithm
Charles Masson, Homin K. Lee
Consistent range-hashing is a technique used in distributed systems, either directly or as a subroutine for consistent hashing, commonly to realize an even and stable data distribu…
cs.DS2024
Sampling Space-Saving Set Sketches
Homin K. Lee, Charles Masson
Large, distributed data streams are now ubiquitous. High-accuracy sketches with low memory overhead have become the de facto method for analyzing this data. For instance, if we wis…
cs.DB2019
DDSketch: A fast and fully-mergeable quantile sketch with relative-error guarantees
Charles Masson, Jee E. Rim, Homin K. Lee
Summary statistics such as the mean and variance are easily maintained for large, distributed data streams, but order statistics (i.e., sample quantiles) can only be approximately…