honeymoose/OpenSearch
1
0
Fork 0
mirror of https://github.com/honeymoose/OpenSearch.git synced 2025-02-05 20:48:22 +00:00
Code Issues Packages Projects Releases Wiki Activity
OpenSearch/docs/reference/search/aggregations/metrics.asciidoc

26 lines
628 B
Plaintext
Raw Normal View History

initial commit of the aggregations module Closes #3300
2013-11-24 03:13:08 -08:00
[[search-aggregations-metrics]]
include::metrics/min-aggregation.asciidoc[]
include::metrics/max-aggregation.asciidoc[]
include::metrics/sum-aggregation.asciidoc[]
include::metrics/avg-aggregation.asciidoc[]
include::metrics/stats-aggregation.asciidoc[]
include::metrics/extendedstats-aggregation.asciidoc[]
- Added docs for the value_count aggregation - Fixed typos in the terms facets docs - Fixed aggregation docs layout - Added docs for shard_size in term aggregation
2013-11-29 12:35:25 +01:00
include::metrics/valuecount-aggregation.asciidoc[]
Percentiles aggregation. A new metric aggregation that can compute approximate values of arbitrary percentiles. Close #5323
2014-01-06 17:35:51 -05:00
Cardinality aggregation. 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
2014-02-16 19:20:33 +01:00
include::metrics/percentile-aggregation.asciidoc[]
Aggregations: Added percentile rank aggregation Percentile Rank Aggregation is the reverse of the Percetiles aggregation. It determines the percentile rank (the proportion of values less than a given value) of the provided array of values. Closes #6386
2014-06-06 15:25:21 +01:00
include::metrics/percentile-rank-aggregation.asciidoc[]
Cardinality aggregation. 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
2014-02-16 19:20:33 +01:00
include::metrics/cardinality-aggregation.asciidoc[]
Aggregations: Adds GeoBounds Aggregation The GeoBounds Aggregation is a new single bucket aggregation which outputs the coordinates of a bounding box containing all the points from all the documents passed to the aggregation as well as the doc count. Geobound Aggregation also use a wrap_logitude parameter which specifies whether the resulting bounding box is permitted to overlap the international date line. This option defaults to true. This aggregation introduces the idea of MetricsAggregation which do not return double values and cannot be used for sorting. The existing MetricsAggregation has been renamed to NumericMetricsAggregation and is a subclass of MetricsAggregation. MetricsAggregations do not store doc counts and do not support child aggregations. Closes #5634
2014-05-29 10:37:03 +01:00
include::metrics/geobounds-aggregation.asciidoc[]
Change the top_hits to be a metric aggregation instead of a bucket aggregation (which can't have an sub aggs) Closes #6395 Closes #6434
2014-06-06 20:29:41 +02:00
include::metrics/tophits-aggregation.asciidoc[]
Reference in New Issue Copy Permalink