UB-tree, the Glossary
The UB-tree as proposed by Rudolf Bayer and Volker Markl is a balanced tree for storing and efficiently retrieving multidimensional data.[1]
Table of Contents
6 relations: B+ tree, Multidimensional analysis, Rudolf Bayer, Self-balancing binary search tree, Volker Markl, Z-order curve.
- Database index techniques
- Search trees
B+ tree
A B+ tree is an m-ary tree with a variable but often large number of children per node.
Multidimensional analysis
In statistics, econometrics and related fields, multidimensional analysis (MDA) is a data analysis process that groups data into two categories: data dimensions and measurements.
See UB-tree and Multidimensional analysis
Rudolf Bayer
Rudolf Bayer (born 3 March 1939) is a German computer scientist.
Self-balancing binary search tree
In computer science, a self-balancing binary search tree (BST) is any node-based binary search tree that automatically keeps its height (maximal number of levels below the root) small in the face of arbitrary item insertions and deletions.
See UB-tree and Self-balancing binary search tree
Volker Markl
Volker Markl (born 1971) is a German computer scientist and database systems researcher.
Z-order curve
In mathematical analysis and computer science, functions which are Z-order, Lebesgue curve, Morton space-filling curve, Morton order or Morton code map multidimensional data to one dimension while preserving locality of the data points. UB-tree and z-order curve are database index techniques.
See also
Database index techniques
- B-tree
- BitFunnel
- Bitmap index
- Block Range Index
- Composite index (database)
- Compressed suffix array
- Database index
- Fractal tree index
- Grid (spatial index)
- Hierarchical navigable small world
- Incremental encoding
- Indexed file
- Inverted index
- K-D-B-tree
- K-d tree
- Log-structured merge-tree
- M-tree
- Octree
- PH-tree
- Priority R-tree
- Quadtree
- R*-tree
- R+ tree
- R-tree
- Reverse index
- Shardmap
- Substring index
- UB-tree
- Vantage-point tree
- X-tree
- Z-order curve
Search trees
- (a,b)-tree
- AA tree
- AVL tree
- B-tree
- Binary search tree
- Day–Stout–Warren algorithm
- Garsia–Wachs algorithm
- Interval tree
- Left-leaning red–black tree
- Optimal binary search tree
- Order statistic tree
- Red–black tree
- Scapegoat tree
- Search tree
- Splay tree
- T-tree
- Tango tree
- Threaded binary tree
- Treap
- Tree rotation
- UB-tree
- Van Emde Boas tree
- WAVL tree
- Weight-balanced tree
References
[1] https://en.wikipedia.org/wiki/UB-tree
Also known as UB tree.