ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Information Systems
Volume 22, Issue 5, July 1997, Pages 325-331
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (792 K)

  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/S0306-4379(97)00018-5    How to Cite or Link Using DOI (Opens New Window)
Copyright © 1997 Elsevier Science Ltd. All rights reserved.

ESTIMATING BLOCK ACCESSES IN A B+-TREE WHOSE LEAF RECORDS ARE OF ARBITRARY SIZE

Allaoua Maamira and William I. Groskyb

a Mathematics and Computer Science Department, UEA University, Al-Ain, United Arab Emirates b Computer Science Department, Wayne State University, Detroit, MI 48202, USA

Received 21 February 1993;
revised 24 April 1997.
Available online 10 April 2001.

Purchase the full-text article



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

Article Outline

1. INTRODUCTION
2. FLAT RANDOM FILES
3. TREE-STRUCTURED FILES - B+-TREES
4. CONCLUSION
References






Information Systems
Volume 22, Issue 5, July 1997, Pages 325-331
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.