March 2019
Intermediate to advanced
336 pages
9h 9m
English
The T-tree is a balanced data structure that has both the index and actual data in memory. They are used in in-memory databases. T refers to the shape of the node. Each node consists of pointers to the parent node and the left and right child nodes. Each node in the tree node will have an ordered array of data pointers and extra control data.
T-trees have similar performance benefits to in-memory tree structures. A T-tree is implemented on top of a self-balancing binary search tree. This data structure is good for ordered scanning of data. It supports various degrees of isolation.
Read now
Unlock full access