© 1975 by British Computer Society
| ||||||||||||||||||||||||||||||||||||||||||||||||||||
Information compression by factorising common strings
Department of Computing and Control, Imperial College of Science and Technology, 48 Princes Gardens, London, UK
Data bases always contain some sequences of characters which occur more frequently than others. This paper provides a technique for data base compression which treats the more frequent sequences as common factors. The common factors are recoded in condense form and a typical data base may then occupy less than sixty per cent of its original storage space. In addition to storage economy, the technique provides for reduced data transmission time and has certain advantages from the security angle.
Received August 1973.
* Department of Computing and Control, Imperial College of Science and Technology, 48 Princes Gardens, London SW7 1LU