A comment on the double-chained tree
- 1 April 1972
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 15 (4) , 276
- https://doi.org/10.1145/361284.361301
Abstract
In 1963, Sussenguth [8] suggested that a file should be organized as a double-chained tree for searching and updating. Patt [5] then obtained the optimum double-chained tree under the assumption that no key may prefix another and that all terminal nodes (items of information) have equal probabilities of being searched. Stanfel [6, 7] explored the relation between the double-chained tree and variable length code [3] and solved a special integer programming problem which corresponds to the case of equal probabilities of terminal nodes and a finite set of available symbols for keys with different costs.Keywords
This publication has 4 references indexed in Scilit:
- Tree Structures for Optimal SearchingJournal of the ACM, 1970
- A comment on optimal tree structuresCommunications of the ACM, 1969
- Variable length tree structures having minimum average search timeCommunications of the ACM, 1969
- Use of tree structures for processing filesCommunications of the ACM, 1963