Conversation
jerry-024
marked this pull request as draft
September 15, 2026 06:14
jerry-024
marked this pull request as ready for review
September 15, 2026 07:17
jerry-024
marked this pull request as draft
September 15, 2026 10:23
jerry-024
marked this pull request as ready for review
September 15, 2026 10:23
This file contains hidden or 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
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.
Purpose
Avoid opening BTree global index files when their manifest metadata already proves that every indexed row matches an equality or range predicate. For example, an index whose values are all
dogshould not read and decode its posting list forcolumn = 'dog'.GlobalIndexIOMeta; retain the existing constructor for callers without row-count metadata.=,<,<=,>,>=, andBETWEEN, return the covered row range directly when both aggregate bounds match. Partial matches, unknown counts, sparse coverage, and nullable files keep the existing lookup path.fast/full/detailcoverage behavior. No on-disk format changes or index rebuilds are required.All-match range queries need no index I/O, so they do not consume the fallback scan budget; partially matching ranges remain subject to it.
Tests
paimon-commonandpaimon-core, with Checkstyle and Spotless enabled:mvn -pl paimon-core -am \ -DfailIfNoTests=false -DwildcardSuites=none \ -Dtest=LazyFilteredBTreeIndexReaderTest,SortedFileMetaSelectorTest,BTreeIndexReaderTest,BTreeIndexReaderCloseTest,BTreeThreadSafetyTest,GlobalIndexEvaluatorTest,BtreeGlobalIndexTableTest,DataEvolutionBatchScanTest,BTreeTopNIndexFileSelectorTest \ test