The Average Height of a Node in the BANG Abstract Directory Tree

Abstract The abstract logical data structure for the BANG file directory is a multiway tree structure with one node for each bucket in the file. Under assumptions of “perfect hashing” or “growth on data principle”, we model the growth of the tree. The average cost for search and insertion is found to be logarithmic in the file size. The order constant is small and depends on the capacity of a bucket. Simulation confirms the analytic results. Similar assumptions should be applicable to the analysis of other multi-dimensional file structures.