UB-tree
The UB-tree, also known as the Universal B-Tree, as proposed by Rudolf Bayer and Volker Markl is a balanced tree for storing and efficiently retrieving multidimensional data. Like a B+ tree, information is stored only in the leaves.
The UB-tree, also known as the Universal B-Tree, as proposed by Rudolf Bayer and Volker Markl is a balanced tree for storing and efficiently retrieving multidimensional data. Like a B+ tree, information is stored only in the leaves.
The UB-tree, also known as the Universal B-Tree, as proposed by Rudolf Bayer and Volker Markl is a balanced tree for storing and efficiently retrieving multidimensional data. Like a B+ tree, information is stored only in the leaves.
Source: Wikipedia "UB-tree" · CC BY-SA 4.0
Share this article: X · Bluesky