en.unionpedia.org

UB-tree, the Glossary

Index UB-tree

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

  1. 6 relations: B+ tree, Multidimensional analysis, Rudolf Bayer, Self-balancing binary search tree, Volker Markl, Z-order curve.

  2. Database index techniques
  3. Search trees

B+ tree

A B+ tree is an m-ary tree with a variable but often large number of children per node.

See UB-tree and B+ tree

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.

See UB-tree and Rudolf Bayer

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.

See UB-tree and Volker Markl

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 UB-tree and Z-order curve

See also

Database index techniques

Search trees

References

[1] https://en.wikipedia.org/wiki/UB-tree

Also known as UB tree.