Storage Analysis Of A Compression Coding For Document Data Bases
- 1 February 1972
- journal article
- research article
- Published by Taylor & Francis in INFOR: Information Systems and Operational Research
- Vol. 10 (1) , 47-61
- https://doi.org/10.1080/03155986.1972.11731495
Abstract
Analysis is made of the effect of using an efficient code for compression of terms within a document data base. The storage efficiency is expressed in terms of the vocabulary length and the values of certain parameters which describe the structure of the code. For vocabularies of up to 100,000 terms the average code length is approximately twelve bits. No information is lost through term truncation or abbreviation. The tables required for coding and decoding may be ordered for rapid access without reduction in the ease of update.Keywords
This publication has 8 references indexed in Scilit:
- An Algorithm for Variable-Length Proper-Name CompressionInformation Technology and Libraries, 1970
- Optimum procedures for economic information retrievalInformation Storage and Retrieval, 1970
- Performance of Ruecking's Word-compression Method When Applied to Machine Retrieval from a Library CatalogInformation Technology and Libraries, 1969
- Compression Word Coding Techniques for Information RetrievalInformation Technology and Libraries, 1968
- Bibliographic Retrieval from Bibliographic Input; the Hypothesis and Construction of a TestInformation Technology and Libraries, 1968
- A “Law≓ of occurrences for words of low frequencyInformation and Control, 1967
- A Study of Methods for Systematically Abbreviating English Words and NamesJournal of the ACM, 1961
- A Method for the Construction of Minimum-Redundancy CodesProceedings of the IRE, 1952