Abstract: A method, information processing system, and computer program storage product store data in an information processing system. Uncompressed data is received and the uncompressed data is divided into a series of vectors. A sequence of profitable bitmask patterns is identified for the vectors that maximizes compression efficiency while minimizes decompression penalty. Matching patterns are created using multiple bit masks based on a set of maximum values of the frequency distribution of the vectors. A dictionary is built based upon the set of maximum values in the frequency distribution and a bit mask savings which is a number of bits reduced using each of the multiple bit masks. Each of the vectors is compressed using the dictionary and the matching patterns with having high bit mask savings. The compressed vectors are stored into memory. Also, an efficient placement is developed to enable parallel decompression of the compressed codes.

Abstract: A method, system and program product for annotating a transient state of a computer displayed application enables annotation of transient applications particularly web based applications. A transient application address (or key) and state information related to an application at a transient state are stored in an annotation store along with an annotation. The annotation is related to the transient application by the application address or key. The application is automatically restored to the transient state when the annotation is requested. Optionally a screen capture of the application at the transient state is also presented.