opensearch-project/OpenSearch

[Enhancement] Histogram aggregation should initialize Ranges lazily

Open

#18,241 创建于 2025年5月8日

在 GitHub 查看
 (13 评论) (0 反应) (1 负责人)Java (8,123 star) (1,505 fork)batch import
Search:Aggregationsenhancementgood first issue

描述

Is your feature request related to a problem? Please describe

Currently, optimized histogram aggregation using multi range traversal initialized Ranges with all buckets eagerly. While for individual request, memory implications are small, it can starting adding up across all requests on a node.

Describe the solution you'd like

Given we process buckets one at a time, they can be initialized lazily avoiding unnecessary memory allocations. This should also allow to raise the number of buckets limit from 3k to 10k or more

Related component

No response

Describe alternatives you've considered

No response

Additional context

No response

贡献者指南

技术栈
java
领域
backendperformancesearch
议题类型
performance
难度面向新贡献者的预计实现难度，1 表示很小改动，5 表示专家级工作。
3
预计时间有经验贡献者完成调查、实现、测试并准备 pull request 的粗略时间范围。
1-2 days
活动状态议题当前的可参与程度：新鲜、活跃、陈旧、阻塞或等待维护者输入。
blocked
清晰度议题是否清楚说明期望改动、验收标准和下一步。
clear
前置要求
JavaOpenSearch aggregation internalslazy initializationmemory management
新手友好度1-100 的估计分数，表示该议题对首次贡献者的友好程度。
40
研究方向
The issue proposes lazy initialization of the Ranges object in histogram aggregation to reduce memory allocations. The implementation is likely in the aggregation module of OpenSearch, specifically in classes related to histogram aggregation. Review the current code where Ranges are eagerly created for all buckets and modify it to create Ranges only when needed, following the multi range traversal pattern described. Check issue comments for any specific file references or maintainer guidance on the preferred approach.
[Enhancement] Histogram aggregation should initialize Ranges lazily · opensearch-project/OpenSearch#18241 | Good First Issue