501bc6419e
This PR is a reference implementation of the proposal described in #10420. In addition to what described in #10420, in this PR I've introduced labels.StableHash(). The idea is to offer an hashing function which doesn't change over time, and that's used by query sharding in order to get a stable behaviour over time. The implementation of labels.StableHash() is the hashing function used by Prometheus before stringlabels, and what's used by Grafana Mimir for query sharding (because built before stringlabels was a thing). Follow up work As mentioned in #10420, if this PR is accepted I'm also open to upload another foundamental piece used by Grafana Mimir query sharding to accelerate the query execution: an optional, configurable and fast in-memory cache for the series hashes. Signed-off-by: Marco Pracucci <marco@pracucci.com> |
||
|---|---|---|
| .. | ||
| labels.go | ||
| labels_common.go | ||
| labels_stringlabels.go | ||
| labels_test.go | ||
| matcher.go | ||
| matcher_test.go | ||
| regexp.go | ||
| regexp_test.go | ||
| sharding.go | ||
| sharding_stringlabels.go | ||
| sharding_test.go | ||
| test_utils.go | ||