Copyright © 1997 Elsevier Science Ltd. All rights reserved.
ESTIMATING BLOCK ACCESSES IN A B+-TREE WHOSE LEAF RECORDS ARE OF ARBITRARY SIZE†
Received 21 February 1993;
revised 24 April 1997.
Available online 10 April 2001.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
For batched searching of a B+-tree file, previous formulas which estimate the number of block accesses fail when the blocking factor at the leaf level is less than one. We overcome this weakness by developing both an exact formula and an approximate formula to estimate the number of block accesses in a batched search of a B+-tree file where the blocking factor at the leaf level may be less than one. © 1997 Elsevier Science Ltd
Author Keywords: Block Accesses, Blocking Factor, B+-Tree






E-mail Article
Add to my Quick Links

Cited By in Scopus (0)




