https://pizza.rs/tags/variable_width_histogram/Recent content in Variable_width_histogram on INFINI PizzaHugoenhttps://pizza.rs/docs/references/aggregation/bucket/variable-width-histogram/Mon, 01 Jan 0001 00:00:00 +0000https://pizza.rs/docs/references/aggregation/bucket/variable-width-histogram/<h1 id="variable-width-histogram-aggregation"> Variable width histogram aggregation <a class="anchor" href="#variable-width-histogram-aggregation">#</a> </h1> <p>A multi-bucket aggregation like <a href="https://pizza.rs/docs/references/aggregation/bucket/histogram/"><code>histogram</code></a>, but bucket edges adapt to the data so each bucket holds roughly the same number of documents. Fixed grids go blind where data is sparse and waste resolution where it is dense; the variable-width form spends its buckets where the documents actually are.</p> <h2 id="how-it-works"> How it works <a class="anchor" href="#how-it-works">#</a> </h2> <p>The engine collects every numeric value, sorts it, and partitions the sorted run into <code>buckets</code> contiguous segments such that the sum of squared distances to each segment&rsquo;s mean is minimal — the classic one-dimensional k-segmentation problem, solved exactly with dynamic programming and prefix sums (an O(1) cost function per candidate cut). When <code>n × k</code> exceeds 1,048,576 it falls back to equal-count chunking, a linear-time approximation. <code>buckets</code> is capped at the number of distinct values, so asking for more buckets than there are values simply yields one bucket per value.</p>