Abstract
Four of the decoding techniques shown in Fig. 27 are to be described and analyzed. There are (1) the truncated fixed length keyword tree, (2) the unique truncation variable length key-word tree, (3) the complete variable length key-word tree, and (4) the randomizer. For convenience these descriptions will be shortened to the fixed tree, truncated variable tree, variable tree, and randomized methods, respectively. The procedure followed will be to describe and illustrate the methods of each, then to formulate expressions for retrieval time and storage requirements, and finally to compare them with respect to programming complexity, decoding speed, and memory requirement.
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Copyright information
© 1969 Computer Command and Control Company
About this chapter
Cite this chapter
Lefkovitz, D. (1969). Techniques of Directory Decoding. In: File Structures for On-Line Systems. Palgrave, London. https://doi.org/10.1007/978-1-349-00693-9_6
Download citation
DOI: https://doi.org/10.1007/978-1-349-00693-9_6
Publisher Name: Palgrave, London
Print ISBN: 978-1-349-00695-3
Online ISBN: 978-1-349-00693-9
eBook Packages: Computer ScienceComputer Science (R0)