-
Notifications
You must be signed in to change notification settings - Fork 25k
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Adjust DateHistogram's bucket accounting to be iteratively #101012
Merged
martijnvg
merged 3 commits into
elastic:main
from
martijnvg:aggs/date_histogram/consumeBucketsAndMaybeBreak
Oct 18, 2023
Merged
Changes from all commits
Commits
Show all changes
3 commits
Select commit
Hold shift + click to select a range
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,5 @@ | ||
pr: 101012 | ||
summary: Adjust `DateHistogram's` bucket accounting to be iteratively | ||
area: Aggregations | ||
type: bug | ||
issues: [] |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
|
@@ -310,6 +310,7 @@ protected boolean lessThan(IteratorAndCurrent<Bucket> a, IteratorAndCurrent<Buck | |
} | ||
} | ||
|
||
int consumeBucketCount = 0; | ||
List<Bucket> reducedBuckets = new ArrayList<>(); | ||
if (pq.size() > 0) { | ||
// list of buckets coming from different shards that have the same key | ||
|
@@ -323,6 +324,10 @@ protected boolean lessThan(IteratorAndCurrent<Bucket> a, IteratorAndCurrent<Buck | |
// the key changes, reduce what we already buffered and reset the buffer for current buckets | ||
final Bucket reduced = reduceBucket(currentBuckets, reduceContext); | ||
if (reduced.getDocCount() >= minDocCount || reduceContext.isFinalReduce() == false) { | ||
if (consumeBucketCount++ >= REPORT_EMPTY_EVERY) { | ||
reduceContext.consumeBucketsAndMaybeBreak(consumeBucketCount); | ||
consumeBucketCount = 0; | ||
} | ||
reducedBuckets.add(reduced); | ||
} | ||
currentBuckets.clear(); | ||
|
@@ -344,10 +349,14 @@ protected boolean lessThan(IteratorAndCurrent<Bucket> a, IteratorAndCurrent<Buck | |
final Bucket reduced = reduceBucket(currentBuckets, reduceContext); | ||
if (reduced.getDocCount() >= minDocCount || reduceContext.isFinalReduce() == false) { | ||
reducedBuckets.add(reduced); | ||
if (consumeBucketCount++ >= REPORT_EMPTY_EVERY) { | ||
reduceContext.consumeBucketsAndMaybeBreak(consumeBucketCount); | ||
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. I think we should only do this is is final reduce? |
||
consumeBucketCount = 0; | ||
} | ||
} | ||
} | ||
} | ||
|
||
reduceContext.consumeBucketsAndMaybeBreak(consumeBucketCount); | ||
return reducedBuckets; | ||
} | ||
|
||
|
@@ -387,7 +396,7 @@ private void addEmptyBuckets(List<Bucket> list, AggregationReduceContext reduceC | |
* consumeBucketsAndMaybeBreak. | ||
*/ | ||
class Counter implements LongConsumer { | ||
private int size = list.size(); | ||
private int size; | ||
|
||
@Override | ||
public void accept(long key) { | ||
|
@@ -490,11 +499,9 @@ private void iterateEmptyBuckets(List<Bucket> list, ListIterator<Bucket> iter, L | |
@Override | ||
public InternalAggregation reduce(List<InternalAggregation> aggregations, AggregationReduceContext reduceContext) { | ||
List<Bucket> reducedBuckets = reduceBuckets(aggregations, reduceContext); | ||
boolean alreadyAccountedForBuckets = false; | ||
if (reduceContext.isFinalReduce()) { | ||
if (minDocCount == 0) { | ||
addEmptyBuckets(reducedBuckets, reduceContext); | ||
alreadyAccountedForBuckets = true; | ||
} | ||
if (InternalOrder.isKeyDesc(order)) { | ||
// we just need to reverse here... | ||
|
@@ -508,9 +515,6 @@ public InternalAggregation reduce(List<InternalAggregation> aggregations, Aggreg | |
CollectionUtil.introSort(reducedBuckets, order.comparator()); | ||
} | ||
} | ||
if (false == alreadyAccountedForBuckets) { | ||
reduceContext.consumeBucketsAndMaybeBreak(reducedBuckets.size()); | ||
} | ||
return new InternalDateHistogram( | ||
getName(), | ||
reducedBuckets, | ||
|
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I think we should only do this is is final reduce?