Abstract
For the compression of data fields in the records of a data file, the fixed-length minimum bit (FLMB) method is commonly used. The scheme requires a compression/decompression (C/D) table which could be very large in size. A large C/D table can occupy a large fraction of the main memory space, and it may cause excessive page swapping in virtual memory systems. To reduce the C/D table overhead storage, a two-stage data compression approach is studied in which several methods are used to further compress the C/D table itself. The resulting C/D table decompression time during the regular data decompression process is also examined.
Original language | English (US) |
---|---|
Pages (from-to) | 819-823 |
Number of pages | 5 |
Journal | Proceedings - IEEE Computer Society's International Computer Software and Applications Conference |
State | Published - Jan 1 1979 |
Event | Proc IEEE Comput Soc Int Comput Software Appl Conf 3rd - Chicago, IL, USA Duration: Nov 6 1979 → Nov 8 1979 |
ASJC Scopus subject areas
- Software
- Computer Science Applications