The real competitors to a Btree like data structure are trie based structures, such as burst tries, (optimised) q-fast and p-fast tries, level compressed tries, bucketed tries, path compressed tries, etc
Also optimised stratified trees (van emde boas) implementations where key length permits.
Full comparison based structures are rarely necessary: ints, floats, strings, etc can be dealt with by lexicographic structures
Tries in particular work outrageously well on (unrealistic) uniform random data with log-logarithmic operation times
As a result, I’m skeptical of “fastest” here
B trees are great though, good work!
Also optimised stratified trees (van emde boas) implementations where key length permits.
Full comparison based structures are rarely necessary: ints, floats, strings, etc can be dealt with by lexicographic structures
Tries in particular work outrageously well on (unrealistic) uniform random data with log-logarithmic operation times
As a result, I’m skeptical of “fastest” here
B trees are great though, good work!