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.
Read Also:
- Bezier Curve
Pronounced bez-ee-ay, Bézier curves are curved lines (splines) defined by mathematical formulas. Nearly all draw programs support Bézier curves. Named after the French mathematician Pierre Bézier, Bézier curves employ at least three points to define a curve. The two endpoints of the curve are called anchor points. The other points, which define the shape of […]
- Baby AT
The form factor used by most PC motherboards prior to 1998. The original motherboard for the PC-AT measured 12″x13″. Baby AT motherboards are a little smaller, 8.5″x13″ usually. The Baby AT is being replaced by the new ATX form factor.
- Backspace key
A key that moves the cursor or insertion point backward one character space. In addition to moving the cursor backward, the Backspace key usually deletes the character to the left of the cursor or insertion point. It is particularly useful, therefore, for correcting typos. Note that PCs also have a Delete key, which deletes the […]
- Bad Frame Interpolation
Interpolates lost and/or corrupted packets by using the previously received voice frames. It increases voice quality by making the voice transmission more robust in bursty error environments.
- Banker Trojan
In computer and network security terminology, a Banker Trojan-horse (commonly called Banker Trojan) is a malicious program used in an attempt to obtain confidential information about customers and clients using online banking and payment systems.