B-trees re-examined
- 1 February 1978
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 21 (2), 139-143
- https://doi.org/10.1145/359340.359348
Abstract
The B-tree and its variants have, with increasing frequency, been proposed as a basic storage structure for multiuser database applications. Here, three potential problems which must be dealt with in such a structure that do not arise in more traditional static directory structures are indicated. One problem is a possible performance penalty.This publication has 3 references indexed in Scilit:
- The UNIX time-sharing systemCommunications of the ACM, 1974
- VSAM data set design parametersIBM Systems Journal, 1974
- Organization and maintenance of large ordered indicesPublished by Association for Computing Machinery (ACM) ,1970