Packet processing method and apparatus

Abstract

Embodiments of the present specification provide a message processing method and device, wherein the method comprises: determining and parsing a request message of a target request to obtain an initial key sequence corresponding to the request message and an initial key-value pair set corresponding to the initial key sequence; determining a historical key sequence set corresponding to the target request according to request identification information of the target request, and updating the initial key sequence to an ordered key sequence by using the historical key sequence set; generating an ordered key-value pair set corresponding to the ordered key sequence according to the initial key-value pair set and the ordered key sequence; determining a to-be-searched key corresponding to the target request according to the request identification information, and determining a target value of the to-be-searched key based on the ordered key-value pair set. The value operation of the to-be-searched key is simplified, the parsing speed of the request message is improved, and the target request can be quickly responded subsequently.

Description

Technical Field

[0001] The embodiments in this specification relate to the field of computer communication technology, and in particular to a message processing method. Background Technology

[0002] With the development of computer network technology, more and more people are choosing to use web browsing to obtain data, mostly by using front-end data requests to access data stored on back-end servers. In some data processing systems, data request messages consist of a request identifier and multiple request fields. When the back-end server parses the message, it needs to retrieve the corresponding value based on the request field as the key. Typically, a hash table is used to look up the key, or an ordered array or various ordered trees are built before searching. However, these search methods may lead to long request response times and slow reply speeds, which are detrimental to the user experience. Therefore, how to quickly parse messages and find the corresponding key-value pairs is a problem that urgently needs to be solved. Summary of the Invention

[0003] In view of this, embodiments of this specification provide a message processing method. One or more embodiments of this specification also relate to a message processing apparatus, a computing device, a computer-readable storage medium, and a computer program, to address the technical deficiencies existing in the prior art.

[0004] According to a first aspect of the embodiments of this specification, a message processing method is provided, including:

[0005] Determine and parse the request message of the target request to obtain the initial key sequence corresponding to the request message and the initial key-value pair set corresponding to the initial key sequence;

[0006] The historical key sequence set corresponding to the target request is determined based on the request identifier information of the target request, and the initial key sequence is updated to an ordered key sequence using the historical key sequence set;

[0007] Based on the initial set of key-value pairs and the ordered key sequence, generate an ordered set of key-value pairs corresponding to the ordered key sequence;

[0008] The key to be searched corresponding to the target request is determined based on the request identification information, and the target value of the key to be searched is determined based on the ordered key-value pair set.

[0009] According to a second aspect of the embodiments of this specification, a message processing apparatus is provided, comprising:

[0010] The parsing module is configured to determine and parse the request message of the target request to obtain the initial key sequence corresponding to the request message and the initial key-value pair set corresponding to the initial key sequence.

[0011] The update module is configured to determine the set of historical key sequences corresponding to the target request based on the request identifier information of the target request, and update the initial key sequence to an ordered key sequence using the set of historical key sequences;

[0012] The generation module is configured to generate an ordered set of key-value pairs corresponding to the ordered key sequence based on the initial set of key-value pairs and the ordered key sequence.

[0013] The determination module is configured to determine the key to be searched corresponding to the target request based on the request identification information, and to determine the target value of the key to be searched based on the ordered key-value pair set.

[0014] According to a third aspect of the embodiments of this specification, a computing device is provided, including: a memory and a processor;

[0015] The memory is used to store computer-executable instructions, and the processor is used to execute the computer-executable instructions, which, when executed by the processor, implement the steps of the above-described message processing method.

[0016] According to a fourth aspect of the embodiments of this specification, a computer-readable storage medium is provided that stores computer-executable instructions, which, when executed by a processor, implement the steps of the above-described message processing method.

[0017] According to a fifth aspect of the embodiments of this specification, a computer program is provided, wherein when the computer program is executed in a computer, it causes the computer to perform the steps of the above-described message processing method.

[0018] This specification provides a message processing method, including determining and parsing a request message of a target request to obtain an initial key sequence corresponding to the request message and an initial key-value pair set corresponding to the initial key sequence; determining a historical key sequence set corresponding to the target request based on request identifier information of the target request, and updating the initial key sequence to an ordered key sequence using the historical key sequence set; generating an ordered key-value pair set corresponding to the ordered key sequence based on the initial key-value pair set and the ordered key sequence; determining a lookup key corresponding to the target request based on the request identifier information, and determining a target value for the lookup key based on the ordered key-value pair set.

[0019] One embodiment of this specification implements the determination of the corresponding ordered key sequence from the initial key sequence in the request message as a whole, thereby transforming the initial key-value pair set corresponding to the initial key sequence into a sorted ordered key-value pair set. Subsequently, the target value of the key to be searched is quickly determined based on the ordered key-value pair set, which simplifies the value retrieval operation of the key to be searched, improves the parsing speed of the request message, and facilitates a rapid response to the target request. Attached Figure Description

[0020] Figure 1 This is a schematic diagram illustrating a scenario of a message processing method provided in one embodiment of this specification;

[0021] Figure 2 This is a flowchart illustrating a message processing method provided in one embodiment of this specification;

[0022] Figure 3 This is a flowchart illustrating the processing procedure of a message processing method provided in one embodiment of this specification.

[0023] Figure 4 This is a schematic diagram of the structure of a message processing device provided in one embodiment of this specification;

[0024] Figure 5 This is a structural block diagram of a computing device provided in one embodiment of this specification. Detailed Implementation

[0025] Many specific details are set forth in the following description to provide a full understanding of this specification. However, this specification can be implemented in many other ways than those described herein, and those skilled in the art can make similar extensions without departing from the spirit of this specification. Therefore, this specification is not limited to the specific implementations disclosed below.

[0026] The terminology used in one or more embodiments of this specification is for the purpose of describing particular embodiments only and is not intended to be limiting of the one or more embodiments of this specification. The singular forms “a,” “described,” and “the” as used in one or more embodiments of this specification and the appended claims are also intended to include the plural forms unless the context clearly indicates otherwise. It should also be understood that the term “and / or” as used in one or more embodiments of this specification refers to and includes any or all possible combinations of one or more associated listed items.

[0027] It should be understood that although the terms first, second, etc., may be used to describe various information in one or more embodiments of this specification, such information should not be limited to these terms. These terms are only used to distinguish information of the same type from one another. For example, first may also be referred to as second without departing from the scope of one or more embodiments of this specification, and similarly, second may also be referred to as first. Depending on the context, the word "if" as used herein may be interpreted as "when," "when," or "in response to a determination."

[0028] Furthermore, it should be noted that the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data used for analysis, stored data, displayed data, etc.) involved in one or more embodiments of this specification are all information and data authorized by the user or fully authorized by all parties. Moreover, the collection, use and processing of related data must comply with the relevant laws, regulations and standards of the relevant countries and regions, and corresponding operation entry points are provided for users to choose to authorize or refuse.

[0029] Currently, in some data processing systems, request messages consist of a request identifier (function number) and multiple request fields and their corresponding values. These request fields and values ​​form key-value pairs, and the order of the keys in the request message is generally not restricted. Parsing the message requires retrieving the corresponding value based on the key. This is typically done by using a hash table for key lookup, or by building an ordered array or various ordered trees for lookup. Hash tables incur the overhead of calculating hash values ​​and the potential for performance degradation due to hash collisions. While ordered arrays and ordered trees do not have the potential for performance degradation, they require multiple key comparisons during the creation process, leading to slower creation speeds and impacting performance.

[0030] Based on this, this specification provides a message processing method for quickly parsing request messages and finding the value corresponding to the key. This specification also relates to a message processing apparatus, a computing device, and a computer-readable storage medium, which will be described in detail in the following embodiments.

[0031] See Figure 1 , Figure 1This diagram illustrates a scenario of a message processing method according to an embodiment of this specification. The sender can be understood as the party sending the target request, and the receiver as the party receiving the target request. In practical applications, the sender can be a client with service usage needs, and the receiver can be a server providing the service. For example, if the sender needs to store data on the server, it can send a storage request to the server. After receiving the storage request, the server will respond to the storage request and store the data. During the response process, the server needs to parse the request message of the target request to obtain the value of the key to be searched corresponding to the target request. In determining the value of the key to be searched, the initial key sequence in the request message can be compared as a whole with the historical key sequence set. Based on the comparison result, an ordered key sequence is determined. Based on the correspondence between the initial key sequence and the ordered key sequence, the initial key-value pair set can be converted into an ordered key-value pair set. Subsequently, the target value of the key to be searched is determined from the ordered key-value pair set. Based on this, by caching the historical initial key sequence and the corresponding historical ordered key sequence in the historical key sequence set, the sorting operation for the initial key sequence is avoided every time. When the key to be searched is determined later, it can be obtained directly by traversing the ordered key-value pair set, thereby improving the message parsing speed.

[0032] See Figure 2 , Figure 2 A flowchart of a message processing method according to an embodiment of this specification is shown, which specifically includes the following steps.

[0033] Step 202: Determine and parse the request message of the target request to obtain the initial key sequence corresponding to the request message and the initial key-value pair set corresponding to the initial key sequence.

[0034] The target request can be understood as the sender's request to use the service, such as a data query request or a data entry request. The target request is a key-value (KV) request, consisting of a request identifier, multiple request fields, and their corresponding values, forming key-value pairs. After receiving the target request, the receiver needs to parse it to respond. During parsing, the corresponding value needs to be retrieved based on the key. To avoid repeatedly sorting the parsed key-value pairs, multiple keys in the request message can be treated as a whole, forming an initial key sequence. Subsequent sorted key sequences are then determined based on this initial key sequence.

[0035] Specifically, the initial key sequence can be understood as a sequence of keys in the initial order of the request message. The initial key sequence contains all the keys included in the request message. The initial key-value pair set can be understood as a set of key-value pairs formed by each key in the request message and its corresponding value. For example, if the initial key sequence is "A, B, C", then the initial key-value pair set is "A-*, B-*, C-*". The order of the keys in the initial key sequence and the initial key-value pair set is the same, both being the initial order in the request message. Since the order of the keys in the request message is not constrained, subsequent searches for the corresponding values ​​require multiple repetitions of sorting to generate the corresponding ordered array or ordered tree. Furthermore, multiple comparisons are needed during the search to determine the target value of the key corresponding to the target request. To avoid these problems, in one embodiment of this specification, the keys in the request message are treated as a whole to generate the initial key sequence. Subsequently, based on the initial key sequence, the sorted ordered key sequence can be directly determined, and then the key value is determined based on the ordered key-value pair set of the ordered key sequence.

[0036] In a specific embodiment of this specification, the target request is a data entry request. The request message of the data entry request is determined and parsed to obtain the initial key sequence and the initial key-value pair set corresponding to the initial key sequence carried in the request message. The initial key sequence is "E, B, D" and the initial key-value pair set is "E-1, B-2, D-4".

[0037] Step 204: Determine the set of historical key sequences corresponding to the target request based on the request identifier information of the target request, and update the initial key sequence to an ordered key sequence using the set of historical key sequences.

[0038] The request identifier information can be understood as an identifier representing the function number of the target request. Based on the request identifier information of the target request, the historical key sequence set of the target request can be determined. The historical key sequence set is the historical initial key sequence in the historical requests corresponding to the same request identifier information. The ordered key sequence can be understood as the key sequence after arranging the initial key sequence in a certain order.

[0039] In practical applications, after determining the initial key sequence in the target request, a corresponding historical key sequence is selected. The historical key sequence set is then searched for a matching initial key sequence. If a matching initial key sequence exists, it indicates that a similar type of request has been processed previously. At this point, the historical key sequence set will contain both the initial key sequence and its corresponding ordered key sequence. Therefore, after determining the historical key sequence set for the current target request, if a matching initial key sequence exists, the ordered key sequence can be used as the sorted key sequence of the initial key sequence, reducing redundant sorting operations. If no matching initial key sequence exists, the initial key sequence needs to be sorted to obtain its corresponding ordered key sequence, which is then used to determine the value subsequently.

[0040] In a specific embodiment of this specification, referring to the above example, the target request is determined to be of the data entry type based on the request identification information of the target request. The corresponding historical key sequence set is selected based on the request identification information, and the ordered key sequence corresponding to the initial key sequence is obtained using the historical key sequence set. The ordered key sequence is "B, D, E".

[0041] Furthermore, in order to quickly determine the ordered key sequence corresponding to the initial key sequence in the request message, it is necessary to correctly select the historical key sequence set corresponding to the target request. Specifically, determining the historical key sequence set corresponding to the target request based on the request identifier information of the target request includes: determining the request type of the target request based on the request identifier information of the target request; and selecting the historical key sequence set corresponding to the target request from the historical key sequence set group based on the request type.

[0042] The request type can be understood as the type of request function corresponding to the target request. The request type can be data storage type, data modification type, data query type, etc. The historical key sequence set group can be understood as a group containing historical key sequence sets corresponding to various different request types. After determining the request type based on the request identifier information of the target request, the historical key sequence set corresponding to the target request can be selected from the historical key sequence set group, thereby determining the ordered key sequence corresponding to the initial key sequence based on the historical key sequence set.

[0043] In practical applications, the historical key sequence set stores the initial key sequence and the corresponding ordered key sequence carried in requests of the same request type. When there is no initial key sequence in the historical key sequence set that is the same as the current one, the initial key sequence is sorted to obtain the ordered key sequence after the initial key sequence has been sorted and updated. At this time, the initial key sequence and the ordered key sequence are also stored in the historical key sequence set in a corresponding relationship, so that when there is the same initial key sequence in the future, the historical ordered key sequence can be directly selected as its ordered key sequence.

[0044] In a specific embodiment of this specification, referring to the above example, the request type is determined based on the request identifier information of the target request. The request type is a data entry type. The historical key sequence set of the data entry type is selected from the historical key sequence set group. Subsequently, the ordered key sequence corresponding to the initial key sequence of the target request is determined using the historical key sequence set.

[0045] Based on this, by selecting the corresponding set of historical key sequences according to the request type of the target request, it is ensured that the corresponding ordered key sequence can be determined from the set of historical key sequences corresponding to historical requests of the same request type.

[0046] Furthermore, in order to quickly determine the ordered key sequence corresponding to the initial key sequence, a set of historical key sequences can be used. Specifically, updating the initial key sequence to an ordered key sequence using the set of historical key sequences includes: searching in the set of historical key sequences based on the initial key sequence; if the search result shows that there is a historical initial key sequence in the set that is the same as the initial key sequence, then the historical ordered key sequence of the historical initial key sequence is taken as the ordered key sequence of the initial key sequence.

[0047] In cases where the receiver is not parsing the request message corresponding to this request type for the first time, the historical key sequence set will store the historical initial key sequence and its corresponding historical ordered key sequence. Therefore, when parsing the request message of the current target request, the initial key sequence of the current target request can be compared with the historical initial key sequence in the historical key sequence set. If the comparison is consistent, it means that the initial key sequence is the same as the historical initial key sequence. In this case, the historical ordered key sequence of the historical initial key sequence can be directly used as the ordered key sequence of the initial key sequence, thus saving the operation of sorting the initial key sequence.

[0048] In practical applications, the order of keys in request messages sent by different senders may vary. Therefore, for the same request type but sent by different senders, the initial key sequence may have different orderings. That is, the historical key sequence set contains a small number of different historical initial key sequences and their corresponding historical ordered key sequences. Therefore, it is necessary to compare the initial key sequence with the historical initial key sequences to find the historical initial key sequence that matches the initial key sequence, thus determining the ordered key sequence corresponding to the initial key sequence.

[0049] In a specific embodiment of this specification, referring to the above example, a search is performed in the historical key sequence set based on the initial key sequence "E, B, D". The search result is that there is a historical initial key sequence "E, B, D" in the historical key sequence set. The historical ordered key sequence corresponding to the historical initial key sequence is taken as the ordered key sequence of the initial key sequence, and the ordered key sequence is "B, D, E".

[0050] Based on this, by comparing the initial key sequence with the historical initial key sequence in the historical key sequence set, the ordered key sequence of the initial key sequence can be quickly determined, avoiding repeated sorting operations on the initial key sequence and improving the efficiency of request message parsing.

[0051] Furthermore, in another scenario, if there is no historical initial key sequence identical to the initial key sequence in the historical initial key sequence set, then a sorting operation needs to be performed on the initial key sequence. Specifically, after searching the historical initial key sequence based on the initial key sequence, the operation includes: if the search result is that there is no historical initial key sequence identical to the initial key sequence in the historical key sequence set, sorting the initial key sequence according to a preset sorting rule to obtain an ordered key sequence.

[0052] The preset sorting rule can be understood as the rule used to sort the key sequence. The preset sorting rule can be set by the user, such as sorting according to the alphabetical order of each key or the order of the number of letters in each key. By sorting the initial key sequence according to the preset sorting rule, an ordered key sequence can be obtained after sorting the initial key sequence.

[0053] In practical applications, if the request type of the target request is one that has not been processed before, or if the initial arrangement of the initial key sequence corresponding to the target request has not been processed before, then there is no historical initial key sequence in the historical key sequence set that is the same as the initial key sequence, and the initial key sequence needs to be sorted.

[0054] In a specific embodiment of this specification, referring to the above example, if there is no historical initial key sequence in the historical key sequence set that is the same as the initial key sequence, the initial key sequence is sorted according to a preset sorting rule. The preset sorting rule is to sort according to the alphabetical order of each key, and the sorted ordered key sequence is "B, D, E".

[0055] Therefore, by treating the initial key sequence as a whole and searching within a set of historical key sequences of multiple saved historical initial key sequences, the ordered key sequence of the initial key sequence can be quickly determined. In practice, the number of historical initial key sequences stored in the historical key sequence set can be limited, and historical initial key sequences with more matching times can be retained and those with fewer matching times can be deleted within a certain period. This reduces the search and traversal time of the initial key sequence and improves the processing efficiency of determining the ordered key sequence.

[0056] Step 206: Generate an ordered key-value pair set corresponding to the ordered key sequence based on the initial key-value pair set and the ordered key sequence.

[0057] The ordered key-value pair set can be understood as the set generated by determining the value corresponding to each key in the ordered key sequence and sorting each key and its corresponding value according to the ordered key sequence. The sorting rule of the ordered key-value pair set is the same as the sorting rule of the ordered key sequence. Therefore, after determining the initial key-value pair set and the ordered key sequence, the value corresponding to each key in the ordered key sequence can be determined, thereby generating the ordered key-value pair set corresponding to the ordered key sequence.

[0058] In a specific embodiment of this specification, referring to the above example, the initial key-value pair set is "E-1, B-2, D-4", the initial key sequence is "E, B, D", and the ordered key sequence is "B, D, E", thereby generating the ordered key-value pair set "B-2, D-4, E-1".

[0059] Furthermore, in order to ensure the generation of a correct ordered key-value pair set, the value of each key in the ordered key-value pair set can be determined based on the value of each key in the initial key-value pair set. Specifically, generating the ordered key-value pair set corresponding to the ordered key sequence based on the initial key-value pair set and the ordered key sequence includes: determining the ordered value sequence corresponding to the ordered key sequence based on the initial key-value pair set; and generating the ordered key-value pair set based on the ordered key sequence and the ordered value sequence.

[0060] In this context, an ordered value sequence can be understood as a value sequence generated from the value corresponding to each key in an ordered key sequence. The order of the values ​​in the ordered value sequence is determined by sorting the keys in the ordered key sequence. Therefore, after obtaining the value corresponding to each key in the initial key-value pair set, an ordered value sequence of the corresponding key values ​​can be generated according to the order of each key in the ordered key sequence. Then, the ordered key sequence and the ordered value sequence are combined to generate an ordered key-value pair set.

[0061] In a specific embodiment of this specification, referring to the above example, the ordered value sequence corresponding to the ordered key sequence is determined to be "2,4,1" based on the initial key-value pair set "E-1, B-2, D-4", and the ordered key-value pair set "B-2, D-4, E-1" is generated based on the ordered value sequence and the ordered key sequence.

[0062] Based on this, by determining the ordered value sequence corresponding to the ordered key sequence, the ordered key-value pair set corresponding to the ordered key sequence can be accurately generated, which facilitates the subsequent search for the target value from the ordered key-value pair set.

[0063] Step 208: Determine the key to be searched corresponding to the target request based on the request identification information, and determine the target value of the key to be searched based on the ordered key-value pair set.

[0064] The lookup key can be understood as the key whose value needs to be determined when parsing the target request. The target request task needs to be processed based on the lookup key and its target value. In practice, the lookup key is determined based on the service code that processes the target request. Therefore, the lookup key corresponding to the target request can be determined based on the request identifier information. For example, if the current target request is an identity information entry request, and the identity information to be entered into the database includes name, age, and occupation, then the lookup key determined based on the request identifier information of the target request is "name, age, job".

[0065] In practical applications, the receiver may have the same keys as those in the ordered key-value pair set and expect to obtain the values ​​corresponding to these keys. However, the receiver's keys may not be completely identical to those in the ordered key-value pair set. For example, if the version of the ordered key-value pair set is newer and new keys have been added, the new keys will be ignored; or if the version of the ordered key-value pair set is older and the key to be searched does not exist in the set, the target value corresponding to the key to be searched will be null.

[0066] In a specific embodiment of this specification, referring to the above example, the key to be searched for corresponding to the target request is determined as "A, B, E" based on the request identification information. The target value of the key to be searched is determined in the ordered key-value pair set. The target value of key A is empty, the target value of key B is 2, and the target value of key E is 1.

[0067] Furthermore, when determining the lookup key for the target request, it is necessary to determine it based on the request identification information. Specifically, determining the lookup key corresponding to the target request based on the request identification information includes: determining the request processing information corresponding to the target request based on the request identification information; determining at least one preset key corresponding to the request processing information in a preset key set and using it as the lookup key corresponding to the target request; or, using at least one preset key associated with the request processing information as the lookup key corresponding to the target request.

[0068] The request processing information can be understood as the request processing service code information corresponding to the target request. Based on the request processing information, the key to be searched corresponding to the target request can be selected from the preset key set. The preset key set includes all the keys of the receiver. Each request with a different request identifier corresponds to a different key to be searched. Therefore, after determining the request processing information corresponding to the target request, the key to be searched corresponding to the target request can be determined based on the request processing information.

[0069] In practical applications, request processing information can correspond to a preset key. After determining the request processing information of the target request, the preset key corresponding to the request processing information can be directly used as the lookup key for the target request, or a preset key can be selected from the preset key set according to the request processing information as the lookup key for the target request.

[0070] In a specific embodiment of this specification, referring to the above example, the request processing information of the target request is determined to be the input request processing information based on the request identification information, and multiple preset keys are selected from the preset key set as the search keys "A, B, E" based on the input request processing information.

[0071] In another specific embodiment of this specification, referring to the above example, the request processing information of the target request is determined to be the input request processing information based on the request identification information, and the preset key associated with the input request processing information is used as the search key "A, B, E".

[0072] Based on this, the lookup key for the target request can be determined by the request processing information, and the target request can then be processed based on the lookup key and its corresponding target value.

[0073] Furthermore, in order to quickly determine the target value of each lookup key, a search can be performed in an ordered set of key-value pairs. Specifically, determining the target value of the lookup key based on the ordered set of key-value pairs includes: comparing the lookup key with the ordered keys in the ordered set of key-value pairs; and determining the target value of the lookup key based on the comparison result.

[0074] Specifically, the key to be searched is compared with each ordered key in the ordered key-value pair set to identify the ordered key that is the same as the key to be searched. The value of the ordered key is then used as the target value of the key to be searched, thereby achieving the goal of finding and determining the target value of the key to be searched.

[0075] In practical applications, the comparison of any key to be searched includes: determining the target key to be searched among the keys to be searched, and determining the target ordered key in the ordered key-value pair set; comparing the target key to be searched and the target ordered key.

[0076] Here, the target key to be searched can be understood as a key to be searched determined from multiple keys to be searched. Next, the target value of the target key to be searched is searched. The target ordered key can be understood as an ordered key determined from multiple ordered keys. Next, the target ordered key is compared with the target key to be searched.

[0077] In practice, since both the key to be searched and the ordered key-value pair set are ordered, the smallest key to be searched and the smallest ordered key can be compared. Therefore, the target key to be searched and the target ordered key are also selected starting from the smallest. After selection, the two are compared, and the target value of the key to be searched is determined based on the comparison result.

[0078] Specifically, determining the target value of the key to be searched based on the comparison result includes: if the comparison result shows that the target key to be searched is less than the target ordered key, then using a null value as the target value of the target key to be searched; if the comparison result shows that the target key to be searched is equal to the target ordered key, then determining the target ordered value corresponding to the target ordered key in the set of ordered key-value pairs, and using the target ordered value as the target value corresponding to the target key to be searched.

[0079] Specifically, if the target key to be searched is less than the target ordered key, it means that there is no target value corresponding to the target key in the ordered key-value pair set, and the target value of the target key to be searched is null; if the target key to be searched is equal to the target ordered key, then the target ordered value of the target ordered key is taken as the target value corresponding to the target key to be searched.

[0080] In another scenario, determining the target value of the key to be searched based on the comparison result includes: if the comparison result indicates that the target key to be searched is greater than the target ordered key, re-determining the target ordered key according to a preset comparison order and the position of the target ordered key in the set of ordered key-value pairs, and returning to the step of comparing the target key to be searched and the target ordered key; until a target ordered key equal to the target key to be searched is determined in the set of ordered key-value pairs, the target ordered value corresponding to the target ordered key is determined in the set of ordered key-value pairs, and the target ordered value is used as the target value corresponding to the target key to be searched; or, if no target ordered key equal to the target key to be searched exists in the set of ordered key-value pairs, a null value is used as the target value of the target key to be searched.

[0081] When the target key to be searched is greater than the target ordered key, a new ordered key needs to be selected from the set of ordered key-value pairs as the target ordered key. The selection rule is to determine the next ordered key as the target ordered key according to the preset comparison rules and the position of the current target ordered key in the set. For example, if the target key to be searched is C, the current target ordered key is B, and the set of ordered key-value pairs is "B=1, C=2, D=3", then the comparison is performed from smallest to largest according to the preset comparison order, and the position of the target ordered key B in the set is used to re-determine the target ordered key as C. Then, the target ordered key C is compared with the target key to be searched, thus determining the target ordered key that is equal to the target key to be searched, and the target ordered value of this target ordered key is used as the target value of the target key to be searched. If, after re-determining the target ordered key, the comparison finds that the target ordered key is greater than the target key to be searched, it means that there is no ordered key in the set of ordered key-value pairs that is equal to the target key to be searched. In this case, a null value can be used as the target value of the target key to be searched.

[0082] In practical applications, since both the target key and the target ordered key are selected starting from the smallest, the target key and the target ordered key can be compared. Based on the comparison result, the target value of the target key can be determined. After determining the target value of the current target key, the comparison object for the next target key needs to be selected based on the comparison object of the current target key. For example, if the target keys are "A, C, D" and the ordered key-value pair set is "A=1, B=2, C=3, D=4", then after determining the target value of target key A, the next target key is C. The comparison object for target key C then starts from the ordered key B. Therefore, using this comparison method, the target values ​​of all target keys can be determined by traversing the ordered key-value pair set only once, thus reducing the process of determining the target value of the target key and improving message parsing efficiency.

[0083] In a specific embodiment of this specification, referring to the example above, the keys to be searched are "A, B, E", and the ordered key-value pair set is "B-2, D-4, E-1". The target key to be searched is determined to be A, and the target ordered key is determined to be B. The comparison result shows that the target key to be searched is less than the target ordered key, so the target value of the target key to be searched A is null. The target key to be searched is redefined as B, and the target ordered key is B again. The comparison result shows that the target key to be searched is equal to the target ordered key, so the target ordered value of the target ordered key B is taken as the target value of the target key to be searched B. The target key to be searched is redefined as E, and the target ordered key is determined to be D. The comparison result shows that the target key to be searched is greater than the target ordered key, so the target ordered key is redefined as E again. The comparison result shows that the target key to be searched is equal to the target ordered key, so the target ordered value of the target ordered key E is taken as the target value of the target key to be searched E. Finally, the target values ​​of the keys to be searched are determined to be A = null (null value), B = 2, and E = 1.

[0084] Based on this, by comparing the key to be searched with the ordered keys in the ordered key-value pair set using the above comparison method, the target value corresponding to each key to be searched can be determined by traversing the ordered key-value pair set only once. This reduces the need to repeatedly perform the operation of searching for the target value for each key to be searched, and improves the efficiency of determining the target value.

[0085] Furthermore, after determining the target value of the key to be searched, the task corresponding to the target request can be processed and the target request can be responded to. Specifically, after determining the target value of the key to be searched based on the ordered key-value pair set, the method further includes: generating a key-value pair to be processed corresponding to the target request based on the key to be searched and the target value; and executing the request task corresponding to the target request according to the key-value pair to be processed.

[0086] Among them, the key-value pair to be processed can be understood as a key-value pair generated by combining the key to be searched with the corresponding target value. The request task corresponding to the target request can be executed through the key-value pair to be processed. The request task can be understood as the task to be processed for the target request. By completing the request task of the target request, the task execution result can be returned to the sender of the target request, thereby realizing the response to the target request.

[0087] In a specific embodiment of this specification, referring to the above example, a key-value pair to be processed is generated based on the key to be searched and the target value as "A=null, B=2, E=1". The data entry task of the target request is processed based on the key-value pair to be processed, and the task execution result is obtained and fed back to the sender of the request.

[0088] This specification provides a message processing method, including determining and parsing a request message of a target request to obtain an initial key sequence corresponding to the request message and an initial key-value pair set corresponding to the initial key sequence; determining a historical key sequence set corresponding to the target request based on the request identifier information of the target request, and updating the initial key sequence to an ordered key sequence using the historical key sequence set; generating an ordered key-value pair set corresponding to the ordered key sequence based on the initial key-value pair set and the ordered key sequence; determining a lookup key corresponding to the target request based on the request identifier information, and determining the target value of the lookup key based on the ordered key-value pair set. This method achieves the goal of determining the corresponding ordered key sequence from the initial key sequence in the request message as a whole, thereby converting the initial key-value pair set corresponding to the initial key sequence into a sorted ordered key-value pair set. Subsequently, the target value of the lookup key is quickly determined based on the ordered key-value pair set, simplifying the value retrieval operation of the lookup key, improving the parsing speed of the request message, and facilitating rapid response to the target request.

[0089] The following is in conjunction with the appendix Figure 3 Taking the message processing method provided in this specification in the application of data query as an example, the message processing method will be further explained. Among other things, Figure 3 A flowchart illustrating the processing procedure of a message processing method according to an embodiment of this specification is shown, specifically including the following steps.

[0090] Step 302: Determine and parse the request message of the target request to obtain the initial key sequence corresponding to the request message and the initial key-value pair set corresponding to the initial key sequence.

[0091] In one feasible approach, the target request is a data query request. After parsing the request message of this data query request, the corresponding initial key sequence is determined to be "name, age, job", and the initial key-value pair set is "name=A, age=20, job=B".

[0092] Step 304: Determine the request type of the target request based on the request identifier information of the target request, and select the historical key sequence set corresponding to the target request from the historical key sequence set group based on the request type.

[0093] In one feasible approach, the request type of the target request is determined to be a data query type based on the request identifier information of the target request, and a set of historical key sequences of the data query type is selected from the set of historical key sequences.

[0094] Step 306: Search the set of historical key sequences based on the initial key sequence.

[0095] In one feasible approach, the initial key sequence is compared with the historical initial key sequence in the historical key sequence set. If the search result shows that there is a historical initial key sequence in the historical key sequence set that is the same as the initial key sequence, the historical ordered key sequence of the historical initial key sequence is taken as the ordered key sequence of the initial key sequence, and the ordered key sequence is "age, job, name".

[0096] Step 308: Determine the ordered value sequence corresponding to the ordered key sequence based on the initial key-value pair set, and generate an ordered key-value pair set based on the ordered key sequence and the ordered value sequence.

[0097] In one feasible approach, an ordered sequence of values ​​is determined as “20, B, A”, and an ordered set of key-value pairs is generated as “age = 20, job = B, name = A”.

[0098] Step 310: Determine the request processing information corresponding to the target request based on the request identification information, determine the preset key corresponding to the request processing information in the preset key set, and use it as the lookup key corresponding to the target request.

[0099] In one feasible approach, the corresponding request processing information is determined to be query processing based on the request identifier information. The corresponding preset keys are determined to be "age, job, name, sex" in the preset key set. The search keys for the target request are "age, job, name, sex", representing age, occupation, name, and gender, respectively.

[0100] Step 312: Compare the key to be searched with the ordered keys in the ordered key-value pair set, and determine the target value of the key to be searched based on the comparison result.

[0101] In one feasible approach, the key to be searched, "age, job, name, sex", is compared with the ordered set of key-value pairs "age=20, job=B, name=A". Based on the comparison result, the target values ​​for the key to be searched are determined to be "20, B, A, null".

[0102] Step 314: Generate a key-value pair to be processed corresponding to the target request based on the key to be searched and the target value, and execute the request task corresponding to the target request according to the key-value pair to be processed.

[0103] In one feasible approach, a key-value pair to be processed, "age=20, job=B, nameA, sex=null", is generated. A data query task is performed based on this key-value pair, and the retrieved data is returned to the sender as the task execution result.

[0104] This specification provides a message processing method that determines the corresponding ordered key sequence by treating the initial key sequence in the request message as a whole, thereby transforming the initial key-value pair set corresponding to the initial key sequence into a sorted ordered key-value pair set. Subsequently, the target value of the key to be searched is quickly determined based on the ordered key-value pair set, simplifying the value retrieval operation of the key to be searched, improving the parsing speed of the request message, and facilitating a rapid response to the target request.

[0105] Corresponding to the above method embodiments, this specification also provides embodiments of a message processing apparatus. Figure 4 A schematic diagram of a message processing apparatus according to one embodiment of this specification is shown. Figure 4 As shown, the device includes:

[0106] The parsing module 402 is configured to determine and parse the request message of the target request to obtain the initial key sequence corresponding to the request message and the initial key-value pair set corresponding to the initial key sequence.

[0107] The update module 404 is configured to determine the set of historical key sequences corresponding to the target request based on the request identifier information of the target request, and update the initial key sequence to an ordered key sequence using the set of historical key sequences;

[0108] The generation module 406 is configured to generate an ordered key-value pair set corresponding to the ordered key sequence based on the initial key-value pair set and the ordered key sequence;

[0109] The determination module 408 is configured to determine the key to be searched corresponding to the target request based on the request identification information, and to determine the target value of the key to be searched based on the ordered key-value pair set.

[0110] Optionally, the update module 404 is further configured to determine the request type of the target request based on the request identifier information of the target request; and select the historical key sequence set corresponding to the target request from the historical key sequence set group based on the request type.

[0111] Optionally, the update module 404 is further configured to search in the historical key sequence set based on the initial key sequence; if the search result shows that there is a historical initial key sequence in the historical key sequence set that is the same as the initial key sequence, the historical ordered key sequence of the historical initial key sequence is used as the ordered key sequence of the initial key sequence.

[0112] Optionally, the update module 404 is further configured to sort the initial key sequence according to a preset sorting rule to obtain an ordered key sequence if the search result shows that there is no historical initial key sequence in the historical key sequence set that is the same as the initial key sequence.

[0113] Optionally, the generation module 406 is further configured to determine the ordered value sequence corresponding to the ordered key sequence based on the initial key-value pair set; and to generate an ordered key-value pair set based on the ordered key sequence and the ordered value sequence.

[0114] Optionally, the determining module 408 is further configured to determine the request processing information corresponding to the target request based on the request identification information; determine at least one preset key corresponding to the request processing information in a preset key set and use it as the lookup key corresponding to the target request; or, use at least one preset key associated with the request processing information as the lookup key corresponding to the target request.

[0115] Optionally, the determining module 408 is further configured to compare the key to be searched with the ordered keys in the ordered key-value pair set; and determine the target value of the key to be searched based on the comparison result.

[0116] Optionally, the determining module 408 is further configured to determine a target key to be searched in the keys to be searched, and to determine a target ordered key in the set of ordered key-value pairs; and to compare the target key to be searched and the target ordered key.

[0117] Optionally, the determining module 408 is further configured to: if the comparison result shows that the target key to be searched is less than the target ordered key, use a null value as the target value of the target key to be searched; if the comparison result shows that the target key to be searched is equal to the target ordered key, determine the target ordered value corresponding to the target ordered key in the set of ordered key-value pairs, and use the target ordered value as the target value corresponding to the target key to be searched.

[0118] Optionally, the determining module 408 is further configured to, if the comparison result shows that the target key to be searched is greater than the target ordered key, re-determine the target ordered key according to a preset comparison order and the position of the target ordered key in the ordered key-value pair set, and return to the step of comparing the target key to be searched and the target ordered key; until a target ordered key equal to the target key to be searched is determined in the ordered key-value pair set, the target ordered value corresponding to the target ordered key is determined in the ordered key-value pair set, and the target ordered value is used as the target value corresponding to the target key to be searched; or, if no target ordered key equal to the target key to be searched exists in the ordered key-value pair set, use a null value as the target value of the target key to be searched.

[0119] Optionally, the device further includes an execution module configured to generate a key-value pair to be processed corresponding to the target request based on the key to be searched and the target value; and to execute a request task corresponding to the target request according to the key-value pair to be processed.

[0120] This specification provides a message processing apparatus, comprising: a parsing module configured to determine and parse a request message of a target request to obtain an initial key sequence corresponding to the request message and an initial key-value pair set corresponding to the initial key sequence; an updating module configured to determine a historical key sequence set corresponding to the target request based on request identifier information of the target request, and update the initial key sequence to an ordered key sequence using the historical key sequence set; a generating module configured to generate an ordered key-value pair set corresponding to the ordered key sequence based on the initial key-value pair set and the ordered key sequence; and a determining module configured to determine a lookup key corresponding to the target request based on the request identifier information, and determine the target value of the lookup key based on the ordered key-value pair set. This apparatus achieves the goal of determining the corresponding ordered key sequence from the initial key sequence in the request message as a whole, thereby converting the initial key-value pair set corresponding to the initial key sequence into a sorted ordered key-value pair set. Subsequently, the target value of the lookup key is quickly determined based on the ordered key-value pair set, simplifying the value retrieval operation of the lookup key, improving the parsing speed of the request message, and facilitating rapid response to the target request.

[0121] The above is an illustrative scheme of a message processing apparatus according to this embodiment. It should be noted that the technical solution of this message processing apparatus and the technical solution of the message processing method described above belong to the same concept. For details not described in detail in the technical solution of the message processing apparatus, please refer to the description of the technical solution of the message processing method described above.

[0122] Figure 5 A structural block diagram of a computing device 500 according to one embodiment of this specification is shown. The components of the computing device 500 include, but are not limited to, a memory 510 and a processor 520. The processor 520 is connected to the memory 510 via a bus 530, and a database 550 is used to store data.

[0123] The computing device 500 also includes an access device 540, which enables the computing device 500 to communicate via one or more networks 560. Examples of these networks include Public Switched Telephone Network (PSTN), Local Area Network (LAN), Wide Area Network (WAN), Personal Area Network (PAN), or combinations of communication networks such as the Internet. The access device 540 may include one or more of any type of wired or wireless network interface (e.g., a network interface controller (NIC)), such as an IEEE 802.11 Wireless Local Area Network (WLAN) wireless interface, a Wi-MAX (Worldwide Interoperability for Microwave Access) interface, an Ethernet interface, a Universal Serial Bus (USB) interface, a cellular network interface, a Bluetooth interface, or a Near Field Communication (NFC) interface.

[0124] In one embodiment of this specification, the above-described components of the computing device 500 and Figure 5 Other components, not shown, can also be connected to each other, for example, via a bus. It should be understood that... Figure 5 The block diagram of the computing device shown is for illustrative purposes only and is not intended to limit the scope of this specification. Those skilled in the art can add or replace other components as needed.

[0125] Computing device 500 can be any type of stationary or mobile computing device, including mobile computers or mobile computing devices (e.g., tablet computers, personal digital assistants, laptop computers, notebook computers, netbooks, etc.), mobile phones (e.g., smartphones), wearable computing devices (e.g., smartwatches, smart glasses, etc.) or other types of mobile devices, or stationary computing devices such as desktop computers or personal computers (PCs). Computing device 500 can also be a mobile or stationary server.

[0126] The processor 520 is configured to execute the following computer-executable instructions, which, when executed by the processor, implement the steps of the above-described message processing method.

[0127] The above is an illustrative scheme of a computing device according to this embodiment. It should be noted that the technical solution of this computing device and the technical solution of the above-described message processing method belong to the same concept. For details not described in detail in the technical solution of the computing device, please refer to the description of the technical solution of the above-described message processing method.

[0128] An embodiment of this specification also provides a computer-readable storage medium storing computer-executable instructions that, when executed by a processor, implement the steps of the above-described message processing method.

[0129] The above is an illustrative scheme of a computer-readable storage medium according to this embodiment. It should be noted that the technical solution of this storage medium and the technical solution of the above-described message processing method belong to the same concept. For details not described in detail in the technical solution of the storage medium, please refer to the description of the technical solution of the above-described message processing method.

[0130] An embodiment of this specification also provides a computer program, wherein when the computer program is executed in a computer, it causes the computer to perform the steps of the above-described message processing method.

[0131] The above is an illustrative scheme of a computer program according to this embodiment. It should be noted that the technical solution of this computer program and the technical solution of the above-described message processing method belong to the same concept. For details not described in detail in the technical solution of the computer program, please refer to the description of the technical solution of the above-described message processing method.

[0132] The foregoing has described specific embodiments of this specification. Other embodiments are within the scope of the appended claims. In some cases, the actions or steps recited in the claims may be performed in a different order than that shown in the embodiments and may still achieve the desired result. Furthermore, the processes depicted in the drawings do not necessarily require the specific or sequential order shown to achieve the desired result. In some embodiments, multitasking and parallel processing are possible or may be advantageous.

[0133] The computer instructions include computer program code, which may be in the form of source code, object code, executable file, or certain intermediate forms. The computer-readable medium may include: any entity or device capable of carrying the computer program code, recording media, USB flash drive, portable hard drive, magnetic disk, optical disk, computer memory, read-only memory (ROM), random access memory (RAM), electrical carrier signals, telecommunication signals, and software distribution media, etc. It should be noted that the content included in the computer-readable medium may be appropriately added or removed according to the requirements of patent practice. For example, in some regions, according to patent practice, computer-readable media may not include electrical carrier signals and telecommunication signals.

[0134] It should be noted that, for the sake of simplicity, the foregoing method embodiments are all described as a series of actions. However, those skilled in the art should understand that the embodiments in this specification are not limited to the described order of actions, because according to the embodiments in this specification, some steps can be performed in other orders or simultaneously. Furthermore, those skilled in the art should also understand that the embodiments described in this specification are all preferred embodiments, and the actions and modules involved are not necessarily essential to the embodiments in this specification.

[0135] In the above embodiments, the descriptions of each embodiment have different focuses. For parts not described in detail in a certain embodiment, please refer to the relevant descriptions of other embodiments.

[0136] The preferred embodiments disclosed above are merely illustrative of this specification. The optional embodiments do not exhaustively describe all details, nor do they limit the invention to the specific implementations described. Clearly, many modifications and variations can be made based on the embodiments described herein. These embodiments are selected and specifically described in this specification to better explain the principles and practical applications of the embodiments, thereby enabling those skilled in the art to better understand and utilize this specification. This specification is limited only by the claims and their full scope and equivalents.

Claims

1. A message processing method, characterized in that, include: Determine and parse the request message of the target request to obtain the initial key sequence corresponding to the request message and the initial key-value pair set corresponding to the initial key sequence; Based on the request identifier information of the target request, the historical key sequence set corresponding to the target request is determined in the historical key sequence set group, and the initial key sequence is updated to an ordered key sequence using the historical key sequence set. The historical key sequence set includes a historical initial key sequence and a corresponding historical ordered key sequence, and the historical ordered key sequence is obtained by sorting and updating the historical initial key sequence. Based on the initial set of key-value pairs and the ordered key sequence, generate an ordered set of key-value pairs corresponding to the ordered key sequence; The key to be searched corresponding to the target request is determined based on the request identification information, and the target value of the key to be searched is determined based on the ordered key-value pair set.

2. The method according to claim 1, characterized in that, Based on the request identifier information of the target request, determine the historical key sequence set corresponding to the target request in the historical key sequence set group, including: The request type of the target request is determined based on the request identifier information of the target request; Based on the request type, select the historical key sequence set corresponding to the target request from the historical key sequence set group.

3. The method according to claim 1, characterized in that, Updating the initial key sequence to an ordered key sequence using the historical key sequence set includes: Based on the initial key sequence, a search is performed in the historical key sequence set; If the search result shows that there is a historical initial key sequence in the historical key sequence set that is the same as the initial key sequence, then the historical ordered key sequence of the historical initial key sequence is taken as the ordered key sequence of the initial key sequence.

4. The method according to claim 3, characterized in that, After searching the historical key sequence set based on the initial key sequence, the process includes: If the search result shows that there is no historical initial key sequence in the set of historical key sequences that is the same as the initial key sequence, the initial key sequence is sorted according to a preset sorting rule to obtain an ordered key sequence.

5. The method according to claim 1, characterized in that, Based on the initial set of key-value pairs and the ordered key sequence, an ordered set of key-value pairs corresponding to the ordered key sequence is generated, including: Determine the ordered value sequence corresponding to the ordered key sequence based on the initial set of key-value pairs; An ordered key-value pair set is generated based on the ordered key sequence and the ordered value sequence.

6. The method according to claim 1, characterized in that, Determining the lookup key corresponding to the target request based on the request identification information includes: The request processing information corresponding to the target request is determined based on the request identification information; Determine at least one preset key corresponding to the request processing information from the preset key set, and use it as the lookup key corresponding to the target request; or, use at least one preset key associated with the request processing information as the lookup key corresponding to the target request.

7. The method according to claim 1, characterized in that, Determining the target value of the key to be searched based on the ordered set of key-value pairs includes: The key to be searched is compared with the ordered keys in the ordered key-value pair set; The target value of the key to be searched is determined based on the comparison results.

8. The method according to claim 7, characterized in that, The comparison of any key to be searched includes: The target key to be searched is determined from the keys to be searched, and the target ordered key is determined from the set of ordered key-value pairs; Compare the target key to be searched with the target ordered key.

9. The method according to claim 8, characterized in that, Determining the target value of the key to be searched based on the comparison results includes: If the comparison result shows that the target key to be searched is less than the target ordered key, then a null value is used as the target value of the target key to be searched. If the comparison result shows that the target key to be searched is equal to the target ordered key, the target ordered value corresponding to the target ordered key is determined in the set of ordered key-value pairs, and the target ordered value is used as the target value corresponding to the target key to be searched.

10. The method according to claim 8, characterized in that, Determining the target value of the key to be searched based on the comparison results includes: If the comparison result shows that the target key to be searched is greater than the target ordered key, the target ordered key is re-determined according to the preset comparison order and the position of the target ordered key in the set of ordered key-value pairs, and the process returns to the step of comparing the target key to be searched and the target ordered key. Until a target ordered key equal to the target search key is determined in the ordered key-value pair set, a target ordered value corresponding to the target ordered key is determined in the ordered key-value pair set, and the target ordered value is used as the target value corresponding to the target search key; or... If there is no target ordered key in the ordered key-value pair set that is equal to the target key to be searched, then a null value is used as the target value of the target key to be searched.

11. The method according to any one of claims 1-10, characterized in that, After determining the target value of the key to be searched based on the ordered set of key-value pairs, the method further includes: Generate a key-value pair to be processed corresponding to the target request based on the key to be searched and the target value; Execute the request task corresponding to the target request based on the key-value pair to be processed.

12. A message processing apparatus, characterized in that, include: The parsing module is configured to determine and parse the request message of the target request to obtain the initial key sequence corresponding to the request message and the initial key-value pair set corresponding to the initial key sequence. The update module is configured to determine the historical key sequence set corresponding to the target request in the historical key sequence set group based on the request identifier information of the target request, and update the initial key sequence to an ordered key sequence using the historical key sequence set, wherein the historical key sequence set includes a historical initial key sequence and a corresponding historical ordered key sequence, and the historical ordered key sequence is obtained by sorting and updating the historical initial key sequence; The generation module is configured to generate an ordered set of key-value pairs corresponding to the ordered key sequence based on the initial set of key-value pairs and the ordered key sequence. The determination module is configured to determine the key to be searched corresponding to the target request based on the request identification information, and to determine the target value of the key to be searched based on the ordered key-value pair set.

13. A computing device, characterized in that, include: Memory and processor; The memory is used to store computer-executable instructions, and the processor is used to execute the computer-executable instructions, which, when executed by the processor, implement the steps of the method according to any one of claims 1 to 11.

14. A computer-readable storage medium, characterized in that, It stores computer-executable instructions that, when executed by a processor, implement the steps of the method according to any one of claims 1 to 11.

Images