T-tree (original) (raw)
T-дерево (англ. T-tree) — сбалансированное двоичное дерево, оптимизированное для случаев, когда востребованные («горячие») данные полностью хранятся в оперативной памяти. Используется многими резидентными СУБД, в том числе , , , , . Структура узла T-дерева может быть представлена следующим образом: struct t_tree_node{ void* parent; // сортированный массив указателей на данные void** data; // дополнительные управляющие данные void* control; void* left_child; void* right_child;}
| Property | Value |
|---|---|
| dbo:abstract | 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. 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 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. (en) Árvore T é em ciência da computação uma estrutura de dados empregada principalmente em bancos de dados em memória principal e alguns bancos de dados convencionais como índice. É uma estrutura baseada na árvore AVL, herdando dela a propriedade de ser uma árvore binária e auto- e possibilitando economia no uso de memória. Além disso é uma estrutura de índice que toma vantagem das características próprias da memória principal, como faz a árvore B+ mas para acesso a disco. Apesar das vantagens demonstradas, a árvore T pode ter problemas de desempenho em hardware moderno por não aproveitar adequadamente o espaço da memória cache do processador.A árvore T é uma árvore binária balanceada que busca obter benefícios de desempenho de estruturas tais como árvores AVL e árvores B. (pt) T-дерево (англ. T-tree) — сбалансированное двоичное дерево, оптимизированное для случаев, когда востребованные («горячие») данные полностью хранятся в оперативной памяти. Используется многими резидентными СУБД, в том числе , , , , . Структура узла T-дерева может быть представлена следующим образом: struct t_tree_node{ void* parent; // сортированный массив указателей на данные void** data; // дополнительные управляющие данные void* control; void* left_child; void* right_child;} (ru) |
| dbo:thumbnail | wiki-commons:Special:FilePath/T-tree-1.png?width=300 |
| dbo:wikiPageExternalLink | http://www.dependability.org/wg10.4/timedepend/08-Rasto.pdf http://www.oracle.com/technology/products/timesten/htdocs/faq/technical_faq.html%23%236 http://www.oracle.com/technology/products/timesten/pdf/wp/timesten_tech_wp_dec_2005.pdf http://code.google.com/p/ttree/ |
| dbo:wikiPageID | 1333086 (xsd:integer) |
| dbo:wikiPageLength | 7137 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID | 1080671828 (xsd:integer) |
| dbo:wikiPageWikiLink | dbr:Binary_tree dbc:Search_trees dbr:Quadtree dbr:R-tree dbr:MySQL_Cluster dbr:Dancing_tree dbr:TimesTen dbr:Subtree dbr:Computer_science dbr:B*-tree dbr:B+_tree dbr:B-tree dbr:Tree_(graph_theory) dbr:Tree_(set_theory) dbr:Data_structure dbr:Fusion_tree dbr:K-d_tree dbr:2-3-4_tree dbr:2-3_tree dbr:Datablitz dbr:EXtremeDB dbr:Exponential_tree dbr:File:T-tree-2.png dbr:Tree_structure dbr:Radix_tree dbr:AVL_tree dbc:Binary_trees dbr:UB-tree dbr:Tree_rotation dbr:Top_tree dbr:Octree dbr:Self-balancing_binary_search_tree dbr:Height-balanced_tree dbr:Main_memory_database dbr:AVL_trees dbr:File:T-tree-1.png |
| dbp:wikiPageUsesTemplate | dbt:CS-Trees dbt:For dbt:One_source |
| dcterms:subject | dbc:Search_trees dbc:Binary_trees |
| gold:hypernym | dbr:Structure |
| rdf:type | yago:WikicatBinaryTrees yago:LivingThing100004258 yago:Object100002684 yago:Organism100004475 yago:PhysicalEntity100001930 yago:Plant100017222 yago:WoodyPlant113103136 dbo:Building yago:Tree113104059 yago:VascularPlant113083586 yago:Whole100003553 |
| rdfs:comment | T-дерево (англ. T-tree) — сбалансированное двоичное дерево, оптимизированное для случаев, когда востребованные («горячие») данные полностью хранятся в оперативной памяти. Используется многими резидентными СУБД, в том числе , , , , . Структура узла T-дерева может быть представлена следующим образом: struct t_tree_node{ void* parent; // сортированный массив указателей на данные void** data; // дополнительные управляющие данные void* control; void* left_child; void* right_child;} (ru) 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. 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 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. (en) Árvore T é em ciência da computação uma estrutura de dados empregada principalmente em bancos de dados em memória principal e alguns bancos de dados convencionais como índice. É uma estrutura baseada na árvore AVL, herdando dela a propriedade de ser uma árvore binária e auto- e possibilitando economia no uso de memória. Além disso é uma estrutura de índice que toma vantagem das características próprias da memória principal, como faz a árvore B+ mas para acesso a disco. (pt) |
| rdfs:label | T-tree (en) Árvore T (pt) T-дерево (ru) |
| owl:sameAs | freebase:T-tree yago-res:T-tree wikidata:T-tree dbpedia-fa:T-tree dbpedia-hr:T-tree dbpedia-pt:T-tree dbpedia-ru:T-tree dbpedia-sr:T-tree dbpedia-th:T-tree https://global.dbpedia.org/id/2QaUW |
| prov:wasDerivedFrom | wikipedia-en:T-tree?oldid=1080671828&ns=0 |
| foaf:depiction | wiki-commons:Special:FilePath/T-tree-1.png wiki-commons:Special:FilePath/T-tree-2.png |
| foaf:isPrimaryTopicOf | wikipedia-en:T-tree |
| is dbo:wikiPageRedirects of | dbr:T-trees dbr:T_tree dbr:T_trees |
| is dbo:wikiPageWikiLink of | dbr:Scapegoat_tree dbr:List_of_data_structures dbr:Binary_search_tree dbr:List_of_graph_theory_topics dbr:Perst dbr:Unrolled_linked_list dbr:B-tree dbr:AVL_tree dbr:Ti-Tree dbr:Red–black_tree dbr:Splay_tree dbr:T-trees dbr:T_tree dbr:T_trees |
| is foaf:primaryTopic of | wikipedia-en:T-tree |
