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. © 1970, ACM. All rights reserved.
Author supplied keywords
Cite
CITATION STYLE
APA
Coffman, E. G., & Eve, J. (1970). File structures using hashing functions. Communications of the ACM, 13(7), 427–432. https://doi.org/10.1145/362686.362693
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free