Improve TDigest merge performance, respect compression factor properly
Summary: I suspect the algorithm in the tdigest paper is slightly off. Instead of setting boundaries at k = 1, 2, 3...d, it sets boundaries at k_last_elem + 1. This results in two issues: 1) It is possible to have more than d elements in the digest. Now, that is no longer possible, and we can properly reserve the right number of elements. 2) Additional floating point operations are computed than necessary. Reviewed By: anakryiko Differential Revision: D7654147 fbshipit-source-id: 131184d456353a9d936c4ed385e2b5e75d468676
Showing
Please register or sign in to comment