A proposed Algorithm To Measure The Behavior Of B-Tree

Authors

  • SHAKIR M. HUSSAIN AL - RAFIDAIN UNIV, COLG.

DOI:

https://doi.org/10.25195/ijci.v27i1.218

Keywords:

B-trees algorithm

Abstract

This paper is a description and analysis of of one the data structure types called a B-tree. B-trees are balanced multi-branch tree structures which make it possible to maintain large files with a guaranteed efficiency. A proposed algorithm are presented here to help us to measure the behavior (such as the tree utilization and the leaf node utilization) of this type of data structure.

Downloads

Download data is not yet available.

Author Biography

SHAKIR M. HUSSAIN, AL - RAFIDAIN UNIV, COLG.

COMPUTER SCIENCE

Downloads

Published

1996-06-30