A proposed Algorithm To Measure The Behavior Of B-Tree
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...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | Arabic |
| Published: |
University of Information Technology and Communications
1996-06-01
|
| Series: | Iraqi Journal for Computers and Informatics |
| Subjects: | |
| Online Access: | http://ijci.uoitc.edu.iq/index.php/ijci/article/view/218 |