or "Bayer", after one of the original

designers of the algorithms and structure. A B-tree is _not_ (necessarily?) a "binary tree".

A B+-tree (as used by IBM's VSAM) is a B-tree where the leaves are also linked sequentially, thus allowing both fast random access and sequential access to data.

[Knuth's Art of Computer Programming].

[Example algorithm?]

Last updated: 2000-01-10

Nearby terms:

or "Bayer", after one of the originale} manager for {IBM PCs}.

Try this search on Wikipedia, OneLook, Google