CN104410424A - Quick lossless compression method of memory data of embedded device - Google Patents

Quick lossless compression method of memory data of embedded device Download PDF

Info

Publication number
CN104410424A
CN104410424A CN201410696377.5A CN201410696377A CN104410424A CN 104410424 A CN104410424 A CN 104410424A CN 201410696377 A CN201410696377 A CN 201410696377A CN 104410424 A CN104410424 A CN 104410424A
Authority
CN
China
Prior art keywords
length
record
character
byte
remaining
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.)
Granted
Application number
CN201410696377.5A
Other languages
Chinese (zh)
Other versions
CN104410424B (en
Inventor
宋彬
李慧玲
秦浩
裴远
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Xidian University
Original Assignee
Xidian University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Xidian University filed Critical Xidian University
Priority to CN201410696377.5A priority Critical patent/CN104410424B/en
Publication of CN104410424A publication Critical patent/CN104410424A/en
Application granted granted Critical
Publication of CN104410424B publication Critical patent/CN104410424B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Abstract

The invention discloses a quick lossless compression method of memory data of an embedded device and mainly solves the problem that the existing compression method has low memory page compression speed. The method is mainly characterized in that two compression formats suitable for memory page data are designed: in the first format, a first byte records character repeated length, shift distance and new character length, and residual new character length, new characters and residual shift distance are recorded in order from the second byte; in the second format, the first byte records a compression format mark, shift distance and new character length, and residual new character length, new characters, character repeated length and residual shift distance are recorded in order from the second byte. Compared with the existing LZO (Lempel-Ziv-Oberhumer) lossless compression method, the method has the advantages that compression and decompression speed of memory page data is increased, a higher compression ratio is obtained, the embedded device has higher memory data storage capacity and availability, and the method is applicable to limited storage embedded devices.

Description

The fast and lossless compression method of embedded device internal storage data
Technical field
The invention belongs to technical field of data processing, relate to the data compression method of embedded device internal storage data, the present invention adopts new data compression format to improve the speed of compression when data compression according to the feature of internal storage data, can be used in the embedded device of constrained storage.
Background technology
Internal memory is one of vitals of computer, and it is the bridge carrying out with CPU linking up.In computer, the operation of all programs is all carried out in internal memory.The performance of internal memory is very large on the impact of computer, and in the portable embedded equipment that volume, memory capacity are limited, the impact of internal memory on equipment performance and Consumer's Experience is particularly outstanding.In the last few years, along with the development of mobile Internet, portable embedded equipment such as mobile phone, panel computer etc. have become a kind of means of communication of people's indispensability.Therefore compress internal storage data, very high memory ability and utilance will improve the overall performance of equipment greatly.Along with social development, amount of information constantly increases, and the systematic function of people to embedded device it is also proposed higher requirement, as higher speed, lower power consumption, less volume, can access more information etc.In order to reach various performance requirements above, there has been proposed the method for various improvement.Compared to the breakthrough of the hardware technology of great number, one of method is exactly lossless data compression technology more rapidly and effectively.If use lossless data compression technology in embedded device, then can access more data in identical hardware memory space, improve memory usage, reduce costs, very high equipment performance and Consumer's Experience.In view of the various advantages of above-mentioned technology, use the technology of the improvement embedded system performance of this simple and inexpensive, research lossless data compression technology is necessary.
Lempel and Ziv proposed a kind of high efficiency undistorted compression technology in 1977, i.e. LZ77 lossless data compression algorithms, the cardinal principle of this compression algorithm utilizes the repetition word string occurred before shorter mark representative, and tag format is repeat length, offset distance, as abcdekabcdeha, then can be encoded into abcdek (5,6) ha to represent, so on the whole, shorter information replaces longer information, thus reaches the effect of compression.Nineteen eighty-two, algorithm is carried out improvement and proposes LZSS algorithm by James Storer and Thomas Szymanski on LZ77 basis, improves compression efficiency.Algorithm was carried out improvement again and proposed LZO algorithm by Lempel-Ziv-Oberhumer on the basis of LZSS afterwards, drastically increased compressed encoding speed.LZO algorithm is a kind of harmless data compression algorithm based on dictionary, has that compression speed is fast, the feature of instantaneity.This algorithm devises five kinds of data compression format according to different repeat lengths and offset distance, coding side is right according to coupling, i.e. repeat length, the size of offset distance selects a certain compressed format encodings, decoding end is by the different form of the first byte size discrimination these five kinds of compressed format, and maximum offset distance can reach 48K.The weak point that the method exists is that, from the beginning of internal memory " Paging system " proposition, the default size of memory pages is just set to 4096 bytes, i.e. 4KB.Although the memory pages size of computer is configurable in principle, the operating system of the overwhelming majority still adopts the 4KB page of acquiescence in the implementation.For ease of main-memory data management, reply internal storage data adopts the mode compressed page by page, and the LZO initial designs object data that to be reduction length indefinite, it is when compression memory data, very low compression ratio can only be obtained, effectively can not improve memory usage, and compression & decompression speed is all very slow.Therefore for internal storage data, all can not be suitable for by the compress mode of current LZO and compressed format.
Summary of the invention
The object of the invention is to the deficiency overcoming above-mentioned prior art, propose a kind of fast and lossless compression method of embedded device internal storage data, with can compression & decompression internal storage data faster, thus effectively improve memory ability and utilance.
Realizing technical scheme of the present invention is: according to the data characteristics of memory pages, and design a kind of compressed format of applicable memory pages, carry out compressed encoding for memory pages data, concrete steps comprise as follows:
(1) read a memory pages of internal storage data in embedded device, namely read memory pages page by page by the page-size of 4KB;
(2) whether the data judging the read page are new data, if institute's read data is not recorded in dictionary, be then judged as new data, and new data position is charged in dictionary, continue to read memory pages data, until there is not new data;
Described dictionary is the Hash table structure of directly accessing according to key value, and this key value is calculated by hash function;
(3) to the institute's read data be recorded in dictionary, according to character repeat length and offset distance, the distance namely in character current location and Hash table between record position, select different compressed format to encode:
8 are less than for character repeat length, and offset distance is less than or equal to the memory pages data of 2KB, its first byte record character repeat length L, offset distance D and fresh character length S; Remaining fresh character length M, fresh character C and remaining offset distance N is recorded successively from second byte;
Be less than 8 for not meeting character repeat length, and offset distance is less than or equal to the memory pages data of 2KB, its first byte recording compressed format denotation T, offset distance D and fresh character length S; Remaining fresh character length M, fresh character C, character repeat length L and remaining offset distance N is recorded successively from second byte;
(4) judge that whether coding site is currently read in memory pages ending, the data if so, then after output squeezing and the length of data, and record end flag, perform step (5), otherwise, return step (2), continue to read in new data;
(5) judge that whether current page is last memory pages of internal storage data bag, if so, then end-of-encode, otherwise, return step (1) and read in next memory pages.
The present invention due to adopted compressed format simple, thus improve the compression & decompression speed of memory pages data, and obtain better compression ratio, more significantly can improve internal storage data memory capacity and the utilance of embedded device.
Test result shows: the present invention is compared with current LZO lossless compression method, and its compression time improves 14.52%, and the decompression time improves 98.84%, and compression ratio improves 1.1%.
Accompanying drawing explanation
Fig. 1 is compression process figure of the present invention;
Fig. 2 is the compressed format figure in the present invention.
Embodiment
Below in conjunction with figure, the present invention is described in further detail:
With reference to Fig. 1, performing step of the present invention is as follows:
Step 1: read in a memory pages from the internal storage data bag of embedded device, namely read memory pages page by page by the page-size of 4KB.
Step 2: read in four characters from institute's rdma read page, do first time Hash operation, namely calculate key value by first hash function, this hash function is first hash function in current LZO lossless compression method.
Step 3: judge that whether the position of character is legal according to key value in step 2, if legal, then enter step 4, if illegal, then upgrade Hash table, this Hash table is the data structure of directly accessing according to key value, then returns step 2.
Described is legal, refers to that each position of depositing in Hash table can only according to a key value access.
Step 4: judge current Hash table deposit character in position whether with to read in character identical, if identical, then enter step 7, if not identical, then enter step 5.
Described position that current Hash table is deposited, refers to the position that the Hash table of directly accessing according to key value in step 2 is deposited.
Step 5: do second time Hash operation with the key value obtained in step 2, namely calculate second key value by second hash function, this hash function is second hash function in current LZO lossless compression method; Judge that whether character position is legal according to second key value again, if legal, then enter step 6, if illegal, then upgrade Hash table, return step 2.
Step 6: judge this Hash table deposit character in address whether with to read in character identical, if identical, then enter step 7, if not identical, then judge to read in character as fresh character C, and upgrade Hash table, return step 2.
Described address that Hash table is deposited, refers to the address that the Hash table of directly accessing according to second key value in step 5 is deposited.
Step 7: calculate fresh character length S, character repeat length L and offset distance D, the distance namely in character current location and Hash table between record position.
These computational methods are identical with the computational methods in current LZO lossless compression method.
Step 8: judge whether character repeat length is less than 8 and whether offset distance is less than or equal to 2KB, if so, then performs step 9; If not, then perform step 10.
Step 9: the record rule of character by compressed format 1 is encoded.
With reference to Fig. 2 (a), the step that this step carries out encoding according to the record rule of compressed format 1 is as follows:
9.1) front 3 record character repeat length L of first byte, rear 3 bits of the 4th, the 5th, the 6th record-shifted distance D of first byte, namely each records 1 bit;
9.2) judge whether fresh character length S is greater than 3, if not, then last 2 record fresh character length S of first byte, and fresh character C is recorded from second byte; If so, then last 2 of first byte be recorded as 0 as mark, and subtract 3 with fresh character length S, obtain remaining fresh character length M, judge whether remaining fresh character length M is greater than 255 again, if not, then record remaining fresh character length M, if, then record a byte 0, and subtract 255 with remaining fresh character length M, until remaining fresh character length is less than 255, record this remaining fresh character length, then record fresh character C;
9.3), after record fresh character completes, record remaining offset distance N, this remaining offset distance N is front 8 bits of offset distance D; Then step 11 is entered.
Step 10: the record rule of character by compressed format 2 is encoded.
With reference to Fig. 2 (b), the step that this step carries out encoding according to the record rule of compressed format 2 is as follows:
10.1) first 2 of first byte are recorded as 01 as compressed format mark T, and namely the 1st is recorded as 0, and the 2nd is recorded as 1, and rear 4 bits of the 3rd, the 4th, the 5th, the 6th record-shifted distance D of first byte, namely each records 1 bit.
10.2) judge whether fresh character length S is greater than 3, if not, then last 2 record fresh character length S of first byte, namely each records 1 bit, and records fresh character from second byte; If so, then last 2 of first byte be recorded as 0 as mark, and subtract 3 with fresh character length S, obtain remaining fresh character length M, judge whether remaining fresh character length M is greater than 255 again, if not, then record remaining fresh character length M, if, then record a byte 0, and subtract 255 with remaining fresh character length M, until remaining fresh character length is less than 255, record this remaining fresh character length, then record fresh character C;
10.3), after record fresh character completes, judge whether character repeat length L is greater than 255, if not, then record character repeat length L, if so, then record a byte 0, and subtract 255 with character repeat length L, until character repeat length is less than 255, record this character repeat length;
10.4), after record character repeat length completes, record remaining offset distance N, this remaining offset distance N is front 8 bits of offset distance D.
Step 11: judge that whether coding site is identical with current memory pages end position of reading in, if identical, then the data after output encoder and the length of data, and record end flag, then enter step 12, if not identical, then returns step 2.
Described end mark, refers to the data of record three bytes, and namely the 1st byte records is that the 17,2nd and the 3rd byte is all recorded as 0.
Step 12: judge that whether the current memory page is last memory pages of internal storage data bag, i.e. whether all data in the internal storage data bag of embedded device are all read, if so, then end-of-encode, if not, then return step 1.
Below in conjunction with experiment, effect of the present invention is described further:
This experiment adopts C language to write the compression method that invention proposes, and by comparing the present invention and current LZO lossless compression method to the compression effectiveness of internal memory page data, the advantage of the inventive method compression & decompression speed is described.LZO is lossless compression method best at present.The internal storage data that this experiment adopts is the memory pages data of the 4KB size of representative mobile device, and experiment usage data is memory pages packet, and data package size is 453MB.In VS2010 programming development environment, use the present invention and current LZO lossless compression method compression memory page data respectively, experimental result is as shown in table 1:
Table 1
Time in table 1 is compression time and decompression time of all memory pages of whole compressed package, and in form, data have run the result be averaged for 1000 times.As can be seen from Table 1, compression ratio of the present invention improves 1.1%, and compression time and decompression time improve 14.52% and 98.84% respectively simultaneously, thus improve embedded memory data storage capacity and utilance.

Claims (5)

1. a fast and lossless compression method for embedded device internal storage data, comprises the steps:
(1) read a memory pages of internal storage data in embedded device, namely read memory pages page by page by the page-size of 4KB;
(2) whether the data judging the read page are new data, if institute's read data is not recorded in dictionary, be then judged as new data, and new data position is charged in dictionary, continue to read memory pages data, until there is not new data;
Described dictionary is the Hash table structure of directly accessing according to key value, and this key value is calculated by hash function;
(3) to the institute's read data be recorded in dictionary, according to character repeat length and offset distance, the distance namely in character current location and Hash table between record position, select different compressed format to encode:
8 are less than for character repeat length, and offset distance is less than or equal to the memory pages data of 2KB, its first byte record character repeat length L, offset distance D and fresh character length S; Remaining fresh character length M, fresh character C and remaining offset distance N is recorded successively from second byte;
Be less than 8 for not meeting character repeat length, and offset distance is less than or equal to the memory pages data of 2KB, its first byte recording compressed format denotation T, offset distance D and fresh character length S; Remaining fresh character length M, fresh character C, character repeat length L and remaining offset distance N is recorded successively from second byte;
(4) judge that whether coding site is currently read in memory pages ending, the data if so, then after output squeezing and the length of data, and record end flag, perform step (5), otherwise, return step (2), continue to read in new data;
(5) judge that whether current page is last memory pages of internal storage data bag, if so, then end-of-encode, otherwise, return step (1) and read in next memory pages.
2. the fast and lossless compression method of embedded device internal storage data according to claim 1, is characterized in that: first byte record character repeat length L, offset distance D described in step (3) and fresh character length S, according to the following rules record:
Front 3 record character repeat length L, the L<8 of first byte;
Rear 3 bits of the 4th, the 5th, the 6th record-shifted distance D of first byte, namely each records 1 bit;
Judge whether fresh character length S is greater than 3, if not, then last 2 record fresh character length S of first byte, namely each records 1 bit, if so, then first byte last 2 be recorded as 0 as mark, and subtract 3 with fresh character length S, obtain remaining fresh character length M.
3. the fast and lossless compression method of embedded device internal storage data according to claim 1, it is characterized in that: described in step (3), from second byte, record remaining fresh character length M, fresh character C and remaining offset distance N successively, record according to the following rules:
Judge whether remaining fresh character length M is greater than 255, if not, then record remaining fresh character length M, if so, then record a byte 0, and subtract 255 with remaining fresh character length M, until remaining fresh character length is less than 255, records this remaining fresh character length, then record fresh character C;
After record fresh character completes, record remaining offset distance N, this remaining offset distance N is front 8 bits of offset distance D.
4. the fast and lossless compression method of embedded device internal storage data according to claim 1, is characterized in that: first byte recording compressed format denotation T, offset distance D described in step (3) and fresh character length S, according to the following rules record:
First 2 of first byte are recorded as 01 as compressed format mark T, and namely the 1st is recorded as 0, and the 2nd is recorded as 1;
Rear 4 bits of the 3rd, the 4th, the 5th, the 6th record-shifted distance D of first byte, namely each records 1 bit;
Judge whether fresh character length S is greater than 3, if not, then last 2 record fresh character length S of first byte, namely each records 1 bit, if so, then first byte last 2 be recorded as 0 as mark, and subtract 3 with fresh character length S, obtain remaining fresh character length M.
5. the fast and lossless compression method of embedded device internal storage data according to claim 1, it is characterized in that: described in step (3), from second byte, record remaining fresh character length M, fresh character C, character repeat length L and remaining offset distance N successively, record according to the following rules:
Judge whether remaining fresh character length M is greater than 255, if not, then record remaining fresh character length M, if so, then record a byte 0, and subtract 255 with remaining fresh character length M, until remaining fresh character length is less than 255, records this remaining fresh character length, then record fresh character C;
After record fresh character completes, judge whether character repeat length L is greater than 255, if not, then record character repeat length L, if so, then record a byte 0, and subtract 255 with character repeat length L, until character repeat length is less than 255, record this character repeat length;
After record character repeat length completes, record remaining offset distance N, this remaining offset distance N is front 8 bits of offset distance D.
CN201410696377.5A 2014-11-26 2014-11-26 The fast and lossless compression method of embedded device internal storage data Active CN104410424B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410696377.5A CN104410424B (en) 2014-11-26 2014-11-26 The fast and lossless compression method of embedded device internal storage data

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410696377.5A CN104410424B (en) 2014-11-26 2014-11-26 The fast and lossless compression method of embedded device internal storage data

Publications (2)

Publication Number Publication Date
CN104410424A true CN104410424A (en) 2015-03-11
CN104410424B CN104410424B (en) 2017-06-16

Family

ID=52648025

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410696377.5A Active CN104410424B (en) 2014-11-26 2014-11-26 The fast and lossless compression method of embedded device internal storage data

Country Status (1)

Country Link
CN (1) CN104410424B (en)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106385260A (en) * 2016-09-28 2017-02-08 中国电子科技集团公司第二十八研究所 FPGA realization system of LZ lossless compression algorithm based on low delay
CN107967296A (en) * 2017-10-31 2018-04-27 西安空间无线电技术研究所 A kind of improvement LZO compression methods of quick low-resource expense
CN110417923A (en) * 2018-04-26 2019-11-05 阿里巴巴集团控股有限公司 A kind of DNS message processing method, device and equipment
CN112230032A (en) * 2020-08-03 2021-01-15 青岛鼎信通讯股份有限公司 Electric energy meter data compression and decompression method
CN114244373A (en) * 2022-02-24 2022-03-25 麒麟软件有限公司 LZ series compression algorithm coding and decoding speed optimization method
CN114598329A (en) * 2022-03-18 2022-06-07 电子科技大学 Lightweight lossless compression method for rapid decompression application

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5455576A (en) * 1992-12-23 1995-10-03 Hewlett Packard Corporation Apparatus and methods for Lempel Ziv data compression with improved management of multiple dictionaries in content addressable memory
US7190284B1 (en) * 1994-11-16 2007-03-13 Dye Thomas A Selective lossless, lossy, or no compression of data based on address range, data type, and/or requesting agent
CN103138764A (en) * 2011-11-22 2013-06-05 上海麦杰科技股份有限公司 Method and system for lossless compression of real-time data
CN103236847A (en) * 2013-05-06 2013-08-07 西安电子科技大学 Multilayer Hash structure and run coding-based lossless compression method for data
CN103258030A (en) * 2013-05-09 2013-08-21 西安电子科技大学 Mobile device memory compression method based on dictionary encoding and run-length encoding
CN103618554A (en) * 2013-12-01 2014-03-05 西安电子科技大学 Internal storage page compression method based on dictionary
CN104050269A (en) * 2014-06-23 2014-09-17 上海帝联信息科技股份有限公司 Log compression method and device and log decompression method and device
CN104125458A (en) * 2013-04-27 2014-10-29 展讯通信(上海)有限公司 Lossless stored data compression method and device

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5455576A (en) * 1992-12-23 1995-10-03 Hewlett Packard Corporation Apparatus and methods for Lempel Ziv data compression with improved management of multiple dictionaries in content addressable memory
US7190284B1 (en) * 1994-11-16 2007-03-13 Dye Thomas A Selective lossless, lossy, or no compression of data based on address range, data type, and/or requesting agent
CN103138764A (en) * 2011-11-22 2013-06-05 上海麦杰科技股份有限公司 Method and system for lossless compression of real-time data
CN104125458A (en) * 2013-04-27 2014-10-29 展讯通信(上海)有限公司 Lossless stored data compression method and device
CN103236847A (en) * 2013-05-06 2013-08-07 西安电子科技大学 Multilayer Hash structure and run coding-based lossless compression method for data
CN103258030A (en) * 2013-05-09 2013-08-21 西安电子科技大学 Mobile device memory compression method based on dictionary encoding and run-length encoding
CN103618554A (en) * 2013-12-01 2014-03-05 西安电子科技大学 Internal storage page compression method based on dictionary
CN104050269A (en) * 2014-06-23 2014-09-17 上海帝联信息科技股份有限公司 Log compression method and device and log decompression method and device

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106385260A (en) * 2016-09-28 2017-02-08 中国电子科技集团公司第二十八研究所 FPGA realization system of LZ lossless compression algorithm based on low delay
CN106385260B (en) * 2016-09-28 2019-05-21 中电莱斯信息系统有限公司 A kind of FPGA realization system of the LZ lossless compression algorithm based on low delay
CN107967296A (en) * 2017-10-31 2018-04-27 西安空间无线电技术研究所 A kind of improvement LZO compression methods of quick low-resource expense
CN107967296B (en) * 2017-10-31 2020-06-09 西安空间无线电技术研究所 Improved LZO compression method with rapid low resource overhead
CN110417923A (en) * 2018-04-26 2019-11-05 阿里巴巴集团控股有限公司 A kind of DNS message processing method, device and equipment
CN110417923B (en) * 2018-04-26 2021-10-29 阿里巴巴集团控股有限公司 DNS message processing method, device and equipment
CN112230032A (en) * 2020-08-03 2021-01-15 青岛鼎信通讯股份有限公司 Electric energy meter data compression and decompression method
CN114244373A (en) * 2022-02-24 2022-03-25 麒麟软件有限公司 LZ series compression algorithm coding and decoding speed optimization method
CN114598329A (en) * 2022-03-18 2022-06-07 电子科技大学 Lightweight lossless compression method for rapid decompression application
CN114598329B (en) * 2022-03-18 2023-04-25 电子科技大学 Lightweight lossless compression method for rapid decompression application

Also Published As

Publication number Publication date
CN104410424B (en) 2017-06-16

Similar Documents

Publication Publication Date Title
CN103236847B (en) Based on the data lossless compression method of multilayer hash data structure and Run-Length Coding
CN104410424A (en) Quick lossless compression method of memory data of embedded device
CN103258030B (en) Based on the mobile device memory compression methods that dictionary and brigade commander are encoded
US8497788B1 (en) Efficient techniques for aligned fixed-length compression
CN105207678B (en) A kind of system for implementing hardware of modified LZ4 compression algorithms
WO2019153700A1 (en) Encoding and decoding method, apparatus and encoding and decoding device
EP2752760B1 (en) Method of compressing data and devices for performing the same
CN102970043B (en) A kind of compression hardware system based on GZIP and accelerated method thereof
CN106202213B (en) FPGA binary file compression and decompression method and device
CN107919943A (en) Coding, coding/decoding method and the device of binary data
WO2019228098A1 (en) Data compression method and device
CN110021369B (en) Gene sequencing data compression and decompression method, system and computer readable medium
CN101667843B (en) Methods and devices for compressing and uncompressing data of embedded system
CN105868194A (en) Methods and devices for text data compression and decompression
KR101866151B1 (en) Adaptive rate compression hash processing device
CN104378119A (en) Quick lossless compression method for file system data of embedded equipment
CN103618554B (en) Memory pages compression method based on dictionary
Lenhardt et al. Gipfeli-high speed compression algorithm
CN113312325B (en) Track data transmission method, device, equipment and storage medium
CN103731154A (en) Data compression algorithm based on semantic analysis
CN105337617A (en) Method for efficiently compressing full service network (FSN) files
WO2021103013A1 (en) Methods for data encoding and data decoding, device, and storage medium
CN104682966A (en) Non-destructive compressing method for list data
CN103049388B (en) A kind of Compression manager method of Fragmentation device and device
CN109255090B (en) Index data compression method of web graph

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant