euzu 1612a3a85a BPlusTree Breadth-First Persistence ...

Key Improvements:

- Sequential leaf access → 4-10x faster full tree iterations
- Better query locality → 10-30% faster queries via prefetching
- Contiguous levels → Sibling nodes adjacent on disk

Implementation:

- Two-phase algorithm: calculate offsets, then write nodes
- Added calculate_serialized_size() and serialize_breadth_first()
- Modified store() to use new layout

2025-12-27 10:42:20 +01:00

..

src

BPlusTree Breadth-First Persistence

2025-12-27 10:42:20 +01:00

build.rs

project shared added

2025-06-19 12:45:55 +02:00

Cargo.lock

project shared added

2025-06-19 12:45:55 +02:00

Cargo.toml

stream properties refactored

2025-12-27 09:52:28 +01:00