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










LATEST ARTICLES
Texting & Chat Abbreviations

From A3 to ZZZ this guide lists 1,500 text message and online chat abbreviations to help you translate and understand today's texting lingo. Read More »

List of Well-Known TCP Port Numbers

Port numbers 0 to 1024 are reserved for privileged services and designated as well-known ports. This list of port numbers  are specified in... Read More »

STUDY GUIDES
Computer Architecture Study Guide

Computer architecture provides an introduction to system design basics for most computer science students. Read More »

Network Fundamentals Study Guide

Networking fundamentals teaches the building blocks of modern network design. Learn different types of networks, concepts, architecture and... Read More »

The Five Generations of Computers

Learn about each of the five generations of computers and major technology developments that have led to the computing devices that we use... Read More »