Construct · 1 fields · 1 citations

B-tree: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Database systems

a balanced multiway search tree kept in disk pages, supporting logarithmic lookup, insertion and deletion for large indexes.

In database systems, B-tree refers to a balanced multiway search tree kept in disk pages, supporting logarithmic lookup, insertion and deletion for large indexes. This meaning comes from Bayer (1972) in Acta Informatica.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how B-tree sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

learned index1 fields · 1 citationsanchor · a standalone construct search4 fields · 7 citationsjingle · one word, four constructs tree3 fields · 4 citationsjingle · one word, three constructs

References

Bayer, R., & McCreight, E. M. (1972). Organization and maintenance of large ordered indexes. Acta Informatica, 1(3), 173-189. https://doi.org/10.1007/bf00288683

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct