B-Tree Data Structure

A B-Tree Data Structure is a tree-based data structure where internal (non-leaf) nodes can have a variable number of child nodes within some pre-defined range.

• Context:
  • It can (typically) facilitate database searches, database sequential access, database insertions, and database deletions in logarithmic time.
  • …
• Example(s):
  • a Binary Search Tree.
  • …
• Counter-Example(s):
  • a Self-Balancing Binary Search Tree.
• See: Database Index, Search Tree.

---

---

References

• http://en.wikibooks.org/wiki/Data_Structures/Trees#B_Trees

2013

• http://en.wikipedia.org/wiki/B-tree
  • 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. Template:Harv 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.

---