Compression Dictionary Updates for Inter-Document Web Redundancy
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional data compression techniques, such as DEFLATE and VCDiff, face inefficiencies in utilizing inter-document redundancies for compressing web content, particularly in the SPDY protocol, leading to suboptimal compression ratios and increased processing complexity.
Innovation Solution
A method that updates the compression dictionary by incorporating additional redundancy information from a secondary dictionary, which correlates with the data to be compressed, to enhance compression performance while maintaining low complexity, specifically by using fingerprints to identify highly correlated subparts and inserting them into the initial compression dictionary.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If conventional data compression techniques (DEFLATE, VCDiff) are used, then compression is performed using a sliding window, but inter-document redundancies are not effectively utilized leading to suboptimal compression ratios
Solution Approach 1:
The patent segments the compression dictionary into two distinct parts: a primary dictionary containing recent data from the sliding window, and a secondary dictionary containing historical data from previously compressed documents. This segmentation allows the system to efficiently utilize inter-document redundancies without compromising the speed of accessing recent data, thereby improving compression ratios while maintaining manageable processing complexity.
Solution Approach 2:
The patent performs preliminary action by pre-processing and storing historical document data in the secondary dictionary before compression occurs. This pre-computed secondary dictionary is then integrated with the primary dictionary to enhance compression performance. By preparing the secondary dictionary in advance, the system avoids the complexity of real-time inter-document analysis during compression, thus improving compression ratios without proportionally increasing processing complexity.
2Productivity
If the compression dictionary size is increased to capture more redundancies, then compression performance improves, but memory requirements and processing complexity increase
Solution Approach 1:
The patent divides the compression dictionary into a primary dictionary (for recent data) and a secondary dictionary (for historical data). This segmentation allows the system to maintain a manageable primary dictionary in memory while storing the larger secondary dictionary in less frequently accessed memory or on disk, thus improving compression performance without proportionally increasing active memory requirements.
Solution Approach 2:
The patent applies partial action by selectively incorporating only the most relevant portions of historical data into the secondary dictionary, rather than storing entire previous documents. This selective approach captures sufficient inter-document redundancies to improve compression performance while keeping the dictionary size and memory requirements at manageable levels.
Data Source
AI summary
The present invention relates to data compression using compression dictionary. A compression method according to the invention comprises obtaining an initial compression dictionary and a separate secondary dictionary SD; determining at least one subpart of the secondary dictionary that correlates with a block of data DB to compress; updating the initial compression dictionary by inserting the determined at least one subpart therein, to obtain an updated compression dictionary used for compressing the block of data; and compressing the block of data using one or more references to entries of the obtained updated compression dictionary.


