Summary Of: B-tree

Encyclodia Page On: B-tree

These Are Links To Other Documents

binary tree | | | computer science | tree data structure | amortized | self-balancing binary search trees | databases | filesystems | self-balancing search trees | 2-3 tree | external nodes | secondary storage | hard drives | child nodes | internal node | disk block | Rudolf Bayer | Boeing | subtrees | binary search tree | Binary search | | | citation needed | clarification needed | citation needed | | original research | unverified claims | references | talk page | Robert Tarjan | amortized | citation needed | locking | databases | ISAM | B+ tree | B*-tree | B# tree | binary tree | red-black tree | dancing tree | skip list | R-tree | radix tree | UB-tree | k-d tree | Splay tree | | list of references | external links | inline citations | improve | where appropriate | Rudolf Bayer | Rudolf Bayer | Donald Knuth | ISBN 0-201-89685-0 | Thomas H. Cormen | Charles E. Leiserson | Ronald L. Rivest | Clifford Stein | Introduction to Algorithms | ISBN 0-262-03293-7 | Categories | Trees (structure) | 1971 introductions | All articles with unsourced statements | Articles with unsourced statements since July 2008 | Wikipedia articles needing clarification | Articles that may contain original research since August 2008 | All articles that may contain original research | Articles with unsourced statements since September 2007 | Articles lacking in-text citations |