Matches in DBpedia 2014 for { <http://dbpedia.org/resource/T-tree> ?p ?o. }
Showing items 1 to 32 of
32
with 100 items per page.
- T-tree abstract "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.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 structuresin the original paper that first described this type of index.".
- T-tree thumbnail T-tree-1.png?width=300.
- T-tree wikiPageExternalLink ttree.
- T-tree wikiPageExternalLink 08-Rasto.pdf.
- T-tree wikiPageExternalLink timesten_tech_wp_dec_2005.pdf.
- T-tree wikiPageExternalLink RaoR99.html.
- T-tree wikiPageID "1333086".
- T-tree wikiPageRevisionID "606306810".
- T-tree hasPhotoCollection T-tree.
- T-tree subject Category:Binary_trees.
- T-tree type BinaryTrees.
- T-tree type LivingThing100004258.
- T-tree type Object100002684.
- T-tree type Organism100004475.
- T-tree type PhysicalEntity100001930.
- T-tree type Plant100017222.
- T-tree type Tree113104059.
- T-tree type VascularPlant113083586.
- T-tree type Whole100003553.
- T-tree type WoodyPlant113103136.
- T-tree comment "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-tree label "T-tree".
- T-tree label "T-дерево".
- T-tree label "Árvore T".
- T-tree sameAs Árvore_T.
- T-tree sameAs m.04thc8.
- T-tree sameAs Q2562299.
- T-tree sameAs Q2562299.
- T-tree sameAs T-tree.
- T-tree wasDerivedFrom T-tree?oldid=606306810.
- T-tree depiction T-tree-1.png.
- T-tree isPrimaryTopicOf T-tree.
