T-tree

In computer science a T-tree is a type of binary treedata structure that is used by main-memory databases, such asDatablitz, EXtremeDB, MySQL Cluster, Oracle TimesTen and MobileLite. In computer science a T-tree is a type of binary treedata structure that is used by main-memory databases, such asDatablitz, EXtremeDB, MySQL Cluster, Oracle TimesTen and MobileLite. A T-tree is a balanced index tree data structure optimized for caseswhere both the index and the actual data are fully kept in memory,just as a B-tree is an index structure optimized for storage on blockoriented secondary storage devices like hard disks. T-trees seek to gain the performance benefitsof in-memory tree structures such as AVL trees while avoiding the large storage space overhead whichis common to them.