5821fa042c
This aggregation computes unique term counts using the hyperloglog++ algorithm which uses linear counting to estimate low cardinalities and hyperloglog on higher cardinalities. Since this algorithm works on hashes, it is useful for high-cardinality fields to store the hash of values directly in the index, which is the purpose of the new `murmur3` field type. This is less necessary on low-cardinality string fields because the aggregator is smart enough to only compute the hash once per unique value per segment thanks to ordinals, or on numeric fields since hashing them is very fast. Close #5426 |
||
|---|---|---|
| .. | ||
| community | ||
| groovy-api | ||
| java-api | ||
| javascript | ||
| perl | ||
| python | ||
| reference | ||
| river | ||
| ruby | ||
| README.md | ||
README.md
The Elasticsearch docs are in AsciiDoc format and can be built using the Elasticsearch documentation build process