Skip to content(if available)orjump to list(if available)

Real-world performance comparison of ebtree/cebtree/rbtree

andrewflnr

> it would likely be sufficient to apply a bijective (non-colliding) transformation like an avalanche hash to the stored keys to flatten everything

What are they referring to by "avalanche hash"? Trying to Google this just results in references to the avalanche effect in hash functions, which IIUC is just normal hash function stuff.