T-tree
Sign in to savethumb|right|251px|An example T-tree
~6 min read
Encyclopedic overview
11 sectionsContents
- Node structures
- Algorithms
- Search
- Insertion
- Deletion
- Rotation and balancing
- Performance and Storage
- See also
- Other trees
- References
- External links
thumb|right|251px|An example T-tree
In computer science a T-tree is a type of binary tree data structure that is used by main-memory databases, such as Datablitz, eXtremeDB, MySQL Cluster, Oracle TimesTen and MobileLite.
Excerpted from Wikipedia’s “T-tree” article, available under the CC BY-SA 4.0 licence.