Definitions for b-tree

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


  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.


  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.


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

Select another language:

Discuss these b-tree definitions with the community:

Word of the Day

Would you like us to send you a FREE new word definition delivered to your inbox daily?

Please enter your email address:     


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


"b-tree." STANDS4 LLC, 2015. Web. 9 Oct. 2015. <>.

Are we missing a good definition for b-tree? Don't keep it to yourself...

Nearby & related entries:

Alternative searches for b-tree:

Thanks for your vote! We truly appreciate your support.