File structures using hashing functions
- 1 July 1970
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 13 (7), 427-432
- https://doi.org/10.1145/362686.362693
Abstract
A general method of file structuring is proposed which uses a hashing function to define tree structure. Two types of such trees are examined, and their relation to trees studied in the past is explained. Results for the probability distributions of path lengths are derived and illustrated.Keywords
This publication has 3 references indexed in Scilit:
- Scatter storage techniquesCommunications of the ACM, 1968
- Use of tree structures for processing filesCommunications of the ACM, 1963
- Some Combinatorial Properties of Certain Trees With Applications to Searching and SortingJournal of the ACM, 1962