A comparison of algorithms for data base compression by use of fragments as language elements
- 1 September 1974
- journal article
- Published by Elsevier in Information Storage and Retrieval
- Vol. 10 (9-10) , 309-319
- https://doi.org/10.1016/0020-0271(74)90069-2
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Selection of equifrequent word fragments for information retrievalInformation Storage and Retrieval, 1973
- The identification of variable-length, equifrequent character strings in a natural language data baseThe Computer Journal, 1972
- Program design for retrospective searches on large data basesInformation Storage and Retrieval, 1972
- Optimum procedures for economic information retrievalInformation Storage and Retrieval, 1970
- Finding the Shortest Route between Two Points in a NetworkThe Computer Journal, 1966
- Variable-Length Binary EncodingsBell System Technical Journal, 1959