JingsongLi opened a new pull request, #868: URL: https://github.com/apache/paimon-rust/pull/868
### Purpose Linked issue: N/A Improve sparse BTree IN queries so they do not sequentially scan unrelated key ranges between distant targets. ### Brief change log - Sort, deduplicate, and file-bound target keys before lookup. - Resolve target keys through the in-memory index block and group them by data block. - Read each target data block once and binary-seek each requested key within that block. - Remove the previous merge-style sequential scan across intermediate blocks and entries. ### Tests - Added a sparse multi-block test that covers unsorted, duplicate, missing, and out-of-bounds keys while asserting only target blocks are read. - Added a large single-block test that verifies sparse keys use logarithmic seeks instead of a linear entry scan. - cargo test -p paimon --lib btree:: - cargo clippy -p paimon --lib -- -D warnings - cargo fmt --all -- --check ### API and Format No API or storage-format changes. ### Documentation No documentation changes are required. -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. To unsubscribe, e-mail: [email protected] For queries about this service, please contact Infrastructure at: [email protected]
