Open AccessA proposed Algorithm To Measure The Behavior Of B-Tree
Author(s) -
Shakir M. Hussain
Publication year - 1996
Publication title -
al-mağallaẗ al-ʿirāqiyyaẗ li-l-ḥāsibāt wa-al-maʿlūmāt/iraqi journal for computers and informatics
Language(s) - English
Resource type - Journals
eISSN - 2520-4912
pISSN - 2313-190X
DOI - 10.25195/ijci.v27i1.218
Subject(s) - tree (set theory) , measure (data warehouse) , computer science , b tree , tree structure , node (physics) , algorithm , data structure , fractal tree index , interval tree , segment tree , k ary tree , theoretical computer science , data mining , mathematics , binary tree , combinatorics , engineering , structural engineering , programming language
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.