github-mirrors/elasticsearch
1
0
Fork 0
mirror of https://github.com/elastic/elasticsearch.git synced 2025-06-28 17:34:17 -04:00
Code Issues Projects Releases Packages Wiki Activity

[DOCS] Fix broken images (#126648)

Browse source
This commit is contained in:
Lisa Cawley 2025-04-11 19:04:08 -07:00 • committed by GitHub
parent 4cbc5eb156
commit ae33eaabdb
No known key found for this signature in database
GPG key ID: B5690EEEBB952194
35 changed files with 53 additions and 168 deletions
Download patch file Download diff file Expand all files Collapse all files

2
docs/reference/aggregations/_snippets/search-aggregations-metrics-cardinality-aggregation-explanation.md
View file

@ -6,7 +6,7 @@ For a precision threshold of `c`, the implementation that we are using requires
The following chart shows how the error varies before and after the threshold:
![cardinality error](/images/cardinality_error.png "")
![cardinality error](/reference/query-languages/images/cardinality_error.png "")
For all 3 thresholds, counts have been accurate up to the configured threshold. Although not guaranteed,
this is likely to be the case. Accuracy in practice depends on the dataset in question. In general,

2
docs/reference/aggregations/_snippets/search-aggregations-metrics-percentile-aggregation-approximate.md
View file

@ -12,6 +12,6 @@ When using this metric, there are a few guidelines to keep in mind:
The following chart shows the relative error on a uniform distribution depending on the number of collected values and the requested percentile:
![percentiles error](/images/percentiles_error.png "")
![percentiles error](/reference/query-languages/images/percentiles_error.png "")
It shows how precision is better for extreme percentiles. The reason why error diminishes for large number of values is that the law of large numbers makes the distribution of values more and more uniform and the t-digest tree can do a better job at summarizing it. It would not be the case on more skewed distributions.