Leverage statistics in querying #25
Merged
Conversation
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 changes the representation of fixed-length array lengths from little endian 32 bit integers to 64 bit varints in the parser bytecode.
This adds support to the tree iterator for pruning inner nodes based on stored statistics, and also implements support in the executor so that text and numeric comparisons can benefit from query acceleration based on this pruning.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
This PR adds support in the executor for excluding inner tree nodes from exploration based on their statistics. For numerical and string comparisons, we can use the min/max statistics in the tree to accelerate queries. This works by compiling the user's where clause into a separate but similar expression structure to the one we use to filter nodes (a tree of function calls), which the tree iterator executes on the inner nodes of a tree. If statistics are inapplicable to a node we don't exclude it - only nodes that the statistics can prove are irrelevant are excluded.