Block Binary Search Tree

Abstract

This paper illustrates a novel data structure created by me called Block Binary Search Tree (BBST). BBST is a data structure which extends Binary Search Tree by replacing the key-value pair domain with an array of key-value pairs in each node of Binary Search Tree. It greatly reduces the space usage cost compared to B+ tree, Binary Search Trees and all kinds of different Self-Balancing Binary Search Trees such as AVL, RBT, Splay.