Matches in DBpedia 2014 for { <http://dbpedia.org/resource/B-tree> ?p ?o. }
Showing items 1 to 76 of
76
with 100 items per page.
- B-tree abstract "In computer science, a B-tree is a tree data structure that keeps data sorted and allows searches, sequential access, insertions, and deletions in logarithmic time. The B-tree is a generalization of a binary search tree in that a node can have more than two children (Comer 1979, p. 123). Unlike self-balancing binary search trees, the B-tree is optimized for systems that read and write large blocks of data. It is commonly used in databases and filesystems.".
- B-tree thumbnail B-tree.svg?width=300.
- B-tree wikiPageExternalLink btree.html.
- B-tree wikiPageExternalLink 14_2_B_Trees.html.
- B-tree wikiPageExternalLink view.php.
- B-tree wikiPageExternalLink cacheObliviousBTree.html.
- B-tree wikiPageExternalLink btree.
- B-tree wikiPageExternalLink TheDesignOfTheInfinityDatabaseEngine.htm.
- B-tree wikiPageExternalLink cbtree.html.
- B-tree wikiPageExternalLink MondR85.html.
- B-tree wikiPageExternalLink Bayer_hist.pdf.
- B-tree wikiPageExternalLink bstartree.html.
- B-tree wikiPageExternalLink btree.html.
- B-tree wikiPageExternalLink B-tree_and_UB-tree.
- B-tree wikiPageExternalLink watch?v=I22wEC1tTGo.
- B-tree wikiPageID "4674".
- B-tree wikiPageRevisionID "604548978".
- B-tree date "February 2012".
- B-tree deleteAvg "O".
- B-tree deleteWorst "O".
- B-tree hasPhotoCollection B-tree.
- B-tree insertAvg "O".
- B-tree insertWorst "O".
- B-tree inventedBy Edward_M._McCreight.
- B-tree inventedBy Rudolf_Bayer.
- B-tree inventedYear "1972".
- B-tree name "B-tree".
- B-tree reason "the discussion below uses "element", "value", "key", "separator", and "separation value" to mean essentially the same thing. The terms are not clearly defined. There are some subtle issues at the root and leaves".
- B-tree searchAvg "O".
- B-tree searchWorst "O".
- B-tree spaceAvg "O".
- B-tree spaceWorst "O".
- B-tree type "tree".
- B-tree subject Category:1971_introductions.
- B-tree subject Category:B-tree.
- B-tree subject Category:Database_index_techniques.
- B-tree subject Category:Trees_(data_structures).
- B-tree type Ability105616246.
- B-tree type Abstraction100002137.
- B-tree type Arrangement105726596.
- B-tree type Cognition100023271.
- B-tree type DataStructure105728493.
- B-tree type DatabaseIndexTechniques.
- B-tree type Know-how105616786.
- B-tree type Method105660268.
- B-tree type PsychologicalFeature100023100.
- B-tree type Structure105726345.
- B-tree type Technique105665146.
- B-tree comment "In computer science, a B-tree is a tree data structure that keeps data sorted and allows searches, sequential access, insertions, and deletions in logarithmic time. The B-tree is a generalization of a binary search tree in that a node can have more than two children (Comer 1979, p. 123). Unlike self-balancing binary search trees, the B-tree is optimized for systems that read and write large blocks of data. It is commonly used in databases and filesystems.".
- B-tree label "Arbre B".
- B-tree label "B-Albero".
- B-tree label "B-Baum".
- B-tree label "B-drzewo".
- B-tree label "B-tree".
- B-tree label "B-дерево".
- B-tree label "B木".
- B-tree label "B树".
- B-tree label "Árbol-B".
- B-tree label "Árvore B".
- B-tree label "شجرة باير".
- B-tree sameAs B-strom.
- B-tree sameAs B-Baum.
- B-tree sameAs Árbol-B.
- B-tree sameAs Arbre_B.
- B-tree sameAs B-Albero.
- B-tree sameAs B木.
- B-tree sameAs B_트리.
- B-tree sameAs B-drzewo.
- B-tree sameAs Árvore_B.
- B-tree sameAs m.01h9m.
- B-tree sameAs Q677051.
- B-tree sameAs Q677051.
- B-tree sameAs B-tree.
- B-tree wasDerivedFrom B-tree?oldid=604548978.
- B-tree depiction B-tree.svg.
- B-tree isPrimaryTopicOf B-tree.