Compute multiple aggregations in one iteration of the match-set
- Dominant language
- Java
- Stars
- 3.6k
- Forks
- 1.4k
- Avg merge
- 2d 11h
- Merged PRs (30d)
- 88
Description
### Description
When a user knows that they want multiple different aggregations, they have to iterate the match-set once for each aggregation, which [is inefficient](https://lists.apache.org/thread/dfw1knm6xqx03wmzq7c9wcxv4loqdg6p). We can remedy this by enabling users to request more than one aggregation in a faceting call and then by handling all the computations in one go.
Contributor guide
Research direction
Start by tracing the faceting call and the match-set iteration that currently computes one aggregation at a time. Determine how multiple aggregation requests should be represented and processed together. Done means a faceting call can request multiple different aggregations and the match-set is iterated only once for their computation.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- java
- Domain
- search
- Issue type
- Feature
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 35/100