Data transmission, acquisition and interaction method, server and related computer device

Abstract

The invention relates to the technical field of computers, in particular to a data transmission, acquisition and interaction method, a server and a related computer device. The data transmission method comprises the steps that an in-band module constructs a frequency tree; splicing a first identifier and / or a second identifier of a connecting line between the root node and the character frequency leaf node as a pseudo code for forming the character, wherein the pseudo code digit of the first character is smaller than or equal to the pseudo code digit of the second character; encoding the frequency tree data to form a first code; updating each component character in the to-be-transmitted data into a pseudo code to obtain a second code; combining the first code and the second code to obtain reconstructed data; and transmitting the reconstructed data, so that the out-of-band module analyzes the data to be transmitted based on the reconstructed data. By adopting the method, the file size of the interaction data can be compressed, the data identification accuracy can be improved, the data interaction efficiency can be improved, the data interaction reliability is ensured, and the method has good generalization performance.

Description

Technical Field

[0001] The present application relates to the field of computer technology, and in particular to a data transmission method, a data acquisition method, a data interaction method, a server, a computer program product, a computer device, and a computer-readable storage medium. Background Art

[0002] Server in-band refers to the network environment in which servers provide services to users. Server out-of-band refers to the management network environment in which server management modules, such as the Baseboard Management Controller (BMC), reside. While server in-band and server out-of-band are typically technically isolated, there is still a need to transmit data from server in-band to server out-of-band.

[0003] To this end, server manufacturers typically create a custom interface when developing a BMC. This interface connects to the fixed storage space within the BMC, which allows for read and write operations. This interface also connects to the server's out-of-band data, allowing data exchange between the server and out-of-band. However, these interface definitions often exhibit strong customization, resulting in non-standardization and inconsistency, making them difficult to widely apply across servers. Consequently, using interfaces to implement data exchange between the server and out-of-band, hindering the generalizability of data exchange methods. Summary of the Invention

[0004] Based on this, it is necessary to provide a data transmission method, a data acquisition method, a data interaction method, a server, a computer program product, a computer device and a computer-readable storage medium to address the above technical problems, which can compress the file size of the interactive data and improve the accuracy of data recognition, thereby improving the efficiency of data interaction while ensuring the reliability of data interaction, and also has good generalization performance.

[0005] On the one hand, a data transmission method is provided, which includes: an in-band module of a server obtains data to be transmitted; counting the character frequency of each component character in the data to be transmitted, and constructing a frequency tree with the character frequency as a leaf node; assigning a first identifier or a second identifier to the connecting lines in the frequency tree, splicing the first identifier and / or the second identifier of the connecting lines from the root node to the leaf node of the character frequency as a pseudo-code of the component character, and the number of pseudo-code bits of the first character is less than or equal to the number of pseudo-code bits of the second character; wherein the first character is the one with a relatively higher character frequency between the first character and the second character; taking the component characters and their character frequencies as frequency tree data, encoding the frequency tree data to form a first code; updating each component character in the data to be transmitted to a pseudo-code to obtain a second code; combining the first code and the second code to obtain reconstructed data; transmitting the reconstructed data, so that the out-of-band module parses the data to be transmitted based on the reconstructed data.

[0006] In one embodiment of the present application, the first identifier includes a first coding value, and the second identifier includes a second coding value; assigning the first coding value or the second coding value to the connecting lines in the frequency tree includes: assigning the first coding value to the root node and the connecting line between the branch node and its left subtree; assigning the second coding value to the root node and the connecting line between the branch node and its right subtree.

[0007] In one embodiment of the present application, one of the first coding value and the second coding value is 0, and the other is 1.

[0008] In one embodiment of the present application, each component character in the data to be transmitted is updated to a pseudo-code to obtain a second code, which includes: sequentially adding the pseudo-codes of the component characters to the second code until the component characters in the data to be transmitted are traversed; wherein the arrangement order of the pseudo-codes in the second code matches the arrangement order of the component characters to which they belong in the data to be transmitted.

[0009] In one embodiment of the present application, encoding frequency tree data to form a first code includes: encoding character frequencies to obtain frequency codes; encoding constituent characters to obtain real codes of the constituent characters; combining the frequency codes and real codes of the constituent characters to form a first code; wherein the real codes of the constituent characters and the frequency codes of their character frequencies are adjacent, and the frequency codes of the constituent characters are located on the target side of their real codes.

[0010] In one embodiment of the present application, encoding the character frequency to obtain the frequency code includes: subtracting one from the character frequency to update the character frequency; and encoding using the updated character frequency to obtain the frequency code.

[0011] In one embodiment of the present application, the data transmission method further includes: forming a character identifier for each component character; assigning the character identifier to a pseudo code of the component character to which it belongs, and using the pseudo code carrying the character identifier as one of the frequency tree data.

[0012] In one embodiment of the present application, combining the first code and the second code further includes: obtaining the code of the spacing character as the spacing code; placing the spacing code between the first code and the second code, and splicing the first code, the spacing code and the second code.

[0013] In one embodiment of the present application, constructing a frequency tree with character frequencies as leaf nodes includes: sorting the character frequencies to form a frequency list; superimposing the character frequencies in the frequency list in sequence according to a preset order until the frequency list is traversed to obtain the target frequency; wherein the frequency result obtained by each superposition is added to the frequency list as the frequency to be superimposed to update the frequency list; in combination with the superposition process, a frequency tree is constructed with the target frequency as the root node and the character frequency as the leaf node.

[0014] In one embodiment of the present application, adding the frequency result obtained by each superposition as the frequency to be superimposed to the frequency list includes: deleting the frequency data of the frequency result obtained by superposition in the frequency list; wherein the frequency data includes character frequency and frequency to be superimposed; comparing the frequency result with the frequency data, and inserting it to a position that complies with the frequency data sorting rules.

[0015] In one embodiment of the present application, before transmitting the reconstructed data, the process includes: evaluating a check code that matches the reconstructed data; wherein the check code is used to check the reconstructed data; and inserting the check code into the reconstructed data to update the reconstructed data.

[0016] In one embodiment of the present application, evaluating the check code that matches the reconstructed data includes: obtaining the number of codes of the character codes in the reconstructed data, evaluating the number of check codes that match the code number and the insertion position; at each check code, starting with it, each time selecting a first number of character codes as the evaluation code, skipping the second number of character codes, until traversing the character code starting from the check code, counting the number of first code values ​​in the evaluation code, and determining whether to assign the first code value or the second code value to the check code based on the number of first code values; wherein the first number and the second number vary with different check codes.

[0017] In one embodiment of the present application, after obtaining the data to be transmitted, it includes: identifying the characters to be transcoded among the constituent characters in the data to be transmitted; obtaining replacement characters associated with the characters to be transcoded; wherein the replacement characters are easier to encode than the characters to be transcoded; and replacing the characters to be transcoded in the data to be transmitted with their replacement characters to update the data to be transmitted.

[0018] On the other hand, a data acquisition method is provided, which includes: an out-of-band module of a server acquires a data image containing reconstructed data; wherein the reconstructed data originates from an in-band module of the server; image recognition is performed on the data image to obtain recognition data obtained by recognizing the reconstructed data; a first code and a second code of the recognition data are parsed; the first code is decoded to obtain frequency tree data to obtain parsed component characters and their parsed character frequencies; the frequency tree is reconstructed with the parsed character frequencies as leaf nodes to obtain a reconstructed frequency tree; a first identifier or a second identifier is assigned to the connecting lines in the reconstructed frequency tree respectively, and the first identifier and / or the second identifier of the connecting lines between the root node and the leaf nodes of the parsed character frequencies are spliced ​​as parsed pseudo codes of the parsed component characters; wherein the assignment method of the first identifier or the second identifier matches the assignment method of the in-band module; and the parsed pseudo code is used to restore the parsed component characters in the second code to parse the transmission data that matches the data to be transmitted.

[0019] In one embodiment of the present application, the first identifier includes a first coding value, and the second identifier includes a second coding value; assigning the first identifier or the second identifier to the connecting lines in the reconstructed frequency tree includes: assigning the first coding value to the root node and the connecting line between the branch node and its left subtree; assigning the second coding value to the root node and the connecting line between the branch node and its right subtree.

[0020] In one embodiment of the present application, one of the first coding value and the second coding value is 0, and the other is 1.

[0021] In one embodiment of the present application, decoding the first code to obtain frequency tree data to obtain parsed component characters and their parsed character frequencies includes: matching the character corresponding to the real code in the first code as the parsed component character; restoring the parsed character frequency corresponding to the frequency code; and according to the order of the real code and the frequency code in the first code, taking the parsed character frequency adjacent to the real code of the parsed component character and located on the target side of its real code as the parsed character frequency of the parsed component character.

[0022] In one embodiment of the present application, restoring the parsed character frequency corresponding to the frequency code includes: decoding the frequency code; and adding one to the decoded frequency to obtain the parsed character frequency.

[0023] In one embodiment of the present application, parsing the first code and the second code of the identification data includes: identifying the interval code in the identification data, and using the interval code as the parsed interval character; using the code on one side of the parsed interval character as the first code, and the code on the other side as the second code.

[0024] In one embodiment of the present application, after parsing the transmission data that matches the data to be transmitted, the method further includes: identifying whether the transmission data includes replacement characters; and in response to the existence of replacement characters in the transmission data, replacing the replacement characters with associated characters that match them to update the transmission data.

[0025] In one embodiment of the present application, before parsing the first code and the second code of the identification data, it also includes: locating the check code in the identification data as a verification code; using the verification code to evaluate whether there is an identification anomaly in the identification data; in response to the existence of an identification anomaly, locating the code of the identification anomaly and correcting it to update the identification data; and deleting the verification code.

[0026] In one embodiment of the present application, using verification codes to evaluate whether there are recognition anomalies in identification data includes: starting with each verification code, selecting a first number of character codes as the codes to be evaluated, skipping a second number of character codes, until traversing the character codes starting from the verification code, counting the number of first code values ​​in the evaluation code, determining the theoretical value of the verification code based on the number of first code values, and comparing the theoretical value of the verification code with the actual value.

[0027] In one embodiment of the present application, the coding for positioning and identifying abnormalities includes: assigning a third coding value to a verification code whose theoretical value matches the actual value as a positioning code; assigning a fourth coding value to a verification code whose theoretical value does not match the actual value as a positioning code; sorting the positioning codes of each verification code according to the position order of the verification code in the identification data to form a positioning coding sequence; decoding the positioning coding sequence to obtain the target position; and determining that the coding value of the target position in the identification data is the coding for identifying abnormalities.

[0028] On the other hand, a data interaction method is provided, which includes: an in-band module of a server obtains data to be transmitted; the in-band module counts the character frequencies of each component character in the data to be transmitted, and constructs a frequency tree with the character frequencies as leaf nodes; the in-band module assigns a first identifier or a second identifier to the connecting lines in the frequency tree, and splices the first identifier and / or the second identifier of the connecting lines from the root node to the leaf nodes of the character frequency as pseudo codes of the component characters, and the number of pseudo code bits of the first character is less than or equal to the number of pseudo code bits of the second character; wherein the first character is the one with a relatively higher character frequency between the first character and the second character; the in-band module uses the component characters and their character frequencies as frequency tree data, and encodes the frequency tree data to form a first code; updates each component character in the data to be transmitted to a pseudo code to obtain a second code; combines the first code and the second code to obtain reconstructed data; the in-band module transmits the reconstructed data to enable the out-of-band module to parse based on the reconstructed data. Data to be transmitted; the out-of-band module of the server obtains a data image containing reconstructed data; wherein the reconstructed data originates from the in-band module of the server; the out-of-band module performs image recognition on the data image to obtain recognition data obtained by recognizing the reconstructed data; the out-of-band module parses the first code and the second code of the recognition data; the out-of-band module decodes the first code to obtain frequency tree data to obtain parsed component characters and their parsed character frequencies; the frequency tree is reconstructed with the parsed character frequencies as leaf nodes to obtain a reconstructed frequency tree; the out-of-band module assigns a first identifier or a second identifier to the connecting lines in the reconstructed frequency tree, and splices the first identifier and / or the second identifier of the connecting lines between the root node and the leaf nodes of the parsed character frequencies as parsed pseudo codes of the parsed component characters; wherein the assignment method of the first identifier or the second identifier matches the assignment method of the in-band module; the out-of-band module uses the parsed pseudo code to restore the parsed component characters in the second code to parse the transmission data that matches the data to be transmitted.

[0029] On the other hand, a server is provided, which includes: a server body, an in-band module and an out-of-band module; the in-band module is arranged in the server body, and is used to obtain data to be transmitted; the character frequency of each component character in the data to be transmitted is counted, and a frequency tree is constructed with the character frequency as a leaf node; the connecting lines in the frequency tree are respectively assigned a first identifier or a second identifier, and the first identifier and / or the second identifier of the connecting lines from the root node to the leaf node of the character frequency are spliced ​​as a pseudo code of the component character, and the number of pseudo code bits of the first character is less than or equal to the number of pseudo code bits of the second character; wherein the first character is the one with a relatively higher character frequency between the first character and the second character; the component characters and their character frequencies are used as frequency tree data, and the frequency tree data is encoded to form a first code; the component characters in the data to be transmitted are updated to a pseudo code to obtain a second code; the first code and the second code are combined to obtain reconstructed data; the reconstructed data is transmitted to enable the out-of-band module The data to be transmitted is parsed based on the reconstructed data; an out-of-band module is provided on the server body for obtaining a data image containing the reconstructed data; wherein the reconstructed data originates from the in-band module of the server; image recognition is performed on the data image to obtain recognition data obtained by recognizing the reconstructed data; a first code and a second code of the recognition data are parsed; the first code is decoded to obtain frequency tree data to obtain parsed constituent characters and their frequencies; the frequency tree is reconstructed with the frequencies of the parsed characters as leaf nodes to obtain a reconstructed frequency tree; the connecting lines in the reconstructed frequency tree are respectively assigned a first identifier or a second identifier, and the first identifier and / or the second identifier of the connecting lines between the root node and the leaf node of the parsed character frequency are spliced ​​as parsed pseudo codes of the parsed constituent characters; wherein the assignment method of the first identifier or the second identifier matches the assignment method of the in-band module; the parsed pseudo code is used to restore the parsed constituent characters in the second code to parse the transmission data that matches the data to be transmitted.

[0030] On the other hand, a computer program product is provided, comprising a computer program, which, when executed by a processor, implements the steps of the data transmission method in any of the above embodiments; or, implements the steps of the data acquisition method in any of the above embodiments; or, implements the data interaction method in any of the above embodiments.

[0031] On the other hand, a computer device is provided, comprising a memory, a processor, and a computer program stored in the memory and runnable on the processor. When the processor executes the computer program, the processor implements the steps of the data transmission method in any one of the above embodiments; or, implements the steps of the data acquisition method in any one of the above embodiments; or, implements the data interaction method in any one of the above embodiments.

[0032] On the other hand, a computer-readable storage medium is provided, on which a computer program is stored. When the computer program is executed by a processor, the steps of the data transmission method in any of the above embodiments are implemented; or, the steps of the data acquisition method in any of the above embodiments are implemented; or, the data interaction method in any of the above embodiments is implemented.

[0033] In the above-mentioned data transmission method, data acquisition method, data interaction method, server, computer program product, computer device and computer-readable storage medium, when the in-band module of the server interacts with the out-of-band module, the in-band module reconstructs the data to be transmitted to form reconstructed data for transmission, so as to adjust the intuitive expression content of the data to be transmitted, thereby facilitating the improvement of data security during the data interaction process. In the process of reconstructing the data to be transmitted, the in-band module makes the pseudo-encoding bit number of the first character less than or equal to the pseudo-encoding bit number of the second character, and the first character is the one with a relatively higher frequency of the two characters. In this way, the present application can assign a shorter pseudo-encoding to the component character with a relatively higher frequency, thereby compressing the string length of the reconstructed data, thereby compressing the file size of the interactive data, and improving data transmission efficiency. At the same time, in the process of constructing the pseudo-encoding, the in-band module uses the first identifier and the second identifier to assign values ​​to the connecting lines of the frequency tree, so that the pseudo-encoding includes the first identifier and the second identifier, thereby reducing the number of identifier categories to be identified by the out-of-band module when identifying the reconstructed data, thereby improving the accuracy of data identification. Furthermore, the present application plans the process of data interaction, thereby helping to improve the generalization performance of the data interaction method, and further helping to enrich the application scenarios of the data interaction method. BRIEF DESCRIPTION OF THE DRAWINGS

[0034] Figure 1 This is a flow chart of an embodiment of the data interaction method of the present application; Figure 2 This is a flow chart of another embodiment of the data interaction method of the present application; Figure 3 This is a flowchart of an embodiment of constructing a frequency tree in the present application; Figure 4 This is a structural diagram of an embodiment of a frequency tree of the present application; Figure 5 This is a structural diagram of an embodiment of the present application for reconstructing a frequency tree; Figure 6 This is a flow chart of an embodiment of the data transmission method of the present application; Figure 7 This is a flow chart of an embodiment of the data acquisition method of the present application; Figure 8 This is a schematic diagram of the structure of an embodiment of the server of this application; Figure 9 It is a structural diagram of an embodiment of the computer device of the present application. DETAILED DESCRIPTION

[0035] In order to make the purpose, technical solutions and advantages of this application more clear, the following further describes this application in detail with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain this application and are not intended to limit this application.

[0036] To address the technical issues in related technologies regarding the poor generalization and relatively low data exchange efficiency of methods for data exchange between in-band and out-of-band modules in servers, the present application provides a data transmission method, a data acquisition method, a data exchange method, a server, a computer program product, a computer device, and a computer-readable storage medium. The detailed working principle of the present application is described below with examples.

[0037] See also Figure 1 , Figure 1 It is a flow chart of an embodiment of the data interaction method of the present application.

[0038] S101: The in-band module of the server obtains data to be transmitted.

[0039] In this embodiment, the in-band module refers to a server module in the network environment where the service is located.

[0040] The data to be transmitted indicates the data currently to be transmitted.

[0041] The in-band module of the server acquires the data to be transmitted so as to perform pre-transmission processing on the data to be transmitted.

[0042] S102: The in-band module counts the frequency of each character in the data to be transmitted, and constructs a frequency tree with the character frequency as a leaf node.

[0043] In this embodiment, the component characters represent the characters present in the data to be transmitted, that is, the characters constituting the data to be transmitted can be considered as the component characters. As the name implies, the character frequency represents the frequency of occurrence of the component characters in the data to be transmitted, and the frequency can be frequency, number of times, etc., which is not limited here.

[0044] The in-band module can count the frequencies of the components of a character, thereby constructing a frequency tree based on the character frequencies. During the frequency tree construction process, the frequency of each component character can be used as a leaf node. The root node and branch nodes of the frequency tree can be connected to a maximum of two, three, or four child nodes / subtrees, and this is not limited here.

[0045] S103: The in-band module assigns a first identifier or a second identifier to the connecting lines in the frequency tree respectively, and splices the first identifier and / or the second identifier of the connecting lines from the root node to the leaf nodes of the character frequency as the pseudo-codes of the constituent characters, and the number of pseudo-code bits of the first character is less than or equal to the number of pseudo-code bits of the second character; wherein the first character is the one with a relatively higher character frequency between the first character and the second character.

[0046] In this embodiment, the connecting lines in the frequency tree can be assigned values, and the first identifier or the second identifier can be assigned to the connecting lines. In this way, when assigning the pseudo-code of the constituent characters, the first identifier and / or the second identifier of the connecting line between the root node and the leaf node of its character frequency can be spliced, and the identifier string obtained by splicing can be used as the pseudo-code of the constituent characters. Among them, the first identifier and / or the second identifier indicates that there may be a first identifier, or a second identifier, or a first identifier and a second identifier between the root node and the leaf node. Therefore, the connecting line identifiers therein are spliced, and the connecting line representation includes the first identifier and the second identifier.

[0047] It should be noted that in this embodiment, the number of pseudo-encoding bits for the first character is less than or equal to the number of pseudo-encoding bits for the second character. The first character is the one with a relatively higher frequency between the first and second characters. This design can assign a shorter pseudo-encoding to the component character with a relatively higher frequency, thereby compressing the string length of the reconstructed data and thus compressing the file size of the interactive data, thereby improving data transmission efficiency.

[0048] For example, the character frequency of A is 1 and the character frequency of B is 2, so for A and B, B represents the first character and A represents the second character; further, the character frequency of C is 3, so for B and C, C represents the first character and B represents the second character.

[0049] That is, each assigned connection line is assigned one of the first and second identifiers, thereby reducing the length of the resulting pseudo-code. Furthermore, by designing a reasonable number of identifier categories, the training and recognition burdens of the out-of-band module for image recognition can be reduced, improving data recognition accuracy and thus the accuracy of the identified data. This, in turn, reduces the tedious work of error correction and even manual verification, ensuring that the out-of-band module obtains accurate data and reducing the risk of serious server impacts due to data recognition anomalies.

[0050] S104: The in-band module uses the component characters and their character frequencies as frequency tree data, encodes the frequency tree data to form a first code; updates each component character in the data to be transmitted to a pseudo code to obtain a second code; and combines the first code and the second code to obtain reconstructed data.

[0051] In this embodiment, the data to be transmitted can be reconstructed by using the pseudo-code of each component character formed based on the frequency tree, that is, each component character in the data to be transmitted is updated to its pseudo-code as the second code. In addition, the component characters and their character frequencies can also be used as frequency tree data and encoded to form the first code. In this way, the out-of-band module can restore the frequency tree based on the frequency tree data to realize automatic parsing of the pseudo-code. Alternatively, the frequency tree data can also include the frequency tree body or the complete frequency tree with connecting line identifiers, which is not limited here.

[0052] At the same time, in this embodiment, the file size of the reconstructed data formed is smaller than the file size of the data to be transmitted. The details will be analyzed later and will not be repeated here. It can be seen that the in-band module can reconstruct the data to be transmitted to form reconstructed data. As the name implies, reconstruction means rebuilding, which means that the information obtained by directly reading the reconstructed data is different from the data to be transmitted. This can reduce the risk that others can directly obtain relevant information when maliciously obtaining the data to be transmitted, thereby helping to improve the security of the data to be transmitted, and further improving the security of the data interaction process. In addition, by reconstructing the data to be transmitted, the file size of the reconstructed data can be made smaller than the file size of the data to be transmitted, thereby achieving the file size of the compressed interaction data, so as to shorten the data transmission time of the data interaction when transmitting the reconstructed data, and further improve the efficiency of data interaction.

[0053] S105: The in-band module transmits the reconstructed data, so that the out-of-band module parses the data to be transmitted based on the reconstructed data.

[0054] In this embodiment, the in-band module may transmit the reconstructed data and send the reconstructed data to the out-of-band module, so that the out-of-band module receives the reconstructed data and generates data to be transmitted based on the reconstructed data.

[0055] S106: The out-of-band module of the server obtains a data image containing reconstructed data; wherein the reconstructed data originates from the in-band module of the server.

[0056] In this embodiment, the out-of-band module refers to a server module in a management network environment where a server management module such as a BMC is located.

[0057] The in-band module can reconstruct the data and output it to a standard output such as a display module. In this case, the out-of-band module can capture the data image containing the reconstructed data using a screenshot function such as provided by the BMC to obtain the data image.

[0058] S107: The out-of-band module performs image recognition on the data image to obtain recognition data obtained by recognizing the reconstructed data.

[0059] In this embodiment, in response to acquiring the data image, the out-of-band module may perform image recognition on the data image to identify the reconstructed data contained in the data image, and use data obtained by identifying the reconstructed data as recognition data.

[0060] In other words, the data specifically identified when identifying the reconstructed data contained in the data image is called identification data. The data transmitted by the in-band module is called reconstructed data, and the data received by the out-of-band module is called identification data. Ideally, the directly identified identification data should be consistent with the reconstructed data. Therefore, the out-of-band module can perform deconstruction processing on the identification data to restore the data to be transmitted by the in-band module, and use the restored data as the transmission data received by the out-of-band module. The deconstruction processing of the out-of-band module can be considered to be the inverse of the reconstruction processing of the in-band module.

[0061] S108: The out-of-band module parses the first code and the second code of the identification data.

[0062] In this embodiment, the first and second codes can be identified. For example, the first and second codes can be separated by a separator, or the first and second codes can be relatively independent data strings, which is not limited here. In this way, the out-of-band module can extract the corresponding information to restore the data to be transmitted.

[0063] S109: The out-of-band module decodes the first code to obtain frequency tree data to obtain parsed component characters and their frequencies; and reconstructs the frequency tree with the frequencies of the parsed characters as leaf nodes to obtain a reconstructed frequency tree.

[0064] In this embodiment, as described above, the in-band module uses the component characters and their character frequencies as frequency tree data and encodes the frequency tree data to obtain a first code. Therefore, the first code can be decoded to restore the frequency tree data, thereby obtaining the component characters and character frequencies transmitted by the in-band module. In this embodiment, the component characters parsed by the out-of-band module are used as the parsed component characters, and the character frequencies parsed by the out-of-band module are used as the parsed character frequencies. In this way, the out-of-band module can use the parsed component characters and parsed character frequencies to reconstruct the frequency tree, obtaining a reconstructed frequency tree on the out-of-band module side.

[0065] S110: The out-of-band module assigns the first identifier or the second identifier to the connecting lines in the reconstructed frequency tree, and splices the first identifier and / or the second identifier of the connecting lines from the root node to the leaf nodes of the parsed character frequency as the parsed pseudo-code of the parsed constituent characters; wherein the assignment method of the first identifier or the second identifier matches the assignment method of the in-band module.

[0066] In this embodiment, the out-of-band module can restore the pseudo-code of each parsed component character by a process that matches the pseudo-code creation process of the in-band module. That is, the out-of-band module can assign a first identifier and a second identifier to the reconstructed frequency tree it constructs. That is, the out-of-band module can assign a first identifier or a second identifier to the connecting lines in the reconstructed frequency tree, thereby splicing the first identifier and / or the second identifier of the connecting lines from the root node to the leaf node of the parsed character frequency as the parsed pseudo-code of the parsed component character. Moreover, the way of assigning the first identifier or the second identifier matches the way of assigning the in-band module. It should be noted that the way of assigning the first identifier or the second identifier can be relative to each connecting line.

[0067] S111: The out-of-band module uses the parsed pseudo-code to restore the parsed constituent characters in the second code to parse the transmission data that matches the data to be transmitted.

[0068] In this embodiment, in response to restoring the pseudo-code of each parsed component character by reconstructing the frequency tree to obtain the parsed pseudo-code, the parsed pseudo-code can be used to restore the second code to obtain transmission data that matches the data to be transmitted, thereby realizing automatic parsing of the data to be transmitted of the in-band module by the out-of-band module.

[0069] That is to say, when the in-band module of the server interacts with the out-of-band module, the in-band module reconstructs the data to be transmitted to form reconstructed data for transmission, so as to adjust the intuitive expression content of the data to be transmitted, thereby improving the data security during the data interaction process. In the process of reconstructing the data to be transmitted, the in-band module makes the pseudo-encoding bit number of the first character less than or equal to the pseudo-encoding bit number of the second character, and the first character is the one with a relatively higher character frequency. In this way, the present application can give the component characters with a relatively higher character frequency a shorter pseudo-encoding to achieve compression of the string length of the reconstructed data, thereby compressing the file size of the interactive data and improving data transmission efficiency. At the same time, in the process of constructing the pseudo-encoding, the in-band module uses the first identifier and the second identifier to assign values ​​to the connecting lines of the frequency tree, so that the pseudo-encoding includes the first identifier and the second identifier, thereby reducing the identifier categories that the out-of-band module needs to identify when identifying the reconstructed data, so as to improve the accuracy of data identification. In addition, the present application plans the process of data interaction, which is conducive to improving the generalization performance of the data interaction method and thus enriching the application scenarios of the data interaction method.

[0070] See also Figure 2 , Figure 2 It is a flow chart of another embodiment of the data interaction method of the present application.

[0071] S201: The in-band module obtains data to be transmitted.

[0072] In this embodiment, the in-band module may obtain the data to be transmitted to the out-of-band module.

[0073] S202: The in-band module replaces the characters to be transcoded in the data to be transmitted with their replacement characters.

[0074] In this embodiment, the characters to be transcoded in the constituent characters of the data to be transmitted can be identified, wherein the characters to be transcoded can be predefined.

[0075] A replacement character associated with the character to be transcoded can be obtained. The replacement character is easier to encode than the character to be transcoded. Accordingly, the association between the replacement character and the character to be transcoded can also be predefined. Therefore, the character to be transcoded in the data to be transmitted can be replaced with its replacement character to update the data to be transmitted.

[0076] As such, in this embodiment, the possible types of constituent characters in the data to be transmitted can be considered, and characters that are difficult to encode can be pre-associated with several easy-to-encode replacement characters to transcode the data to be transmitted, thereby improving the encoding efficiency during the data reconstruction process. In particular, considering that in encoding standards such as ASCII, there may be some characters to be transmitted that have no corresponding encoding, it is possible to pre-plan encoding replacement characters for them, thereby improving the encoding smoothness. Moreover, compared to the method of encoding the data to be transmitted using multiple encoding standards simultaneously, using fewer encoding standards by replacing characters can reduce the encoding complexity, thereby shortening the encoding and decoding time, and further improving the efficiency of data interaction.

[0077] Among them, ASCII is an encoding standard for a computer encoding system based on the Latin alphabet.

[0078] For example, in ASCII encoding, "￥" doesn't have a direct ASCII equivalent. Therefore, the replacement character associated with "￥" can be pre-set to "\\y." This allows for three characters that can be encoded in ASCII to be used as a replacement. When "￥" is included in the data to be transmitted, it is replaced with "\\y." Furthermore, to further improve the consistency of the replacement characters, the replacement characters can be assigned the same replacement identifier, such as "\\," though this is not a limitation.

[0079] S203: The in-band module counts the frequency of each component character in the data to be transmitted.

[0080] In this embodiment, the constituent characters represent the characters included in the data to be transmitted.

[0081] The number of occurrences of each component character in the data to be transmitted can be counted to obtain the character frequency of each component character, so that the data to be transmitted can be reconstructed in combination with the character frequency of each component character. The character frequency can include at least one of the number of occurrences of the character and the frequency of occurrence of the character.

[0082] For example, the data to be transmitted may be: BBADDDDCCC. A character counter may be used to count the number of occurrences of each component character. For example, the character frequency may be obtained by counting the occurrence order of the characters. The statistical result may be as follows: The data to be transmitted is shown in Table 1 as an example: Table 1 Character table of data to be transmitted

[0083] The statistical results can be presented as shown in Table 2: Table 2 Character frequency statistics

[0084] The second row of Table 2 contains the constituent characters that appear in the data to be transmitted, and the first row contains the character frequencies corresponding to the constituent characters in the second row.

[0085] S204: The in-band module constructs a frequency tree for the data to be transmitted.

[0086] In this embodiment, the in-band module may construct a frequency tree of the data to be transmitted using the character frequencies of the constituent characters as leaf nodes.

[0087] That is to say, in this embodiment, pseudo-codes can be assigned to constituent characters based on the frequency tree, further improving the complexity of the pseudo-codes. It can also be beneficial to restore the pseudo-codes to constituent characters based on the frequency tree, achieving reversibility between the pseudo-codes and constituent characters, and helping to reduce manual participation in the process of assigning pseudo-codes and restoring constituent characters, which can improve the automation of data interaction.

[0088] Specifically, the character frequencies can be sorted to form a frequency list. For example, the statistical results such as Table 2 can be re-sorted by a sorting device to extract a frequency list. The character frequency statistics table obtained by updating the character frequency statistics table can be shown in the following table: Table 3 Character frequency statistics

[0089] Please also refer to Figures 2 to 4 , Figure 3 This is a flow chart of an embodiment of constructing a frequency tree in this application. Figure 4It is a structural diagram of an embodiment of the frequency tree of the present application.

[0090] The character frequencies in the frequency list can be stacked in a preset order until the frequency list is traversed and the target frequency is obtained. Combining the stacking process, a frequency tree is constructed with the target frequency as the root node and the character frequencies as the leaf nodes.

[0091] The frequency result obtained by each superposition can be added to the frequency list as the frequency to be superimposed, so as to update the frequency list.

[0092] For example, the frequency data of the frequency result obtained by superimposing in the frequency list can be deleted; wherein the frequency data includes the character frequency and the frequency to be superimposed. The frequency result is compared with the frequency data and inserted into a position that complies with the frequency data sorting rules. In this embodiment, the design can balance the left subtree and the right subtree of the frequency tree, and can improve the rationality of the distribution of branch nodes formed in the superposition process and the leaf nodes that constitute the characters. In this embodiment, the hierarchy of the frequency tree can also be reduced, thereby shortening the length of the pseudo-code to reduce the file size of the reconstructed data.

[0093] The following Figure 3 To briefly describe the process, you can create an empty node in advance, assign the component character A with the smallest frequency to the left side of the empty node, assign the component character B with the second smallest frequency to the right side of the empty node, and set the value of the empty node to the sum of the component characters A and B. You can delete the character frequencies of the component characters A and B from the frequency list, and add the sum value to the frequency list, which is shown in the table as " ", it should be noted that, " " is used to distinguish the frequencies of the characters that make up character C, and is not intended to give any other numerical meaning.

[0094] Then you can create a new empty node, take the node with the sum value of 3 generated in the previous step as its left node, take the frequency of the characters that make up the character C as its right node, take the sum of the two as the value of the new node, add the sum to the frequency list, and delete "3" and " ”. And so on, the frequency tree of the data to be transmitted can be obtained.

[0095] S205: The in-band module assigns pseudo codes to each component character.

[0096] In this embodiment, the code length of the pseudo code constituting the character may be smaller than the code length of its real code.

[0097] As described in the previous step, a frequency tree is constructed based on the frequencies of the constituent characters. Connecting lines within the frequency tree can be assigned a first identifier or a second identifier, and the first identifier and / or second identifier of the connecting lines from the root node to the leaf nodes of the character frequency tree can be combined to form a pseudo-code for the constituent characters. The first identifier and the second identifier can be a code value, a letter, a symbol, or the like.

[0098] Optionally, in this embodiment, the first identifier may include a first code value, and the second identifier may include a second code value. The first code value and the second code value may be a single-digit code value, a two-digit code value, etc., which are not limited here.

[0099] The first code value can be assigned to the connection line between the root node and the branch node and its left subtree, and the second code value can be assigned to the connection line between the root node and the branch node and its right subtree. In layman's terms, the first side connection line between the branch node and the root node in the frequency tree can be assigned to the first code value, and the second side connection line can be assigned to the second code value. The first code value and / or second code value of the connection line between the root node and the leaf node of the character frequency are spliced ​​as a pseudo code.

[0100] Furthermore, the frequency tree can be a binary tree structure, that is, the branch node and the root node can be connected to two subtrees, that is, they can be connected to the left subtree, or they can be connected to the right subtree, or they can be connected to the left subtree and the right subtree. Therefore, one of the first code value and the second code value can be 0, and the other can be 1. When the out-of-band module recognizes the reconstructed data in the data image, it can recognize 0 and 1, which can significantly improve the accuracy of image recognition.

[0101] For example, the first code value may be 1, and the second code value may be 0. Figure 4 As shown in the example, taking the frequency tree as a binary tree, the connecting line between the branch node and the left side of the root node can be assigned the second code value, that is, the value 0; the connecting line between the branch node and the right side of the root node can be assigned the first code value, that is, the value 1. The code value of the connecting line from the root node to the leaf node that constitutes the character is used as its pseudo code. The pseudo code can be shown as an example in the following table: Table 4 Pseudo-coding table of constituent characters

[0102] In an alternative embodiment, the pseudo code may be manually assigned or randomly generated, which is not limited here.

[0103] S206: The in-band module fits the character frequencies and pseudo codes to form reconstructed data.

[0104] In this embodiment, the character frequencies may be encoded to obtain frequency codes.

[0105] Optionally, the character frequency can be subtracted by one to update the character frequency. The updated character frequency is then used for encoding to obtain a frequency code. In this way, when the maximum character frequency is a power of 2, such as 2, 4, 8, 16, 32, 64, or 128, the frequency code of the character frequency can be reduced by one bit, thereby further reducing the file size of the reconstructed data.

[0106] In this embodiment, the constituent characters can also be encoded to obtain the true half of the constituent characters. The true code of the constituent characters and the frequency code can be combined to form a first code. The true code of the constituent characters and the frequency code of their character frequencies are adjacent, and the frequency code of the constituent characters is located on the target side of the true code. This can significantly improve the efficiency of matching the character frequencies with the constituent characters when decoding is performed in an out-of-band module.

[0107] The second code is formed using the pseudocode, with reference to the order of the constituent characters in the data to be transmitted. In other words, the pseudocodes of the constituent characters can be sequentially added to the second code until all the constituent characters in the data to be transmitted are traversed. The order of the pseudocodes in the second code matches the order of the constituent characters to which they belong in the data to be transmitted.

[0108] In this way, the first code and the second code are combined to obtain reconstructed data.

[0109] For example, the data to be transmitted is "BBADDDDCCC". Before data reconstruction, its decimal code is: [66,66,65,68,68,68,68,67,67,67] When it is further converted to binary encoding, the encoding is: [01000010 01000010 01000001 01000100 01000100 0100010001000011 01000011 01000011] It can be seen that when the data to be transmitted "BBADDDDCCC" is directly encoded, an 80-bit code is obtained. According to the method of assigning pseudo codes to the constituent characters in this embodiment, the pseudo code sequence of the data to be transmitted is as follows: [101 101 100 0 0 0 0 11 11 11] That can form a total The second encoding of the bits.

[0110] The first encoding can be as follows: 0100000100 0100001001 0100001110 0100010011; Among them, the first eight bits 01000001, 01000010, 01000011 and 01000100 represent A, B, C, and D respectively; the last two bits 00, 01, 10, and 11 represent the binary codes of the values ​​after the character frequencies 1, 2, 3, and 4 are reduced by one.

[0111] Furthermore, the code of the spacing character can be obtained as the spacing code. In this way, the components of the reconstructed data can be isolated by the preset spacing character and spacing code, which is beneficial for the out-of-band module to distinguish the first code from the second code by identifying the spacing code after receiving the reconstructed data, further improving the efficiency of parsing the transmitted data.

[0112] The interval code can be placed between the first code and the second code, and the first code, the interval code and the second code can be spliced ​​together.

[0113] For example, you can use " " is used as a space character, and its encoding is: 0101010. Therefore, the reconstructed data can be expressed as: 0100000100 0100001001 0100001110 0100010011 0101010 101 101 100 0 0 0 0 11 1111; Among them, "101 101 100 0 0 0 0 11 11 11" is the second code. As can be seen, the length of the reconstructed data is 66 bits, which effectively shortens the data encoding length, making the file size of the reconstructed data smaller than the file size of the data to be transmitted, thus achieving file size compression of the interactive data.

[0114] S207: The in-band module evaluates the checksum that matches the reconstructed data.

[0115] In this embodiment, the check code is used to check the reconstructed data.

[0116] Specifically, the code quantity of the character code in the reconstructed data may be obtained, and the number and insertion position of the check codes matching the code quantity may be evaluated.

[0117] For each checksum code: Starting with the check code itself, a first number of character codes are selected as evaluation codes each time, and a second number of character codes are skipped until the character codes starting from the check code are traversed. The number of first code values ​​in the evaluation code is counted, and based on the number of first code values, the first code value or the second code value is assigned to the check code; wherein the first number and the second number vary with different check codes.

[0118] In this way, in this embodiment, redundant check bits can be added so that when recognition anomalies such as recognition errors occur during the image recognition process, the receiving end such as the out-of-band module can perform error correction according to the corresponding redundant algorithm, which is beneficial to improving the data fault tolerance of the data interaction process, and is beneficial to automatic error correction when data acquisition anomalies occur, thereby improving the reliability of the data interaction process, and thus helping to improve the reliability of the transmission data obtained by analysis.

[0119] For example, the number of checksums can be calculated using the following formula: N+c<=2 c -1 Formula 1-1 Wherein, N represents the number of bits of the reconstructed data, and in this embodiment, N=66; c represents the number of check codes to be calculated, and c is a positive integer. According to calculation, c=7 in this embodiment.

[0120] The position of the check code can be determined using a check rule such as a parity check specification. For example, the check code can be located at a position that is a power of 2 (n=0, 1, 2, 3, ...). Therefore, in this embodiment, the check code positions are 1, 2, 4, 8, 16, 32, and 64, respectively.

[0121] Therefore, the reconstructed data after adding the checksum code update is expressed as: P1P20P3100P40001000P5100001001010000P61110010001001101010101011011000P7000111111; Among them, P1, P2, P3, P4, P5, P6, and P7 represent the check codes to be inserted.

[0122] Taking even parity as an example, in layman's terms, the calculation rule for each bit of parity code can be: starting from the current bit parity code number, check 2 i-1 bit, then skip 2 i-1 bit, then check 2 i-1 Then skip 2 i-1 The calculation process of P1 to P7 is exemplified below using the code value of the specific reconstructed data: P1:[0,0,1,0,0,0,0,0,1,0,0,0,1,1,0,0,1,1,0,0,0,0,1,0,0,0,0,0,1,1,0,0,0,0,1,1,1]=>sum:12; P2:[0,0,0,0,0,0,0,0,0,0,1,0,0,1,0,0,1,1,1,0,1,0,1,0,1,0,1,0,0,1,0,0,0,0,1,1]=>sum:12; P3:[0,1,0,0,1,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,1,1,0,1,0,1,0,1,0,0,0,1,1,1,1]=>sum:13; P4:[0,0,0,0,1,0,0,0,0,1,0,1,0,0,0,0,0,0,1,0,0,1,1,0,1,1,0,1,1,0,0,0,1,1]=>sum:12; P5:[0,1,0,0,0,0,1,0,0,1,0,1,0,0,0,0,1,0,1,0,1,0,1,0,1,1,0,1,1,0,0,0]=>sum:12; P6:[0,1,1,1,0,0,1,0,0,0,1,0,0,1,1,0,1,0,1,0,1,0,1,0,1,1,0,1,1,0,0,0]=>sum:15; P7:[0,0,0,0,1,1,1,1,1,1]=>sum:6.

[0123] Wherein, sum: represents the number of the first code value (i.e. 1) in the statistical evaluation code; the first code in the brackets is the check code itself. In this embodiment, 0 is preferentially used in the evaluation process so that when the number of the first code value in the evaluation code is an even number, the code assignment of the check code does not need to be adjusted. Considering the sum+p in the even check code (i.e. equivalent to p i The result of summing the evaluation codes must be an even number, so P1=0; P2=0; P3=1; P4=0; P5=0; P6=1; P7=0.

[0124] The final updated reconstructed data is: 0001100000010000100101000011110010001001101010101010110110000000111111.

[0125] In an alternative embodiment, the number of codes and the insertion position may also be verified as empirical values, etc., which are not limited here.

[0126] S208: The in-band module inserts the check code into the reconstructed data to update the reconstructed data.

[0127] S209: The in-band module transmits the reconstruction data.

[0128] In this embodiment, the in-band module may transmit the reconstructed data so that the out-of-band module can obtain the reconstructed data.

[0129] Optionally, the in-band module can also form a character identifier for each component character. The character identifier is assigned to the pseudo-code of the component character as one of the frequency tree data. Frequency tree data is transmitted and reconstructed data is reconstructed. That is to say, when the component characters are assigned pseudo-codes through a new character encoding, if a receiver such as an out-of-band module needs to restore the component characters, the frequency tree can also be passed to the receiver, and the component characters, character frequencies, etc. contained in the frequency tree can be transmitted to the receiver, so that after the receiver obtains the characters and frequencies, it can obtain a new character encoding according to the specifications generated by the frequency tree, as shown in the following table, so that according to the encoding, the received compressed encoding can be restored to obtain the original component characters, which are used as the parsed component characters in this embodiment.

[0130] Table 5 Pseudo-coding table of parsed characters

[0131] In other words, in this embodiment, the key elements of the frequency tree can be transmitted to an out-of-band module—that is, the component characters and their frequencies are sent to the out-of-band module, which then recovers the pseudo-code. Compared to directly transmitting the frequency tree, this embodiment can further reduce the amount of data exchanged. Furthermore, the frequency tree data and the reconstructed data can be transmitted separately to further reduce the risk of simultaneous acquisition of the two, thereby improving the security of data exchange. Furthermore, if the recipient does not require decoding, the frequency tree does not need to be transmitted, further improving the rationality of the data exchange process.

[0132] In an alternative embodiment, the first code within the reconstructed data may be used as frequency tree data, i.e., the frequency tree data may be included in the reconstructed data. A detailed agreement may be made regarding the process of constructing the frequency tree, i.e., a set of agreed rules may be formulated. For example, when the superimposed frequency result matches the frequency of the original constituent characters, the superimposed frequency result may be placed on the first or second side of a branch node or root node of the frequency tree. This allows reliable restoration by a receiving end such as an out-of-band module according to the agreed rules.

[0133] As can be seen, the data reconstruction performed by the in-band module in this embodiment can be divided into a data processing device, a data compression device, and a data fault-tolerant encoding device. The data processing device can be considered to include a character counter and a sorting device, and further includes a transcoder. As the name suggests, the character counter is used to count the frequency of the components of the data to be transmitted; the sorting device is used to sort the components based on the frequency, such as to obtain a frequency list; and the transcoder is used to convert the characters to be transcoded into their replacement characters.

[0134] The data compression device can be considered to include two parts: a frequency tree builder and a character recoder. As the name implies, the frequency tree builder can create a frequency tree, and the character recoder can reconstruct the data to be transmitted based on the pseudo-code to obtain reconstructed data.

[0135] The data fault-tolerant device can add redundant bits to the reconstructed data to improve the data fault-tolerant performance, and can also perform error correction when data recognition is abnormal.

[0136] S210: The out-of-band module obtains a data image containing reconstructed data.

[0137] In this embodiment, the server's standard output screenshot can be obtained through the server's out-of-band technology. The functional server provides a unified interface to the outside world. The image acquisition part can obtain the server's screenshot image by calling the server's interface to obtain a data image containing reconstructed data.

[0138] S211: The out-of-band module performs image recognition on the data image to obtain recognition data.

[0139] In this embodiment, the out-of-band module may perform image recognition on the data image to obtain recognition data obtained by recognizing the reconstructed data.

[0140] Optionally, data recognition can be performed on the data image using pre-trained algorithms, open source image recognition algorithms or tools, etc.

[0141] S212: The out-of-band module evaluates whether there is any recognition anomaly in the recognition data.

[0142] In this embodiment, when it is determined that the recognition data has a recognition anomaly, step S213 is executed. When it is determined that the recognition data has no recognition anomaly, step S214 is executed.

[0143] Specifically, a check code within the identification data can be located as a verification code, and the verification code can be used to evaluate whether the identification data has any recognition anomalies.

[0144] For example, for each verification code: Starting with the verification code, the first number of character codes can be selected as the codes to be evaluated, and the second number of character codes can be skipped until the character codes starting from the verification code are traversed. The number of first code values ​​in the evaluation code is counted, and the theoretical value of the verification code is determined based on the number of first code values. The theoretical value of the verification code is compared with the actual value.

[0145] For example, the reconstructed data as described above is: 0001100000010000100101000011110010001001101010101010110110000000111111.

[0146] The identification data is: 0001100000010000100101000011110010001001101010101010110110000000111110.

[0147] Table 6 Theoretical and actual values ​​of verification codes

[0148] S213: The out-of-band module locates and identifies the abnormal code and corrects it to update the identification data.

[0149] In this embodiment, in response to the presence of an identification anomaly, the code of the identification anomaly is located and corrected to update the identification data.

[0150] Specifically, as shown in Table 6, the third code value can be assigned to a verification code where the theoretical value matches the actual value, serving as the positioning code. The fourth code value can be assigned to a verification code where the theoretical value does not match the actual value, serving as the positioning code. The third code value is 0, and the fourth code value is 1. Alternatively, the final value obtained by superimposing the actual value and the theoretical value can be used as the third or fourth code value, or the third or fourth code value can be assigned through comparison, without limitation.

[0151] The positioning codes of each verification code are sorted according to the position of the verification code within the identification data to form a positioning code sequence. This positioning code sequence can be decoded to obtain the target position. The code value of the target position within the identification data is determined to be the code for identifying the abnormality, thereby locating the code for identifying the abnormality.

[0152] That is Figure 5 As shown in the example, the positioning code sequence is 1001001, which is converted to 73 in decimal, so it can be determined that the 73rd bit is wrong. That is, the last bit in the example of this embodiment, correcting the last bit can obtain the correct result: 0001100000010000100101000011110010001001101010101010110110000000111111.

[0153] S214: The out-of-band module deletes the verification code in the identification data.

[0154] In this embodiment, in response to identifying and correcting an anomaly, or in response to an unidentified anomaly, the verification code in the identification data may be deleted to update the identification data, thereby restoring the data to be transmitted in the in-band module using the updated identification data.

[0155] For example, after deleting the verification code in the identification data, new identification data can be obtained: 01000001000100001001 0100001110 0100010011 0101010 101 101 100 0 0 0 0 11 11 11.

[0156] S215: The out-of-band module parses the first code and the second code of the identification data.

[0157] In this embodiment, as described above, the reconstructed data may include a space code. Therefore, the out-of-band module can identify the space code in the identification data and use the space code as a parsed space character. The code on one side of the parsed space character is used as the first code, and the code on the other side is used as the second code.

[0158] Specifically, the “ " is identified by extracting the front part "01000001000100001001 0100001110 0100010011" as the first code, and extracting the rear part "101 101 100 0 0 011 11 11" as the second code.

[0159] S216: The out-of-band module restores and analyzes the component characters and their frequencies.

[0160] In this embodiment, the real code and the frequency code in the first code can be decomposed, the parsed component characters corresponding to the real code are matched, and the character frequency corresponding to the frequency code is restored.

[0161] Specifically, the character corresponding to the real code within the first code can be matched as the parsed component character. The parsed character frequency corresponding to the frequency code is restored. According to the order of the real code and the frequency code within the first code, the parsed character frequency adjacent to the real code of the parsed component character and located on the target side of the real code is used as the parsed character frequency of the parsed component character.

[0162] Optionally, the frequency code may be decoded; the decoded frequency may be incremented by one to obtain the character frequency, so as to restore the character frequency corresponding to the frequency code.

[0163] For example, the first code can be restored to obtain the following table: Table 7 The true code and its character frequency obtained by restoring the first code

[0164] S217: The out-of-band module reconstructs the frequency tree to obtain a reconstructed frequency tree.

[0165] In this embodiment, the frequency tree may be reconstructed by using the parsed constituent characters and their character frequencies to obtain a reconstructed frequency tree; wherein the character frequencies of the parsed constituent characters serve as leaf nodes of the reconstructed frequency tree.

[0166] The process of reconstructing the frequency tree can replicate the process of the in-band module constructing the frequency tree. For example, the construction processes of the two are the same, so as to obtain Figure 5 The reconstructed frequency tree shown in the example, Figure 5 It is a structural diagram of an embodiment of the frequency tree reconstruction of the present application.

[0167] In detail, as described above, when reconstructing the frequency tree to obtain the reconstructed frequency tree, the frequency tree can be reconstructed with the parsed character frequencies as leaf nodes to obtain the reconstructed frequency tree; the connecting lines in the reconstructed frequency tree are respectively assigned the first identifier or the second identifier.

[0168] Furthermore, the first identifier may include a first coding value, and the second identifier may include a second coding value. When assigning identifiers to connecting lines, the first coding value may be assigned to the connecting line between the root node and the branch node and its left subtree; and the second coding value may be assigned to the connecting line between the root node and the branch node and its right subtree.

[0169] One of the first coding value and the second coding value may be 0, and the other may be 1.

[0170] S218: The out-of-band module obtains the parsed pseudo-code of the parsed constituent characters.

[0171] In this embodiment, the code values ​​of the connection lines between the root node and the leaf nodes in the reconstructed frequency tree can be spliced ​​together to serve as pseudo codes for parsing the constituent characters.

[0172] The pseudo codes in the second code are divided by combining the character frequencies of the parsed constituent characters and the pseudo codes to obtain the parsed pseudo codes.

[0173] In this way, the recognition data can be de-fitted to obtain the parsed character frequencies and parsed pseudo codes of the parsed constituent characters.

[0174] For example, based on Figure 7 The reconstructed frequency tree shown in the example can be obtained as the following analytical pseudo-code: Table 8 Parsed character components and their parsed pseudo-codes

[0175] S219: The out-of-band module restores the data to be transmitted to form transmission data.

[0176] In this embodiment, the data to be transmitted can be restored by analyzing the character frequency and the component characters to form the transmission data, so as to perform inverse reconstruction processing on the recognition data and obtain the transmission data through analysis.

[0177] For example, the compressed data (101 101 100 0 0 0 11 11 11) as the second code can be restored by parsing the pseudo-code, parsing the constituent characters, parsing the character frequency, etc., and obtaining the data to be transmitted BBADDDDCCC that the in-band module wants to transmit, which is used as the transmission data.

[0178] Optionally, the out-of-band module may further identify whether the transmitted data includes replacement characters.

[0179] In response to the absence of the replacement character, there may be no need to perform replacement character conversion on the transmission data.

[0180] In response to the presence of a replacement character in the transmitted data, the replacement character is replaced with a matching associated character to update the transmitted data. Specifically, the replacement character can be replaced with a matching associated character (i.e., the character to be transcoded in the in-band module described above) to update the transmitted data, thereby ensuring the accuracy of the transmitted data.

[0181] It can be seen that the deconstruction of the out-of-band module can be considered to include five parts when decoding and restoring the transmitted data, namely image acquisition, image recognition, data error correction, frequency tree reconstruction and data restoration (i.e. decompression).

[0182] In summary, the present application can achieve compression of data transmission within and outside the server band, thereby transmitting richer information through less space. Moreover, through the information fault-tolerant mechanism, the out-of-band module can automatically identify and correct image recognition errors to ensure the accuracy of data transmission. In this way, the present application can reduce the risk of unpredictable consequences of the program due to individual character recognition errors in the scenario of transmitting a large number of characters. In other words, even if individual character errors are identified in the present application, they can be discovered and automatically corrected in time to ensure the accuracy of data transmission. At the same time, combined with data compression and data fault-tolerant means, a new encoding specification for the data transmission process is defined. After the data to be transmitted is encoded by this encoding specification, it can be printed to a standard output (such as a display, etc.). The printed data image can be identified by image recognition outside the server band to obtain identification data, so as to achieve the purpose of high-density and high-reliability data transmission.

[0183] See also Figure 6 , Figure 6 It is a flowchart of an embodiment of the data transmission method of the present application.

[0184] S301: The in-band module of the server obtains data to be transmitted.

[0185] S302: Count the character frequencies of the various characters in the data to be transmitted, and construct a frequency tree with the character frequencies as leaf nodes.

[0186] S303: Assign a first identifier or a second identifier to each connecting line in the frequency tree, and splice the first identifier and / or the second identifier of the connecting line from the root node to the leaf node of the character frequency as the pseudo-code of the constituent characters, and the number of pseudo-code bits of the first character is less than or equal to the number of pseudo-code bits of the second character; wherein the first character is the one with a relatively higher character frequency between the first character and the second character.

[0187] S304: Using the component characters and their character frequencies as frequency tree data, encoding the frequency tree data to form a first code; updating each component character in the data to be transmitted to a pseudo code to obtain a second code; combining the first code and the second code to obtain reconstructed data.

[0188] S305: Transmit the reconstructed data, so that the out-of-band module parses the data to be transmitted based on the reconstructed data.

[0189] As can be seen from this, when the in-band module interacts with the out-of-band module, it reconstructs the data to be transmitted into reconstructed data for transmission, thereby modifying the intuitive representation of the data to be transmitted. This can help improve data security during the data interaction process. Furthermore, by compressing the file size of the interaction data, data transmission efficiency can be improved. Furthermore, this can also help improve the generalization performance of the data interaction method, thereby enriching its application scenarios.

[0190] See also Figure 7 , Figure 7 It is a flow chart of an embodiment of the data acquisition method of the present application.

[0191] S401: The out-of-band module of the server obtains a data image containing reconstructed data; wherein the reconstructed data originates from the in-band module of the server.

[0192] S402: Perform image recognition on the data image to obtain recognition data obtained by recognizing the reconstructed data.

[0193] S403: Analyze the first code and the second code of the identification data.

[0194] S404: Decode the first code to obtain frequency tree data to obtain parsed component characters and their frequencies; reconstruct the frequency tree with the frequencies of the parsed characters as leaf nodes to obtain a reconstructed frequency tree.

[0195] S405: Assign a first identifier or a second identifier to the connecting lines in the reconstructed frequency tree respectively, and splice the first identifier and / or second identifier of the connecting lines from the root node to the leaf nodes of the parsed character frequency as the parsed pseudo-code of the parsed constituent characters; wherein the assignment method of the first identifier or the second identifier matches the assignment method of the in-band module.

[0196] S406: Restore the parsed constituent characters in the second code using the parsed pseudo code to parse the transmission data that matches the data to be transmitted.

[0197] It should be understood that although Figure 1-Figure 3 、 Figure 6 as well as Figure 7 The steps in the flowchart are shown in sequence as indicated by the arrows, but these steps are not necessarily executed in the order indicated by the arrows. Unless otherwise specified in this document, there is no strict order restriction for the execution of these steps, and these steps can be executed in other orders. In addition, Figure 1-Figure 3 、 Figure 6 as well as Figure 7At least part of the steps may include multiple sub-steps or multiple stages. These sub-steps or stages are not necessarily executed at the same time, but can be executed at different times. The execution order of these sub-steps or stages is not necessarily sequential, but can be executed in turn or alternately with other steps or at least part of the sub-steps or stages of other steps.

[0198] See also Figure 8 , Figure 8 It is a structural diagram of an embodiment of the server of this application.

[0199] In one embodiment, the server includes a server body 11 , an in-band module 12 , and an out-of-band module 13 .

[0200] The in-band module 12 is provided in the server body 11 and is used to obtain the data to be transmitted; reconstruct the data to be transmitted to form reconstructed data so that the file size of the reconstructed data is smaller than the file size of the data to be transmitted; and transmit the reconstructed data so that the out-of-band module 13 parses the data to be transmitted based on the reconstructed data.

[0201] The out-of-band module 13 is provided on the server body 11 and is used to obtain a data image containing reconstructed data; wherein the reconstructed data originates from the in-band module 12 of the server; image recognition is performed on the data image to obtain identification data obtained by identifying the reconstructed data; and deconstruction processing is performed on the identification data to parse the transmission data.

[0202] For the specific definitions of in-band modules and out-of-band modules, please refer to the definitions of data interaction methods, data transmission methods, and data acquisition methods above, and will not be repeated here. Each module in the above-mentioned server can be implemented in whole or in part through software, hardware, or a combination thereof. Each of the above-mentioned modules can be embedded in or independent of the processor in the computer device in hardware form, or can be stored in the memory of the computer device in software form, so that the processor can call and execute the operations corresponding to each of the above modules.

[0203] In one embodiment, a computer program product is provided, including a computer program. When the computer program is executed by a processor, the steps of the data interaction method, data transmission method, and data acquisition method described above are implemented, which will not be described in detail here.

[0204] That is to say, when the computer program is executed by the processor, the following steps can be implemented: the in-band module of the server obtains the data to be transmitted; the character frequency of each component character in the data to be transmitted is counted, and a frequency tree is constructed with the character frequency as the leaf node; the connecting lines in the frequency tree are respectively assigned a first identifier or a second identifier, and the first identifier and / or the second identifier of the connecting line from the root node to the leaf node of the character frequency are spliced ​​as the pseudo-code of the component character, and the number of pseudo-code bits of the first character is less than or equal to the number of pseudo-code bits of the second character; wherein the first character is the one with a relatively higher character frequency between the first character and the second character; the component characters and their character frequencies are used as frequency tree data, and the frequency tree data is encoded to form a first code; each component character in the data to be transmitted is updated to a pseudo-code to obtain a second code; the first code and the second code are combined to obtain reconstructed data; and the reconstructed data is transmitted so that the out-of-band module parses the data to be transmitted based on the reconstructed data. Or, implement the following steps: the out-of-band module of the server obtains a data image containing reconstructed data; wherein the reconstructed data originates from the in-band module of the server; image recognition is performed on the data image to obtain recognition data obtained by recognizing the reconstructed data; the first code and the second code of the recognition data are parsed; the first code is decoded to obtain frequency tree data to obtain parsed constituent characters and their parsed character frequencies; the frequency tree is reconstructed with the parsed character frequencies as leaf nodes to obtain a reconstructed frequency tree; the connecting lines in the reconstructed frequency tree are respectively assigned a first identifier or a second identifier, and the first identifier and / or the second identifier of the connecting lines between the root node and the leaf node of the parsed character frequency are spliced ​​as parsed pseudo-codes of the parsed constituent characters; wherein the assignment method of the first identifier or the second identifier matches the assignment method of the in-band module; the parsed pseudo-code is used to restore the parsed constituent characters in the second code to parse the transmission data that matches the data to be transmitted.Or, implement the following steps: the in-band module of the server obtains the data to be transmitted; the in-band module counts the character frequencies of each component character in the data to be transmitted, and constructs a frequency tree with the character frequencies as leaf nodes; the in-band module assigns the first identifier or the second identifier to the connecting lines in the frequency tree, and splices the first identifier and / or the second identifier of the connecting lines from the root node to the leaf nodes of the character frequency as the pseudo-code of the component characters, and the number of pseudo-code bits of the first character is less than or equal to the number of pseudo-code bits of the second character; wherein the first character is the one with a relatively higher character frequency between the first character and the second character; the in-band module uses the component characters and their character frequencies as frequency tree data, and encodes the frequency tree data to form a first code; updates each component character in the data to be transmitted to a pseudo-code to obtain a second code; combines the first code and the second code to obtain reconstructed data; the in-band module transmits the reconstructed data to enable the out-of-band module to parse the data to be transmitted based on the reconstructed data; the service The out-of-band module of the server obtains a data image containing reconstructed data; wherein the reconstructed data originates from the in-band module of the server; the out-of-band module performs image recognition on the data image to obtain recognition data obtained by recognizing the reconstructed data; the out-of-band module parses the first code and the second code of the recognition data; the out-of-band module decodes the first code to obtain frequency tree data to obtain parsed component characters and their parsed character frequencies; the frequency tree is reconstructed with the parsed character frequencies as leaf nodes to obtain a reconstructed frequency tree; the out-of-band module assigns a first identifier or a second identifier to the connecting lines in the reconstructed frequency tree, and splices the first identifier and / or the second identifier of the connecting lines between the root node and the leaf nodes of the parsed character frequencies as parsed pseudo codes of the parsed component characters; wherein the assignment method of the first identifier or the second identifier matches the assignment method of the in-band module; the out-of-band module uses the parsed pseudo code to restore the parsed component characters in the second code to parse the transmission data that matches the data to be transmitted.

[0205] See also Figure 9 , Figure 9 It is a structural diagram of an embodiment of the computer device of the present application.

[0206] In one embodiment, the computer device may be a server, and its internal structure diagram may be as follows: Figure 9 As shown in the example.

[0207] The computer device includes a processor, memory, a network interface, and a database connected via a system bus. The processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program, and a database. The internal memory provides an environment for the operation of the operating system and computer program in the non-volatile storage medium. The database of the computer device is used to store data. The network interface of the computer device is used to communicate with an external terminal via a network connection. When executed by the processor, the computer program implements a data transmission method, a data acquisition method, or a data interaction method.

[0208] Those skilled in the art will understand that Figure 9 The structure shown in the figure is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the computer device to which the solution of the present application is applied. The specific computer device may include more or fewer components than shown in the figure, or combine certain components, or have a different component arrangement.

[0209] In one embodiment, a computer device is provided, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, the following steps can be implemented: an in-band module of a server obtains data to be transmitted; the character frequency of each component character in the data to be transmitted is counted, and a frequency tree is constructed with the character frequency as a leaf node; a first identifier or a second identifier is assigned to each connecting line in the frequency tree, and the first identifier and / or the second identifier of the connecting line from the root node to the leaf node of the character frequency is spliced ​​as a pseudo-code of the component character, and the number of pseudo-code bits of the first character is less than or equal to the number of pseudo-code bits of the second character; wherein the first character is the one with a relatively higher character frequency between the first character and the second character; the component characters and their character frequencies are used as frequency tree data, and the frequency tree data is encoded to form a first code; each component character in the data to be transmitted is updated to a pseudo-code to obtain a second code; the first code and the second code are combined to obtain reconstructed data; and the reconstructed data is transmitted so that the out-of-band module parses the data to be transmitted based on the reconstructed data.

[0210] In one embodiment, the first identifier includes a first coding value, and the second identifier includes a second coding value; when the connecting lines in the frequency tree are assigned the first coding value or the second coding value respectively, the processor can also implement the following steps when executing the computer program: assigning the first coding value to the root node and the connecting line between the branch node and its left subtree; assigning the second coding value to the root node and the connecting line between the branch node and its right subtree.

[0211] In one embodiment, when the processor executes the computer program, one of the first coding value and the second coding value can be 0, and the other can be 1.

[0212] In one embodiment, when each component character in the data to be transmitted is updated to a pseudo-code and a second code is obtained, the processor can also implement the following steps when executing the computer program: sequentially add the pseudo-codes of the component characters to the second code until the component characters in the data to be transmitted are traversed; wherein the arrangement order of the pseudo-codes in the second code matches the arrangement order of the component characters to which they belong in the data to be transmitted.

[0213] In one embodiment, when encoding the frequency tree data to form a first code, the processor may further implement the following steps when executing the computer program: encoding the character frequency to obtain a frequency code; encoding the constituent characters to obtain the real codes of the constituent characters; combining the frequency codes and the real codes of the constituent characters to form a first code; wherein the real codes of the constituent characters and the frequency codes of their character frequencies are adjacent, and the frequency codes of the constituent characters are located on the target side of their real codes.

[0214] In one embodiment, when encoding the character frequency to obtain the frequency code, the processor may further implement the following steps when executing the computer program: subtracting one from the character frequency to update the character frequency; and encoding using the updated character frequency to obtain the frequency code.

[0215] In one embodiment, when the processor executes the computer program, the following steps may be further implemented: forming a character identifier for each component character; assigning the character identifier to a pseudo-code of the component character to which it belongs, and using the pseudo-code carrying the character identifier as one of the frequency tree data.

[0216] In one embodiment, when combining the first code and the second code, the processor may further implement the following steps when executing the computer program: obtaining the code of the spacing character as the spacing code; placing the spacing code between the first code and the second code, and splicing the first code, the spacing code, and the second code.

[0217] In one embodiment, when constructing a frequency tree with character frequencies as leaf nodes, the processor may further implement the following steps when executing the computer program: sorting the character frequencies to form a frequency list; superimposing the character frequencies in the frequency list in sequence according to a preset order until the frequency list is traversed and the target frequency is obtained; wherein the frequency result obtained by each superposition is added to the frequency list as the frequency to be superimposed to update the frequency list; combining the superposition process, constructing a frequency tree with the target frequency as the root node and the character frequency as the leaf node.

[0218] In one embodiment, each time the frequency result obtained by superposition is added to the frequency list as the frequency to be superimposed, the processor can also implement the following steps when executing the computer program: deleting the frequency data of the frequency result obtained by superposition in the frequency list; wherein the frequency data includes character frequency and frequency to be superimposed; comparing the frequency result with the frequency data, and inserting it to a position that complies with the frequency data sorting rules.

[0219] In one embodiment, before transmitting the reconstructed data, the processor may further implement the following steps when executing the computer program: evaluating a check code that matches the reconstructed data; wherein the check code is used to check the reconstructed data; and inserting the check code into the reconstructed data to update the reconstructed data.

[0220] In one embodiment, when evaluating the check code that matches the reconstructed data, the processor may further implement the following steps when executing the computer program: obtaining the number of codes of the character codes in the reconstructed data, evaluating the number of check codes that match the code number and the insertion position; starting with each check code, selecting the first number of character codes as the evaluation code each time, skipping the second number of character codes, until traversing the character code starting from the check code, counting the number of first code values ​​in the evaluation code, and determining whether to assign the first code value or the second code value to the check code based on the number of first code values; wherein the first number and the second number vary with different check codes.

[0221] In one embodiment, after obtaining the data to be transmitted, the processor may further implement the following steps when executing the computer program: identifying the character to be transcoded among the constituent characters in the data to be transmitted; obtaining a replacement character associated with the character to be transcoded; wherein the replacement character is easier to encode than the character to be transcoded; and replacing the character to be transcoded in the data to be transmitted with its replacement character to update the data to be transmitted.

[0222] In one embodiment, the processor can implement the following steps when executing the computer program: the out-of-band module of the server obtains a data image containing reconstructed data; wherein the reconstructed data originates from the in-band module of the server; image recognition is performed on the data image to obtain recognition data obtained by recognizing the reconstructed data; the first code and the second code of the recognition data are parsed; the first code is decoded to obtain frequency tree data to obtain parsed component characters and their parsed character frequencies; the frequency tree is reconstructed with the parsed character frequencies as leaf nodes to obtain a reconstructed frequency tree; the connecting lines in the reconstructed frequency tree are respectively assigned a first identifier or a second identifier, and the first identifier and / or the second identifier of the connecting lines between the root node and the leaf node of the parsed character frequency are spliced ​​as parsed pseudo-codes of the parsed component characters; wherein the assignment method of the first identifier or the second identifier matches the assignment method of the in-band module; and the parsed pseudo-code is used to restore the parsed component characters in the second code to parse the transmission data that matches the data to be transmitted.

[0223] In one embodiment, the first identifier includes a first coding value, and the second identifier includes a second coding value; when the connecting lines in the reconstructed frequency tree are respectively assigned the first identifier or the second identifier, the processor can also implement the following steps when executing the computer program: assigning the first coding value to the root node and the connecting line between the branch node and its left subtree; assigning the second coding value to the root node and the connecting line between the branch node and its right subtree.

[0224] In one embodiment, when the processor executes the computer program, one of the first coding value and the second coding value can be 0, and the other can be 1.

[0225] In one embodiment, when the first code is decoded to obtain frequency tree data to obtain parsed component characters and their parsed character frequencies, the processor may further implement the following steps when executing the computer program: matching the character corresponding to the real code in the first code as the parsed component character; restoring the parsed character frequency corresponding to the frequency code; and according to the order of the real code and the frequency code in the first code, using the parsed character frequency adjacent to the real code of the parsed component character and located on the target side of its real code as the parsed character frequency of the parsed component character.

[0226] In one embodiment, when restoring the parsed character frequency corresponding to the frequency code, the processor may further implement the following steps when executing the computer program: decoding the frequency code; adding one to the decoded frequency to obtain the parsed character frequency.

[0227] In one embodiment, when parsing the first code and the second code of the identification data, the processor may further implement the following steps when executing the computer program: identifying the interval code in the identification data, and using the interval code as the parsed interval character; using the code on one side of the parsed interval character as the first code, and the code on the other side as the second code.

[0228] In one embodiment, after parsing the transmission data that matches the data to be transmitted, the processor may further implement the following steps when executing the computer program: identifying whether the transmission data includes replacement characters; and in response to the presence of replacement characters in the transmission data, replacing the replacement characters with associated characters that match them to update the transmission data.

[0229] In one embodiment, before parsing the first code and the second code of the identification data, the processor may further implement the following steps when executing the computer program: locating the check code within the identification data as a verification code; using the verification code to evaluate whether there is an identification anomaly in the identification data; in response to the existence of an identification anomaly, locating the code of the identification anomaly and correcting it to update the identification data; and deleting the verification code.

[0230] In one embodiment, when using verification codes to evaluate whether there are recognition anomalies in identification data, the processor can also implement the following steps when executing a computer program: starting with each verification code, each time a first number of character codes are selected as the codes to be evaluated, skipping the second number of character codes until the character codes starting from the verification code are traversed, the number of first code values ​​in the evaluation code is counted, the theoretical value of the verification code is determined based on the number of first code values, and the theoretical value of the verification code is compared with the actual value.

[0231] In one embodiment, when locating and identifying an abnormal code, the processor may further implement the following steps when executing a computer program: assigning a third code value to a verification code whose theoretical value matches the actual value as a positioning code; assigning a fourth code value to a verification code whose theoretical value does not match the actual value as a positioning code; sorting the positioning codes of each verification code according to the position order of the verification code in the identification data to form a positioning code sequence; decoding the positioning code sequence to obtain a target position; and determining that the code value of the target position in the identification data is the code for identifying an abnormality.

[0232] In one embodiment, the processor can also implement the following steps when executing the computer program: the in-band module of the server obtains the data to be transmitted; the in-band module counts the character frequencies of each component character in the data to be transmitted, and constructs a frequency tree with the character frequencies as leaf nodes; the in-band module assigns a first identifier or a second identifier to the connecting lines in the frequency tree, and splices the first identifier and / or the second identifier of the connecting lines from the root node to the leaf nodes of the character frequency as the pseudo-code of the component characters, and the number of pseudo-code bits of the first character is less than or equal to the number of pseudo-code bits of the second character; wherein the first character is the one with a relatively higher character frequency between the first character and the second character; the in-band module uses the component characters and their character frequencies as frequency tree data, and encodes the frequency tree data to form a first code; updates each component character in the data to be transmitted to a pseudo-code to obtain a second code; combines the first code and the second code to obtain reconstructed data; the in-band module transmits the reconstructed data to enable the out-of-band module to decrypt the data based on the reconstructed data. Analyze the data to be transmitted; the out-of-band module of the server obtains a data image containing reconstructed data; wherein the reconstructed data originates from the in-band module of the server; the out-of-band module performs image recognition on the data image to obtain recognition data obtained by recognizing the reconstructed data; the out-of-band module parses the first code and the second code of the recognition data; the out-of-band module decodes the first code to obtain frequency tree data to obtain the parsed component characters and their parsed character frequencies; the frequency tree is reconstructed with the parsed character frequencies as leaf nodes to obtain a reconstructed frequency tree; the out-of-band module assigns a first identifier or a second identifier to the connecting lines in the reconstructed frequency tree, and splices the first identifier and / or the second identifier of the connecting lines between the root node and the leaf nodes of the parsed character frequencies as parsed pseudo codes of the parsed component characters; wherein the assignment method of the first identifier or the second identifier matches the assignment method of the in-band module; the out-of-band module uses the parsed pseudo code to restore the parsed component characters in the second code to parse the transmission data that matches the data to be transmitted.

[0233] In one embodiment, a computer-readable storage medium is provided, on which a computer program is stored, and when the computer program is executed by a processor, the following steps can be implemented: an in-band module of a server obtains data to be transmitted; counts the character frequency of each component character in the data to be transmitted, and constructs a frequency tree with the character frequency as a leaf node; assigns a first identifier or a second identifier to the connecting lines in the frequency tree, and splices the first identifier and / or the second identifier of the connecting lines from the root node to the leaf node of the character frequency as a pseudo-code of the component character, and the number of pseudo-code bits of the first character is less than or equal to the number of pseudo-code bits of the second character; wherein the first character is the one with a relatively higher character frequency between the first character and the second character; the component characters and their character frequencies are used as frequency tree data, and the frequency tree data is encoded to form a first code; each component character in the data to be transmitted is updated to a pseudo-code to obtain a second code; the first code and the second code are combined to obtain reconstructed data; and the reconstructed data is transmitted to enable the out-of-band module to parse the data to be transmitted based on the reconstructed data.

[0234] In one embodiment, the first identifier includes a first coding value, and the second identifier includes a second coding value; when the connecting lines in the frequency tree are assigned the first coding value or the second coding value respectively, the computer program can also implement the following steps when executed by the processor: assigning the first coding value to the root node and the connecting line between the branch node and its left subtree; assigning the second coding value to the root node and the connecting line between the branch node and its right subtree.

[0235] In one embodiment, when the computer program is executed by the processor, one of the first coding value and the second coding value is 0, and the other is 1.

[0236] In one embodiment, when each component character in the data to be transmitted is updated to a pseudo-code and a second code is obtained, the computer program can also implement the following steps when it is executed by the processor: the pseudo-codes of the component characters are added to the second code in sequence until the component characters in the data to be transmitted are traversed; wherein the arrangement order of the pseudo-codes in the second code matches the arrangement order of the component characters to which they belong in the data to be transmitted.

[0237] In one embodiment, when frequency tree data is encoded to form a first code, the computer program may further implement the following steps when executed by a processor: encoding character frequencies to obtain frequency codes; encoding constituent characters to obtain real codes of the constituent characters; combining the frequency codes and real codes of the constituent characters to form a first code; wherein the real codes of the constituent characters and the frequency codes of their character frequencies are adjacent, and the frequency codes of the constituent characters are located on the target side of their real codes.

[0238] In one embodiment, when encoding the character frequency to obtain the frequency code, the computer program can also implement the following steps when executed by the processor: subtract one from the character frequency to update the character frequency; and encode using the updated character frequency to obtain the frequency code.

[0239] In one embodiment, when the computer program is executed by the processor, the following steps may also be implemented: forming a character identifier for each component character; assigning the character identifier to the pseudo code of the component character to which it belongs, and using the pseudo code carrying the character identifier as one of the frequency tree data.

[0240] In one embodiment, when combining the first code and the second code, the computer program can also implement the following steps when executed by the processor: obtaining the code of the spacing character as the spacing code; placing the spacing code between the first code and the second code, and splicing the first code, the spacing code and the second code.

[0241] In one embodiment, when constructing a frequency tree with character frequencies as leaf nodes, the computer program can also implement the following steps when executed by the processor: sorting the character frequencies to form a frequency list; superimposing the character frequencies in the frequency list in sequence according to a preset order until the frequency list is traversed and the target frequency is obtained; wherein, the frequency result obtained by each superposition is added to the frequency list as the frequency to be superimposed to update the frequency list; combining the superposition process, constructing a frequency tree with the target frequency as the root node and the character frequency as the leaf node.

[0242] In one embodiment, each time the frequency result obtained by superposition is added to the frequency list as the frequency to be superimposed, the computer program can also implement the following steps when executed by the processor: deleting the frequency data of the frequency result obtained by superposition in the frequency list; wherein the frequency data includes character frequency and frequency to be superimposed; comparing the frequency result with the frequency data, and inserting it to a position that complies with the frequency data sorting rules.

[0243] In one embodiment, before transmitting the reconstructed data, the computer program may further implement the following steps when executed by the processor: evaluating a check code that matches the reconstructed data; wherein the check code is used to check the reconstructed data; and inserting the check code into the reconstructed data to update the reconstructed data.

[0244] In one embodiment, when evaluating the check code that matches the reconstructed data, the computer program can also implement the following steps when executed by the processor: obtain the number of codes of the character code in the reconstructed data, evaluate the number of check codes that match the code number and the insertion position; at each check code, use it as the starting point, select the first number of character codes as the evaluation code each time, skip the second number of character codes, until the character code starting from the check code is traversed, count the number of first code values ​​in the evaluation code, and determine whether to assign the first code value or the second code value to the check code based on the number of first code values; wherein the first number and the second number vary with different check codes.

[0245] In one embodiment, after obtaining the data to be transmitted, the computer program can also implement the following steps when executed by the processor: identifying the characters to be transcoded among the constituent characters in the data to be transmitted; obtaining a replacement character associated with the character to be transcoded; wherein the replacement character is easier to encode than the character to be transcoded; and replacing the character to be transcoded in the data to be transmitted with its replacement character to update the data to be transmitted.

[0246] In one embodiment, the computer program can implement the following steps when executed by a processor: an out-of-band module of a server obtains a data image containing reconstructed data; wherein the reconstructed data originates from an in-band module of the server; image recognition is performed on the data image to obtain recognition data obtained by recognizing the reconstructed data; a first code and a second code of the recognition data are parsed; the first code is decoded to obtain frequency tree data to obtain parsed component characters and their parsed character frequencies; the frequency tree is reconstructed with the parsed character frequencies as leaf nodes to obtain a reconstructed frequency tree; the connecting lines in the reconstructed frequency tree are respectively assigned a first identifier or a second identifier, and the first identifier and / or the second identifier of the connecting lines between the root node and the leaf nodes of the parsed character frequencies are spliced ​​as parsed pseudo codes of the parsed component characters; wherein the assignment method of the first identifier or the second identifier matches the assignment method of the in-band module; and the parsed pseudo code is used to restore the parsed component characters in the second code to parse the transmission data that matches the data to be transmitted.

[0247] In one embodiment, the first identifier includes a first coding value, and the second identifier includes a second coding value; when the connecting lines in the reconstructed frequency tree are respectively assigned the first identifier or the second identifier, the computer program can also implement the following steps when executed by the processor: assigning the first coding value to the root node and the connecting line between the branch node and its left subtree; assigning the second coding value to the root node and the connecting line between the branch node and its right subtree.

[0248] In one embodiment, when the computer program is executed by the processor, one of the first coding value and the second coding value is 0, and the other is 1.

[0249] In one embodiment, when the first code is decoded to obtain frequency tree data to obtain parsed component characters and their parsed character frequencies, the computer program can also implement the following steps when executed by the processor: match the character corresponding to the real code in the first code as the parsed component character; restore the parsed character frequency corresponding to the frequency code; and according to the order of the real code and the frequency code in the first code, use the parsed character frequency adjacent to the real code of the parsed component character and located on the target side of its real code as the parsed character frequency of the parsed component character.

[0250] In one embodiment, when restoring the parsed character frequency corresponding to the frequency code, the computer program may further implement the following steps when executed by the processor: decoding the frequency code; adding one to the decoded frequency to obtain the parsed character frequency.

[0251] In one embodiment, when parsing the first code and the second code of the identification data, the computer program can also implement the following steps when executed by the processor: identifying the interval code in the identification data, and using the interval code as the parsed interval character; using the code on one side of the parsed interval character as the first code, and the code on the other side as the second code.

[0252] In one embodiment, after parsing the transmission data that matches the data to be transmitted, the computer program may further implement the following steps when executed by the processor: identifying whether the transmission data includes replacement characters; and in response to the presence of replacement characters in the transmission data, replacing the replacement characters with associated characters that match them to update the transmission data.

[0253] In one embodiment, before parsing the first code and the second code of the identification data, the computer program can also implement the following steps when executed by the processor: locate the check code in the identification data as a verification code; use the verification code to evaluate whether there is an identification anomaly in the identification data; in response to the existence of an identification anomaly, locate the code of the identification anomaly and correct it to update the identification data; and delete the verification code.

[0254] In one embodiment, when using verification codes to evaluate whether there are recognition anomalies in identification data, the computer program can also implement the following steps when executed by the processor: starting with each verification code, each time a first number of character codes are selected as the codes to be evaluated, skipping the second number of character codes until the character codes starting from the verification code are traversed, counting the number of first code values ​​in the evaluation code, determining the theoretical value of the verification code based on the number of first code values, and comparing the theoretical value of the verification code with the actual value.

[0255] In one embodiment, when locating and identifying abnormal codes, the computer program can also implement the following steps when executed by the processor: assigning the third code value to the verification code whose theoretical value matches the actual value as the positioning code; assigning the fourth code value to the verification code whose theoretical value does not match the actual value as the positioning code; sorting the positioning codes of each verification code according to the position order of the verification code in the identification data to form a positioning code sequence; decoding the positioning code sequence to obtain the target position; and determining that the code value of the target position in the identification data is the code for identifying the abnormality.

[0256] In one embodiment, when the computer program is executed by the processor, the following steps can also be implemented: the in-band module of the server obtains the data to be transmitted; the in-band module counts the character frequencies of each component character in the data to be transmitted, and constructs a frequency tree with the character frequencies as leaf nodes; the in-band module assigns a first identifier or a second identifier to the connecting lines in the frequency tree, and splices the first identifier and / or the second identifier of the connecting lines from the root node to the leaf nodes of the character frequency as the pseudo-code of the component characters, and the number of pseudo-code bits of the first character is less than or equal to the number of pseudo-code bits of the second character; wherein the first character is the one with a relatively higher character frequency between the first character and the second character; the in-band module uses the component characters and their character frequencies as frequency tree data, and encodes the frequency tree data to form a first code; updates each component character in the data to be transmitted to a pseudo-code to obtain a second code; combines the first code and the second code to obtain reconstructed data; the in-band module transmits the reconstructed data to enable the out-of-band module to generate a first code based on the reconstructed data Parse the data to be transmitted; the out-of-band module of the server obtains a data image containing reconstructed data; wherein the reconstructed data originates from the in-band module of the server; the out-of-band module performs image recognition on the data image to obtain recognition data obtained by recognizing the reconstructed data; the out-of-band module parses the first code and the second code of the recognition data; the out-of-band module decodes the first code to obtain frequency tree data to obtain parsed component characters and their parsed character frequencies; reconstructs the frequency tree with the parsed character frequencies as leaf nodes to obtain a reconstructed frequency tree; the out-of-band module assigns a first identifier or a second identifier to the connecting lines in the reconstructed frequency tree, and splices the first identifier and / or the second identifier of the connecting lines between the root node and the leaf nodes of the parsed character frequencies as parsed pseudo codes of the parsed component characters; wherein the assignment method of the first identifier or the second identifier matches the assignment method of the in-band module; the out-of-band module uses the parsed pseudo code to restore the parsed component characters in the second code to parse the transmission data that matches the data to be transmitted.

[0257] Those skilled in the art will understand that all or part of the processes in the above-mentioned embodiments can be implemented by instructing the relevant hardware through a computer program. The computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to memory, storage, database or other media used in the embodiments provided in this application may include non-volatile and / or volatile memory. Non-volatile memory may include read-only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM) or flash memory. Volatile memory may include random access memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in many forms such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), Synchronous Link DRAM (SLDRAM), Rambus direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM), etc.

[0258] The technical features of the above embodiments can be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0259] The above embodiments merely illustrate several implementation methods of the present application. While the descriptions are relatively specific and detailed, they should not be construed as limiting the scope of the present invention. It should be noted that a person skilled in the art could make numerous variations and improvements without departing from the spirit of the present application, all of which fall within the scope of protection of the present application.

Claims

1. A data transmission method, characterized in that: The data transmission method comprises: The in-band module of the server obtains the data to be transmitted; Counting the character frequencies of each component character in the data to be transmitted, and constructing a frequency tree with the character frequencies as leaf nodes; Assigning a first identifier or a second identifier to the connecting lines in the frequency tree respectively, splicing the first identifier and / or the second identifier of the connecting line from the root node to the leaf node of the character frequency as the pseudo-code of the component character, and the number of bits of the pseudo-code of the first character is less than or equal to the number of bits of the pseudo-code of the second character; wherein the first character is the one with a relatively higher character frequency between the first character and the second character; Using constituent characters and their character frequencies as frequency tree data, encoding the frequency tree data to form a first code; updating each constituent character in the data to be transmitted to the pseudo code to obtain a second code; combining the first code and the second code to obtain reconstructed data; The reconstructed data is transmitted so that the out-of-band module parses the data to be transmitted based on the reconstructed data.

2. The data transmission method according to claim 1, characterized in that: The first identifier includes a first coded value, and the second identifier includes a second coded value; The assigning the first coding value or the second coding value to the connection lines in the frequency tree respectively comprises: Assigning the first code value to the root node and the connecting line between the branch node and its left subtree; The second encoding value is assigned to the root node and the connecting line between the branch node and its right subtree.

3. The data transmission method according to claim 2, characterized in that: One of the first coding value and the second coding value is 0, and the other is 1.

4. The data transmission method according to claim 1, characterized in that: The updating of each of the constituent characters in the data to be transmitted into the pseudo-code to obtain the second code comprises: Sequentially adding the pseudo codes of the constituent characters to the second code until the constituent characters in the data to be transmitted are traversed; The arrangement order of the pseudo codes in the second code matches the arrangement order of the constituent characters thereof in the data to be transmitted.

5. The data transmission method according to claim 1, characterized in that: The encoding of the frequency tree data to form a first code comprises: Encoding the character frequency to obtain a frequency code; Encoding the constituent characters to obtain real codes of the constituent characters; The frequency code and the real code of the constituent characters are combined to form the first code; wherein the real code of the constituent characters and the frequency code of their character frequency are adjacent, and the frequency code of the constituent characters is located on the target side of its real code.

6. The data transmission method according to claim 5, characterized in that: The encoding of the character frequency to obtain the frequency code comprises: Subtract one from the character frequency to update the character frequency; The updated character frequency is used for encoding to obtain the frequency code.

7. The data transmission method according to claim 1 or 5, characterized in that: The data transmission method further comprises: forming character identifiers for the component characters; The character identifier is assigned a pseudo code of the component character to which it belongs, and the pseudo code carrying the character identifier is used as one of the frequency tree data.

8. The data transmission method according to claim 1, characterized in that: The combining of the first encoding and the second encoding further comprises: Get the code of the space character as the space code; The interval code is placed between the first code and the second code, and the first code, the interval code and the second code are concatenated.

9. The data transmission method according to claim 1, characterized in that: The step of constructing a frequency tree using the character frequencies as leaf nodes includes: Sorting the character frequencies to form a frequency list; The character frequencies in the frequency list are sequentially superimposed in a preset order until the frequency list is traversed to obtain a target frequency; wherein the frequency result obtained by each superposition is added to the frequency list as a frequency to be superimposed, so as to update the frequency list; In combination with the superposition process, the frequency tree is constructed with the target frequency as the root node and the character frequency as the leaf node.

10. The data transmission method according to claim 9, characterized in that: The frequency result obtained by each superposition is added to the frequency list as the frequency to be superimposed, including: Deleting the frequency data in the frequency list that is superimposed to obtain the frequency result; wherein the frequency data includes the character frequency and the frequency to be superimposed; The frequency result is compared with the frequency data and inserted into a position that complies with the frequency data sorting rules.

11. The data transmission method according to claim 1, characterized in that: The transmitting of the reconstructed data includes: evaluating a check code matching the reconstructed data; wherein the check code is used to check the reconstructed data; The check code is inserted into the reconstructed data to update the reconstructed data.

12. The data transmission method according to claim 11, characterized in that: The evaluating the check code matching the reconstructed data comprises: Obtaining the number of codes of the character codes in the reconstructed data, and evaluating the number and insertion position of the check codes matching the number of codes; For each of the verification codes, starting with it, each time a first number of character codes are selected as evaluation codes, a second number of character codes are skipped, until the character codes starting from the verification code are traversed, the number of first code values ​​in the evaluation code is counted, and based on the number of the first code values, it is determined whether to assign the first code value or the second code value to the verification code; wherein the first number and the second number vary with different verification codes.

13. The data transmission method according to claim 1, characterized in that: The step of obtaining the data to be transmitted includes: Identifying characters to be transcoded among the constituent characters in the data to be transmitted; Obtaining a replacement character associated with the character to be transcoded; wherein the replacement character is easier to encode than the character to be transcoded; The character to be transcoded in the data to be transmitted is replaced with a replacement character to update the data to be transmitted.

14. A data acquisition method, characterized in that: The data acquisition method comprises: The out-of-band module of the server obtains a data image including reconstructed data; wherein the reconstructed data originates from the in-band module of the server; Performing image recognition on the data image to obtain recognition data obtained by recognizing the reconstructed data; Parsing the first code and the second code of the identification data; Decoding the first code to obtain frequency tree data to obtain parsed component characters and parsed character frequencies; reconstructing the frequency tree with the parsed character frequencies as leaf nodes to obtain a reconstructed frequency tree; Assigning a first identifier or a second identifier to the connecting lines in the reconstructed frequency tree respectively, splicing the first identifier and / or the second identifier of the connecting line from the root node to the leaf node of the parsed character frequency as the parsed pseudo-code of the parsed component character; wherein the assignment method of the first identifier or the second identifier matches the assignment method of the in-band module; The parsed pseudo-code is used to restore the parsed constituent characters in the second code to parse the transmission data that matches the data to be transmitted.

15. The data acquisition method according to claim 14, characterized in that: The first identifier includes a first coded value, and the second identifier includes a second coded value; The assigning the first identifier or the second identifier to the connection lines in the reconstructed frequency tree includes: Assigning the first code value to the root node and the connecting line between the branch node and its left subtree; The second encoding value is assigned to the root node and the connecting line between the branch node and its right subtree.

16. The data acquisition method according to claim 15, characterized in that: One of the first coding value and the second coding value is 0, and the other is 1.

17. The data acquisition method according to claim 14, characterized in that: The decoding of the first code to obtain frequency tree data to obtain parsed component characters and parsed character frequencies includes: Match the character corresponding to the real code in the first code as the parsed component character; Restore the parsed character frequency corresponding to the frequency code; According to the order of the real codes and frequency codes in the first code, the frequency of the parsed character adjacent to the real code of the parsed component character and located on the target side of its real code is used as the frequency of the parsed character of the parsed component character.

18. The data acquisition method according to claim 17, characterized in that: The reconstructing the parsed character frequency corresponding to the frequency code comprises: decoding the frequency code; The frequency obtained by decoding is added by one to obtain the frequency of the parsed character.

19. The data acquisition method according to claim 14, characterized in that: The first encoding and the second encoding of the parsing identification data include: Recognize the interval code in the identification data, and use the interval code as a parsing interval character; The code on one side of the parsed space character is used as the first code, and the code on the other side thereof is used as the second code.

20. The data acquisition method according to claim 14, characterized in that: After parsing the transmission data matching the data to be transmitted, the following further comprises: identifying whether the transmitted data includes replacement characters; In response to the replacement character existing in the transmission data, the replacement character is replaced with an associated character matching the replacement character to update the transmission data.

21. The data acquisition method according to claim 14, characterized in that: Before parsing the first code and the second code of the identification data, the following further comprises: Locating a check code in the identification data as a verification code; Using the verification code to evaluate whether the identification data has an identification anomaly; In response to the presence of an identification anomaly, locating and correcting a code of the identification anomaly to update the identification data; Delete the verification code.

22. The data acquisition method according to claim 21, characterized in that: The using the verification code to evaluate whether the identification data has an identification anomaly includes: For each of the verification codes, take it as the starting point, select a first number of character codes as the codes to be evaluated, skip the second number of character codes, until traversing the character codes starting from the verification code, count the number of first code values ​​in the evaluation code, determine the theoretical value of the verification code based on the number of the first code values, and compare the theoretical value of the verification code with the actual value.

23. The data acquisition method according to claim 22, characterized in that: The coding of the positioning and identification anomaly includes: Assigning the third code value to the verification code whose theoretical value matches the true value as the positioning code; Assigning a fourth code value to the verification code whose theoretical value does not match the actual value as a positioning code; According to the position sequence of the verification codes in the identification data, the positioning codes of the verification codes are sorted to form a positioning code sequence; Decoding the positioning coding sequence to obtain a target position; The code value of the target position in the identification data is determined to be a code for identifying an abnormality.

24. A data interaction method, characterized in that: The data interaction method comprises: The in-band module of the server obtains the data to be transmitted; The in-band module counts the character frequencies of each component character in the data to be transmitted, and constructs a frequency tree with the character frequencies as leaf nodes; The in-band module assigns a first identifier or a second identifier to the connection lines in the frequency tree respectively, and splices the first identifier and / or the second identifier of the connection line from the root node to the leaf node of the character frequency as the pseudo-code of the constituent character, and the number of bits of the pseudo-code of the first character is less than or equal to the number of bits of the pseudo-code of the second character; wherein the first character is the one with a relatively higher character frequency between the first character and the second character; The in-band module uses the component characters and their character frequencies as frequency tree data, encodes the frequency tree data to form a first code; updates each of the component characters in the data to be transmitted to the pseudo code to obtain a second code; combines the first code and the second code to obtain reconstructed data; The in-band module transmits the reconstructed data so that the out-of-band module parses the data to be transmitted based on the reconstructed data; The out-of-band module of the server obtains a data image containing the reconstructed data; wherein the reconstructed data originates from the in-band module of the server; The out-of-band module performs image recognition on the data image to obtain recognition data obtained by recognizing the reconstructed data; The out-of-band module parses the first code and the second code of the identification data; The out-of-band module decodes the first code to obtain frequency tree data to obtain parsed component characters and parsed character frequencies; the frequency tree is reconstructed using the parsed character frequencies as leaf nodes to obtain a reconstructed frequency tree; The out-of-band module assigns a first identifier or a second identifier to the connection lines in the reconstructed frequency tree, respectively, and splices the first identifier and / or the second identifier of the connection lines from the root node to the leaf nodes of the parsed character frequency as the parsed pseudo-code of the parsed component characters; wherein the assignment method of the first identifier or the second identifier matches the assignment method of the in-band module; The out-of-band module uses the parsed pseudo-code to restore parsed constituent characters in the second code to parse the transmission data that matches the data to be transmitted.

25. A server, characterized in that: The server comprises: Server body; The in-band module is provided in the server body, and is used to obtain data to be transmitted; count the character frequencies of each component character in the data to be transmitted, and construct a frequency tree with the character frequencies as leaf nodes; assign a first identifier or a second identifier to the connecting lines in the frequency tree respectively, and splice the first identifier and / or the second identifier of the connecting line from the root node to the leaf node of the character frequency as the pseudo-code of the component character, and the number of pseudo-code bits of the first character is less than or equal to the number of pseudo-code bits of the second character; wherein the first character is the one with a relatively higher character frequency between the first character and the second character; the component characters and their character frequencies are used as frequency tree data, and the frequency tree data is encoded to form a first code; each of the component characters in the data to be transmitted is updated to the pseudo-code to obtain a second code; the first code and the second code are combined to obtain reconstructed data; and the reconstructed data is transmitted to enable the out-of-band module to parse the data to be transmitted based on the reconstructed data; An out-of-band module is provided in the server body, and is used to obtain a data image containing the reconstructed data; wherein the reconstructed data originates from an in-band module of the server; image recognition is performed on the data image to obtain recognition data obtained by recognizing the reconstructed data; a first code and a second code of the recognition data are parsed; the first code is decoded to obtain frequency tree data to obtain parsed constituent characters and their parsed character frequencies; the frequency tree is reconstructed with the parsed character frequencies as leaf nodes to obtain a reconstructed frequency tree; a first identifier or a second identifier is respectively assigned to the connecting lines in the reconstructed frequency tree, and the first identifier and / or the second identifier of the connecting lines between the root node and the leaf nodes of the parsed character frequencies are spliced ​​as parsed pseudo-codes of the parsed constituent characters; wherein the assignment method of the first identifier or the second identifier matches the assignment method of the in-band module; and the parsed constituent characters in the second code are restored using the parsed pseudo-code to parse the transmission data that matches the data to be transmitted.

26. A computer program product comprising a computer program, characterized in that When the computer program is executed by a processor, it implements the steps of the data transmission method described in any one of claims 1-13; or, implements the steps of the data acquisition method described in any one of claims 14-23; or, implements the data interaction method described in claim 24.

27. A computer device comprising a memory, a processor and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the computer program, it implements the steps of the data transmission method described in any one of claims 1-13; or, implements the steps of the data acquisition method described in any one of claims 14-23; or, implements the data interaction method described in claim 24.

28. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, it implements the steps of the data transmission method described in any one of claims 1-13; or, implements the steps of the data acquisition method described in any one of claims 14-23; or, implements the data interaction method described in claim 24.

Images