Search Results for "b-tree implementation"

...A crash-safe monotonic ID generator capable of generating 75-125 million unique ID's per second. Zstd compression (use the compression build feature, disabled by default). Cpu-scalable lock-free implementation. Flash-optimized log-structured storage. Uses modern b-tree techniques such as prefix encoding and suffix truncation for reducing the storage costs of long keys with shared prefixes. If keys are the same length and sequential then the system can avoid storing 99%+ of the key data in most cases, essentially acting like a learned index. sled performs prefix encoding on long keys with similar prefixes that are grouped together in a range, as well as suffix truncation to further reduce the indexing costs of long keys.