Affiliation:
1. Univ. of Newcastle upon Tyne, England
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.
Publisher
Association for Computing Machinery (ACM)
Cited by
58 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Development of a Web Service for Tandem Repeat Detection;2023 27th International Computer Science and Engineering Conference (ICSEC);2023-09-14
2. Experiences with Secure Pipelines in Highly Regulated Environments;Proceedings of the 18th International Conference on Availability, Reliability and Security;2023-08-29
3. The fluctuations of the giant cluster for percolation on random split trees;Latin American Journal of Probability and Mathematical Statistics;2022
4. The asymptotic distribution of cluster sizes for supercritical percolation on random split trees;Random Structures & Algorithms;2021-09-20
5. Position Heaps for Cartesian-Tree Matching on Strings and Tries;String Processing and Information Retrieval;2021