WO2021174836A1 - Differential package generation method and apparatus, computer device, and storage medium - Google Patents

Abstract

A differential package generation method and a related device. The method comprises: acquiring an old file and a new file of software to be upgraded; dividing the old file into a plurality of first character strings, and combining the plurality of first character strings into a first character string group according to the order in the old file; dividing the new file into a plurality of second character strings, and combining the plurality of second character strings into a second character string group according to the order in the new file; combining sequence numbers in the first character string group of a similar character string of each second character string in the second character string group into a sequence number array; calculating the difference value of each second character string in the second character string group and a similar character string of the second character string in the first character string group, and combining a difference value corresponding to each second character string in the second character string group into a difference value array (105); and compressing the sequence number array and the difference value array into a differential package (106). The present method improves the efficiency of generating a differential package.

Description

Differential packet generation method, device, computer equipment and storage medium

This application claims the priority of a Chinese patent application filed with the Chinese Patent Office on March 4, 2020, the application number is CN202010144853.8, and the invention title is "Differential Packet Generation Method and Related Equipment", the entire content of which is incorporated herein by reference Applying.

Technical field

This application relates to the technical field of software upgrades, and in particular to a differential packet generation method, device, computer device, and computer storage medium.

Background technique

Differential upgrade is one of the main ways to upgrade the software of electronic equipment. The main process of using the differential upgrade method to upgrade the software is: calculate the different parts of the new file and the old file of the software to be upgraded, pack and compress the different parts into a differential package (ie upgrade patch), and send the differential package to the electronic device. Combine the difference package and the old file of the software to be upgraded into a new file. However, the inventor has realized that the difference packet generated by the existing difference packet generation algorithm is relatively large, and it takes a long time to generate the difference packet.

Summary of the invention

A differential packet generation method, the method includes:

Acquiring an old file and a new file of the software to be upgraded, where the old file and the new file are text files;

Dividing the old file into a plurality of first character strings according to the separator in the old file, and combining the plurality of first character strings according to the order in the old file into a first character string group;

Dividing the new file into a plurality of second character strings according to the separator in the new file, and combining the plurality of second character strings according to the order in the new file into a second character string group;

Search for similar character strings of each second character string in the second character string group from the first character string group, and compare the similar character strings of each second character string in the second character string group The sequence number combination in the first character string group is a sequence number array;

Calculate the difference between each second character string in the second character string group and the similar character string of the second character string in the first character string group, and calculate the difference between each second character string in the second character string group The difference value combination corresponding to the second character string is a difference value array;

Compressing the sequence number array and the difference value array into a difference packet.

A differential packet generating device, the device includes:

An obtaining module, used to obtain old files and new files of the software to be upgraded, where the old files and the new files are text files;

The first dividing module is configured to divide the old file into a plurality of first character strings according to the separator in the old file, and combine the plurality of first character strings in the order in the old file into The first string group;

The second dividing module is configured to divide the new file into a plurality of second character strings according to the separator in the new file, and combine the plurality of second character strings according to the order in the new file into The second string group;

The search module is used to search for similar character strings of each second character string in the second character string group from the first character string group, and to compare each second character in the second character string group The sequence number combination of similar character strings in the first character string group is a sequence number array;

The calculation module is used to calculate the difference between each second character string in the second character string group and the similar character string of the second character string in the first character string group, and calculate the difference between the second character The difference combination corresponding to each second character string in the string group is a difference array;

The compression module is used to compress the sequence number array and the difference value array into a difference packet.

A computer device includes a processor, and the processor implements the following steps when the processor is used to execute a computer program stored in a memory:

Acquiring an old file and a new file of the software to be upgraded, where the old file and the new file are text files;

Dividing the old file into a plurality of first character strings according to the separator in the old file, and combining the plurality of first character strings according to the order in the old file into a first character string group;

Dividing the new file into a plurality of second character strings according to the separator in the new file, and combining the plurality of second character strings according to the order in the new file into a second character string group;

Search for similar character strings of each second character string in the second character string group from the first character string group, and compare the similar character strings of each second character string in the second character string group The sequence number combination in the first character string group is a sequence number array;

Calculate the difference between each second character string in the second character string group and the similar character string of the second character string in the first character string group, and calculate the difference between each second character string in the second character string group The difference value combination corresponding to the second character string is a difference value array;

Compressing the sequence number array and the difference value array into a difference packet.

The fourth aspect of the present application provides a computer storage medium on which a computer program is stored, and when the computer program is executed by a processor, the following steps are implemented:

Acquiring an old file and a new file of the software to be upgraded, where the old file and the new file are text files;

Dividing the old file into a plurality of first character strings according to the separator in the old file, and combining the plurality of first character strings according to the order in the old file into a first character string group;

Dividing the new file into a plurality of second character strings according to the separator in the new file, and combining the plurality of second character strings according to the order in the new file into a second character string group;

Search for similar character strings of each second character string in the second character string group from the first character string group, and compare the similar character strings of each second character string in the second character string group The sequence number combination in the first character string group is a sequence number array;

Calculate the difference between each second character string in the second character string group and the similar character string of the second character string in the first character string group, and calculate the difference between each second character string in the second character string group The difference value combination corresponding to the second character string is a difference value array;

Compressing the sequence number array and the difference value array into a difference packet.

The difference packet of the present application includes the sequence number array and the difference value array, and occupies a small storage space; it also reduces the time for generating the difference packet of the present invention, so the present invention reduces the size of the difference packet and improves the generation The efficiency of the differential package.

Description of the drawings

Fig. 1 is a flowchart of a differential packet generation method provided by an embodiment of the present application.

Fig. 2 is a structural diagram of a differential packet generating device provided by an embodiment of the present application.

Fig. 3 is a schematic diagram of a computer device provided by an embodiment of the present application.

Detailed ways

In order to be able to understand the above objectives, features and advantages of the application more clearly, the application will be described in detail below with reference to the accompanying drawings and specific embodiments. It should be noted that the embodiments of the application and the features in the embodiments can be combined with each other if there is no conflict.

In the following description, many specific details are set forth in order to fully understand the present application. The described embodiments are only a part of the embodiments of the present application, rather than all the embodiments. Based on the embodiments in this application, all other embodiments obtained by those of ordinary skill in the art without creative work shall fall within the protection scope of this application.

Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by those skilled in the technical field of this application. The terms used in the specification of the application herein are only for the purpose of describing specific embodiments, and are not intended to limit the application.

Preferably, the differential packet generation method of the present application is applied to one or more computer devices. The computer device is a device that can automatically perform numerical calculation and/or information processing in accordance with pre-set or stored instructions. Its hardware includes, but is not limited to, a microprocessor and an application specific integrated circuit (ASIC) , Programmable Gate Array (Field-Programmable Gate Array, FPGA), Digital Processor (Digital Signal Processor, DSP), embedded equipment, etc.

The computer device may be a computing device such as a desktop computer, a notebook, a palmtop computer, and a cloud server. The computer device can interact with the user through a keyboard, a mouse, a remote control, a touch panel, or a voice control device.

Example one

FIG. 1 is a flowchart of a differential packet generation method provided in Embodiment 1 of the present application. The differential packet generation method is applied to a computer device.

The differential package generating method generates a differential package for software upgrade.

As shown in Figure 1, the differential packet generation method includes:

101. Obtain an old file and a new file of the software to be upgraded, where the old file and the new file are text files.

In a specific embodiment, the version information of the software to be upgraded may be obtained from a mobile phone terminal; a file whose version information is consistent with the version information of the software to be upgraded of the mobile phone terminal is searched from a local version file library to obtain the The old file of the software to be upgraded; searching for the file of the latest version of the software to be upgraded from a local version file library to obtain the new file of the software to be upgraded. The local version file library stores multiple historical versions of the software to be upgraded and files of the latest version.

For example, obtain the version information of a given software to be upgraded from a given mobile phone terminal as V1.0.1; search for a file with version information of V1.0.1 from the local version file library, and obtain the version information of the given software to be upgraded as V1. 0.1 old file; search the file of the latest version of the given software to be upgraded from the local version file library, and get the new file with the version information of the given software to be upgraded as V1.0.2. The local version file library can store files with the version information of the given software to be upgraded as V1.0.0, V1.0.1, and V1.0.2. The files with version information of V1.0.0 and V1.0.1 are files of two historical versions of the given software to be upgraded, and the file with version information of V1.0.2 is the file of the latest version of the given software to be upgraded.

In another specific embodiment, the version information of the software to be upgraded may be obtained from a computer terminal; a file whose version information is consistent with the version information of the software to be upgraded of the mobile phone terminal is searched from a local version file library, and all files are obtained. The old file of the software to be upgraded; the file of the latest version of the software to be upgraded is searched from a local version file library to obtain the new file of the software to be upgraded.

In another embodiment, before the obtaining the old file and the new file of the software to be upgraded, the method further includes:

Obtaining description information of the old file;

Determine whether the old file is legal according to the description information of the old file.

For example, to obtain the description information of the old file from the client, the client uses a given hash algorithm to hash the old file to obtain the description information of the old file; the old file in the local version of the file library is hashed to get the local The description information of the old file; if the description information of the client’s old file is consistent with that of the local old file, the old file is valid; if the description of the client’s old file is inconsistent with the local old file’s description, the old file is inconsistent. The file is illegal.

102. Divide the old file into a plurality of first character strings according to the separator in the old file, and combine the plurality of first character strings according to the order in the old file into a first character string group .

The separator in the old file may include: line break, space character, tab character, etc.

For example, the old file is divided into multiple first strings according to the space characters in the old file, where the content of the old file is "I am not robot", and the multiple first strings obtained are {"I"," am","not","robot"}. Combine multiple first character strings in the order in the old file into a first character string group {b[1],b[2],b[3],b[4]}, where b[1 ]="I", b[2]="am", b[3]="not", b[4]="robot".

In a specific embodiment, the combining the plurality of first character strings according to the order in the old file into a first character string group includes:

Deleting repeated first character strings in the multiple first character strings to obtain multiple deduplicated first character strings;

The multiple deduplicated first character strings are combined into the first character string group according to the order in the old file.

For example, the content of the old file is "I am not robot, he is a robot", and the multiple first strings obtained are {"I","am","not","robot",","," he","is","a","robot"}. Delete the repeated first string "robot" in multiple first strings, and get multiple deduplicated first strings {"I","am","not","robot",",", "He", "is", "a"}, combine multiple deduplicated first character strings according to the order in the old file into a first character string group {b[1],b[2] ,b[3],b[4],b[5],b[6],b[7],b[8]}, where b[1]="I", b[2]="am ", b[3]="not", b[4]="robot", b[5]=",", b[6]="he", b[7]="is", b[8 ]="a".

The foremost first character string among the repeated first character strings may be retained in the order of the preceding and the next, and the first character strings other than the foremost first character string among the repeated first character strings may be deleted.

103. Divide the new file into a plurality of second character strings according to the separator in the new file, and combine the plurality of second character strings according to the order in the new file into a second character string group .

The delimiters in the new file may include: line breaks, space characters, tabs, and so on.

For example, the old file is divided into multiple first strings according to the space characters in the new file, where the content of the new file is "I am a robot", and the multiple first strings obtained are {"I"," am","a","robot"}. Combine multiple first character strings in the order in the old file into a first character string group {b[1],b[2],b[3],b[4]}, where b[1 ]="I", b[2]="am", b[3]="a", b[4]="robot".

104. Search for similar character strings of each second character string in the second character string group from the first character string group, and compare the similarity of each second character string in the second character string group The sequence number combination of the character string in the first character string group is a sequence number array.

The searching for similar character strings of each second character string in the second character string group from the first character string group includes:

(1) For any of the second character string in a second set of string A _i, m _i is determined the number of the second string of characters included in A _i, determining the character of the second string of each A _i is a _ix, x=0,1,2,...,m _i -1.

(2) For any set of the first character string in a first character string B _j, B _j determines that the character string contains a first number n _j, determining a first string of characters in each of b _j b _jy, y=0,1,2,...,n _j -1.

(3) Calculate the respective intermediate edit distances v _ij (x+1,y+1) between the second character string A _i and each first character string B _{j in the first character string group, x=0,1} ,2,...,m _i -1, y=0,1,2,...,n _j -1:

Wherein, v _ij (x, 0) = x, v _ij (0, y) = y, the edit distance between the _{second character string A i} and each first character string B _{j in the first character string group is} v _ij (m _i ,n _j ).

For example, a second string in the second string group is "pingan", the number of characters in the second string is 6, the 0th character is "p", the first character is "i", and the number of characters in the second string is 6. Two characters are "n", the third character is "g", the fourth character is "a", and the fifth character is "n". One of the first string in the first string group is "pintai", the number of characters in the first string is 6, the 0th character is "p", the first character is "i", the second is The character is "n", the third character is "t", the fourth character is "a", and the fifth character is "i". Calculate the intermediate edit distances v(1,2), v(2,1), v(2,2), v(2,3), v(3,2), v(3,3), one by one according to the above formula v(3,4), v(4,3), v(4,4), v(4,5), v(5,4), v(5,4), v(5,5), v (5,6) and v(6,5). Calculate the edit distance v(6,6) between the second character string and the first character string according to the above formula and v(5,6) and v(6,5).

(4) find the minimum of the first character string and the second string A _i of the string edit distance from the first set, the minimum first string edit distance as a second similar string of A _i String.

105. Calculate the difference between each second character string in the second character string group and the similar character string of the second character string in the first character string group, and combine the second character string in the second character string group The difference combination corresponding to each second character string of is a difference array.

The calculating the difference between each second character string in the second character string group and the similar character string of the second character string in the first character string group includes:

Align the binary value of each second character string in the second character string group with the binary value of the second character string in the first character string group to obtain the second character string The intermediate binary value of each second character string in the character string group and the intermediate binary value of the similar character string of the second character string in the first character string group. For example, if the binary value of the second character string is inconsistent with the length of the binary value of the similar character string of the second character string, the long binary value remains unchanged, and zeros are added one by one before the short binary value until two The lengths of the binary values are the same, and the intermediate binary value of the second character string with the same length and the intermediate binary value of the similar character string of the second character string in the first character string group are obtained.

An exclusive OR algorithm is used to calculate the difference between the intermediate binary value of each second character string in the second character string group and the intermediate binary value of similar character strings of the second character string.

For example, if a second character string is "pingan", the intermediate binary value of the second character string is "0000000111000011010011101110110011111000011101110". The similar character string of the second character string is "pintai", and the intermediate binary value of the similar character string of the second character string is "1110000110100111011101100111111010011000011101001". An exclusive OR algorithm is used to calculate the difference between the intermediate binary value of the second character string and the intermediate binary value of the similar character string of the second character string as "1110000001100100001110001001001001100000000000111".

106. Compress the sequence number array and the difference value array into a difference packet.

The bzip2 algorithm may be used to compress the difference array into a difference file, compress the serial number array into a serial number file, and combine the difference file and the serial number file into a difference package. Before compressing the difference value array, the binary value in the difference value array may be converted into a hexadecimal value.

In another embodiment, the sequence number array may not be compressed, and the difference file and the sequence number array are combined into one difference package.

When the client receives the difference packet, it can decompress the difference packet, and decompress the difference value array and the sequence number array. The old file is divided into multiple character strings according to the separator in the old file in the client, the multiple character strings are combined into a third character string group according to the order in the old file, and the The binary value combination of the third string group is a binary array. Find the binary value in the binary array corresponding to each binary value in the difference value array according to the sequence number array, and put each binary value in the difference value array with the binary value in the binary array corresponding to the binary value Perform an exclusive OR operation on the binary value of to obtain the array of the new file, and convert the array of the new file into a character string to obtain the new file.

The differential package generation method of the first embodiment obtains the old file and the new file of the software to be upgraded, the old file and the new file are text files; the old file is divided into a plurality of files according to the separator in the old file A first character string, combining the plurality of first character strings according to the order in the old file into a first character string group; dividing the new file into a plurality of first character strings according to the separator in the new file Two character strings, combining the multiple second character strings according to the order in the new file into a second character string group; searching for each of the second character string groups from the first character string group Similar character strings of a second character string, combining the sequence numbers of similar character strings of each second character string in the second character string group in the first character string group into a sequence number array; The difference between each second character string in the two character string group and the similar character string of the second character string in the first character string group, and each second character in the second character string group The difference value combination corresponding to the string is a difference value array; the sequence number array and the difference value array are compressed into a difference packet. The first embodiment reduces the size of the differential packet and improves the efficiency of generating the differential packet.

In another embodiment, the method further includes:

In response to the download request of the client, the differential package is sent to the client, so that the client generates the new file according to the differential package and the old file.

The difference package includes a difference file and a serial number file. Decompressing the difference package can obtain the difference value array and the serial number array. Customers can divide the old file into multiple character strings according to the separator in the old file in the client, and combine the multiple character strings into a third character string group according to the order in the old file, Combine the binary values of the third character string group into a binary array. Find the binary value in the binary array corresponding to each binary value in the difference value array according to the sequence number array, and put each binary value in the difference value array with the binary value in the binary array corresponding to the binary value Perform an exclusive OR operation on the binary value of to obtain the array of the new file, and convert the array of the new file into a character string to obtain the new file.

In another embodiment, the method further includes:

Distribute the differential package to the server.

In a specific embodiment, the differential package can be sent to each distributed server, and when the client requests the differential package, the differential package can be returned to the client through the distributed server to increase the download of the client. efficient.

Example two

Fig. 2 is a structural diagram of a differential packet generating device provided in the second embodiment of the present application. The differential packet generating device 20 is applied to a computer device. The difference package generation of this device is to generate a difference package for software upgrade. As shown in FIG. 2, the differential packet generating device 20 may include an acquisition module 201, a first division module 202, a second division module 203, a search module 204, a calculation module 205, and a compression module 206.

The obtaining module 201 is configured to obtain old files and new files of the software to be upgraded, and the old files and the new files are text files.

In a specific embodiment, the version information of the software to be upgraded may be obtained from a mobile phone terminal; a file whose version information is consistent with the version information of the software to be upgraded of the mobile phone terminal is searched from a local version file library to obtain the The old file of the software to be upgraded; searching for the file of the latest version of the software to be upgraded from a local version file library to obtain the new file of the software to be upgraded. The local version file library stores multiple historical versions of the software to be upgraded and files of the latest version.

For example, obtain the version information of a given software to be upgraded from a given mobile phone terminal as V1.0.1; search for a file with version information of V1.0.1 from the local version file library, and obtain the version information of the given software to be upgraded as V1. 0.1 old file; search the file of the latest version of the given software to be upgraded from the local version file library, and get the new file with the version information of the given software to be upgraded as V1.0.2. The local version file library can store files with the version information of the given software to be upgraded as V1.0.0, V1.0.1, and V1.0.2. The files with version information of V1.0.0 and V1.0.1 are files of two historical versions of the given software to be upgraded, and the file with version information of V1.0.2 is the file of the latest version of the given software to be upgraded.

In another specific embodiment, the version information of the software to be upgraded may be obtained from a computer terminal; a file whose version information is consistent with the version information of the software to be upgraded of the mobile phone terminal is searched from a local version file library, and all files are obtained. The old file of the software to be upgraded; the file of the latest version of the software to be upgraded is searched from a local version file library to obtain the new file of the software to be upgraded.

In another embodiment, before the obtaining the old file and the new file of the software to be upgraded, the method further includes:

Obtaining description information of the old file;

Determine whether the old file is legal according to the description information of the old file.

For example, to obtain the description information of the old file from the client, the client uses a given hash algorithm to hash the old file to obtain the description information of the old file; the old file in the local version of the file library is hashed to obtain the local The description information of the old file; if the description information of the client’s old file is consistent with that of the local old file, the old file is valid; if the description of the client’s old file is inconsistent with the local old file’s description, the old file is inconsistent. The file is illegal.

The first dividing module 202 is configured to divide the old file into a plurality of first character strings according to the separator in the old file, and combine the plurality of first character strings in the order in the old file Is the first string group.

The separator in the old file may include: line break, space character, tab character, etc.

For example, the old file is divided into multiple first strings according to the space characters in the old file, where the content of the old file is "I am not robot", and the multiple first strings obtained are {"I"," am","not","robot"}. Combine multiple first character strings in the order in the old file into a first character string group {b[1],b[2],b[3],b[4]}, where b[1 ]="I", b[2]="am", b[3]="not", b[4]="robot".

In a specific embodiment, the combining the plurality of first character strings according to the order in the old file into a first character string group includes:

Deleting repeated first character strings in the multiple first character strings to obtain multiple deduplicated first character strings;

The multiple deduplicated first character strings are combined into the first character string group according to the order in the old file.

For example, the content of the old file is "I am not robot, he is a robot", and the multiple first strings obtained are {"I","am","not","robot",","," he","is","a","robot"}. Delete the repeated first string "robot" in multiple first strings, and get multiple deduplicated first strings {"I","am","not","robot",",", "He", "is", "a"}, combine multiple deduplicated first character strings according to the order in the old file into a first character string group {b[1],b[2] ,b[3],b[4],b[5],b[6],b[7],b[8]}, where b[1]="I", b[2]="am ", b[3]="not", b[4]="robot", b[5]=",", b[6]="he", b[7]="is", b[8 ]="a".

The foremost first character string among the repeated first character strings may be retained in the order of the preceding and the next, and the first character strings other than the foremost first character string among the repeated first character strings may be deleted.

The second dividing module 203 is configured to divide the new file into a plurality of second character strings according to the separator in the new file, and combine the plurality of second character strings in the order in the new file Is the second string group.

The delimiters in the new file may include: line breaks, space characters, tabs, and so on.

For example, the old file is divided into multiple first strings according to the space characters in the new file, where the content of the new file is "I am a robot", and the multiple first strings obtained are {"I"," am","a","robot"}. Combine multiple first character strings in the order in the old file into a first character string group {b[1],b[2],b[3],b[4]}, where b[1 ]="I", b[2]="am", b[3]="a", b[4]="robot".

The search module 204 is configured to search for similar character strings of each second character string in the second character string group from the first character string group, and search for each second character string in the second character string group. The sequence number combination of similar character strings of the character string in the first character string group is a sequence number array.

The searching for similar character strings of each second character string in the second character string group from the first character string group includes:

(1) For any of the second character string in a second set of string A _i, m _i is determined the number of the second string of characters included in A _i, determining the character of the second string of each A _i is a _ix, x=0,1,2,...,m _i -1.

(2) For any set of the first character string in a first character string B _j, B _j determines that the character string contains a first number n _j, determining a first string of characters in each of b _j b _jy, y=0,1,2,...,n _j -1.

(3) Calculate the respective intermediate edit distances v _ij (x+1,y+1) between the second character string A _i and each first character string B _{j in the first character string group, x=0,1} ,2,...,m _i -1, y=0,1,2,...,n _j -1:

Wherein, v _ij (x, 0) = x, v _ij (0, y) = y, the edit distance between the _{second character string A i} and each first character string B _{j in the first character string group is} v _ij (m _i ,n _j ).

For example, a second character string in the second character string group is "pingan", the number of characters in the second character string is 6, the 0th character is "p", the first character is "i", and the first character is "i". Two characters are "n", the third character is "g", the fourth character is "a", and the fifth character is "n". One of the first string in the first string group is "pintai", the number of characters in the first string is 6, the 0th character is "p", the first character is "i", the second is The character is "n", the third character is "t", the fourth character is "a", and the fifth character is "i". Calculate the intermediate edit distances v(1,2), v(2,1), v(2,2), v(2,3), v(3,2), v(3,3), one by one according to the above formula v(3,4), v(4,3), v(4,4), v(4,5), v(5,4), v(5,4), v(5,5), v (5,6) and v(6,5). Calculate the edit distance v(6,6) between the second character string and the first character string according to the above formula and v(5,6) and v(6,5).

(4) find the minimum of the first character string and the second string A _i of the string edit distance from the first set, the minimum first string edit distance as a second similar string of A _i String.

The calculation module 205 is configured to calculate the difference between each second character string in the second character string group and the similar character string of the second character string in the first character string group, and calculate the difference between the second character string and the similar character string in the first character string group. The difference combination corresponding to each second character string in the character string group is a difference array.

The calculating the difference between each second character string in the second character string group and the similar character string of the second character string in the first character string group includes:

Align the binary value of each second character string in the second character string group with the binary value of the second character string in the first character string group to obtain the second character string The intermediate binary value of each second character string in the character string group and the intermediate binary value of the similar character string of the second character string in the first character string group. For example, if the binary value of the second character string is inconsistent with the length of the binary value of the similar character string of the second character string, the long binary value remains unchanged, and zeros are added one by one before the short binary value until two The lengths of the binary values are the same, and the intermediate binary value of the second character string with the same length and the intermediate binary value of the similar character string of the second character string in the first character string group are obtained.

An exclusive OR algorithm is used to calculate the difference between the intermediate binary value of each second character string in the second character string group and the intermediate binary value of similar character strings of the second character string.

For example, if a second character string is "pingan", the intermediate binary value of the second character string is "0000000111000011010011101110110011111000011101110". The similar character string of the second character string is "pintai", and the intermediate binary value of the similar character string of the second character string is "1110000110100111011101100111111010011000011101001". An exclusive OR algorithm is used to calculate the difference between the intermediate binary value of the second character string and the intermediate binary value of the similar character string of the second character string as "1110000001100100001110001001001001100000000000111".

The compression module 206 is configured to compress the sequence number array and the difference value array into a difference packet.

The bzip2 algorithm may be used to compress the difference array into a difference file, compress the serial number array into a serial number file, and combine the difference file and the serial number file into a difference package. Before compressing the difference value array, the binary value in the difference value array may be converted into a hexadecimal value.

In another embodiment, the sequence number array may not be compressed, and the difference file and the sequence number array are combined into one difference package.

When the client receives the difference packet, it can decompress the difference packet, and decompress the difference value array and the sequence number array. The old file is divided into multiple character strings according to the separator in the old file in the client, the multiple character strings are combined into a third character string group according to the order in the old file, and the The binary value combination of the third string group is a binary array. Find the binary value in the binary array corresponding to each binary value in the difference value array according to the sequence number array, and put each binary value in the difference value array with the binary value in the binary array corresponding to the binary value Perform an exclusive OR operation on the binary value of to obtain the array of the new file, and convert the array of the new file into a character string to obtain the new file.

The differential package generating device 20 of the second embodiment obtains the old file and the new file of the software to be upgraded, the old file and the new file are text files; the old file is divided into multiple files according to the separator in the old file. A first character string, combining the multiple first character strings according to the order in the old file into a first character string group; dividing the new file into a plurality of characters according to the separator in the new file A second character string, combining the multiple second character strings according to the order in the new file into a second character string group; searching for the second character string group in the first character string group The similar character strings of each second character string, the sequence numbers of the similar character strings of each second character string in the second character string group in the first character string group are combined into a sequence number array; The difference between each second character string in the second character string group and the similar character string of the second character string in the first character string group is calculated by dividing each second character string in the second character string group The difference value combination corresponding to the character string is a difference value array; the sequence number array and the difference value array are compressed into a difference packet. The second embodiment generates a differential package for software upgrade, which reduces the size of the differential package and improves the efficiency of generating the differential package.

In another embodiment, the differential packet generating device 20 may further include: a sending module, configured to send the differential packet to the client in response to a download request from the client, so that the client can perform the The difference package and the old file generate the new file.

The difference package includes a difference file and a serial number file. Decompressing the difference package can obtain the difference value array and the serial number array. Customers can divide the old file into multiple character strings according to the separator in the old file in the client, and combine the multiple character strings into a third character string group according to the order in the old file, Combine the binary values of the third character string group into a binary array. Find the binary value in the binary array corresponding to each binary value in the difference value array according to the sequence number array, and put each binary value in the difference value array with the binary value in the binary array corresponding to the binary value Perform an exclusive OR operation on the binary value of to obtain the array of the new file, and convert the array of the new file into a character string to obtain the new file.

In another embodiment, the differential packet generating device 20 may further include: a distribution module, configured to distribute the differential packet to a server.

In a specific embodiment, the differential package can be sent to each distributed server, and when the client requests the differential package, the differential package can be returned to the client through the distributed server to increase the download of the client. efficient.

Example three

This embodiment provides a computer storage medium on which a computer program is stored. When the computer program is executed by a processor, the steps in the embodiment of the differential packet generation method described above are implemented, for example, 101-106 shown in FIG. 1:

101. Obtain an old file and a new file of the software to be upgraded, where the old file and the new file are text files;

102. Divide the old file into a plurality of first character strings according to the separator in the old file, and combine the plurality of first character strings according to the order in the old file into a first character string group ；

103. Divide the new file into a plurality of second character strings according to the separator in the new file, and combine the plurality of second character strings according to the order in the new file into a second character string group ；

104. Search for similar character strings of each second character string in the second character string group from the first character string group, and compare the similarity of each second character string in the second character string group The sequence number combination of the character string in the first character string group is a sequence number array;

105. Calculate the difference between each second character string in the second character string group and the similar character string of the second character string in the first character string group, and combine the second character string in the second character string group The difference combination corresponding to each second character string of is a difference array;

106. Compress the sequence number array and the difference value array into a difference packet.

Or, when the computer program is executed by the processor, the function of each module in the above-mentioned device embodiment is realized, for example, the modules 201-206 in Fig. 2:

The obtaining module 201 is configured to obtain old files and new files of the software to be upgraded, where the old files and the new files are text files;

The first dividing module 202 is configured to divide the old file into a plurality of first character strings according to the separator in the old file, and combine the plurality of first character strings in the order in the old file Is the first string group;

The second dividing module 203 is configured to divide the new file into a plurality of second character strings according to the separator in the new file, and combine the plurality of second character strings in the order in the new file Is the second string group;

The search module 204 is configured to search for similar character strings of each second character string in the second character string group from the first character string group, and search for each second character string in the second character string group. The sequence number combination of similar character strings of the character string in the first character string group is an array of sequence numbers;

The calculation module 205 is configured to calculate the difference between each second character string in the second character string group and the similar character string of the second character string in the first character string group, and calculate the difference between the second character string and the similar character string in the first character string group. The difference combination corresponding to each second character string in the character string group is a difference array;

The compression module 206 is configured to compress the sequence number array and the difference value array into a difference packet.

Example four

FIG. 3 is a schematic diagram of a computer device provided in Embodiment 4 of this application. The computer device 30 includes a memory 301, a processor 302, and a computer program 303 that is stored in the memory 301 and can run on the processor 302, such as a differential packet generation program. When the processor 302 executes the computer program 303, the steps in the embodiment of the above-mentioned differential packet generation method are implemented, for example, 101-106 shown in Fig. 1:

101. Obtain an old file and a new file of the software to be upgraded, where the old file and the new file are text files;

102. Divide the old file into a plurality of first character strings according to the separator in the old file, and combine the plurality of first character strings according to the order in the old file into a first character string group ；

103. Divide the new file into a plurality of second character strings according to the separator in the new file, and combine the plurality of second character strings according to the order in the new file into a second character string group ；

104. Search for similar character strings of each second character string in the second character string group from the first character string group, and compare the similarity of each second character string in the second character string group The sequence number combination of the character string in the first character string group is a sequence number array;

105. Calculate the difference between each second character string in the second character string group and the similar character string of the second character string in the first character string group, and combine the second character string in the second character string group The difference combination corresponding to each second character string of is a difference array;

106. Compress the sequence number array and the difference value array into a difference packet.

Or, when the computer program is executed by the processor, the function of each module in the above-mentioned device embodiment is realized, for example, the modules 201-206 in Fig. 2:

The obtaining module 201 is configured to obtain old files and new files of the software to be upgraded, where the old files and the new files are text files;

The first dividing module 202 is configured to divide the old file into a plurality of first character strings according to the separator in the old file, and combine the plurality of first character strings in the order in the old file Is the first string group;

The second dividing module 203 is configured to divide the new file into a plurality of second character strings according to the separator in the new file, and combine the plurality of second character strings in the order in the new file Is the second string group;

The search module 204 is configured to search for similar character strings of each second character string in the second character string group from the first character string group, and search for each second character string in the second character string group. The sequence number combination of similar character strings of the character string in the first character string group is an array of sequence numbers;

The calculation module 205 is configured to calculate the difference between each second character string in the second character string group and the similar character string of the second character string in the first character string group, and calculate the difference between the second character string and the similar character string in the first character string group. The difference combination corresponding to each second string in the string group is a difference array;

The compression module 206 is configured to compress the sequence number array and the difference value array into a difference packet.

Exemplarily, the computer program 303 may be divided into one or more modules, and the one or more modules are stored in the memory 301 and executed by the processor 302 to complete the method. The one or more modules may be a series of computer program instruction segments capable of completing specific functions, and the instruction segments are used to describe the execution process of the computer program 303 in the computer device 30. For example, the computer program 303 can be divided into the acquisition module 201, the first division module 202, the second division module 203, the search module 204, the calculation module 205, and the compression module 206 in FIG. 2. For the specific functions of each module, refer to the embodiments. two.

The computer device 30 may be a computing device such as a desktop computer, a notebook, a palmtop computer, and a cloud server. Those skilled in the art can understand that the schematic diagram 3 is only an example of the computer device 30 and does not constitute a limitation on the computer device 30. It may include more or less components than those shown in the figure, or combine certain components, or be different. For example, the computer device 30 may also include input and output devices, network access devices, buses, and so on.

The so-called processor 302 may be a central processing unit (Central Processing Unit, CPU), other general processors, digital signal processors (Digital Signal Processor, DSP), application specific integrated circuits (Application Specific Integrated Circuit, ASIC), Field-Programmable Gate Array (FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components, etc. The general-purpose processor can be a microprocessor or the processor 302 can also be any conventional processor, etc. The processor 302 is the control center of the computer device 30, which uses various interfaces and lines to connect the entire computer device 30. Various parts.

The memory 301 can be used to store the computer program 303, and the processor 302 implements the computer device by running or executing the computer program or module stored in the memory 301 and calling data stored in the memory 301 30 various functions. The memory 301 may mainly include a storage program area and a storage data area, where the storage program area may store an operating system, an application program required by at least one function (such as a sound playback function, an image playback function, etc.), etc.; the storage data area may Data (such as audio data, etc.) created according to the use of the computer device 30 and the like are stored. In addition, the memory 301 may include non-volatile memory, such as a hard disk, a memory, a plug-in hard disk, a smart memory card (Smart Media Card, SMC), a Secure Digital (SD) card, a flash memory card (Flash Card), At least one magnetic disk storage device, flash memory device, or other non-volatile solid state storage device.

If the integrated module of the computer device 30 is implemented in the form of a software function module and sold or used as an independent product, it can be stored in a computer readable storage medium. Based on this understanding, this application implements all or part of the processes in the above-mentioned embodiments and methods, and can also be completed by instructing relevant hardware through a computer program. The computer program can be stored in a computer storage medium. When executed by the processor, the following steps can be implemented:

Acquiring an old file and a new file of the software to be upgraded, where the old file and the new file are text files;

Dividing the old file into a plurality of first character strings according to the separator in the old file, and combining the plurality of first character strings according to the order in the old file into a first character string group;

Dividing the new file into a plurality of second character strings according to the separator in the new file, and combining the plurality of second character strings according to the order in the new file into a second character string group;

Search for similar character strings of each second character string in the second character string group from the first character string group, and compare the similar character strings of each second character string in the second character string group The sequence number combination in the first character string group is a sequence number array;

Calculate the difference between each second character string in the second character string group and the similar character string of the second character string in the first character string group, and calculate the difference between each second character string in the second character string group The difference value combination corresponding to the second character string is a difference value array;

Compressing the sequence number array and the difference value array into a difference packet.

Wherein, the computer program includes computer program code, and the computer program code may be in the form of source code, object code, executable file, or some intermediate forms. The computer-readable medium may include: any entity or device capable of carrying the computer program code, recording medium, U disk, mobile hard disk, magnetic disk, optical disk, computer memory, read-only memory (ROM, Read-Only Memory) .

In the several embodiments provided in this application, it should be understood that the disclosed system, device, and method can be implemented in other ways. For example, the device embodiments described above are only illustrative. For example, the division of the modules is only a logical function division, and there may be other division methods in actual implementation.

The modules described as separate components may or may not be physically separated, and the components displayed as modules may or may not be physical modules, that is, they may be located in one place, or they may be distributed on multiple network units. Some or all of the modules can be selected according to actual needs to achieve the objectives of the solutions of the embodiments.

In addition, the functional modules in the various embodiments of the present application may be integrated into one processing module, or each module may exist alone physically, or two or more modules may be integrated into one module. The above-mentioned integrated modules can be implemented in the form of hardware, or in the form of hardware plus software functional modules.

The above-mentioned integrated modules implemented in the form of software functional modules may be stored in a computer-readable storage medium, and the computer-readable storage medium may be volatile or non-volatile. The above-mentioned software function module is stored in a storage medium and includes several instructions to make a computer device (which can be a personal computer, a server, or a network device, etc.) or a processor execute the following steps:

Acquiring an old file and a new file of the software to be upgraded, where the old file and the new file are text files;

Dividing the old file into a plurality of first character strings according to the separator in the old file, and combining the plurality of first character strings according to the order in the old file into a first character string group;

Dividing the new file into a plurality of second character strings according to the separator in the new file, and combining the plurality of second character strings according to the order in the new file into a second character string group;

Search for similar character strings of each second character string in the second character string group from the first character string group, and compare the similar character strings of each second character string in the second character string group The sequence number combination in the first character string group is a sequence number array;

Calculate the difference between each second character string in the second character string group and the similar character string of the second character string in the first character string group, and calculate the difference between each second character string in the second character string group The difference value combination corresponding to the second character string is a difference value array;

Compressing the sequence number array and the difference value array into a difference packet.

In another embodiment, in the differential packet generation method provided by the present application, in order to further ensure the privacy and security of all the above-mentioned data, all the above-mentioned data can also be stored in a node of a blockchain. For example, the serial number array and the difference value array, etc., these data can be stored in the blockchain node.

It should be noted that the blockchain referred to in this application is a new application mode of computer technology such as distributed data storage, point-to-point transmission, consensus mechanism, and encryption algorithm.

For those skilled in the art, it is obvious that the present application is not limited to the details of the foregoing exemplary embodiments, and the present application can be implemented in other specific forms without departing from the spirit or basic characteristics of the application. Therefore, no matter from which point of view, the embodiments should be regarded as exemplary and non-limiting. The scope of this application is defined by the appended claims rather than the above description, and therefore it is intended to fall into the claims. All changes in the meaning and scope of the equivalent elements of are included in this application. Any associated diagram marks in the claims should not be regarded as limiting the claims involved. In addition, it is obvious that the word "including" does not exclude other modules or steps, and the singular does not exclude the plural. Multiple modules or devices stated in the system claims can also be implemented by one module or device through software or hardware. Words such as first and second are used to denote names, but do not denote any specific order.

Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the application and not to limit them. Although the application has been described in detail with reference to the preferred embodiments, those of ordinary skill in the art should understand that the technical solutions of the application can be Make modifications or equivalent replacements without departing from the spirit and scope of the technical solution of the present application.

Claims (20)

1. A differential packet generation method, wherein the method includes:

   Acquiring an old file and a new file of the software to be upgraded, where the old file and the new file are text files;

   Dividing the old file into a plurality of first character strings according to the separator in the old file, and combining the plurality of first character strings according to the order in the old file into a first character string group;

   Dividing the new file into a plurality of second character strings according to the separator in the new file, and combining the plurality of second character strings according to the order in the new file into a second character string group;

   Search for similar character strings of each second character string in the second character string group from the first character string group, and compare the similar character strings of each second character string in the second character string group The sequence number combination in the first character string group is a sequence number array;

   Calculate the difference between each second character string in the second character string group and the similar character string of the second character string in the first character string group, and calculate the difference between each second character string in the second character string group The difference value combination corresponding to the second character string is a difference value array;

   Compressing the sequence number array and the difference value array into a difference packet.
2. The method of claim 1, wherein the combining the plurality of first character strings into a first character string group according to the order in the old file comprises:

   Deleting repeated first character strings in the multiple first character strings to obtain multiple deduplicated first character strings;

   The multiple deduplicated first character strings are combined into the first character string group according to the order in the old file.
3. The method according to claim 1, wherein said searching for similar character strings of each second character string in said second character string group from said first character string group comprises:

   For any set of the second character string in a second string A _i, m _i is determined the number of the second string of characters included in A _i, determining the character of the second string of each A _i is a _ix, x = 0 ,1,2,…,m _i -1;

   For any set of the first character string is a first character string B _j, B _j determines that the character string contains a first number n _j, determining a first string of characters in each of b _j b _jy, y = 0 ,1,2,…,n _j -1;

   Calculate the respective intermediate edit distances v _ij (x+1,y+1) between the second character string A _i and each first character string B _{j in the first character string group, x=0,1,2,} …,M _i -1, y=0,1,2,…,n _j -1:

   

   Wherein, v _ij (x, 0) = x, v _ij (0, y) = y, the edit distance between the _{second character string A i} and each first character string B _{j in the first character string group is} v _ij (m _i ,n _j );

   Find character string from the first set and the second character string edit distances A _i minimum first string, the first string edit distance is a minimum string similar second string of A _i.
4. The method of claim 1, wherein the calculating the difference between each second character string in the second character string group and a similar character string in the first character string group of the second character string Values include:

   Align the binary value of each second character string in the second character string group with the binary value of the second character string in the first character string group to obtain the second character string The intermediate binary value of each second character string in the character string group and the intermediate binary value of the similar character string of the second character string in the first character string group.
5. The method according to any one of claims 1 to 4, wherein, before the obtaining the old file and the new file of the software to be upgraded, the method further comprises:

   Obtaining description information of the old file;

   Determine whether the old file is legal according to the description information of the old file.
6. The method according to any one of claims 1-4, wherein the method further comprises:

   In response to the download request of the client, the differential package is sent to the client, so that the client generates the new file according to the differential package and the old file.
7. The method according to any one of claims 1-4, wherein the method further comprises:

   The differential packet is sent to the server separately.
8. A differential packet generating device, wherein the device includes:

   An obtaining module, used to obtain old files and new files of the software to be upgraded, where the old files and the new files are text files;

   The first dividing module is configured to divide the old file into a plurality of first character strings according to the separator in the old file, and combine the plurality of first character strings in the order in the old file into The first string group;

   The second dividing module is configured to divide the new file into a plurality of second character strings according to the separator in the new file, and combine the plurality of second character strings according to the order in the new file into The second string group;

   The search module is used to search for similar character strings of each second character string in the second character string group from the first character string group, and to compare each second character in the second character string group The sequence number combination of similar character strings in the first character string group is a sequence number array;

   The calculation module is used to calculate the difference between each second character string in the second character string group and the similar character string of the second character string in the first character string group, and calculate the difference between the second character The difference combination corresponding to each second character string in the string group is a difference array;

   The compression module is used to compress the sequence number array and the difference value array into a difference packet.
9. A computer device, wherein the computer device includes a processor, and the processor is configured to execute a computer program stored in a memory to implement the following steps:

   Acquiring an old file and a new file of the software to be upgraded, where the old file and the new file are text files;

   Dividing the old file into a plurality of first character strings according to the separator in the old file, and combining the plurality of first character strings according to the order in the old file into a first character string group;

   Dividing the new file into a plurality of second character strings according to the separator in the new file, and combining the plurality of second character strings according to the order in the new file into a second character string group;

   Search for similar character strings of each second character string in the second character string group from the first character string group, and compare the similar character strings of each second character string in the second character string group The sequence number combination in the first character string group is a sequence number array;

   Calculate the difference between each second character string in the second character string group and the similar character string of the second character string in the first character string group, and calculate the difference between each second character string in the second character string group The difference value combination corresponding to the second character string is a difference value array;

   Compressing the sequence number array and the difference value array into a difference packet.
10. 9. The computer device according to claim 9, wherein said combining the plurality of first character strings into a first character string group according to the order in the old file comprises:

    Deleting repeated first character strings in the multiple first character strings to obtain multiple deduplicated first character strings;

    The multiple deduplicated first character strings are combined into the first character string group according to the order in the old file.
11. 9. The computer device according to claim 9, wherein said searching for similar character strings of each second character string in said second character string group from said first character string group comprises:

    For any set of the second character string in a second string A _i, m _i is determined the number of the second string of characters included in A _i, determining the character of the second string of each A _i is a _ix, x = 0 ,1,2,…,m _i -1;

    For any set of the first character string is a first character string B _j, B _j determines that the character string contains a first number n _j, determining a first string of characters in each of b _j b _jy, y = 0 ,1,2,…,n _j -1;

    Calculate the respective intermediate edit distances v _ij (x+1,y+1) between the second character string A _i and each first character string B _{j in the first character string group, x=0,1,2,} …,M _i -1, y=0,1,2,…,n _j -1:

    

    Wherein, v _ij (x, 0) = x, v _ij (0, y) = y, the edit distance between the _{second character string A i} and each first character string B _{j in the first character string group is} v _ij (m _i ,n _j );

    Find character string from the first set and the second character string edit distances A _i minimum first string, the first string edit distance is a minimum string similar second string of A _i.
12. 9. The computer device according to claim 9, wherein said calculating the difference between each second character string in said second character string group and the similar character string of said second character string in said first character string group Differences include:

    Align the binary value of each second character string in the second character string group with the binary value of the second character string in the first character string group to obtain the second character string The intermediate binary value of each second character string in the character string group and the intermediate binary value of the similar character string of the second character string in the first character string group.
13. The computer device according to any one of claims 9-12, wherein, before said acquiring the old file and the new file of the software to be upgraded, the processor is configured to execute the computer program stored in the memory to further implement the following steps:

    Obtaining description information of the old file;

    Determine whether the old file is legal according to the description information of the old file.
14. The computer device according to any one of claims 9-12, wherein the processor is configured to execute the computer program stored in the memory and further implements the following steps:

    In response to the download request of the client, the differential package is sent to the client, so that the client generates the new file according to the differential package and the old file.
15. The computer device according to any one of claims 9-12, wherein the processor is configured to execute the computer program stored in the memory and further implements the following steps:

    The differential packet is sent to the server separately.
16. A computer storage medium having a computer program stored on the computer storage medium, wherein the following steps are implemented when the computer program is executed by a processor:

    Acquiring an old file and a new file of the software to be upgraded, where the old file and the new file are text files;

    Dividing the old file into a plurality of first character strings according to the separator in the old file, and combining the plurality of first character strings according to the order in the old file into a first character string group;

    Dividing the new file into a plurality of second character strings according to the separator in the new file, and combining the plurality of second character strings according to the order in the new file into a second character string group;

    Search for similar character strings of each second character string in the second character string group from the first character string group, and compare the similar character strings of each second character string in the second character string group The sequence number combination in the first character string group is a sequence number array;

    Calculate the difference between each second character string in the second character string group and the similar character string of the second character string in the first character string group, and calculate the difference between each second character string in the second character string group The difference value combination corresponding to the second character string is a difference value array;

    Compressing the sequence number array and the difference value array into a difference packet.
17. 15. The computer storage medium of claim 16, wherein the combining the plurality of first character strings into a first character string group according to the order in the old file comprises:

    Deleting repeated first character strings in the multiple first character strings to obtain multiple deduplicated first character strings;

    The multiple deduplicated first character strings are combined into the first character string group according to the order in the old file.
18. 15. The computer storage medium according to claim 16, wherein said searching for similar character strings of each second character string in said second character string group from said first character string group comprises:

    For any set of the second character string in a second string A _i, m _i is determined the number of the second string of characters included in A _i, determining the character of the second string of each A _i is a _ix, x = 0 ,1,2,…,m _i -1;

    For any set of the first character string is a first character string B _j, B _j determines that the character string contains a first number n _j, determining a first string of characters in each of b _j b _jy, y = 0 ,1,2,…,n _j -1;

    Calculate the respective intermediate edit distances v _ij (x+1,y+1) between the second character string A _i and each first character string B _{j in the first character string group, x=0,1,2,} …,M _i -1, y=0,1,2,…,n _j -1:

    

    Wherein, v _ij (x, 0) = x, v _ij (0, y) = y, the edit distance between the _{second character string A i} and each first character string B _{j in the first character string group is} v _ij (m _i ,n _j );

    Find character string from the first set and the second character string edit distances A _i minimum first string, the first string edit distance is a minimum string similar second string of A _i.
19. The computer storage medium according to claim 16, wherein the calculation of each second character string in the second character string group and the similar character string of the second character string in the first character string group The differences include:

    Align the binary value of each second character string in the second character string group with the binary value of the second character string in the first character string group to obtain the second character string The intermediate binary value of each second character string in the character string group and the intermediate binary value of the similar character string of the second character string in the first character string group.
20. 22. The computer storage medium according to any one of claims 16-19, wherein, before said acquiring the old file and the new file of the software to be upgraded, the following steps are further implemented when the computer program is executed by the processor:

    Obtaining description information of the old file;

    Determine whether the old file is legal according to the description information of the old file.

Images