page_title: T-tree
hierarchical_section_title: T-tree
caption_attribution_description: English: Author: Hartmut Holzgraefe &lt;hartmut@mysql.com&gt;
context_page_description: In computer science a T-tree is a type of binary treedata structure that is used by main-memory databases, such as
  Datablitz, EXtremeDB, MySQL Cluster, Oracle TimesTen and MobileLite.
  A T-tree is a balanced index tree data structure optimized for cases
  where 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 block
  oriented secondary storage devices like hard disks. T-trees seek to gain the performance benefits
  of in-memory tree structures such as AVL trees while avoiding the large storage space overhead which
  is common to them.
  T-trees do not keep copies of the indexed data fields within the index tree nodes themselves. Instead, they take advantage of the fact that the actual data is always in main memory together with the index so that they just contain pointers to the actual data fields.
  The 'T' in T-tree refers to the shape of the node data structures
  in the original paper which first described this type of index.
context_section_description: In computer science a T-tree is a type of binary treedata structure that is used by main-memory databases, such as
  Datablitz, EXtremeDB, MySQL Cluster, Oracle TimesTen and MobileLite.
  A T-tree is a balanced index tree data structure optimized for cases
  where 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 block
  oriented secondary storage devices like hard disks.  T-trees seek to gain the performance benefits
  of in-memory tree structures such as AVL trees while avoiding the large storage space overhead which
  is common to them.
  T-trees do not keep copies of the indexed data fields within the index tree nodes themselves. Instead, they take advantage of the fact that the actual data is always in main memory together with the index so that they just contain pointers to the actual data fields.
  The 'T' in T-tree refers to the shape of the node data structures
  in the original paper which first described this type of index.
caption: An example T-tree.
exif: {}