Re: [math-fun] Asymptotically zero memory wasted inside dictionaries

On 6/22/14, Warren D Smith <warren.wds@gmail.com> wrote:

...

Any advantage over standard B trees?

--...I think Tom Rokicki is right: B trees are superior.

--wait a cotton picking minute. B trees fill their arrays with t to 2t elements hence may have fill fraction 50%. That is a big memory waste. My trees have asymptotically zero memory waste. That being said, it presumably is possible to change the parameters and algorithms of B trees and I think if you do so right, you'd get something similar to my trees in performance. Which would then be better? I am not sure.