Baunsgaard commented on PR #2292: URL: https://github.com/apache/iceberg-rust/pull/2292#issuecomment-4164170030
Just to make it complete, here are results from the Rust benchmark. Related PRs: - Java: https://github.com/apache/iceberg/pull/15791 - C++: https://github.com/apache/iceberg-cpp/pull/608 - Rust: https://github.com/apache/iceberg-rust/pull/2292 ### Benchmark results `insert_range()` (native roaring-rs range insert) vs a loop of individual `insert()` calls (--release, Rust 1.92, 5 iterations after 3 warmup): | Scenario | Before (insert loop) | After (insert_range) | Speedup | |---|---|---|---| | 100 positions | 1.7 µs | 73.6 ns | **23x** | | 10k positions | 127.4 µs | 76.8 ns | **1,659x** | | 200k positions | 1.79 ms | 151.4 ns | **11,811x** | | 1M positions | 12.30 ms | 1.1 µs | **11,196x** | | 10k cross-key boundary | 194.0 µs | 130.0 ns | **1,492x** | > The cross-key boundary scenario inserts 10k positions spanning the 32-bit key boundary (e.g., `(1LL << 32) - 5000` to `(1LL << 32) + 5000`). This exercises the key-splitting logic where the range is divided across two internal 32-bit Roaring bitmaps. -- 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] --------------------------------------------------------------------- To unsubscribe, e-mail: [email protected] For additional commands, e-mail: [email protected]
