Approximate storage utilisation of B-trees: a simple derivation and generalisations
Information Processing Letters
Real and complex analysis, 3rd ed.
Real and complex analysis, 3rd ed.
A population analysis for hierarchical data structures
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Analysis and applications of hierarchical data structures
Analysis and applications of hierarchical data structures
The design and analysis of spatial data structures
The design and analysis of spatial data structures
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
Extendible hashing—a fast access method for dynamic files
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |
The approximate average storage utilization of bucket methods with fanout of n, assuming a uniform distribution of data, is shown to depend only on the fanout and not on any other factors such as the directory structure. It obeys the formula (ln n)/(n - 1). The analysis makes use of a generalization of previously published methods for n = 2 and n = 4 and its predictions match these results. The formula is applicable to methods that are based on digital searching (e.g., tries) or balancing rather than comparison-based methods. The formula is also used to detect an erroneous statement about the average storage utilization of a ternary system in [12].