Webopedia on Google+Webopedia on TwitterWebopedia on FacebookTech Bytes Blog
Main » TERM » B »

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.







TECH RESOURCES FROM OUR PARTNERS
LATEST ARTICLES
SEO Dictionary

From keyword analysis to backlinks and Google search engine algorithm updates, our search engine optimization glossary lists 85 SEO terms you need... Read More »

Slideshow: History of Microsoft Operating Systems

Microsoft Windows is a family of operating systems for personal computers. In this article we look at the history of Microsoft operating... Read More »

Slideshow: Interesting Facts About Google Search

From Goats to Penguins, a server outage and trillions of searches, our slideshow presents interesting facts about Google and the Google.com... Read More »

STUDY GUIDES
Java Basics, Part 1

Java is a high-level programming language. This guide describes the basics of Java, providing an overview of syntax, variables, data types and... Read More »

Java Basics, Part 2

This second Study Guide describes the basics of Java, providing an overview of operators, modifiers and control Structures. Read More »

The 7 Layers of the OSI Model

The Open System Interconnection (OSI) model defines a networking framework to implement protocols in seven layers. Use this handy guide to compare... Read More »