T-tree
Sign in to savethumb|right|251px|An example T-tree
~6 min read
Article
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.
Connections
B-tree
Entity
tree
Entity
self-balancing binary search tree
Entity
computer science
Entity
International Standard Book Number
Entity
data structure
Entity
binary tree
Entity
heap
Entity
tree
Entity
binary search tree
Entity
red–black tree
Entity
AVL tree
Entity
associative array
Entity
hash tree
Entity
trie
Entity
set
Entity
binary heap
Entity
suffix tree
Entity
octree
Entity
splay tree
Entity