B-tree

related topics
{math, number, function}
{system, computer, user}
{woman, child, man}
{rate, high, increase}
{household, population, female}


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 amortized time. The B-tree is a generalization of a binary search tree in that a node can have more than two children. (Comer, 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.

Contents

Full article ▸

related documents
Queue (data structure)
XSL Transformations
Unicity distance
Oracle machine
Haar measure
Splitting lemma
Extended real number line
Richard's paradox
Axiom of pairing
Legendre symbol
Assignment problem
Functional analysis
Ring (mathematics)
Elementary group theory
Idempotence
Meromorphic function
Associativity
Mathematical model
Lazy evaluation
Examples of groups
Presburger arithmetic
Preorder
Lagrange inversion theorem
Chain rule
Statistical independence
Extended Backus–Naur Form
Referential transparency (computer science)
Consistency
Merkle-Hellman
Boolean ring