No full-text available
To read the full-text of this research,
you can request a copy directly from the author.
Random access data compression
... But schemes such as these are not general purpose and have limited usefulness. Byte Pair Encoding scheme [1] is a universal compression algorithm that supports random access for all types of data. The global substitution process of BPE produces a uniform data format that allows decompression to begin anywhere in the data. ...
... The following algorithm illustrates this compression process. 1 Read file into buffer 2 ...
... In this method, the Compression starts by replacing Quads, then Tris, and then pairs by the codes from 128 through 255. 1 Read File into the buffer 2 Code = 128 3 do { 4 Find the most frequent quad in Buffer 5 If No such quads, Then Break 6 ...
Random access text compression is a type of compression technique in which there is a direct access to the compressed data. It facilitates to start decompression from any place in the compressed file, not necessarily from first. If any byte changed during transmission, the remaining data can be retrieved safely. In this paper, a try has been made to develop few algorithms for random access text compression based on the byte pair encoding scheme (Gage, 1997). The BPE algorithm relies on the fact that ASCII character set uses only codes from 0 through 127. That frees up codes from 128 through 255 for use as pair codes. Pair code is a byte, used to replace the most frequently appearing pair of bytes in the text file. Five algorithms are developed based on this byte pair encoding scheme. These algorithms finds the unused bytes at each level and tries to use those bytes for replacing the most frequently used bytes
... Nibble codes were widely used in versions of text adventure games for small machines [Blank+95]. Philip Gage used a similar technique to compress an entire string table [Gage97]. Early versions of MacWrite used string compression ubiquitously, both in main memory and in text files [Bell+90]. ...
... Nibble codes were widely used in versions of text games for small machines [Blank+95]. Philip Gage used a similar technique to compress an entire string table [Gage97]. Early versions of MacWrite used compression ubiquitously, both in main memory and in text files [Bell+90]. ...
Class [Woolf97] or an Adapter class [Gamma+94] so that users don't have to be aware of the implementation. Consequences The system will use the most appropriate implementation for any task, reducing processing time which would be necessary to use an inappropriate representation. Code using each instance will use the common interface, and need not know the implementation, reducing programmer effort on the client side, increasing design quality and reusability. Representations can be chosen locally for each data structure. However: the resulting duplication can increase total memory requirements, increase programmer effort on the server side because multiple implementations are more complex than a single implementation, increase testing costs overall, because each alternative implementation must be tested, and require programmer discipline to avoid unnecessary dependencies by clients on a particular implementation. Known Uses Psion Software's EPOC32 C++ environment handles strings u...
ResearchGate has not been able to resolve any references for this publication.