B-tree
id:
b-tree-162-13262859
title:
B-tree
text:
In computer science, a B-tree is a self-balancing tree data structure that maintains sorted data and allows searches, sequential access, insertions, and deletions in logarithmic time. The B-tree generalizes the binary search tree, allowing for nodes with more than two children. Unlike other self-balancing binary search trees, the B-tree is well suited for storage systems that read and write relatively large blocks of data, such as databases and file systems.
brand slug:
wiki
category slug:
encyclopedia
description:
A self-balancing, tree-based data structure, that allows read/write access in logarithmic time
original url:
https://en.wikipedia.org/wiki/B-tree
date created:
2001-11-27T08:55:06Z
date modified:
2024-08-28T00:18:52Z
main entity:
{"identifier":"Q677051","url":"https://www.wikidata.org/entity/Q677051"}
image:
fields total:
13
integrity:
15