Skip to search formSkip to main contentSkip to account menu

T-tree

Known as: T tree, T trees, T-trees 
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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

28 relations
AVL treeB+ treeB-treeBinary tree

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Tree Structure Based Data Hiding for Progressive Transmission Images
Progressive image transmission (PIT) is supported by several encoders such as SPIHT, JPEG2000 and so on. However, few of data… 
2010
2010
Mining Several Kinds of Temporal Association Rules Enhanced by Tree Structures
Market basket analysis is one important application of knowledge discovery in databases. Real life market basket databases… 
2009
2009
Using Tectogrammatical Alignment in Phrase-Based Machine Translation
In this paper, we describe an experiment whose goal is to improve the quality of machine translation. Phrase-based machine… 
Review
2008
Review
2008
A Comparative Study of Main Memory Databases and Disk-Resident Databases
— Main Memory Database systems (MMDB) store their data in main physical memory and provide very high-speed access. Conventional… 
2008
2008
TGC-Tree: An Online Algorithm Tracing Closed Itemset and Transaction Set Simultaneously
Finding Association Rules is a classical data mining task. The most critical part of Association Rules Mining is about finding… 
2007
2007
CST-Trees: Cache Sensitive T-Trees
Researchers have modified existing index structures into ones optimized for CPU cache performance in main memory database… 
Highly Cited
2006
Highly Cited
2006
Placement of digital microfluidic biochips using the T-tree formulation
Droplet-based microfluidic biochips have recently gained much attention and are expected to revolutionize the biological… 
2005
2005
Scalability of indexing structures in a production systems testbed for computational research
Highly Cited
2004
Highly Cited
2004
Temporal floorplanning using the T-tree formulation
Improving logic capacity by time-sharing, dynamically reconfigurable FPGAs are employed to handle designs of high complexity and… 
2002
2002
Error resilience and recovery in streaming of embedded video
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)