Click here

B-tree

Most often used in databases and file systems, B-trees are tree structures (a type of data structure) that are optimized for situations when all or part of the tree must be maintained on a secondary storage device such as an optical disk or tape. A B-tree is designed to minimize the number of disk accesses.

See also tree structure.



Top Terms

Connect with Webopedia

  • The Difference Between Adware & Spyware

    Not technically fitting into either the virus or spam category we have spyware and adware, which are growing concerns for Internet users.

    Read More »

Did You Know? Archive »

  • Quick Reference Archive »