a 2-3 tree with that every node has a buffer to buffer elem to be inserted.
B-ε Tree
A B-ε tree is a generalisation of a 2-3 tree where each internal node has between m and 2m keys, where 0 < m = O(Bε). Each node is also accompanied by a buffer of size k = O(B). This buffer space is used to queue pending inserts, just like in the BRT.
nanne007
commented
8 years ago
http://blog.omega-prime.co.uk/?p=197
2-3 tree
balanced tree
lookup: log(n) insertion: log(n)
B-Tree
every internal node has [m, 2m] elems.
Buffered Repo Tree(BRT)
a 2-3 tree with that every node has a buffer to buffer elem to be inserted.
B-ε Tree
A B-ε tree is a generalisation of a 2-3 tree where each internal node has between m and 2m keys, where 0 < m = O(Bε). Each node is also accompanied by a buffer of size k = O(B). This buffer space is used to queue pending inserts, just like in the BRT.