glycerine/bufftree

BP-Trees in Go. Buffered-Partitioned Arrays are used in the leaves. For single-threaded memory-only work, this is faster than tidwall.Btree, which was the old champion. Both are 2x as fast as a red-black tree. The drawback is no concurrent readers at the moment, because writes defer sorting, so even supposedly read-only scans must modify the data.

语言：Go · GitHub 星标：9 · Fork：0

在 GitHub 上查看原仓库