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.
Posts about B-Tree
  • VIDEOS: Data @Scale Boston

    Featuring: Ryan Mack, Facebook Boston Site Lead Description: @Scale is a series of technical conferences for engineers who build or maintain systems that are designed for scale.   Building applications and services that scale to millions or even billions of people presents a complex set of engineering challenges, many of them unprecedented. The @Scale community is ...

    David Cohen/ AllFacebookin Social Google Facebook Twitter YouTube- 7 readers -
Get the top posts daily into your mailbox!