CN1951017A - Method and apparatus for sequence data compression and decompression - Google Patents
Method and apparatus for sequence data compression and decompression Download PDFInfo
- Publication number
- CN1951017A CN1951017A CNA2005800149354A CN200580014935A CN1951017A CN 1951017 A CN1951017 A CN 1951017A CN A2005800149354 A CNA2005800149354 A CN A2005800149354A CN 200580014935 A CN200580014935 A CN 200580014935A CN 1951017 A CN1951017 A CN 1951017A
- Authority
- CN
- China
- Prior art keywords
- compression
- data segment
- template
- data
- parameters
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
- H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Mathematical Physics (AREA)
- Software Systems (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
The present invention provides a method and a device for XML compression and decompression. The XML document is assumed to consist of similar data blocks that can be decomposed into a single metadata template and enclosed content data. This template is analysed and LZW-based data compression (ZLIB) of the content data is performed using references to the positions in the template. The template itself is compressed separately. The content data pertaining to a data block are compressed block-wise (referred to as 'sequentially' in the application ) so that selective decompression of any data block can be performed without decompressing the entire file.
Description
Background technology
The present invention relates to a kind of method and apparatus of compression/de-compression data, relate in particular to a kind of method and device of sequential compression/decompressed data.
At present, sequential compression/decompressed data is a kind of method of data being carried out compression/de-compression commonly used.This method is to be used in the compression process data processed thereby to come the data of compression/de-compression back to reduce as a reference redundant, and the typical sequence compression scheme has LZ77 and Zlib.Zlib is based on a kind of sequential compression scheme of Huffman coding and LZ77.
Fig. 1 is a kind of structural representation block diagram of device of existing sequential compression/decompressed data.As shown in Figure 1, this device comprises: order coder 120 is used for N data segment of input done the as a whole sequential encoding compression of carrying out together; Memory 130 is used to preserve the good data of compression; Order decoder 140 is used for the data after the compression are carried out the order decoding, and utilizes data character or a concordance list that N data segment separated.Such compression method can obtain maximum compression efficiency, and the redundancy between the data segment can be saved.If particularly this N data segment has same or analogous data structure, then the redundancy of the data after the compression can significantly reduce.
Yet in device shown in Figure 1, it is impossible wanting each data segment after the compression is carried out arbitrary access.Because in compression process shown in Figure 1, the compression of a back data segment as data segment K (K is the arbitrary number among the 1-N), depend on all data segments that compressed of front, i.e. data segment 1-K.Therefore, when decompressing, must at first decompress to preceding all the compressed data segments (data segment 1-K) of this data segment (data segment K), then, the data segment after this compression (data segment K) could be decompressed comes out.An extreme example is, in order from the data after the compression, to obtain a last data segment (data segment N), all compressed data segments all must be contractd by decompress(ion) successively and be abandoned one by one before data segment N, are decompressed to could obtain data segment N at last always.
Fig. 2 is the structural representation block diagram of the device of another kind of existing sequential compression/decompressed data.Different with above-mentioned compression method is that data segment is compressed independently each other/decompresses.As shown in Figure 2, this device comprises: order coder 120, be used for data segment K is carried out sequential compression independently, and this data segment K is any one in 1-N the data segment; Memory 130 is used to preserve the good data segment K of compression; Order decoder 140 is used for the data segment K after the compression is decompressed and restores data segment K.In above-mentioned compression process, this N data segment is by compression/de-compression respectively, and the compression/decompression process of each data segment is separate, and the sequential compression of back one data segment/decompress does not also rely on the data segment that the front has been compressed.As obtaining data segment K,, and do not need its data segment that compresses is previously decompressed then as long as directly from memory 130, find the data segment K after the compression can carry out order decompression by decompressing.Because this device is a packed data section independently, therefore also just obtained these data segments are carried out random-access approach.Yet, also just because of each data segment by independent compression, thereby the redundancy between them can not be utilized, thereby causes the compression ratio of whole data very low.
Therefore, need a kind of method and device of new sequential compression/decompressed data, it can effectively compress data also can Random Access Data.
Summary of the invention
One of purpose of the present invention is the defective that solves existing sequential compression/decompression scheme (scheme), and a kind of method and device of new sequential compression/decompressed data is provided, also can Random Access Data thereby can effectively carry out sequential compression to data.
The invention provides the method for a data segment of a kind of sequential compression, this data segment has a kind of data structure.At first, obtain a plurality of compression parameters; Then, this data segment is carried out sequential compression, thereby obtain a data segment after the compression according to the compression parameters that is obtained.Wherein this data segment can be to obtain by data are carried out preliminary treatment.This compression parameters is to come from a storage device, and certainly, this compression parameters also can obtain after a template with this data structure is compressed.A template with this data structure is compressed the back except obtaining described compression parameters, also obtain a template after the compression.Data segment after template after this compression and the compression is stored respectively, and perhaps the template after this compression is dropped.
With it accordingly, the present invention also provides the method for the data segment after compression of a kind of order decompression, and this data segment has a kind of data structure.At first, obtain a plurality of decompressed parameters; Then, carry out order according to the data segment of the decompressed parameters that is obtained after and decompress, thereby obtain a data segment after the decompression this compression.This decompressed parameters is to come from a storage device, and certainly, this decompressed parameters also can obtain after the order decompression by the template after the compression is carried out, and this template has described data structure.Template after this compression is carried out order decompress the back except obtaining described decompressed parameters, also obtain a template after the decompression.Template after this decompression is dropped.
The present invention also provides the device of a data segment of a kind of sequential compression, and this device comprises a deriving means and a compression set, and this data segment has a kind of data structure.The device of a data segment of this sequential compression also can comprise a pretreatment unit, a storage device and a drop device selectively.This deriving means is used to obtain a plurality of compression parameters; This compression set is used for according to the compression parameters that is obtained, and described data segment is carried out sequential compression, thereby obtains a data segment after the compression.This compression set also is used for a template with this data structure is carried out sequential compression, thereby obtains the template after described compression parameters and the compression; This pretreatment unit obtains described data segment thereby be used for that data are carried out preliminary treatment; This storage device is used to store described compression parameters; This drop device is used to abandon the template after the described compression.
Corresponding with it, the invention provides the decompress device of the data segment after the compression of a kind of order, this device comprises a deriving means and a decompressing device.The device of the data segment after this compression that decompresses in proper order also can comprise a storage device and a drop device selectively.This deriving means is used to obtain a plurality of decompressed parameters; This decompressing device is used for according to the decompressed parameters that is obtained, and the data segment after the compression is carried out order decompress, thereby obtain a data segment after the decompression, and this data segment has a kind of specific data structure.This decompressing device is used for that also the template after the compression is carried out order and decompresses, thereby obtains the template after described decompressed parameters and the decompression, and this template has described data structure; This storage device is used to store described decompressed parameters; This drop device is used to abandon the template after this decompression.
The method and the device thereof of said sequence compression/de-compression data provided by the invention, after the data segment that has specific data structure for compressed, its data structure part (template) can be filtered off, so can improve the compression ratio of data; After a plurality of data segments with specific data structure are compressed respectively, the data structure part of each data segment all can be filtered off, but can only keep a template after the compression, or abandon template after all compressions, so can improve the compression ratio of data greatly, can carry out random process to each data segment again.
By following description and the claim that reference is carried out in conjunction with the accompanying drawings, other purpose of the present invention and achievement will be conspicuous, and the present invention is also had more comprehensively understanding.
Description of drawings
The present invention carries out detailed explanation by the mode of example with reference to accompanying drawing, wherein:
Fig. 1 is a kind of structural representation block diagram of device of existing sequential compression/decompressed data;
Fig. 2 is the structural representation block diagram of the device of another kind of existing sequential compression/decompressed data;
Fig. 3 is the structural representation block diagram of the device of a data segment of a sequential compression according to an embodiment of the invention;
Fig. 4 is the flow chart of a data segment of a sequential compression according to an embodiment of the invention;
Fig. 5 is the decompress structural representation block diagram of device of the data segment after the compression of an order according to an embodiment of the invention; With
Fig. 6 is the decompress schematic flow sheet of the data segment after the compression of an order according to an embodiment of the invention.
In all accompanying drawings, identical reference number is represented similar or identical feature and function.The present invention is further described in conjunction with the embodiments with reference to the accompanying drawings.
Embodiment
Fig. 3 is the structural representation block diagram of the device of a data segment of a sequential compression according to an embodiment of the invention, and this data segment has a kind of data structure.Device 300 comprises a deriving means 310 and a compression set 320.Device 300 also can comprise a pretreatment unit 330, a storage device 340 and a drop device 350.
Deriving means 310 is used to obtain a plurality of compression parameters, and these compression parameters have indicated the encoding compression information of the template with this data structure, comprises the information such as compress mode, memory location, data structure of this template.This compression parameters can obtain from storage device 340.This compression parameters is corresponding to the internal state of compression set 320 when having compressed the template with this data structure.
This pretreatment unit 330 can be exported various different classes of data segments according to different situations.For instance, can produce different data segments according to the different types of data of database input, in this case, at each data segment, the template of data structure that can correspondingly produce a correspondence is to be used to compress corresponding data segment.Certainly, also can design when a general template compresses for all types of data segments and use, but this scheme can only offer the compression ratio of a sub-optimal performance.
It is described that the running of device 300 sees following Fig. 4 for details.
Fig. 4 is the flow chart of a data segment of a sequential compression according to an embodiment of the invention.This data segment has a kind of data structure.At first, obtain a template (step S410) with this data structure.This template can be by carrying out obtaining after the preliminary treatment to the data that do not comprise any effective content.In this preprocessing process, can add a sign in ending place of this template, as end-of-file mark, this sign is used to show the end position of this template file.
As described below is the data structure of a television programme data:
<radioshow radioshowID=″″>
<description></description>
<start_time></start_time>
<end_time></end_time>
<party><host></host><participant></participant></party>
</radioshow>
The content of described template is above-mentioned data structure.
Then, this template is carried out sequential compression (step S420).Specifically, first initialization codes state carries out sequential compression to this template then, for example utilizes Zlib sequential compression algorithm, thereby obtains a template and an a plurality of compression parameters after the compression.This compression parameters can be used for compressing data segment to be compressed.This compression parameters has indicated the encoding compression information of this template and the memory location in compression set thereof, comprises the information such as compress mode, data structure, Huffman tabulation of this template.Need to prove that Zlib sequential compression operation method is not unique compression rule, the implementer can select different compression algorithms according to the needs of oneself.
Then, abandon template (step S430) after this compression.For compression ratio and the conserve storage that does not influence whole data, system can abandon the template after the compression.Because ending place of template has a sign, as end-of-file mark, after system reads this sign, can abandon the template of this compression automatically.Certainly, also can with the template stores after the compression in a specific memory section of a local storage device, decompress for being used in the future.Particularly when a plurality of data segments with this data structure compress by compress mode of the present invention respectively successively, can only keep the template after one of them compression, abandon the template after remaining compression.
Above-mentioned steps S410-S430 is by thereby a template with this data structure is carried out the process that sequential compression is obtained compression parameters.This compression parameters can be stored, as stores in the local storage device, for using when another data segment with same/similar data structure is compressed.In this case, if in a local storage device, preserved this compression parameters, then when the data segment that another is had same data structure compresses, then can not carry out above-mentioned steps S410-S430, promptly do not need a template with this data structure is compressed, and can directly from this storage device, obtain this compression parameters.It should be noted that before directly from this storage device, obtaining this compression parameters, should first initialization codes state, the compression parameters when guaranteeing that previous flow process finishes can not influence this flow process.
Next, obtain a data segment, this data segment has described data structure (step S440).This data segment is data to be carried out preliminary treatment obtain, and obtains a data segment that meets the XML form as the composing processing unit (publishingprocess) by data-base recording in XML (eXtensibleMarkup Language) form.Certainly, this data segment also can come from other data source.
Following Example can be described more specifically the relation between template and the data segment, for example, after the form preliminary treatment, obtains the data segment of two television programme data, and data segment 1 is:
<radioshow radioshowID=″new talk show″>
<description>a new TV talk show every Friday</description>
<start_time>7pm</start_time>
<end_time>8pm</end_time>
<party><host>Mr.XYZ</host><participant>Mr.ABC</participant></party>
</radioshow>
Data segment 2 is:
<radioshow radioshowID=″News report″>
<description>news report every evening</description>
<start_time>6pm</start_time>
<end_time>7pm</end_time>
<party><host>Mr.ABC</host><participant></participant></party>
</radioshow>
The something in common of above-mentioned two data segments is to have the data structure the same with above-mentioned template, difference is that each data segment includes different effective contents, as " the new talk show " in data segment 1, a new TV talk show every Friday etc., " News report " in data segment 2, news report every evening etc.
Again next, according to the compression parameters that has obtained data segment is carried out sequential encoding compression (step S450), because this compression parameters has comprised the compressed information and the information such as address stored and length of the template with same data structure, therefore, according to this compression parameters when this data segment is carried out sequential compression, the character string that the automatic search of characteristic meeting that sequential compression had had occurred, when searching the coded string that once in template, occurred, will export appearance position and the length of this character string in template automatically.So, the sequential encoding rule can be automatically with in this data segment with compressed the identical part of template substitute with memory address and length, this memory address is pointed to the template after this compression, the size of the data segment after the replacement is far smaller than original data segment.Because come this data segment is carried out sequential compression by means of the compression parameters that produces in this template procedure of compression, the template after the compression can be dropped simultaneously, thereby can improve the compression ratio of data segment greatly.
At last, store data segment (step S460) after this compression.In order not influence compression ratio, the storage area of the template after the storage area of the data segment after this compression and the compression is different, for example, can store with different filenames.
The foregoing description has been finished the compression to a data segment, under many circumstances, needs successively a plurality of data segments with same template to be carried out sequential compression.For example, can compress 20 television programme data (20 data segments just) successively, these television programme data have identical or similar data structure through after the preliminary treatment.After having compressed a data segment according to above-mentioned flow process S460, can continue to compress next data segment by above-mentioned flow process, it should be noted that, beginning in each flow process, need the initialization codes state, such as, empty all compression parameters in the compression set, compression parameters when guaranteeing that this flow process finishes can not influence next flow process, because the parameter of this flow process when finishing comprised some compression parameters corresponding to the effective content in this data segment.
Fig. 5 is the decompress structural representation block diagram of device of the data segment after the compression of an order according to an embodiment of the invention.Data segment after this compression is to be obtained by device 300, and this data segment has described data structure.Device 500 comprises a deriving means 510 and a decompressing device 520.Device 500 also can comprise a storage device 540 and a drop device 550.
Deriving means 510 is used to obtain a plurality of decompressed parameters, and these decompressed parameters have indicated the decompression information of the template after this compression, comprises the information such as decompression mode, memory location, data structure of this template.This compression parameters can come from storage device 540.The internal state of this decompressed parameters during corresponding to the template of decompressing device 520 after this compression that decompressed.
Decompressing device 520 is used for according to the decompressed parameters that is obtained, and the data segment after this compression is carried out order decompress, thereby obtain a data segment after the decompression.If can't directly from deriving means 510, obtain this decompressed parameters, then this decompressing device 520 also is used for the template after this compression is carried out the order decompression, thereby obtain a template and a described decompressed parameters after the decompression, this template has described data structure.
Storage device 540 is used to store the data segment after the decompression, also can be used for storing described decompressed parameters.
Drop device 550 is used to abandon the template after the decompression.
It is described that the running of device 500 sees following Fig. 6 for details.
Fig. 6 is decompress one a flow chart of an order according to an embodiment of the invention.Data segment after this compression is produced by Fig. 4 flow process, and this data segment has described data structure.
At first, obtain a template (step S610) after the compression, this template has described data structure.Template after this compression is to obtain from a storage device, also can be sent by network or other devices.Template after this compression can also be carried out sequential compression by the template that has a described data structure to and be obtained.
Then, the template after this compression is carried out order decompression (step S620).Specifically, after the decoded state initialization, the template after the compression is carried out order decompress, obtain a template and an a plurality of decompressed parameters after the decompression.This decompressed parameters can be used for decompressing data segment to be decompressed of back, this decompressed parameters comprises the decompression information of the template after this compression, comprises information such as decompression mode, address and data structure.This decompresses in proper order and can utilize Zlib order decompression operation rule.For conserve storage, the template (step S630) after discardable should the decompression, this abandons and can realize by the end-of-file mark of this template.
Thereby above-mentioned steps S610-S630 is by the template after the compression being carried out the process that decompressed parameters is obtained in the order decompression.This decompressed parameters can be stored, as stores in the local storage device, uses when decompressing for the data segment after another right compression, and this data segment has equally/similar data structure.In this case, if in a local storage device, preserved this decompressed parameters, then when the data segment after described another compression is decompressed, then can not carry out above-mentioned steps S410-S430, promptly do not need the template after the compression is decompressed, and can directly from this storage device, obtain this decompressed parameters.It should be noted that before directly from this storage device, obtaining this decompressed parameters, should first initialization codes state, the decompressed parameters when guaranteeing that previous flow process finishes can not influence this flow process.
Then, obtain a data segment (step S640) after the compression.Data segment after this compression can obtain from a storage device, also can be transmitted by network or other devices.
Subsequently, the data segment after this compression is carried out order decompress (step S650), this decompresses in proper order and can utilize Zlib order decompression operation rule.Find corresponding replacement information according to the memory address in the data segment of decompressed parameters that has obtained and compression, and this replacement information is substituted into data segment after the decompression, finally obtain a data segment after the complete decompression.Data segment after this decompression has described data structure, comprises specific effective content.
At last, store data segment (step S660) after this decompression.
Above-mentioned decompression process has been finished the decompression to the data segment after the compression, under many circumstances, needs successively the data segment after a lot of the compressions to be carried out order and decompresses identical/similar data structure that these data segments have.Behind the data segment after the compression that decompressed according to above-mentioned flow process S660, can continue by the data segment after the next compression of above-mentioned flow process decompression, it should be noted that, beginning in each flow process, need the initialization codes state, such as, empty all decompressed parameters in the compression set, decompressed parameters when guaranteeing that this flow process finishes can not influence next flow process, because the parameter of this flow process when finishing comprised some decompressed parameters corresponding to the effective content in this data segment.
The method of the sequential compression/decompressed data of the foregoing description, thus mainly be data to be converted to the data segment with same data structure by preprocessing process, and obtain simultaneously one the structure this data segment template be used for the compression/de-compression data.The compression of this method by having a kind of template of data structure to one, obtain having the data segment compression desired compression parameter of same data structure, and according to this parameter data segment is compressed, and abandon template after the compression, thus the data segment of high compression rate obtained.Simultaneously, because each data segment is to carry out sequential compression separately, therefore also just can each data segment of arbitrary access.Correspondingly, this method is by the decompression to the template after the compression, data segment decompression desired compression parameter after obtaining compressing, this data segment and this masterplate have same data structure, and decompress, thereby the data segment after decompression according to the data segment of this parameter after to compression.Simultaneously, because each data segment is to carry out sequential compression separately, therefore also just can decompress to the data segment after each compression individually.
Below experimental result can further specify compression ratio of the present invention and compare advantage with the compression ratio of prior art.This experiment comprises that the compression ratio of carrying out data segment compression with the described technology of Fig. 2 is a benchmark, and same data segment is carried out sequential compression, and the compression ratio of example of the present invention has improved 38.4%.All methods are all utilized the algorithm of Zlib as sequential compression/decompression.Following 1 couple of two kinds of result of form are described.
Form 1: experimental result
The technology of Fig. 2 | The present invention | |
Access | Can arbitrary access (independent data segment) | Can arbitrary access (independent data segment) |
The compression ratio improvement value | 0% | 38.4% |
Though through the present invention is described in conjunction with specific embodiments, for the skilled personage in present technique field, according to substituting of making of narration above, revise with variation will be conspicuous.Therefore, such substituting, in the spirit and scope that modifications and variations fall into attached claim the time, should be included among the present invention.
Claims (25)
1. the method for a data segment of a sequential compression, this data segment has a kind of data structure, comprises step:
A. obtain a plurality of compression parameters;
B. according to the compression parameters that is obtained, described data segment is carried out sequential compression, thereby obtain a data segment after the compression.
2. the method for claim 1, wherein step a is for to carry out sequential compression to a template with described data structure, thereby obtains described compression parameters.
3. method as claimed in claim 2, wherein step a also obtains a template after the compression.
4. method as claimed in claim 3 also comprises step: abandon the template after the described compression.
5. method as claimed in claim 3 also comprises step: store the data segment after template and the compression after the described compression respectively.
6. the method for claim 1, wherein the compression parameters described in the step a is from a storage device.
7. the method for claim 1 also comprises step: data are carried out preliminary treatment, thereby obtain described data segment.
8. the method for claim 1 also comprises step: store the data segment after the described compression.
9. order method of the data segment after the compression that decompresses, this data segment has a kind of data structure, comprises step:
A. obtain a plurality of decompressed parameters;
B. according to the decompressed parameters that is obtained, the data segment after the described compression is carried out order decompress, thereby obtain a data segment after the decompression.
10. method as claimed in claim 9, wherein step a decompresses for the template after the compression being carried out order, thereby obtains described decompressed parameters, and this template has described data structure.
11. method as claimed in claim 10 also comprises step: a template with described data structure is carried out sequential compression, thereby obtain the template after the described compression.
12. method as claimed in claim 11, the template after the described compression come from a storage device.
13. method as claimed in claim 10, wherein step a also obtains a template after the decompression.
14. method as claimed in claim 13 also comprises step: abandon the template after the described decompression.
15. method as claimed in claim 10 also comprises step: store the data segment after the described decompression.
16. method as claimed in claim 9, described decompressed parameters come from a storage device.
17. the device of a data segment of a sequential compression, this data segment has a kind of data structure, comprising:
A deriving means is used to obtain a plurality of compression parameters;
A compression set is used for according to the compression parameters that is obtained, and described data segment is carried out sequential compression, thereby obtains a data segment after the compression.
18. device as claimed in claim 17 also comprises: a pretreatment unit is used for data are carried out preliminary treatment, thereby obtains described data segment.
19. device as claimed in claim 17 also comprises: a storage device is used to store described compression parameters.
20. device as claimed in claim 17, wherein said compression set also are used for a template with described data structure is carried out sequential compression, thereby obtain the template after described compression parameters and the compression.
21. device as claimed in claim 20 also comprises: a drop device is used to abandon the template after the described compression.
The device of the data segment a 22. order decompresses after the compression, this data segment has a kind of data structure, comprising:
A deriving means is used to obtain a plurality of decompressed parameters;
A decompressing device is used for according to the decompressed parameters that is obtained, and the data segment after the described compression is carried out order decompress, thereby obtain a data segment after the decompression.
23. device as claimed in claim 22 also comprises: a storage device is used to store described decompressed parameters.
Decompress 24. device as claimed in claim 22, wherein said decompressing device are used for that also the template after the compression is carried out order, thereby obtain template after described decompressed parameters and the decompression, this template has described data structure.
25. device as claimed in claim 24 also comprises: a drop device is used to abandon the template after the described decompression.
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CNA2004100435620A CN1697327A (en) | 2004-05-13 | 2004-05-13 | Method and device for sequence data compression / decompression |
CN200410043562.0 | 2004-05-13 | ||
PCT/IB2005/051088 WO2005112270A1 (en) | 2004-05-13 | 2005-04-01 | Method and apparatus for structured block-wise compressing and decompressing of xml data |
Publications (1)
Publication Number | Publication Date |
---|---|
CN1951017A true CN1951017A (en) | 2007-04-18 |
Family
ID=34962052
Family Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CNA2004100435620A Pending CN1697327A (en) | 2004-05-13 | 2004-05-13 | Method and device for sequence data compression / decompression |
CNA2005800149354A Pending CN1951017A (en) | 2004-05-13 | 2005-04-01 | Method and apparatus for sequence data compression and decompression |
Family Applications Before (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CNA2004100435620A Pending CN1697327A (en) | 2004-05-13 | 2004-05-13 | Method and device for sequence data compression / decompression |
Country Status (5)
Country | Link |
---|---|
EP (1) | EP1751873A1 (en) |
JP (1) | JP2007537642A (en) |
KR (1) | KR20070011490A (en) |
CN (2) | CN1697327A (en) |
WO (1) | WO2005112270A1 (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN110518917A (en) * | 2019-07-17 | 2019-11-29 | 华东计算技术研究所(中国电子科技集团公司第三十二研究所) | LZW data compression method and system based on Huffman coding |
Families Citing this family (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7904417B2 (en) | 2006-02-27 | 2011-03-08 | Microsoft Corporation | Recursive metadata templating |
KR101454167B1 (en) * | 2007-09-07 | 2014-10-27 | 삼성전자주식회사 | Device and method for compressing and decompressing data |
KR101503829B1 (en) * | 2007-09-07 | 2015-03-18 | 삼성전자주식회사 | Device and method for compressing data |
JP5570202B2 (en) * | 2009-12-16 | 2014-08-13 | キヤノン株式会社 | Structured document analysis apparatus, structured document analysis method, and computer program |
US8751687B2 (en) | 2010-04-30 | 2014-06-10 | Microsoft Corporation | Efficient encoding of structured data |
US20110314070A1 (en) * | 2010-06-18 | 2011-12-22 | Microsoft Corporation | Optimization of storage and transmission of data |
Family Cites Families (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
FR2820563B1 (en) * | 2001-02-02 | 2003-05-16 | Expway | COMPRESSION / DECOMPRESSION PROCESS FOR A STRUCTURED DOCUMENT |
US20020107881A1 (en) * | 2001-02-02 | 2002-08-08 | Patel Ketan C. | Markup language encapsulation |
CA2437123C (en) * | 2001-02-05 | 2007-05-29 | Expway | Method and system for compressing structured descriptions of documents |
-
2004
- 2004-05-13 CN CNA2004100435620A patent/CN1697327A/en active Pending
-
2005
- 2005-04-01 WO PCT/IB2005/051088 patent/WO2005112270A1/en not_active Application Discontinuation
- 2005-04-01 CN CNA2005800149354A patent/CN1951017A/en active Pending
- 2005-04-01 KR KR1020067023759A patent/KR20070011490A/en not_active Application Discontinuation
- 2005-04-01 JP JP2007512605A patent/JP2007537642A/en active Pending
- 2005-04-01 EP EP05718613A patent/EP1751873A1/en not_active Withdrawn
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN110518917A (en) * | 2019-07-17 | 2019-11-29 | 华东计算技术研究所(中国电子科技集团公司第三十二研究所) | LZW data compression method and system based on Huffman coding |
CN110518917B (en) * | 2019-07-17 | 2023-01-03 | 华东计算技术研究所(中国电子科技集团公司第三十二研究所) | LZW data compression method and system based on Huffman coding |
Also Published As
Publication number | Publication date |
---|---|
EP1751873A1 (en) | 2007-02-14 |
CN1697327A (en) | 2005-11-16 |
JP2007537642A (en) | 2007-12-20 |
WO2005112270A1 (en) | 2005-11-24 |
KR20070011490A (en) | 2007-01-24 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US11044495B1 (en) | Systems and methods for variable length codeword based data encoding and decoding using dynamic memory allocation | |
EP3108584B1 (en) | Mehtods and devices for source-coding and decoding of data involving symbol compression | |
CN1951017A (en) | Method and apparatus for sequence data compression and decompression | |
US8578058B2 (en) | Real-time multi-block lossless recompression | |
US8836547B1 (en) | Server side data storage and deduplication | |
CN1183683C (en) | Position adaptive coding method using prefix prediction | |
CN111626411A (en) | Method and device for compressing data | |
CN1671103A (en) | Data compression | |
US7800519B2 (en) | Method and apparatus for compressing and decompressing data | |
CN1868127A (en) | Data compression system and method | |
CN1536068A (en) | Method for coding DNA sequence and device and computer readability medium | |
CN102724500B (en) | A kind of compressing/decompressing method of video data and system | |
CN101783788A (en) | File compression method, file compression device, file decompression method, file decompression device, compressed file searching method and compressed file searching device | |
US6919826B1 (en) | Systems and methods for efficient and compact encoding | |
US20090204626A1 (en) | Systems and methods for information compression | |
US20080122664A1 (en) | Huffman decoding method | |
CN101060337A (en) | An optimized Huffman decoding method and device | |
CN112380196A (en) | Server for data compression transmission | |
CN1209925C (en) | Data compress method based on higher order entropy of message source | |
CN100343851C (en) | Database compression and decompression method | |
CN1129232C (en) | Method for compressing and decompressing data in database | |
CN1645750A (en) | Coding and decoding method for variable long code | |
US7930435B2 (en) | Hub and spoke compression | |
CN1874231A (en) | Method for transmitting files | |
CN1780398A (en) | CAVLC decoding method |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
WD01 | Invention patent application deemed withdrawn after publication |
Open date: 20070418 |