CN113014551B - Data decompression method, data transmission method based on data decompression method, computer device and readable storage medium - Google Patents

Data decompression method, data transmission method based on data decompression method, computer device and readable storage medium Download PDF

Info

Publication number
CN113014551B
CN113014551B CN202110174553.9A CN202110174553A CN113014551B CN 113014551 B CN113014551 B CN 113014551B CN 202110174553 A CN202110174553 A CN 202110174553A CN 113014551 B CN113014551 B CN 113014551B
Authority
CN
China
Prior art keywords
data
data block
encoding
compressible
compressed
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.)
Active
Application number
CN202110174553.9A
Other languages
Chinese (zh)
Other versions
CN113014551A (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.)
Honor Device Co Ltd
Original Assignee
Honor Device Co Ltd
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 Honor Device Co Ltd filed Critical Honor Device Co Ltd
Priority to CN202110174553.9A priority Critical patent/CN113014551B/en
Publication of CN113014551A publication Critical patent/CN113014551A/en
Application granted granted Critical
Publication of CN113014551B publication Critical patent/CN113014551B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/04—Protocols for data compression, e.g. ROHC
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F8/00—Arrangements for software engineering
    • G06F8/60—Software deployment
    • G06F8/65—Updates
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F8/00—Arrangements for software engineering
    • G06F8/60—Software deployment
    • G06F8/65—Updates
    • G06F8/658—Incremental updates; Differential updates
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F8/00—Arrangements for software engineering
    • G06F8/70—Software maintenance or management
    • G06F8/71—Version control; Configuration management
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/34—Network arrangements or protocols for supporting network services or applications involving the movement of software or configuration parameters 

Abstract

The embodiment of the application provides a data compression method, a data transmission method based on the data compression method, a terminal and a system, wherein the data compression method comprises the following steps: determining whether a first least compressible element currently encoded in a first data block is included before the first least compressible element; in an instance in which it is determined that the first least compressible element currently encoded therein is not included in the first data block before the first least compressible element, determining whether the first least compressible element is included in a second data block; in the case that it is determined that the first minimum compressible unit is included in the second data block, a first encoding is used as an encoding corresponding to the currently encoded first minimum compressible unit, wherein the first encoding is an outer encoding including position information of the corresponding minimum compressible unit in the second data block. By the data compression method, the data compression rate is improved, and the user experience is improved.

Description

Data decompression method, data transmission method based on data decompression method, computer device and readable storage medium
Technical Field
The present application relates to the field of data processing technologies, and in particular, to a data compression method, and a data transmission method, a terminal device, and a system based on the data compression method.
Background
Currently available compression algorithms for compressing data are classified into lossy compression and lossless compression. The decompressed data with loss compression cannot ensure the same content as the original file, so the method is generally used in specific fields, has no influence on use although the data has loss, and is mostly used in multimedia fields such as audio and video. Lossless compression requires that the compressed data be decompressed and must be the same as the original data, and all fields are available, but the compression rate is not as high as that of lossy compression. Lossless compression mainly uses dictionary coding and entropy coding techniques. Currently, in compression software, dictionary coding is often used to compress data.
The dictionary coding algorithm implements a compression function by replacing current data with corresponding matching data information that has already occurred in the encoder or decoder. This matching information is encoded using a pair of data called "length-distance pairs," which equates to "each set of length-distance information equals the uncompressed data stream at a particular distance character position. Both the encoder and decoder must hold a certain amount of the most recent data, such as the most recent 2KB, 4KB or 32KB of data. The structure that holds this data is called a sliding window, so this algorithm is sometimes also called sliding window compression. The encoder needs to save this data lookup match data and the decoder saves the match data referred to by this data interpretation encoder.
Fig. 1 schematically shows a schematic diagram of data compression by a prior art dictionary coding algorithm. As shown in fig. 1, when a first data block to be compressed (for example, difference data of a new version and an old version used for upgrading software) is compressed, the first data block itself is used as a dictionary, and the data is compressed by a dictionary coding compression algorithm, so that a data compression packet is obtained. The existing dictionary coding technology takes the information source self-query content as the dictionary data source, can meet the common compression scene, but has limited compression ratio to the data because the query hit rate of the dictionary data is not high.
Disclosure of Invention
The embodiment of the application provides a data compression method and a data transmission method, a terminal and a system based on the data compression method.
In a first aspect of the present application, there is provided a data compression method, including:
determining whether a first least compressible element currently encoded in a first data block is included before the first least compressible element;
in an instance in which it is determined that a first minimum compressible unit currently encoded in the first data block is not included before the first minimum compressible unit, determining whether the first minimum compressible unit is included in a second data block, wherein the second data block is a data block related to the first data block;
in the case that it is determined that the first minimum compressible unit is included in the second data block, taking a first code as a code corresponding to the currently-coded first minimum compressible unit to obtain first compressed data of the first data block, wherein the first code is an outer code, and the outer code includes position information of the corresponding minimum compressible unit in the second data block.
With reference to the first aspect, in one possible embodiment, in a case where it is determined that the first minimum compressible unit is included in the second data block, taking the first encoding as the encoding corresponding to the currently encoded first minimum compressible unit includes, in a case where it is determined that the first minimum compressible unit is included in the second data block, determining whether a consecutive plurality of minimum compressible units starting from the currently encoded first minimum compressible unit in the first data block is included in the second data block, and in a case where it is determined that the consecutive plurality of minimum compressible units is included in the second data block, taking the first encoding as the encoding of the consecutive plurality of minimum compressible units, where the first encoding further includes a number of the consecutive plurality of minimum compressible units.
With reference to the first aspect, in one possible embodiment, the least compressible element is a continuous string of characters between two consecutive spaces.
With reference to the first aspect, in one possible embodiment, the method further includes, in a case where it is determined that a first least compressible element currently encoded in a first data block is included before the first least compressible element, taking a second encoding as an encoding corresponding to the first least compressible element currently encoded, wherein the second encoding is an inner encoding including a position of the corresponding least compressible element in the first data block, wherein the inner encoding is distinguished from the outer encoding by a predetermined representation.
In combination with the first aspect, in one possible embodiment, determining whether the first least compressible element is included in the first data block before the first least compressible element currently encoded therein includes determining whether the first least compressible element is included in the first data block among a predetermined number of least compressible elements preceding the first least compressible element currently encoded therein.
With reference to the first aspect, in one possible embodiment, the first compressed data includes first information, and the first information is used to obtain the second data block when decompressing the first compressed data.
A second aspect of the present application provides a data decompression method, including:
determining whether a currently decoded first encoding in first compressed data is an inner encoding or an outer encoding, wherein the inner encoding includes position information of a corresponding minimum compressible unit in a first data block, and the outer encoding includes position information of the corresponding minimum compressible unit in a second data block, wherein the first data block is an original data block of the first compressed data, and the second data block is a data block related to the first data block;
in the case where it is determined that the first encoding is an outer encoding, at least one least compressible unit in the second data block corresponding to the first encoding is taken as decompressed data of the first encoding.
With reference to the second aspect, in one possible embodiment, the first compressed data includes first information used to obtain the second data block when decompressing the first compressed data, where, in a case where it is determined that the first encoding is the outer encoding, taking at least one smallest compressible unit in the second data block corresponding to the first encoding as decompressed data of the first encoding includes, in a case where it is determined that the first encoding is the outer encoding, obtaining the second data block based on the first information, and taking at least one smallest compressible unit in the second data block corresponding to the first encoding as decompressed data of the first encoding.
In combination with the second aspect, in one possible embodiment, the inner encoding is distinguished from the outer encoding by a predetermined representation, and determining whether the currently decoded first encoding in the first compressed data is the inner encoding or the outer encoding includes determining whether the currently decoded first encoding in the first compressed data is the inner encoding or the outer encoding based on the particular identification.
With reference to the second aspect, in one possible embodiment, the method further includes, in the case that it is determined that the first encoding is an inner encoding, taking at least one least compressible unit in the first data block corresponding to the first encoding as decompressed data of the first encoding.
A third aspect of the present application provides a data transmission method, where the method is performed by a server-side device, and includes:
acquiring a first data block and a second data block, wherein the second data block is related to the first data block;
performing data compression on the first data block by using the method according to the first aspect of the present application to obtain first compressed data;
and sending the first compressed data to terminal equipment.
With reference to the third aspect, in one possible embodiment, the first data block is differential data between new version installation data and old version installation data of software, the second data block is old version installation data of the software, and the first compressed data is an upgrade package used for upgrading the software at the terminal device.
With reference to the third aspect, in one possible embodiment, the first compressed data includes first information, and the first information is used to enable the terminal device to obtain the second data block when decompressing the first compressed data.
A fourth aspect of the present application provides a data transmission method, where the method is executed by a terminal device, and includes:
receiving first compressed data from a server-side device, wherein the first compressed data comprises an inner code and an outer code, the inner code comprises position information of a corresponding minimum compressible unit in a first data block, and the outer code comprises position information of a corresponding minimum compressible unit in a second data block, wherein the first data block is an original data block of the first compressed data, and the second data block is a data block related to the first data block;
locally acquiring the second data block;
decompressing the first compressed data by the method according to the second aspect of the present application to obtain the first data block.
With reference to the fourth aspect, in one possible embodiment, the first data block is differential data between new version installation data and old version installation data of software, the second data block is old version installation data of the software, and the first compressed data is an upgrade package used for upgrading the software at the terminal device.
With reference to the fourth aspect, in one possible embodiment, the first compressed data includes first information, and the first information is used to enable the terminal device to obtain the second data block when decompressing the first compressed data, where obtaining the second data block locally includes obtaining the second data block locally based on the first information.
With reference to the fourth aspect, in one possible embodiment, the first information is any one of the following information: the storage address of the second data block in the terminal equipment and the data identification of the second data block in the terminal equipment.
A fifth aspect of the present application provides a server-side device, where the server-side device includes: a transceiver module, a memory, a processor, wherein,
the memory has stored therein program instructions;
the processor is configured to perform the following operations in accordance with program instructions stored in the memory:
acquiring a first data block and a second data block, wherein the second data block is related to the first data block;
performing data compression on the first data block by using the method according to the first aspect of the present application to obtain first compressed data;
and sending the first compressed data to terminal equipment through the transceiver module.
With reference to the fifth aspect, in one possible embodiment, the first data block is differential data between new version installation data and old version installation data of software, the second data block is old version installation data of the software, and the first compressed data is an upgrade package used for upgrading the software at the terminal device.
With reference to the fifth aspect, in one possible embodiment, the first compressed data includes first information, and the first information is used to enable the terminal device to obtain the second data block when decompressing the first compressed data.
A sixth aspect of the present application provides a terminal device, wherein the terminal device includes: a transceiver module, a memory, a processor, wherein,
the memory has stored therein program instructions;
the processor is configured to perform the following operations in accordance with program instructions stored in the memory:
receiving first compressed data from a server-side device through the transceiver module, wherein the first compressed data comprises an inner code and an outer code, the inner code comprises position information of a corresponding minimum compressible unit in a first data block, and the outer code comprises position information of a corresponding minimum compressible unit in a second data block, wherein the first data block is an original data block of the first compressed data, and the second data block is a data block related to the first data block;
locally acquiring the second data block;
decompressing the first compressed data by the method according to the second aspect of the present application to obtain the first data block.
With reference to the sixth aspect, in a possible embodiment, the first data block is differential data between new version installation data and old version installation data of software, the second data block is old version installation data of the software, the first compressed data is an upgrade package for upgrading the software at the terminal device, and the processor is further configured to perform the following operations according to program instructions stored in the memory: after the first data block is obtained, obtaining the new version installation data based on the first data block and the second data block.
With reference to the sixth aspect, in one possible embodiment, the first compressed data includes first information, and the first information is used to enable the terminal device to obtain the second data block when decompressing the first compressed data, where the processor is further configured to perform the following operations according to the program instructions stored in the memory: the second data block is obtained locally based on the first information.
With reference to the sixth aspect, in one possible embodiment, the first information is any one of the following information: the storage address of the second data block in the terminal equipment and the data identification of the second data block in the terminal equipment.
A seventh aspect of the present application provides a system, which is characterized by comprising the server-side device according to the fifth aspect of the present application and the terminal device according to the sixth aspect of the present application.
An eighth aspect of the present application provides a computer readable storage medium storing program instructions, which when executed by a computer, cause the computer to perform the method according to any one of the first, second, third and fourth aspects of the present application.
A ninth aspect of the present application provides a computing device comprising a memory and a processor, wherein the memory has stored therein program instructions, and wherein the processor, when executing the program instructions, implements the method according to any of the first, second, third and fourth aspects of the present application.
Drawings
FIG. 1 schematically illustrates data compression by a prior art dictionary encoding algorithm;
FIG. 2 shows a schematic diagram of a software upgrade system 200 of a data compression scheme according to an embodiment of the present application;
FIG. 3 shows a flow diagram of a method of data compression according to an embodiment of the application;
FIG. 4 is a schematic diagram of a process for encoding a block of data by dictionary encoding;
FIG. 5 is a diagram illustrating a process for compressing a string of English words by a dictionary encoding algorithm;
FIG. 6 is a diagram illustrating a process for compressing data in conjunction with an external dictionary;
FIG. 7 schematically shows a block diagram of a data compression process corresponding to that shown in FIG. 3;
FIG. 8 shows a flow diagram of a method of data decompression according to an embodiment of the present application;
FIG. 9 shows a flow chart of a data transmission method according to an embodiment of the application;
FIG. 10 shows a flow diagram of a method of data transmission according to an embodiment of the application;
fig. 11 illustrates a server-side device 1100 according to an embodiment of the application;
fig. 12 shows a terminal device 1200 according to an embodiment of the application;
fig. 13 illustrates a system 1300 according to an embodiment of the present application.
Detailed Description
Technical solutions of embodiments of the present application will be described in detail below with reference to the accompanying drawings.
FIG. 2 shows a schematic diagram of a software upgrade system 200 of a data compression scheme according to an embodiment of the application. As shown in fig. 1, the software upgrading system 200 includes a server-side device 21 and a terminal device 22. In the case where software (for example, APP) in the terminal device 22 is to be upgraded by a new version of the installation package of the software, in the server-side device 21, differential data of the new version of the installation package and the old version of the installation package is acquired based on the new version of the installation package and the old version of the installation package, and the differential data is used as a first data block to be compressed and the old version of the installation package is used as a second data block. The data of the first data block and the second data block are used as dictionaries, and the first data block is encoded by the compression algorithm according to the embodiment of the present application, so that a data compression packet for upgrading is obtained, and the compression packet is sent to the terminal device 22. In the terminal device 22, the data in the second data block (old version installation package data) that has been locally stored and the data compression package received from the server-side device 21 are used as dictionaries, and the data compression package is decompressed by the decompression algorithm according to the present application, so as to obtain the first data block (i.e., the above-mentioned differential data) corresponding to the upgraded compression package, and then, the terminal device 22 can restore the new version installation package based on the differential data and the old version installation package, so as to perform software upgrade by using the new version installation package.
It is to be appreciated that the content shown in fig. 2 and the description above with reference to fig. 2 are merely illustrative and are not intended to limit the scope of the embodiments of the present application, for example, the data compression method according to the present application is not limited to the scenario for client software upgrade, but may be used in any computing device, in any scenario, for data compression. For example, the data compression method according to the present application can be used for compression and transmission of log data, and the like.
Terminal equipment in the embodiments of the present application may also be denoted as user equipment, access terminal, subscriber unit, subscriber station, mobile station, remote terminal, mobile device, user terminal, wireless communication device, user agent, or user device, etc.
The terminal device in the embodiment of the application may be a mobile terminal device or a non-mobile terminal device. The mobile terminal device may be a cellular phone, a cordless phone, a Session Initiation Protocol (SIP) phone, a smart phone, a Wireless Local Loop (WLL) station, a tablet computer, a notebook computer, a palm computer, a vehicle-mounted terminal, a wearable device, an ultra-mobile personal computer (UMPC), a netbook, a Personal Digital Assistant (PDA), a handheld device with wireless communication function, a computing device or other processing device connected to a wireless modem, a drone device or an internet of things, a terminal in a car networking, a relay user device, a terminal device in a future 5G network, or a terminal device in a future evolved Public Land Mobile Network (PLMN), and the like, and the embodiments of the present application are not limited thereto. The non-mobile terminal device may be a Personal Computer (PC), a Television (TV), a teller machine, a self-service machine, or the like, which is not particularly limited in this embodiment of the present application.
Fig. 3 shows a flow diagram of a method of data compression according to an embodiment of the application, which may include the steps of:
step 301, determining whether a first least compressible element currently encoded in a first data block is included before the first least compressible element;
step 302, in the case that it is determined that the first minimum compressible unit currently encoded in the first data block is not included before the first minimum compressible unit, determining whether the first minimum compressible unit is included in a second data block, wherein the second data block is a data block related to the first data block;
step 303, in a case that it is determined that the first minimum compressible unit is included in the second data block, taking a first code as a code corresponding to the currently-coded first minimum compressible unit to obtain first compressed data of the first data block, where the first code is an outer code, and the outer code includes location information of the corresponding minimum compressible unit in the second data block.
As described above with reference to the data compression process in the server side in fig. 2, in the embodiment of the present application, the data to be compressed is encoded with the data itself to be compressed and the external data related thereto together as a dictionary, so as to compress the data. The manner of encoding the data based on the data itself may refer to a dictionary encoding algorithm in the prior art, and therefore, before describing the method steps shown in fig. 3 in detail, a brief introduction is made to the dictionary encoding algorithm in the prior art.
Fig. 4 schematically shows a process of encoding a data block by dictionary encoding. The data block shown in fig. 4 is "abacbababcad", it is understood that the encoding (compression) of the data block in units of letters in fig. 4 is only illustrative, and in an actual scenario, an object to be encoded may be determined based on a minimum compressible unit suitable for encoding in the data block, for example, in the case where the data block to be encoded is a multi-line code, a continuous character string between two continuous spaces may be used as the minimum compressible unit, and the continuous character string between the two continuous spaces may be, for example, an english word, a number, a functional expression, and the like. The black box sliding over the data block in fig. 4 is a sliding window having a predetermined number of positions corresponding to the smallest compressible units, schematically shown as 8, and when dictionary-coding a certain smallest compressible unit, the data in the sliding window is taken as the dictionary of the code, the matching data is found from the sliding window, and the position information of the matching data in the sliding window is used as the code of the smallest compressible unit. The sliding window is set to control the size of the dictionary data that needs to be looked up for each minimum compressible unit, thereby improving the efficiency of dictionary look-up.
When a string of data is encoded, the sliding window is slid back from the first least compressible unit (a in the figure) of the string of data to start encoding. As shown in fig. 4(a), the sliding window slides to a before coding starts from a, since there is no matching data in the sliding window, i.e., the currently available dictionary is empty, a is noted in the compressed data. In fig. 4(B), the sliding window moves to a, and the subsequent letter B still does not match the data in the sliding window, so B is noted after a in the compressed data. In fig. 4(C), the letters AB after B, which are moved to B in the sliding window, may match the AB in the sliding window, that is, the AB to be encoded may be encoded by the position of the AB in the sliding window, and in dictionary encoding, the encoding is usually performed by a format such as (6,2, C), where 6 denotes that the AB in the sliding window has 6 positions from the leftmost side of the sliding window, that is, it is the position information of the AB in the sliding window, 2 denotes that the number of letters encoded is 2, that is, two letters a and B, and C denotes that the data corresponding to the code is followed by one letter, that is, C, which is clearly indicated by such encoding as "ABC". In fig. 4(d), the sliding window is moved to C, and the letters BAB after C can be matched with the BAB in the sliding window, so the BABA can be encoded by the same encoding method as in fig. 4(C), i.e. its corresponding code is (4,3, a), similarly, 4 indicates that the BAB in the sliding window has 4 positions to the leftmost side of the window, 3 indicates the number of BABs is 3, and a indicates the letters after the corresponding BAB of the code. In fig. 4(e), the letter BC after the window matches the letter BC in the window, and similarly the BCA can be encoded as (2, 2, a). In fig. 4 (f), the letter D after the window does not find matching data in the window, and is therefore noted as D in the compressed data. Finally, in fig. 4(g), there is no data after the buffer, and thus, this encoding is finished, and compressed data corresponding to the character string abacbababcad is obtained as AB (6,2, C) (4,3, a) (2, 2, a) D. In decoding, the original data can be recovered by sequentially decoding each code in the compressed data based on the window position and the data in the window, similarly by sequentially sliding a sliding window over the compressed data.
Corresponding to the above-described encoding process, for example, in the case where each letter in the character string actually corresponds to a word, the number of bytes of the string of words can be reduced by the dictionary encoding algorithm, thereby functioning to compress data. For example, FIG. 5 shows a diagram of a string of English words compressed by a dictionary encoding algorithm. As shown in fig. 5, in the string of english words, when the second "this" is encoded, since "this" has occurred before, the second "this" can be encoded using the position of the "this" that has occurred before, that is, in the compressed data, the second "this" is replaced with the position of the first "this", that is, "(1)", and similarly, when the second "is encoded, since" is "has occurred before, the second" is "can be encoded using the position of the" is "that has occurred before, that is, in the compressed data, the second" is replaced with (2) ". That is, the string of English words is eventually compressed into "This is new data source (1) test (2) name ok". However, for a string of english words, for example, if there are not many repeated words, matching words cannot be obtained in the dictionary based on the own data at the time of encoding, that is, the hit rate is low, and thus, the compression rate for the string of words is low.
According to the method shown in the figure 3 of the application, the external dictionary is introduced and the dictionary coding algorithm is combined for coding, so that the dictionary hit rate is greatly improved, and the data compression rate is improved.
Specifically, in step 301, it is determined whether a first least compressible element currently encoded in a first data block is included before the first least compressible element.
FIG. 6 shows a schematic diagram of a process for compressing data in conjunction with an external dictionary. As shown in fig. 6, assuming that the first data block is a string of english words "This is new data source This is test is source ok", in the process of data compression of the first data block, the second data block "the re are source old data source" having related content with the first data block is used as the external dictionary. In this example, the word is taken as the smallest compressible element. After the compression is started, encoding is performed sequentially starting with the first word of the first data block, similar to the dictionary encoding process in fig. 4, wherein when encoding each word, it is first determined whether there is a word in the first data block that precedes the word that matches it. That is, a match lookup is first made from an internal dictionary based on the first block itself.
Fig. 7 schematically shows a block diagram of a data compression process corresponding to that shown in fig. 3. As shown in fig. 7, in block 701, it is determined whether there is a smallest compressible cell to be encoded. For example, for the example shown in fig. 6, after determining that there is a word in the first data block to be encoded, corresponding to step 301, in block 702, for the current word to be encoded, first look up the first data block for a matching word in the internal dictionary that precedes the word. For example, for the first compression unit "This" in the first data block, first look up in the internal dictionary, since the dictionary before This "is empty in the first data block, no matching word is found in the internal dictionary, i.e., in fig. 7, the following block 703 is entered. For example, for the word "data" in the first data block, a lookup is first made in the internal dictionary, i.e. in the "This is new" preceding it, in which no matching word is found, and likewise for This word, block 703 will be entered for the subsequent steps. For example, for the second "This" in the first data block, first looking up in the internal dictionary, i.e. looking up in the "This is new data source" before it, it can be seen that in the internal dictionary, the matching word, i.e. the first "This" is found, in which case, as shown in fig. 7, block 704 is entered, i.e. the second "This" is encoded based on the internal dictionary, thereby obtaining its inner encoding. That is, the second "This" is encoded as an inner code "(1)" in the present application, by a coding method similar to that in dictionary coding, where (1) indicates that the position of the first "This" is the first position in the first data block, and the inner code refers to coding based on an inner dictionary. It is understood that the specific coding form of the inner code is only illustrative and not restrictive, for example, the inner code may also be (1,1), where the first 1 indicates that the first position of the first "This" is the first position in the first data block, and the second 1 indicates that the number of words is 1, and for example, the code may also be (1,1, test), which indicates that the code corresponds to "This test". In addition, in this encoding process, no sliding window is introduced for encoding. However, in actual encoding, for a data block to be compressed with a long length, a sliding window may be introduced during encoding, for example, the length of the sliding window is set to 2k words, so that, when encoding a word in the data block based on an internal dictionary, matching lookup is performed with 2k words before the word as the internal dictionary, thereby improving dictionary lookup efficiency by limiting the size of the internal dictionary. In case of introducing a sliding window, the position information in the inner code may be a position from the left (or right) side of the sliding window, or the like.
With continued reference to FIG. 3, in step 302, in the event that it is determined that the first least compressible element currently encoded in the first data block is not included before the first least compressible element, it is determined whether the first least compressible element is included in a second data block, wherein the second data block is a data block related to the first data block.
This step corresponds to block 703 in fig. 7, i.e. looking up the external dictionary (i.e. the second data block). The external dictionary is predetermined, and a second data block having a greater association with the first data block is usually selected as the external dictionary, for example, the second data block and the first data block have related content, the second data block and the first data block have the same field, and the second data block and the first data block are used in the same scene, in the same time period, and so on, so that the search hit rate of the dictionary can be made higher, and the data compression rate can be improved. In one embodiment, in a scenario of software upgrade, the first data block is a differential packet of a new and old version of software, and the old version of software may be used as an external dictionary (i.e., the second data block) for compressing the differential packet. In one embodiment, in the scenario of log data transmission, since the logs have a uniform format and only part of contents are different, in the case that the first data block is the first log, another log transmitted before the first log may be used as an external dictionary to perform data compression on the first log, and in this case, the lookup hit rate of the external dictionary is also high, and a better data compression rate can be obtained.
Still referring to the illustrative example in fig. 6, for example as described above, after performing an internal dictionary lookup on the first "This" in the first data block, the flow proceeds to block 703, where, for "This", a matching word is looked up in the second data block (i.e., "the are _ sound _ data source"), since "This" is not looked up, the encoding of This "is whether it is itself or not, the flow loops back to block 701 to determine whether There are still minimum compressible units to be encoded, and if so, to block 702, and if not, for example, if" ok "encoding in the first data block has ended, and then There are no other words to be encoded, the compression flow ends. For example, as described above, after performing the internal dictionary lookup on the "data" in the first data block, the flow proceeds to block 703, and in 703, for the "data", a matching word is looked up in the second data block (i.e., "the re are _ same _ data _ source"), and since the 5 th word in the second data block is "data", the flow may proceed to block 705, and the "data" in the first data block is encoded by the position of the "data" in the second data block, i.e., the external encoding thereof is obtained.
In step 303, in the case that it is determined that the first minimum compressible unit is included in the second data block, taking a first encoding as an encoding corresponding to the currently encoded first minimum compressible unit to obtain first compressed data of the first data block, where the first encoding is an outer encoding, and the outer encoding includes position information of the corresponding minimum compressible unit in the second data block.
For example, in the above example, when encoding "data" in a first data block based on a second data block, the "data" in the first data block may be replaced with a first encoding "W5", where the first encoding "W5" is an outer encoding, i.e., an encoding based on an external dictionary (second data block), W is used as a flag for distinguishing from the above-mentioned inner encoding, and 5 denotes that the position of "data" in the second data block is the 5 th word position.
It is to be understood that the specific form of the outer coding described above is illustrative only and not limiting. In one embodiment, in the above block 703, after determining that the second data block includes the "data" in the first data block, it is also determined whether a plurality of words in the second data block that are consecutive from the "data" in the first data block are included, that is, whether the words after the "data" in the second data block are the same as the words after the "data" in the first data block. After determining that the "data source" in the second data block matches the "data source" in the first data block, the "data source" in the first data block may be replaced with a first encoding "(W5, 2)" which is an outer encoding, where 5 denotes that the "data source" starts at the 5 th word in the second data block and 2 denotes that the first encoding corresponds to 2 words. In the above description, although the label "W" is used to distinguish between inner coding and outer coding, it is to be understood that in the present application, it is not limited to distinguish between outer coding and inner coding in this way. For example, the outer code and the inner code may be distinguished by other characters for identification, or may be distinguished by different format representations, or may be distinguished by different numerical forms (e.g., 1 and i), different numerical ranges, and so forth.
Optionally, in the process of encoding the first data block, after some data in the external dictionary is matched, the data may be marked so that the data is not looked up again when the external dictionary is looked up next time. For example, in the above example, after "data" in the second data block is matched, the "data" may be marked to indicate that it has been matched once, and when the second data block is searched next time for, for example, "test" in the first data block, the matching process for the "data" in the second data block may be omitted, thereby improving the searching efficiency.
After each word in the first data block shown in fig. 6 is encoded by the above-described method, the compressed data after encoding (i.e., first compressed data) can be acquired: "This is new (W5) (W6) (1) test (2) (W3) ok", it is obvious that the compressed data has a greatly reduced number of bytes compared to the original data in the first data block, and has a reduced number of bytes compared to the compressed data obtained based on the existing dictionary coding algorithm in fig. 5, thereby achieving a better data compression effect compared to the prior art.
Optionally, first information is included in the first compressed data, and the first information is used to obtain the second data block when decompressing the first compressed data. For example, the first information is a storage address of the second data block when the first compressed data is decompressed, or a data identifier of the second data block, and the like.
For example, the method shown in fig. 3 is performed in the first computer, that is, the first data block is subjected to data compression in the first computer to obtain first compressed data, and the first compressed data is transmitted to the second computer after the compression is completed, so that the second computer performs decompression on the first compressed data to obtain the first data block. In This case, the first computer includes, for example, the specific location in the first compressed data where the second data chunk is stored in the second computer, e.g., the first compressed data is ultimately "This is new (W5) (W6) (1) test (2) (W3) ok (C: \ Apps \ W)", where "C: \ Apps \ W" is a predetermined address in the second computer where the second data chunk is stored. Thus, the second computer can accurately and quickly acquire the second data block based on the address after receiving the compressed data, and use the second data block for decompression of the first compressed data. By serving to find the second data block in this way, only the simple way of "W5" is needed in the compressed data as an index to a specific location in the second data block, thereby improving the compression rate.
In the case where a plurality of data blocks used as an external dictionary may be stored in the second computer, by including an identification corresponding to a selected second data block in the first compressed data, the second computer can find a correct second data block based on the identification. For example, a plurality of external dictionaries, respectively identified as W, X, Y and so on, are stored in predetermined addresses of the second computer, thereby making it possible for the second computer to determine the second data block identified with W as the external dictionary among the plurality of external dictionaries W, X, Y and so on by identifying in the first compressed data with "W5". Here, it is exemplified only in the form of a single letter as the identification, and in the case where the identification includes a plurality of character strings, the identification may be separately included in the first information in a similar manner to the above-described storage address, for example, the first compressed data is finally "This is new (W5) (W6) (1) test (2) (W3) ok (50842611)", where "50842611" is the identification of the second data block stored in the second computer.
Fig. 8 shows a flow chart of a data decompression method according to an embodiment of the present application, which may include the following steps:
step S801, determining whether a currently decoded first code in first compressed data is an inner code or an outer code, wherein the inner code includes position information of a corresponding minimum compressible unit in a first data block, and the outer code includes position information of a corresponding minimum compressible unit in a second data block, wherein the first data block is an original data block of the first compressed data, and the second data block is a data block related to the first data block;
step S802, in a case that it is determined that the first code is an outer code, taking at least one minimum compressible unit corresponding to the first code in the second data block as decompressed data of the first code.
First, in step S801, it is determined whether a currently decoded first encoding in first compressed data is an inner encoding or an outer encoding, wherein the inner encoding includes position information of a corresponding minimum compressible unit in a first data block, and the outer encoding includes position information of a corresponding minimum compressible unit in a second data block, wherein the first data block is an original data block of the first compressed data, and the second data block is a data block related to the first data block.
The first compressed data is, for example, the compressed data obtained last in the example shown in fig. 6, that is, "This is new (W5) (W6) (1) test (2) (W3) ok", in This example, as described above, the first data block is "This is new data source This test is source ok", which is the original data block of the above compressed data, and the second data block as the external dictionary is "the same source record and data source". In decoding the compressed data, decoding is started from the first encoding of the compressed data, similarly to decoding of dictionary encoding in the related art. For example, "This" in the compressed data is an encoding corresponding to the original data, and therefore, "This" is noted in the decompressed data. For example, for "(W5)" in the compressed data, W therein can be used to determine that the encoding is an outer encoding, and thus the encoding will be subsequently decoded based on the second data block. For example, for a "(1)" in compressed data, it can be determined that the encoding is an intra-encoding, and thus the decoding will be performed subsequently based on the original data before the intra-encoding, similar to the existing dictionary encoding algorithm.
In the case where it is determined that "(1)" in the compressed data is intra-coded, the code is decoded based on the original data in the first data block before the code, that is, after the above-mentioned compressed data is sequentially decoded, when "(1)" is decoded, the original data before the code "(1)", that is, "This is new data source", is obtained, and with the string of words as an intra-dictionary, it is determined that the 1 st word in the intra-dictionary is "This", and therefore, the intra-code "(1)" can be decoded as "This", that is, the "This" can be noted at a position corresponding to the code "(1)" in the decompressed data.
In step S802, in the case that it is determined that the first encoding is an outer encoding, at least one least compressible unit corresponding to the first encoding in the second data block is taken as decompressed data of the first encoding.
For example, in the case where "(W5)" in the above-mentioned compressed data is determined to be outer code, the 5 th word in the second data block is determined to be "data" based on the above-mentioned second data block, and therefore, the original data corresponding to this outer code "(W5)" is "data", and thus "data" can be written in the position corresponding to "(W5)" in the decompressed data. For example, in the case of the form of the outer encoding as "(W5, 2)" as described above, two words starting from the 5 th word in the second data block are determined to be "data sources" based on the second data block, and thus "data sources" can be inscribed at the position corresponding to "(W5, 2)" in the decompressed data.
Optionally, the first compressed data includes first information, the first information is used to obtain the second data block when decompressing the first compressed data, where, in a case where it is determined that the first encoding is an outer encoding, the second data block is obtained based on the first information, and at least one minimum compressible unit corresponding to the first encoding in the second data block is taken as decompressed data of the first encoding.
The methods of fig. 3 and 8 described above may be performed by any computing device that includes a memory having stored therein program instructions and a processor that, when executing the program instructions, may implement the methods of fig. 3 or 8.
Fig. 9 is a flowchart illustrating a data transmission method according to an embodiment of the present application, where the method is performed by a server-side device, and includes:
step S901, acquiring a first data block and a second data block, where the second data block is related to the first data block;
step S902, performing data compression on the first data block by using the method shown in fig. 3 to obtain first compressed data;
step S903, sending the first compressed data to a terminal device.
The method is executed by the server-side device, and is used for performing data compression on data to be transmitted by the method shown in fig. 3, and transmitting the compressed data to the terminal device, so that the size of the transmitted data is saved, the transmission cost is saved, and the use experience of a terminal user is improved.
First, in step S901, a first data block and a second data block are obtained, wherein the second data block is related to the first data block.
In one embodiment, the method is used in the context of a software upgrade. In this scenario, the server-side device may perform data compression on the software upgrade package by using the method shown in fig. 3 before transmitting the software upgrade package. For example, the APP version currently installed in the terminal device is a version installed through an old version installation package (e.g., APK1), after the server side acquires a new version installation package (e.g., APK2) of the APP, a differential package of APK2 relative to APK1 is generated through a differential algorithm in the prior art, and the differential package is used as a first data block and APK1 is used as a second data block. It is to be understood that in this scenario, the differential packet of APK2 relative to APK1 is not limited to being the first data block and APK1 is the second data block. For example, in some upgrade scenarios, a plurality of image files (IMGs) are included in one installation package, and the image files respectively relate to different contents, and thus are not very related to each other, for example, an IMG1 is included in an APK1, an image file IMG2 corresponding to the IMG1 is included in an APK2, and the IMG2 has a large correlation with only the IMG1 in the APK 1. In this case, the difference data of IMG2 with respect to IMG1 may be obtained as a first data block and IMG1 as a second data block, i.e., each IMG file in APK2 may be compressed separately, rather than compressing APK2 as a whole.
In one embodiment, the method is used in the context of page transfers. In this scenario, for example, the terminal device continuously requests a plurality of page contents from the server device, and generally, the plurality of page contents continuously requested by the user in the same period may have a large correlation. In this case, after the server-side device has sent the 1 st page of the multiple pages to the terminal device, and before sending the 2 nd page to the terminal device, the server-side device may perform data compression on the 2 nd page by using the method shown in fig. 3, and then perform transmission. For example, the server-side device may use the 2 nd page as the first data block and use the 1 st page as the second data block. Alternatively, similar to the above embodiment, the server-side device may first obtain a difference packet of the 2 nd page relative to the 1 st page, and then use the difference packet as the first data block and the 1 st page as the second data block.
In step S902, the first data block is data-compressed by the method shown in fig. 3 to obtain first compressed data.
In one embodiment, in the software upgrade scenario, since the software upgrade of APP changes the original APP in several small places, most of the contents of APK2 and APK1 are still the same, and the contents in APK2 and the contents in APK1 have very large correlation, so that the probability of coincidence of the data included therein is also large. Therefore, the differential packet of APK2 can be obtained first with respect to APK1 to exclude the identical content of the two, and then the differential packet to be transmitted is encoded with the original old version APK1 as an external dictionary, and since the correlation between APK2 and APK1 is large, by using APK1 as an external dictionary in which there will be much data (words, continuous character strings, calculation expressions) and the like that match in the differential packet, the compressed packet of the differential packet (i.e., the first compressed data) can be obtained as an upgrade packet for upgrading APP with a large compression rate.
In one embodiment, in the above scenario of page transmission, similarly, since the correlation between the 1 st page and the 2 nd page is large, by encoding the 2 nd page with the 1 st page as an external dictionary, the compressed packet of the 2 nd page can be obtained with a large compression rate.
Optionally, the first compressed data includes first information, where the first information is used to enable the terminal device to obtain the second data block when decompressing the first compressed data, and the terminal device locally obtaining the second data block includes the terminal device locally obtaining the second data block based on the first information.
In step S903, the first compressed data is sent to the terminal device.
In an embodiment, in the above scenario of software upgrade, the server-side device sends an upgrade package (i.e., the first compressed data) for upgrading the APPs to the corresponding APPs in the terminal device, so that the corresponding APPs can perform APP upgrade based on the upgrade package.
In an embodiment, in the above scenario of page transmission, the server-side device sends the compressed packet (i.e., the first compressed data) of the 2 nd page to the terminal device, and the terminal device opens the page in the form of a webpage based on the compressed packet, or the server-side device sends the compressed packet of the 2 nd page to a corresponding APP in the terminal device, so that the corresponding APP opens the 2 nd page based on the compressed packet.
Fig. 10 shows a flowchart of a data transmission method according to an embodiment of the present application, where the method is performed by a terminal device, and includes:
step S1001, receiving first compressed data from a server-side device, wherein the first compressed data includes an inner code and an outer code, the inner code includes position information of a corresponding minimum compressible unit in a first data block, and the outer code includes position information of a corresponding minimum compressible unit in a second data block, wherein the first data block is an original data block of the first compressed data, and the second data block is a data block related to the first data block;
step S1002, acquiring a second data block from local;
step S1003, decompressing the first compressed data by using the method shown in fig. 8 to obtain the first data block.
The method is a method corresponding to the method shown in fig. 9, which is executed by a terminal device, and after receiving first compressed data from a server-side device, the terminal device decompresses the first compressed data based on the method shown in fig. 8, thereby acquiring original data corresponding to the first compressed data.
In step S1001, first compressed data is received from the server-side device. For the implementation of this step, reference may be made to the description of step S903 above, and for the specific description of the first compressed data, reference may be made to the description of step S801 above, which is not repeated herein.
In step S1002, the second data block is acquired locally.
In one embodiment, in the software upgrade scenario described above, the terminal device may locally retrieve a pre-stored installation version of the current APP, e.g., APK1, according to a predetermined path to serve as an external dictionary at decompression time.
In one embodiment, in the scenario of page transmission described above, the terminal device may locally obtain the 1 st page previously downloaded and stored by the terminal device as an external dictionary according to the page identifier of the previously stored 1 st page.
Optionally, the first compressed data includes first information, where the first information is used to enable the terminal device to obtain the second data block when decompressing the first compressed data, and the terminal device locally obtaining the second data block includes the terminal device locally obtaining the second data block based on the first information.
For example, in the above-described software upgrade scenario, the first information is, for example, a storage address of the APK1 stored in the terminal device, so that the terminal device can locally obtain the APK1 based on the first information and use the obtained APK for decompressing the first compressed data.
For example, in the scenario of page transmission described above, the first information is, for example, a storage identifier of the 1 st page in the terminal device, so that the terminal device can locally obtain the 1 st page based on the first information and use the page for decompressing the first compressed data.
By including the first information for acquiring the second data block in the first compressed data and performing data compression using the index corresponding to the reference position in the second data block in the compressed data, when decompressing the compressed data, the second data block may be acquired first based on the first information and then the decompressed data may be determined based on the specific position in the second data block, thereby eliminating the need to include the specific storage address of the second data block in the compressed data, thereby making the compression rate of the data larger.
In step S1003, the first compressed data is decompressed by the method shown in fig. 8 to obtain the first data block.
In one embodiment, in the software upgrade scenario, the APK1 is used as an external dictionary, the upgrade package received from the server-side device is decompressed, so that a differential package of the APK2 relative to the APK1 is obtained, and based on the differential package and the APK1, the APK2 can be recovered, so that the terminal device can finally obtain a new software installation package APK2 by receiving a smaller data amount, so that APP upgrade can be performed based on the APK 2.
In one embodiment, in the above scenario of page transmission, the terminal device decompresses the received compressed packet by using, for example, the 1 st page that is already locally available as an external dictionary, so that the 2 nd page can be obtained by receiving a smaller amount of data, and the 2 nd page is displayed.
Fig. 11 shows a server-side device 1100 according to an embodiment of the present application, where the server-side device includes: a transceiver module 1101, a memory 1102, a processor 1103, wherein,
the memory 1102 has stored therein program instructions;
the processor 1103 is configured to perform the following operations according to program instructions stored in the memory:
acquiring a first data block and a second data block, wherein the second data block is related to the first data block;
performing data compression on the first data block by using the method shown in fig. 3 to obtain first compressed data;
and sending the first compressed data to terminal equipment through the transceiver module.
In one embodiment, the first data block is differential data between new version installation data and old version installation data of software, the second data block is old version installation data of the software, and the first compressed data is an upgrade package for upgrading the software at the terminal device.
In one embodiment, the first compressed data includes first information, and the first information is used for enabling the terminal device to acquire the second data block when decompressing the first compressed data.
Fig. 12 shows a terminal device 1200 according to an embodiment of the present application, where the terminal device 1200 includes: a transceiver module 1201, a memory 1202, a processor 1203, wherein,
the memory 1202 has stored therein program instructions;
the processor 1203 is configured to perform the following operations according to program instructions stored in the memory:
receiving first compressed data from a server-side device through the transceiving module 1201, wherein the first compressed data includes an inner code and an outer code, the inner code includes location information of a corresponding minimum compressible unit in a first data block, and the outer code includes location information of a corresponding minimum compressible unit in a second data block, the first data block is an original data block of the first compressed data, and the second data block is a data block related to the first data block;
acquiring a second data block from the local;
the first compressed data is decompressed by the method shown in fig. 8 to obtain the first data block.
In one embodiment, the first data block is differential data between new version installation data and old version installation data of software, the second data block is old version installation data of the software, the first compressed data is an upgrade package for upgrading the software at the terminal device, and the processor 1203 is further configured to perform the following operations according to program instructions stored in the memory: after the first data block is obtained, obtaining the new version installation data based on the first data block and the second data block.
In one embodiment, the first compressed data includes first information for causing the terminal device to obtain the second data block when decompressing the first compressed data, wherein the processor is configured to locally obtain the second data block according to the program instructions stored in the memory includes: the processor is configured to retrieve the second block of data locally based on the first information according to program instructions stored in the memory.
In one embodiment, the first information is any one of the following information: the storage address of the second data block in the terminal equipment and the data identification of the second data block in the terminal equipment.
The transceiver module 1201 may be, for example, a wired network interface or a wireless transceiver module. The wireless transceiver module is, for example, a Radio Frequency (RF) circuit or a wireless network module. The RF circuitry may be configured to transmit and receive information, such as to interact with information from a server or the like, and to process the received information for the processor 1203. In general, RF circuits include, but are not limited to, an antenna, at least one Amplifier, a transceiver, a coupler, a Low Noise Amplifier (LNA), a duplexer, and the like. In addition, the RF circuitry may also communicate with networks and other devices via wireless communications. The wireless communication may adopt any communication standard or protocol, including but not limited to Global System for Mobile communication (GSM), General Packet Radio Service (GPRS), Code Division Multiple Access (CDMA), Wideband Code Division Multiple Access (WCDMA), Long Term Evolution (LTE), email, Short Message Service (SMS), and the like.
The memory 1202 may be used for storing software programs and modules, and the processor 1203 causes the terminal device to execute the decompression method by running the software programs and modules stored in the memory 1202. The memory 1202 may mainly include a program storage area and a data storage area, wherein the program storage area may store an operating system, application programs required for implementing the decompression method, and the like. In addition, the memory 1202 may be a volatile memory (RAM), such as a random-access memory (RAM); the memory 1202 may also be a non-volatile memory (such as a read-only memory (ROM), a flash memory (flash memory), a hard disk (HDD), or a solid-state drive (SSD); the memory 1202 may also comprise a combination of memories of the above-mentioned kinds.
The processor 1203 is the control center of the terminal device, connects various parts of the entire terminal device with various interfaces and lines, and executes the decompression method by running or executing software programs and/or modules stored in the memory 1202 and calling data stored in the memory 1202. Optionally, the processor 1203 may include one or more processing units. Preferably, the processor 1203 may integrate an application processor and a modem processor, wherein the application processor mainly handles operating systems, user interfaces, application programs, etc., and the modem processor mainly handles wireless communications. It will be appreciated that the modem processor described above may not be integrated into the processor 1203.
Although not shown, the terminal device may further include an input unit, a display unit, a power supply, a sensor, a camera, a bluetooth module, an audio circuit, a USB module, and the like, which are not described herein again.
Fig. 13 shows a system 1300 according to an embodiment of the present application, where the system 1300 includes the server-side device 1100 shown in fig. 11 and the terminal device 1200 shown in fig. 12.
The present application also provides a computer readable storage medium storing program instructions, which when executed by a computer, cause the computer to perform a method according to an embodiment of the present application as shown in fig. 3 or fig. 8 or fig. 9 or fig. 10.
The present application also provides a computing device comprising a memory and a processor, wherein the memory stores program instructions, and the processor implements the method according to the embodiment of the present application, as shown in fig. 3, 8, 9 or 10, when executing the program instructions.
It is to be understood that the terms "first," "second," and the like, herein are used for descriptive purposes only and not for purposes of limitation, to distinguish between similar concepts.
It will be further appreciated by those of ordinary skill in the art that the elements and algorithm steps of the examples described in connection with the embodiments disclosed herein may be embodied in electronic hardware, computer software, or combinations of both, and that the components and steps of the examples have been described in a functional general in the foregoing description for the purpose of illustrating clearly the interchangeability of hardware and software. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
It will be understood by those skilled in the art that all or part of the steps in the method for implementing the above embodiments may be implemented by a program, and the program may be stored in a computer-readable storage medium, where the storage medium is a non-transitory medium, such as a random access memory, a read only memory, a flash memory, a hard disk, a solid state disk, a magnetic tape (magnetic tape), a floppy disk (floppy disk), an optical disk (optical disk), and any combination thereof.
The above description is only for the preferred embodiment of the present invention, but the scope of the present invention is not limited thereto, and any changes or substitutions that can be easily conceived by those skilled in the art within the technical scope of the present invention are included in the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.

Claims (12)

1. A data compression method is applied to terminal equipment and is characterized by comprising the following steps:
determining whether a first least compressible element currently encoded in a first data block is included before the first least compressible element, wherein the first least compressible element is a continuous string between two consecutive spaces;
in an instance in which it is determined that a first minimum compressible unit currently encoded in the first data block is not included before the first minimum compressible unit, determining whether the first minimum compressible unit is included in a second data block, wherein the second data block is a data block related to the first data block;
in the case that it is determined that the first minimum compressible unit is included in the second data block, taking a first code as a code corresponding to the currently-coded first minimum compressible unit to obtain first compressed data of the first data block, wherein the first code is an outer code, the outer code includes position information of the corresponding minimum compressible unit in the second data block, and the first compressed data includes first information used for obtaining the second data block when decompressing the first compressed data;
in case it is determined that a first least compressible unit currently encoded in the first data block is included before the first least compressible unit, a second encoding is used as an encoding corresponding to the first least compressible unit currently encoded, wherein the second encoding is an inner encoding comprising the position of the respective least compressible unit in the first data block, wherein the inner encoding is distinguished from the outer encoding by a predetermined representation.
2. The method of claim 1, wherein in the case that it is determined that the first minimum compressible unit is included in the second data block, having a first encoding as the encoding corresponding to the currently encoded first minimum compressible unit comprises, in the case that it is determined that the first minimum compressible unit is included in the second data block, determining whether a consecutive plurality of minimum compressible units in the first data block starting from the currently encoded first minimum compressible unit is included in the second data block, and in the case that it is determined that the consecutive plurality of minimum compressible units is included in the second data block, having the first encoding as the encoding of the consecutive plurality of minimum compressible units, wherein the first encoding further comprises a number of the consecutive plurality of minimum compressible units.
3. The method of claim 1, wherein determining whether the first least compressible element is included before the currently encoded first least compressible element therein in the first data block comprises determining whether the first least compressible element is included in a predetermined number of least compressible elements before the currently encoded first least compressible element therein in the first data block.
4. A method of data decompression, comprising:
determining whether a currently decoded first encoding in first compressed data is an inner encoding or an outer encoding, wherein the inner encoding includes position information of a corresponding minimum compressible unit in a first data block, and the outer encoding includes position information of the corresponding minimum compressible unit in a second data block, wherein the first data block is an original data block of the first compressed data, the second data block is a data block related to the first data block, and the minimum compressible unit is a continuous character string between two continuous spaces;
in the case that the first code is determined to be an outer code, taking at least one minimum compressible unit corresponding to the first code in the second data block as decompressed data of the first code;
in the case that it is determined that the first encoding is an inner encoding, at least one least compressible unit in the first data block corresponding to the first encoding is taken as decompressed data of the first encoding.
5. The method of claim 4, wherein the first compressed data includes first information used to obtain the second data block when decompressing the first compressed data, wherein in the case where it is determined that the first encoding is outer encoding, having at least one least compressible unit in the second data block corresponding to the first encoding as decompressed data of the first encoding includes, in the case where it is determined that the first encoding is outer encoding, obtaining the second data block based on the first information, and having at least one least compressible unit in the second data block corresponding to the first encoding as decompressed data of the first encoding.
6. The method of claim 4, wherein the inner encoding is distinguished from the outer encoding by a predetermined representation, and wherein determining whether the currently decoded first encoding of the first compressed data is inner encoding or outer encoding comprises determining whether the currently decoded first encoding of the first compressed data is inner encoding or outer encoding based on the particular identifier.
7. A data transmission method, wherein the method is performed by a terminal device, and comprises:
receiving first compressed data from a server-side device, wherein the first compressed data comprises an inner code and an outer code, the inner code comprises position information of a corresponding minimum compressible unit in a first data block, and the outer code comprises position information of a corresponding minimum compressible unit in a second data block, wherein the first data block is an original data block of the first compressed data, and the second data block is a data block related to the first data block;
locally acquiring the second data block;
decompressing the first compressed data to obtain the first data block by the method according to any of claims 4 to 6.
8. The method according to claim 7, wherein the first data block is differential data between new version installation data and old version installation data of software, the second data block is old version installation data of the software, and the first compressed data is an upgrade package for upgrading the software at the terminal device, the method further comprising, after acquiring the first data block, acquiring the new version installation data based on the first data block and the second data block.
9. The method of claim 8, wherein the first compressed data includes first information configured to cause the terminal device to obtain the second data block when decompressing the first compressed data, wherein obtaining the second data block locally includes obtaining the second data block locally based on the first information.
10. The method of claim 9, wherein the first information is any one of: the storage address of the second data block in the terminal equipment and the data identification of the second data block in the terminal equipment.
11. A computer-readable storage medium storing program instructions, which when executed by a computer, cause the computer to perform the method of any one of claims 1 to 10.
12. A computing device comprising a memory and a processor, wherein the memory has stored therein program instructions that, when executed, implement the method of any of claims 1 to 10.
CN202110174553.9A 2019-09-18 2019-09-18 Data decompression method, data transmission method based on data decompression method, computer device and readable storage medium Active CN113014551B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110174553.9A CN113014551B (en) 2019-09-18 2019-09-18 Data decompression method, data transmission method based on data decompression method, computer device and readable storage medium

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202110174553.9A CN113014551B (en) 2019-09-18 2019-09-18 Data decompression method, data transmission method based on data decompression method, computer device and readable storage medium
CN201910882172.9A CN110740123B (en) 2019-09-18 2019-09-18 Data compression method and data transmission method, terminal equipment and system based on data compression method

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
CN201910882172.9A Division CN110740123B (en) 2019-09-18 2019-09-18 Data compression method and data transmission method, terminal equipment and system based on data compression method

Publications (2)

Publication Number Publication Date
CN113014551A CN113014551A (en) 2021-06-22
CN113014551B true CN113014551B (en) 2022-04-29

Family

ID=69268202

Family Applications (2)

Application Number Title Priority Date Filing Date
CN201910882172.9A Active CN110740123B (en) 2019-09-18 2019-09-18 Data compression method and data transmission method, terminal equipment and system based on data compression method
CN202110174553.9A Active CN113014551B (en) 2019-09-18 2019-09-18 Data decompression method, data transmission method based on data decompression method, computer device and readable storage medium

Family Applications Before (1)

Application Number Title Priority Date Filing Date
CN201910882172.9A Active CN110740123B (en) 2019-09-18 2019-09-18 Data compression method and data transmission method, terminal equipment and system based on data compression method

Country Status (1)

Country Link
CN (2) CN110740123B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110740123B (en) * 2019-09-18 2021-03-09 华为技术有限公司 Data compression method and data transmission method, terminal equipment and system based on data compression method

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2311635A (en) * 1996-03-27 1997-10-01 Memory Corp Plc Compression of data for storage using two CAM dictionaries in parallel
CN103281156A (en) * 2013-05-02 2013-09-04 华为技术有限公司 Methods and devices for compressing and decompressing data
CN104468028A (en) * 2013-09-25 2015-03-25 华为技术有限公司 Data coding and decoding method and device
CN104734722A (en) * 2013-12-23 2015-06-24 深圳市国微电子有限公司 Data compression method and data decompression device
CN105846825A (en) * 2015-01-30 2016-08-10 富士通株式会社 Compression method, decompression method, compression device and decompresssion device
CN110740123B (en) * 2019-09-18 2021-03-09 华为技术有限公司 Data compression method and data transmission method, terminal equipment and system based on data compression method

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8698657B2 (en) * 2012-09-10 2014-04-15 Canon Kabushiki Kaisha Methods and systems for compressing and decompressing data
CN106375177A (en) * 2015-07-21 2017-02-01 中兴通讯股份有限公司 Message transmission method and apparatus

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2311635A (en) * 1996-03-27 1997-10-01 Memory Corp Plc Compression of data for storage using two CAM dictionaries in parallel
CN103281156A (en) * 2013-05-02 2013-09-04 华为技术有限公司 Methods and devices for compressing and decompressing data
CN104468028A (en) * 2013-09-25 2015-03-25 华为技术有限公司 Data coding and decoding method and device
CN104734722A (en) * 2013-12-23 2015-06-24 深圳市国微电子有限公司 Data compression method and data decompression device
CN105846825A (en) * 2015-01-30 2016-08-10 富士通株式会社 Compression method, decompression method, compression device and decompresssion device
CN110740123B (en) * 2019-09-18 2021-03-09 华为技术有限公司 Data compression method and data transmission method, terminal equipment and system based on data compression method

Also Published As

Publication number Publication date
CN113014551A (en) 2021-06-22
CN110740123B (en) 2021-03-09
CN110740123A (en) 2020-01-31

Similar Documents

Publication Publication Date Title
CN107395209B (en) Data compression method, data decompression method and equipment thereof
US9727574B2 (en) System and method for applying an efficient data compression scheme to URL parameters
US6985965B2 (en) Static information knowledge used with binary compression methods
US8799239B2 (en) Method, apparatus and computer program product for performing a query using a decision diagram
CN111262876B (en) Data processing method, device and equipment based on block chain and storage medium
US7983301B2 (en) Method for extended transmission capabilities of short message service
KR101568947B1 (en) Method and system for downloading font file
US10897270B2 (en) Dynamic dictionary-based data symbol encoding
CN112165331A (en) Data compression method and device, data decompression method and device, storage medium and electronic equipment
CA2428788C (en) Static information knowledge used with binary compression methods
CN115208414A (en) Data compression method, data compression device, computer device and storage medium
CN113014551B (en) Data decompression method, data transmission method based on data decompression method, computer device and readable storage medium
CN115189696A (en) Hardware compression and decompression method based on Huffman decoding table
JP2003333619A (en) Frame compression using cardinal approximation or differential code and escape code
CN112995199B (en) Data encoding and decoding method, device, transmission system, terminal equipment and storage medium
CN114337678A (en) Data compression method, device, equipment and storage medium
CN103138871A (en) Server data processing system and method of application program of mobile communication system
CN108090115B (en) Filtering method and system for Gzip compressed data
CN116137534A (en) Lossless compression method, electronic device, and storage medium
CN103139757B (en) A kind of data transmission system of application program for mobile terminal is unified method
CN112383888A (en) Short message system, method and equipment
CN116708589B (en) Method, device, computer equipment and storage medium for compressing packet header
EP1605595A1 (en) Method for compressing a short message
CN103220647B (en) The recognition methods of data coding mode, subscriber equipment and system
CN105491544A (en) Short message compression communication method and short message compression communication system

Legal Events

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