forked from elastic/elasticsearch
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
ESQL: Syntax support and operator for count all (elastic#99602)
Introduce physical plan for representing query stats Use internal aggs when pushing down count Add support for count all outside Lucene
- Loading branch information
1 parent
b2c40ba
commit cab2736
Showing
26 changed files
with
1,724 additions
and
804 deletions.
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
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
163 changes: 163 additions & 0 deletions
163
...ugin/esql/compute/src/main/java/org/elasticsearch/compute/lucene/LuceneCountOperator.java
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,163 @@ | ||
| /* | ||
| * Copyright Elasticsearch B.V. and/or licensed to Elasticsearch B.V. under one | ||
| * or more contributor license agreements. Licensed under the Elastic License | ||
| * 2.0; you may not use this file except in compliance with the Elastic License | ||
| * 2.0. | ||
| */ | ||
|
|
||
| package org.elasticsearch.compute.lucene; | ||
|
|
||
| import org.apache.lucene.search.LeafCollector; | ||
| import org.apache.lucene.search.Query; | ||
| import org.apache.lucene.search.Scorable; | ||
| import org.apache.lucene.search.ScoreMode; | ||
| import org.apache.lucene.search.Weight; | ||
| import org.elasticsearch.compute.data.BooleanBlock; | ||
| import org.elasticsearch.compute.data.LongBlock; | ||
| import org.elasticsearch.compute.data.Page; | ||
| import org.elasticsearch.compute.operator.DriverContext; | ||
| import org.elasticsearch.compute.operator.SourceOperator; | ||
| import org.elasticsearch.search.internal.SearchContext; | ||
|
|
||
| import java.io.IOException; | ||
| import java.io.UncheckedIOException; | ||
| import java.util.List; | ||
| import java.util.function.Function; | ||
|
|
||
| /** | ||
| * Source operator that incrementally counts the results in Lucene searches | ||
| * Returns always one entry that mimics the Count aggregation internal state: | ||
| * 1. the count as a long (0 if no doc is seen) | ||
| * 2. a bool flag (seen) that's always true meaning that the group (all items) always exists | ||
| */ | ||
| public class LuceneCountOperator extends LuceneOperator { | ||
|
|
||
| private static final int PAGE_SIZE = 1; | ||
|
|
||
| private int totalHits = 0; | ||
| private int remainingDocs; | ||
|
|
||
| private final LeafCollector leafCollector; | ||
|
|
||
| public static class Factory implements LuceneOperator.Factory { | ||
| private final DataPartitioning dataPartitioning; | ||
| private final int taskConcurrency; | ||
| private final int limit; | ||
| private final LuceneSliceQueue sliceQueue; | ||
|
|
||
| public Factory( | ||
| List<SearchContext> searchContexts, | ||
| Function<SearchContext, Query> queryFunction, | ||
| DataPartitioning dataPartitioning, | ||
| int taskConcurrency, | ||
| int limit | ||
| ) { | ||
| this.limit = limit; | ||
| this.dataPartitioning = dataPartitioning; | ||
| var weightFunction = weightFunction(queryFunction, ScoreMode.COMPLETE_NO_SCORES); | ||
| this.sliceQueue = LuceneSliceQueue.create(searchContexts, weightFunction, dataPartitioning, taskConcurrency); | ||
| this.taskConcurrency = Math.min(sliceQueue.totalSlices(), taskConcurrency); | ||
| } | ||
|
|
||
| @Override | ||
| public SourceOperator get(DriverContext driverContext) { | ||
| return new LuceneCountOperator(sliceQueue, limit); | ||
| } | ||
|
|
||
| @Override | ||
| public int taskConcurrency() { | ||
| return taskConcurrency; | ||
| } | ||
|
|
||
| public int limit() { | ||
| return limit; | ||
| } | ||
|
|
||
| @Override | ||
| public String describe() { | ||
| return "LuceneCountOperator[dataPartitioning = " + dataPartitioning + ", limit = " + limit + "]"; | ||
| } | ||
| } | ||
|
|
||
| public LuceneCountOperator(LuceneSliceQueue sliceQueue, int limit) { | ||
| super(PAGE_SIZE, sliceQueue); | ||
| this.remainingDocs = limit; | ||
| this.leafCollector = new LeafCollector() { | ||
| @Override | ||
| public void setScorer(Scorable scorer) {} | ||
|
|
||
| @Override | ||
| public void collect(int doc) { | ||
| if (remainingDocs > 0) { | ||
| remainingDocs--; | ||
| totalHits++; | ||
| } | ||
| } | ||
| }; | ||
| } | ||
|
|
||
| @Override | ||
| public boolean isFinished() { | ||
| return doneCollecting || remainingDocs == 0; | ||
| } | ||
|
|
||
| @Override | ||
| public void finish() { | ||
| doneCollecting = true; | ||
| } | ||
|
|
||
| @Override | ||
| public Page getOutput() { | ||
| if (isFinished()) { | ||
| assert remainingDocs <= 0 : remainingDocs; | ||
| return null; | ||
| } | ||
| try { | ||
| final LuceneScorer scorer = getCurrentOrLoadNextScorer(); | ||
| // no scorer means no more docs | ||
| if (scorer == null) { | ||
| remainingDocs = 0; | ||
| } else { | ||
| Weight weight = scorer.weight(); | ||
| var leafReaderContext = scorer.leafReaderContext(); | ||
| // see org.apache.lucene.search.TotalHitCountCollector | ||
| int leafCount = weight == null ? -1 : weight.count(leafReaderContext); | ||
| if (leafCount != -1) { | ||
| // make sure to NOT multi count as the count _shortcut_ (which is segment wide) | ||
| // handle doc partitioning where the same leaf can be seen multiple times | ||
| // since the count is global, consider it only for the first partition and skip the rest | ||
| // SHARD, SEGMENT and the first DOC_ reader in data partitioning contain the first doc (position 0) | ||
| if (scorer.position() == 0) { | ||
| // check to not count over the desired number of docs/limit | ||
| var count = Math.min(leafCount, remainingDocs); | ||
| totalHits += count; | ||
| remainingDocs -= count; | ||
| scorer.markAsDone(); | ||
| } | ||
| } else { | ||
| // could not apply shortcut, trigger the search | ||
| scorer.scoreNextRange(leafCollector, leafReaderContext.reader().getLiveDocs(), remainingDocs); | ||
| } | ||
| } | ||
|
|
||
| Page page = null; | ||
| // emit only one page | ||
| if (remainingDocs <= 0 && pagesEmitted == 0) { | ||
| pagesEmitted++; | ||
| page = new Page( | ||
| PAGE_SIZE, | ||
| LongBlock.newConstantBlockWith(totalHits, PAGE_SIZE), | ||
| BooleanBlock.newConstantBlockWith(true, PAGE_SIZE) | ||
| ); | ||
| } | ||
| return page; | ||
| } catch (IOException e) { | ||
| throw new UncheckedIOException(e); | ||
| } | ||
| } | ||
|
|
||
| @Override | ||
| protected void describe(StringBuilder sb) { | ||
| sb.append(", remainingDocs=").append(remainingDocs); | ||
| } | ||
| } |
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
Oops, something went wrong.