[DGD] A good bigmap

[bart at wotf.org]

On Fri, 3 Aug 2018 14:30:10 -0700, Raymond Jennings wrote
> I actually wound up implementing a b-tree like implementation that
> subdivides the key space recursively.  Each level indexes the next
> lower one by the bottom key in the subnode's keyspace, with the leaf
> buckets allowed to be heavier than the branch buckets, and an attempt
> to insert into a bucket that's too full causes a node split
> (recursively if necessary) before reattempting.
> 
> Can anyone see any weaknesses in such a scheme?  Branch nodes are
> allowed to have 4 subnodes each and are split into subnodes of 2 each
> when necessary.

Btrees are a somewhat different trade-off, and a well established solution to
this problem, I see no reason why that shouldn't work. 

Bart.
--
https://www.bartsplace.net/
https://wotf.org/
https://www.flickr.com/photos/mrobjective/