Definitions for b-tree

This page provides all possible meanings and translations of the word b-tree

Wiktionary

  1. B-tree(Noun)

    An indexed data structure suitable for storage of a large number of items in a balanced fashion, with very few disk hits required for locating the correct record block.

Freebase

  1. 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. 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.

Translation

Find a translation for the b-tree definition in other languages:

Select another language:

Discuss these b-tree definitions with the community:


Citation

Use the citation below to add this definition to your bibliography:

Style:MLAChicagoAPA

"b-tree." Definitions.net. STANDS4 LLC, 2014. Web. 19 Apr. 2014. <http://www.definitions.net/definition/b-tree>.

Are we missing a good definition for b-tree?


The Web's Largest Resource for

Definitions & Translations


A Member Of The STANDS4 Network


Nearby & related entries:

Alternative searches for b-tree: