Ｂ木びーき

noun

B-tree

A self-balancing tree data structure in computer science that maintains sorted data and allows searches, sequential access, insertions, and deletions in logarithmic time.

• データベースのインデックスにはＢ木きがよく使つかわれる。

  B-trees are often used for database indexes.