B-tree
a self-balancing, tree-based data structure, that allows read/write access in logarithmic time
fusion tree
type of tree data structure that implements an associative array on w-bit integers
dancing tree
tree data structure similar to B+ trees
B*-tree
B-tree in which nodes are kept 2/3 full by redistributing keys to fill two child nodes, then splitting them into three nodes