Information processing method and device, electronic equipment and computer readable storage medium

By automatically checking the source object to the target object in interface docking, the problem of high development and maintenance costs caused by frequent interface docking in the prior art is solved, and more efficient and accurate information processing is achieved.

CN119440671APending Publication Date: 2025-02-14BEIJING JINGDONG QIANSHITECHNOLOGY CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202310942876.7
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2023-07-28
Publication Date
2025-02-14

AI Technical Summary

Technical Problem

In the prior art, each interface docking requires the code to be modified to adapt to the interface changes of the supplier, resulting in high development and maintenance costs, and the efficiency and accuracy of interface docking and subsequent information processing cannot be guaranteed.

Method used

In response to receiving the information processing request, the source object is checked according to the source object's attribute information to obtain the source object verification result; then the source object is processed according to the predetermined mapping relationship to obtain the target key-value relationship; finally, according to the target object The attribute information processes the target key-value relationship to obtain the target object. This method realizes automatic conversion from source object to target object through automatic checksum mapping.

Benefits of technology

It improves the efficiency of object conversion and interface docking, thereby improving the accuracy of subsequent information processing and reducing development and maintenance costs.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119440671A_ABST
    Figure CN119440671A_ABST
Patent Text Reader

Abstract

The invention provides an information processing method and device, electronic equipment and a computer readable storage medium, which can be applied to the technical fields of computers and internet. The information processing method comprises the following steps: in response to a received information processing request, performing attribute verification on a source object in the information processing request according to source object attribute information to obtain a source object verification result; the source object verification result is responded to represent that the source object passes the attribute verification, the source object is processed according to a preset mapping relation, at least one target key value relation is obtained, and the target key value relation comprises target key information and target value information corresponding to the target key information; according to the target object attribute information, processing the at least one piece of target key information and target value information corresponding to the at least one piece of target key information to obtain a target object; the source object attribute information, the predetermined mapping relation and the target object attribute information are determined according to the service identifier.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present disclosure relates to the fields of computer technology and Internet technology, and more specifically, to an information processing method and device, an electronic device, a computer-readable storage medium, and a computer program product. Background Art

[0002] With the development of computer technology, computer systems can be used to connect with different suppliers, and different suppliers can maintain different equipment.

[0003] Different devices can use interfaces to call programs or functions. Interfaces can refer to the basic entry point for users to use computer systems, and upper-level applications can use computers through interfaces provided by computer systems.

[0004] In the process of realizing the concepts disclosed herein, the inventors discovered that there are at least the following problems in the related art: since the code needs to be modified each time the interface is connected to adapt to the interface changes of the supplier, the development and maintenance costs are high, and therefore the efficiency and accuracy of the interface connection and subsequent information processing cannot be guaranteed. Summary of the invention

[0005] In view of this, the present disclosure provides an information processing method and apparatus, an electronic device, a computer-readable storage medium, and a computer program product.

[0006] According to one aspect of the present disclosure, there is provided an information processing method, comprising: in response to receiving an information processing request, performing attribute verification on a source object in the information processing request according to source object attribute information to obtain a source object verification result, wherein the information processing request also includes a business identifier corresponding to the business to be processed; in response to the source object verification result indicating that the source object passes the attribute verification, processing the source object according to a predetermined mapping relationship to obtain at least one target key-value relationship, wherein the target key-value relationship includes target key information and target value information corresponding to the target key information; and processing the at least one target key information and the target value information corresponding to each of the at least one target key information according to the target object attribute information to obtain a target object; wherein the source object attribute information, the predetermined mapping relationship and the target object attribute information are determined according to the business identifier.

[0007] According to an embodiment of the present disclosure, the above-mentioned source object includes at least one source node identifier and source node information corresponding to each of the above-mentioned at least one source node identifier, and the above-mentioned predetermined mapping relationship includes at least one mapping rule.

[0008] According to an embodiment of the present disclosure, in response to the source object verification result characterizing that the source object has passed the attribute verification, the source object is processed according to a predetermined mapping relationship to obtain at least one target key-value relationship, including: in response to the source object verification result characterizing that the source object has passed the attribute verification, according to the source node information corresponding to each of the at least one source node identifier, a source node key-value relationship corresponding to each of the at least one source node identifier is constructed; and according to the at least one mapping rule, the source node key-value relationships corresponding to each of the at least one source node identifier are processed respectively to obtain the target key-value relationships corresponding to each of the at least one target node identifier.

[0009] According to an embodiment of the present disclosure, the above-mentioned constructing a source node key-value relationship corresponding to each of the above-mentioned at least one source node identifier based on the source node information corresponding to each of the above-mentioned at least one source node identifier includes: for each source node identifier in the above-mentioned at least one source node identifier, determining the source key information and the source value information corresponding to the above-mentioned source key information based on the above-mentioned source node information corresponding to the above-mentioned source node identifier; and constructing a source node key-value relationship corresponding to the above-mentioned source node identifier based on the above-mentioned source key information and the source value information corresponding to the above-mentioned source key information.

[0010] According to an embodiment of the present disclosure, the above-mentioned mapping rule includes target key information corresponding to the target node identifier. The above-mentioned processing of the source node key-value relationship corresponding to each of the above-mentioned at least one source node identifier respectively according to the above-mentioned at least one mapping rule to obtain the above-mentioned target key-value relationship corresponding to each of the at least one target node identifier includes: for each mapping rule in the above-mentioned at least one mapping rule, in the above-mentioned at least one source node identifier, determining the above-mentioned at least one source node identifier to be mapped corresponding to the above-mentioned mapping rule; processing the source value information corresponding to each of the above-mentioned at least one source node identifier to be mapped according to the above-mentioned mapping rule and the source key information corresponding to each of the above-mentioned at least one source node identifier to be mapped to obtain the target value information corresponding to the above-mentioned target node identifier; and constructing the above-mentioned target key-value relationship corresponding to the above-mentioned target node identifier according to the above-mentioned target key information and the above-mentioned target value information corresponding to the above-mentioned target node identifier.

[0011] According to an embodiment of the present disclosure, the target object attribute information includes target node identifiers corresponding to each of the N target nodes and association relationships between the N target node identifiers.

[0012] According to an embodiment of the present disclosure, the above-mentioned at least one target key information and the target value information corresponding to the above-mentioned at least one target key information are processed according to the target object attribute information to obtain the target object, including: constructing a target object template according to the association relationship between the above-mentioned N target node identifiers and the target key information corresponding to the above-mentioned N target node identifiers, wherein the above-mentioned target object template includes the above-mentioned at least one target key information; and determining the above-mentioned target object according to the above-mentioned target object template and the target value information corresponding to the above-mentioned at least one target key information.

[0013] According to an embodiment of the present disclosure, the above-mentioned information processing method also includes: in response to detecting an information configuration request, determining, according to the candidate service identifier in the above-mentioned information configuration request, the M candidate source nodes corresponding to the above-mentioned candidate service identifier, the source node configuration information of each of the above-mentioned M candidate source nodes, the N candidate target nodes, the target node configuration information of each of the above-mentioned N candidate target nodes, and the mapping relationship between the above-mentioned M candidate source nodes and the above-mentioned N candidate target nodes, wherein M and N are both positive integers; determining the candidate source object attribute information according to the source node configuration information of each of the above-mentioned M candidate source nodes and the above-mentioned M candidate source nodes; determining the candidate target object attribute information according to the target node configuration information of each of the above-mentioned N candidate target nodes and the above-mentioned N candidate target nodes; determining the above-mentioned candidate predetermined mapping relationship according to the mapping relationship between the above-mentioned M candidate source nodes and the above-mentioned N candidate target nodes; and associating and storing the above-mentioned candidate service identifier, the above-mentioned candidate source object attribute information, the above-mentioned candidate predetermined mapping relationship and the above-mentioned candidate target object attribute information to the data source.

[0014] According to an embodiment of the present disclosure, the above-mentioned source object includes at least one source node identifier and source node information corresponding to each of the above-mentioned at least one source node identifier.

[0015] According to an embodiment of the present disclosure, the above-mentioned candidate source object attribute information includes candidate source node identifiers, source node data types, source node parameter requirements and predetermined source node parameter thresholds corresponding to each of the above-mentioned M candidate source nodes.

[0016] According to an embodiment of the present disclosure, the above-mentioned data source includes at least one candidate service identifier and candidate source object attribute information corresponding to each of the above-mentioned at least one candidate service identifier.

[0017] According to an embodiment of the present disclosure, in response to receiving an information processing request, performing attribute verification on the source object in the information processing request according to the source object attribute information to obtain the source object verification result includes: in response to receiving the information processing request, matching the at least one candidate business identifier in the data source according to the business identifier in the information processing request to obtain the target business identifier; determining the candidate source object attribute information corresponding to the target business identifier as the source object attribute information; and performing attribute verification on the source object according to the source node data type, the source node parameter requirement and the predetermined source node parameter threshold corresponding to the source object attribute information to obtain the source object verification result.

[0018] According to an embodiment of the present disclosure, the above-mentioned source object is subjected to attribute verification according to the above-mentioned source node data type corresponding to the above-mentioned source object attribute information, the above-mentioned source node parameter requirement and the above-mentioned predetermined source node parameter threshold, and the above-mentioned source object verification result is obtained, which includes: for each source node identifier in the above-mentioned at least one source node identifier, according to the above-mentioned source node parameter requirement, the source node information corresponding to the above-mentioned source node identifier is verified to obtain a parameter requirement verification result; in response to the above-mentioned parameter requirement verification result indicating that the above-mentioned source node information passes the parameter requirement verification, according to the above-mentioned source node data type, the source node information corresponding to the above-mentioned source node identifier is verified to obtain a data type verification result; in response to the above-mentioned data type verification result indicating that the above-mentioned source node information passes the data type verification, according to the above-mentioned predetermined source node parameter threshold, the source node information corresponding to the above-mentioned source node identifier is verified to obtain a parameter verification result; and in response to the above-mentioned parameter verification result indicating that the above-mentioned source node information passes the parameter threshold verification, the above-mentioned source object verification result indicating that the above-mentioned source object passes the attribute verification is determined.

[0019] According to another aspect of the present disclosure, an information processing device is provided, including: a verification module, for, in response to receiving an information processing request, performing attribute verification on the source object in the above information processing request according to source object attribute information to obtain a source object verification result, wherein the above information processing request also includes a business identifier corresponding to the business to be processed; a first processing module, for, in response to the above source object verification result indicating that the above source object has passed the attribute verification, processing the above source object according to a predetermined mapping relationship to obtain at least one target key-value relationship, wherein the above target key-value relationship includes target key information and target value information corresponding to the above target key information; and a second processing module, for processing the above at least one target key information and the target value information corresponding to each of the above at least one target key information according to the target object attribute information to obtain a target object; wherein the above source object attribute information, the above predetermined mapping relationship and the above target object attribute information are determined according to the above business identifier.

[0020] According to another aspect of the present disclosure, an electronic device is provided, comprising: one or more processors; and a memory for storing one or more instructions, wherein when the one or more instructions are executed by the one or more processors, the one or more processors implement the method as described above.

[0021] According to another aspect of the present disclosure, a computer-readable storage medium is provided, on which executable instructions are stored. When the executable instructions are executed by a processor, the processor implements the method described above.

[0022] According to another aspect of the present disclosure, a computer program product is provided. The computer program product includes computer executable instructions. When the computer executable instructions are executed, they are used to implement the method described above.

[0023] According to an embodiment of the present disclosure, after receiving an information processing request, the source object attribute information, the predetermined mapping relationship and the target object attribute information are automatically determined according to the business identifier, which is conducive to improving the efficiency of subsequent information processing. Since the source object verification result is obtained by performing attribute verification on the source object in the information processing request according to the source object attribute information, at least one target key-value relationship is obtained by processing the source object according to the predetermined mapping relationship when the source object verification result indicates that the source object has passed the attribute verification, thereby enabling automatic verification and mapping of the source object. On this basis, by processing at least one target key-value relationship according to the target object attribute information to obtain the target object, since the conversion from the source object to the target object can be automatically performed, it at least partially overcomes the technical problem in the related art that each time the interface docking is performed, the code needs to be modified to adapt to the interface changes of the supplier, resulting in high development and maintenance costs, thereby improving the efficiency of object conversion and interface docking, and thus improving the accuracy of subsequent information processing. BRIEF DESCRIPTION OF THE DRAWINGS

[0024] The above and other objects, features and advantages of the present disclosure will become more apparent through the following description of the embodiments of the present disclosure with reference to the accompanying drawings, in which:

[0025] Figure 1 The system architecture to which the information processing method according to the embodiment of the present disclosure can be applied is schematically shown;

[0026] Figure 2 The flowchart of the information processing method according to the embodiment of the present disclosure is schematically shown;

[0027] Figure 3 An example schematic diagram schematically shows an information configuration process according to an embodiment of the present disclosure;

[0028] Figure 4 The following schematically shows an example of a process of performing attribute verification on a source object in an information processing request according to source object attribute information to obtain a source object verification result in response to receiving an information processing request according to an embodiment of the present disclosure;

[0029] Figure 5A An example schematic diagram schematically shows a process of constructing a source node key-value relationship according to an embodiment of the present disclosure;

[0030] Figure 5B An example schematic diagram schematically shows a process of constructing a target node key-value relationship according to an embodiment of the present disclosure;

[0031] Figure 6 An example schematic diagram schematically shows an information processing process according to an embodiment of the present disclosure;

[0032] Figure 7 A block diagram schematically shows an information processing device according to an embodiment of the present disclosure; and

[0033] Figure 8 A block diagram of an electronic device suitable for implementing an information processing method according to an embodiment of the present disclosure is schematically shown. DETAILED DESCRIPTION

[0034] Hereinafter, embodiments of the present disclosure will be described with reference to the accompanying drawings. However, it should be understood that these descriptions are exemplary only and are not intended to limit the scope of the present disclosure. In the following detailed description, for ease of explanation, many specific details are set forth to provide a comprehensive understanding of the embodiments of the present disclosure. However, it is apparent that one or more embodiments may also be implemented without these specific details. In addition, in the following description, descriptions of known structures and technologies are omitted to avoid unnecessary confusion of the concepts of the present disclosure.

[0035] The terms used herein are only for describing specific embodiments and are not intended to limit the present disclosure. The terms "comprise", "include", etc. used herein indicate the existence of the features, steps, operations and / or components, but do not exclude the existence or addition of one or more other features, steps, operations or components.

[0036] All terms (including technical and scientific terms) used herein have the meanings commonly understood by those skilled in the art, unless otherwise defined. It should be noted that the terms used herein should be interpreted as having a meaning consistent with the context of this specification, and should not be interpreted in an idealized or overly rigid manner.

[0037] When using expressions such as "at least one of A, B, and C, etc.", they should generally be interpreted according to the meaning of the expression commonly understood by those skilled in the art (for example, "a system having at least one of A, B, and C" should include but is not limited to a system having A alone, B alone, C alone, A and B, A and C, B and C, and / or A, B, C, etc.).

[0038] In the embodiments of the present disclosure, the collection, updating, analysis, processing, use, transmission, provision, disclosure, storage, etc. of the data involved (for example, including but not limited to user personal information) are in compliance with the provisions of relevant laws and regulations, are used for legitimate purposes, and do not violate public order and good morals. In particular, necessary measures are taken for user personal information to prevent illegal access to user personal information data and maintain the security of user personal information, network security, and national security.

[0039] In the embodiments of the present disclosure, the user's authorization or consent is obtained before obtaining or collecting the user's personal information.

[0040] For example, after receiving an information processing request, your information can be desensitized using methods including de-identification or anonymization to protect the security of your information.

[0041] An interface can refer to the basic entrance for users to use a computer system. Upper-level applications can use the computer through the interface provided by the computer system. By setting up an interface, it is possible to effectively call the functions of an existing external system.

[0042] However, since each interface connection requires code modification to adapt to the supplier's interface changes, the development and maintenance costs are high, and the efficiency and accuracy of interface connection and subsequent information processing cannot be guaranteed.

[0043] In order to at least partially solve the technical problems existing in the related art, the present disclosure provides an information processing method and device, an electronic device and a computer-readable storage medium, which can be applied to the fields of computer technology and Internet technology. The information processing method includes: in response to receiving an information processing request, according to the source object attribute information, performing attribute verification on the source object in the information processing request to obtain the source object verification result, wherein the information processing request also includes the business identifier corresponding to the business to be processed; in response to the source object verification result indicating that the source object passes the attribute verification, according to the predetermined mapping relationship, the source object is processed to obtain at least one target key-value relationship, wherein the target key-value relationship includes target key information and target value information corresponding to the target key information; according to the target object attribute information, at least one target key information and the target value information corresponding to each of the at least one target key information are processed to obtain the target object; the source object attribute information, the predetermined mapping relationship and the target object attribute information are determined according to the business identifier.

[0044] Figure 1 The system architecture to which the information processing method can be applied according to the embodiment of the present disclosure is schematically shown. It should be noted that: Figure 1 What is shown is merely an example of a system architecture to which the embodiments of the present disclosure can be applied, in order to help those skilled in the art understand the technical content of the present disclosure, but it does not mean that the embodiments of the present disclosure cannot be used in other devices, systems, environments or scenarios.

[0045] like Figure 1 As shown, the system architecture 100 according to this embodiment may include a first terminal device 101, a second terminal device 102, a third terminal device 103, a network 104 and a server 105. The network 104 is used to provide a medium for a communication link between the first terminal device 101, the second terminal device 102, the third terminal device 103 and the server 105. The network 104 may include various connection types, such as wired, wireless communication links or optical fiber cables, etc.

[0046] The user may use at least one of the first terminal device 101, the second terminal device 102, and the third terminal device 103 to interact with the server 105 through the network 104 to receive or send messages, etc. Various communication client applications may be installed on the first terminal device 101, the second terminal device 102, and the third terminal device 103, such as shopping applications, web browser applications, search applications, instant messaging tools, email clients, social platform software, etc. (only as examples).

[0047] The first terminal device 101, the second terminal device 102, and the third terminal device 103 may be various electronic devices having display screens and supporting web browsing, including but not limited to smart phones, tablet computers, laptop computers, desktop computers, and the like.

[0048] The server 105 may be a server that provides various services, such as a background management server (only as an example) that provides support for websites browsed by users using the first terminal device 101, the second terminal device 102, and the third terminal device 103. The background management server may analyze and process the received data such as user requests, and feed back the processing results (such as web pages, information, or data obtained or generated according to user requests) to the terminal device.

[0049] It should be noted that the information processing method provided in the embodiment of the present disclosure can generally be executed by the server 105. Accordingly, the information processing device provided in the embodiment of the present disclosure can generally be set in the server 105. The information processing method provided in the embodiment of the present disclosure can also be executed by a server or server cluster that is different from the server 105 and can communicate with the first terminal device 101, the second terminal device 102, the third terminal device 103 and / or the server 105. Accordingly, the information processing device provided in the embodiment of the present disclosure can also be set in a server or server cluster that is different from the server 105 and can communicate with the first terminal device 101, the second terminal device 102, the third terminal device 103 and / or the server 105.

[0050] Alternatively, the information processing method provided in the embodiment of the present disclosure may also be executed by the first terminal device 101, the second terminal device 102, or the third terminal device 103, or may also be executed by other terminal devices different from the first terminal device 101, the second terminal device 102, or the third terminal device 103. Accordingly, the information processing apparatus provided in the embodiment of the present disclosure may also be provided in the first terminal device 101, the second terminal device 102, or the third terminal device 103, or may be provided in other terminal devices different from the first terminal device 101, the second terminal device 102, or the third terminal device 103.

[0051] It should be understood that Figure 1 The number of the first terminal device, the second terminal device or the third terminal device, the network and the server in the embodiment is only for illustration. According to the implementation requirements, there may be any number of the first terminal device, the second terminal device or the third terminal device, the network and the server.

[0052] It should be noted that the sequence numbers of the operations in the following method are only used as representations of the operations for the purpose of description, and should not be regarded as representing the execution order of the operations. Unless explicitly stated, the method does not need to be executed completely in the order shown.

[0053] Figure 2 The flowchart of the information processing method according to the embodiment of the present disclosure is schematically shown.

[0054] like Figure 2 As shown, the information processing method 200 includes operations S210 to S230.

[0055] In operation S210, in response to receiving the information processing request, the source object in the information processing request is subjected to attribute verification according to the source object attribute information to obtain a source object verification result, wherein the information processing request also includes a service identifier corresponding to the service to be processed.

[0056] In operation S220, in response to the source object verification result indicating that the source object passes the attribute verification, the source object is processed according to a predetermined mapping relationship to obtain at least one target key-value relationship, wherein the target key-value relationship includes target key information and target value information corresponding to the target key information.

[0057] In operation S230, at least one target key information and target value information corresponding to the at least one target key information are processed according to the target object attribute information to obtain the target object.

[0058] According to an embodiment of the present disclosure, source object attribute information, a predetermined mapping relationship, and target object attribute information may be determined according to a service identifier.

[0059] According to an embodiment of the present disclosure, the information processing method may be applicable to a warehouse management scenario. The warehouse management scenario may include a warehouse management system (WMS), a warehouse control system (WCS) and a warehouse execution device.

[0060] According to an embodiment of the present disclosure, a warehouse management system can be used to coordinate the in-and-out information and storage information of all goods in a warehouse, and provide the above information to a warehouse control system. The warehouse control system can be used to determine the tasks of each warehouse execution device based on the in-and-out information and storage information of the goods, and distribute the determined tasks to the corresponding warehouse execution device. The warehouse execution device can refer to multiple unmanned devices arranged in the warehouse for moving, transporting or lifting goods.

[0061] According to an embodiment of the present disclosure, the code for generating an information processing request can be pre-written into a first script. When information processing is required, the user can run the first script through a terminal device to generate an information processing request message, and send the information processing request message to a server, so that the server can determine the information corresponding to the business identifier based on the business identifier in the information processing request message, and process the source object to obtain the target object.

[0062] According to an embodiment of the present disclosure, at least one candidate service identifier, candidate source object attribute information corresponding to each of the at least one candidate service identifier, candidate predetermined mapping relationship, and candidate target object attribute information may be pre-configured in the data source. After obtaining the information processing request, at least one candidate service identifier in the data source may be matched according to the service identifier in the information processing request to obtain the target service identifier. On this basis, the information corresponding to the target service identifier may be determined as the source object attribute information, the predetermined mapping relationship, and the target object attribute information.

[0063] According to an embodiment of the present disclosure, a service identifier can be used to characterize different services to be processed. The source object attribute information, the predetermined mapping relationship and the target object attribute information can correspond to the service to be processed, that is, the source object attribute information, the predetermined mapping relationship and the target object attribute information can be determined according to the service identifier.

[0064] According to an embodiment of the present disclosure, a source object may refer to an input entity for interface docking. A source object may include at least one source node. Source object attribute information may refer to a structural description of an input entity. The source object attribute information may include source node information corresponding to each of the at least one source nodes. After obtaining the source object attribute information, an attribute check may be performed on the source object according to the source object attribute information to obtain a source object check result. The attribute check may include at least one of the following: parameter requirement check, data type check, and parameter check, etc. The source object check result may be used to characterize whether the source object passes the attribute check.

[0065] According to an embodiment of the present disclosure, the predetermined mapping relationship may include at least one mapping rule. The mapping rule may be used to perform data mapping between a source node and a target node. When the source object verification result indicates that the source object has passed the attribute verification, the source object may be processed according to the predetermined mapping relationship to obtain at least one target key information and target value information corresponding to each of the at least one target key information.

[0066] According to an embodiment of the present disclosure, the target object attribute information may indicate a structural description of a reference entity. The target object attribute information may include target node information corresponding to at least one target node. After obtaining at least one target key-value relationship, at least one target key information and target value information corresponding to at least one target key information may be processed according to the target object attribute information to obtain a target object. The target object may refer to an output reference entity for interface docking. The target object may include at least one target node.

[0067] According to the embodiments of the present disclosure, the data structure description language of the source object and the target object can be configured according to actual business needs, which is not limited here. For example, the data structure description language of the source object and the target object can include at least one of the following: JSON (JavaScript Object Notation, a lightweight data exchange format), XML (eXtensible Markup Language, extensible markup language), YAML (YAML Ain't MarkupLanguage, a human-friendly data serialization format) and Protocol Buffers (i.e., a binary data serialization protocol), etc.

[0068] According to an embodiment of the present disclosure, after receiving an information processing request, the source object attribute information, the predetermined mapping relationship and the target object attribute information are automatically determined according to the business identifier, which is conducive to improving the efficiency of subsequent information processing. Since the source object verification result is obtained by performing attribute verification on the source object in the information processing request according to the source object attribute information, at least one target key-value relationship is obtained by processing the source object according to the predetermined mapping relationship when the source object verification result indicates that the source object has passed the attribute verification, thereby enabling automatic verification and mapping of the source object. On this basis, by processing at least one target key-value relationship according to the target object attribute information to obtain the target object, since the conversion from the source object to the target object can be automatically performed, it at least partially overcomes the technical problem in the related art that each time the interface docking is performed, the code needs to be modified to adapt to the interface changes of the supplier, resulting in high development and maintenance costs, thereby improving the efficiency of object conversion and interface docking, and thus improving the accuracy of subsequent information processing.

[0069] Reference below Figure 3 , Figure 4 , Figure 5A , Figure 5B and Figure 6 , the information processing method 200 according to the embodiment of the present invention is further explained.

[0070] According to an embodiment of the present disclosure, the information processing method 200 may further include the following operations.

[0071] In response to detecting an information configuration request, according to the candidate service identifier in the information configuration request, determine the M candidate source nodes corresponding to the candidate service identifier, the source node configuration information of each of the M candidate source nodes, the N candidate target nodes, the target node configuration information of each of the N candidate target nodes, and the mapping relationship between the M candidate source nodes and the N candidate target nodes, wherein M and N are both positive integers. According to the source node configuration information of each of the M candidate source nodes and the M candidate source nodes, determine the candidate source object attribute information. According to the target node configuration information of each of the N candidate target nodes and the N candidate target nodes, determine the candidate target object attribute information. According to the mapping relationship between the M candidate source nodes and the N candidate target nodes, determine the candidate predetermined mapping relationship. The candidate service identifier, the candidate source object attribute information, the candidate predetermined mapping relationship, and the candidate target object attribute information are associated and stored in the data source.

[0072] According to an embodiment of the present disclosure, in a warehouse management scenario, the warehouse control system needs to connect to different suppliers and different types of equipment in order to control and integrate different equipment and complete business processes. Since different equipment has different suppliers and types, the interfaces of the equipment are also different. According to the candidate business identifiers corresponding to different business scenarios, information corresponding to the candidate business identifiers can be pre-configured to facilitate dynamic conversion between source objects and target objects, that is, interface resolution can be achieved through configuration.

[0073] According to an embodiment of the present disclosure, the code for generating an information configuration request can be pre-written into a second script. When information configuration is required, the user can run the second script through a terminal device to generate an information configuration request message, and send the information configuration request message to a server, so that the server can determine information related to the candidate business identifier based on the candidate business identifier in the information configuration request message, and associate the candidate business identifier and the information related to the candidate business identifier and store them in a data source.

[0074] According to an embodiment of the present disclosure, information related to a candidate service identifier may include candidate source object attribute information, candidate predetermined mapping relationship, and candidate target object attribute information. The candidate source object attribute information may be determined based on source node configuration information of each of the M candidate source nodes and the M candidate source nodes. The candidate target object attribute information may be determined based on target node configuration information of each of the N candidate target nodes and the N candidate target nodes. The candidate predetermined mapping relationship may be determined based on a mapping relationship between the M candidate source nodes and the N candidate target nodes.

[0075] According to the embodiments of the present disclosure, since the candidate source object attribute information is determined based on the source node configuration information of each of the M candidate source nodes and the M candidate source nodes, the candidate target object attribute information is determined based on the target node configuration information of each of the N candidate target nodes and the N candidate target nodes, and the candidate predetermined mapping relationship is determined based on the mapping relationship between the M candidate source nodes and the N candidate target nodes, the automatic determination of the information related to the candidate business identifier is achieved. On this basis, by associating and storing the candidate business identifier, the candidate source object attribute information, the candidate predetermined mapping relationship and the candidate target object attribute information to the data source, the information related to the business identifier is automatically determined after receiving the information processing request, thereby improving the efficiency of information processing.

[0076] Figure 3 An example schematic diagram of an information configuration process according to an embodiment of the present disclosure is schematically shown.

[0077] like Figure 3 As shown, in 300, in response to detecting an information configuration request 301, the M candidate source nodes 302 corresponding to the candidate business identifier 3011, the source node configuration information 303 of each of the M candidate source nodes 302, the N candidate target nodes 304, the target node configuration information 305 of each of the N candidate target nodes 304, and the mapping relationship 306 between the M candidate source nodes 302 and the N candidate target nodes 304 can be determined based on the candidate business identifier 3011 in the information configuration request 301.

[0078] The candidate source object attribute information 307 may be determined based on the M candidate source nodes 302 and the source node configuration information 303 of each of the M candidate source nodes 302. The candidate target object attribute information 308 may be determined based on the N candidate target nodes 304 and the target node configuration information 305 of each of the N candidate target nodes 304. The candidate predetermined mapping relationship 309 may be determined based on the mapping relationship 306 between the M candidate source nodes 302 and the N candidate target nodes 304.

[0079] On this basis, the candidate business identifier 3011 , the candidate source object attribute information 307 , the candidate predetermined mapping relationship 309 and the candidate target object attribute information 308 may be associated and stored in the data source 310 .

[0080] According to an embodiment of the present disclosure, operation S210 may include the following operations.

[0081] In response to receiving the information processing request, at least one candidate service identifier in the data source is matched according to the service identifier in the information processing request to obtain the target service identifier. The candidate source object attribute information corresponding to the target service identifier is determined as the source object attribute information. According to the source node data type, source node parameter requirement and predetermined source node parameter threshold corresponding to the source object attribute information, the source object is attribute-checked to obtain the source object verification result.

[0082] According to an embodiment of the present disclosure, a source object may include at least one source node identifier and source node information corresponding to each of the at least one source node identifier.

[0083] According to an embodiment of the present disclosure, the candidate source object attribute information may include a candidate source node identifier corresponding to each of the M candidate source nodes, a source node data type, a source node parameter requirement, and a predetermined source node parameter threshold.

[0084] According to an embodiment of the present disclosure, a data source may include at least one candidate service identifier and candidate source object attribute information corresponding to each of the at least one candidate service identifier.

[0085] According to an embodiment of the present disclosure, after obtaining an information processing request, at least one candidate service identifier can be matched according to the service identifier in the information processing request to determine the target service identifier. On this basis, the candidate source object attribute information corresponding to the target service identifier can be determined as the source object attribute information.

[0086] According to an embodiment of the present disclosure, a source object may refer to an input entity to be converted. A source object may include at least one source node and source node information corresponding to each of the at least one source node. At least one source node may constitute a tree structure. The candidate source object attribute information may be used to describe the source object, that is, it may be used to define the hierarchical relationship of at least one source node. The candidate source object attribute information may include a candidate source node identifier corresponding to each of the at least one candidate source node, a source node data type, a source node parameter requirement, and a predetermined source node parameter threshold.

[0087] According to an embodiment of the present disclosure, the candidate source node identifier can be used to characterize the node name of the candidate source node. The source node data type can be used to characterize the data type of the candidate source node. The data type can include at least one of the following: an object data type (i.e., object), an array data type (i.e., array), a string data type (i.e., string), an integer data type (i.e., integer) or a floating point data type (i.e., number) and a Boolean type (i.e., boolean).

[0088] According to an embodiment of the present disclosure, a source node parameter requirement may be used to characterize whether information of a candidate source node must be input. The source node parameter requirement may include one of the following: required input and optional input. A predetermined source node parameter threshold may be used to characterize the maximum and minimum values ​​of a candidate source node. For example, a predetermined source node parameter threshold may include 1 and 10. In this case, it may be characterized that the source node parameter needs to be between 1 and 10.

[0089] According to an embodiment of the present disclosure, after determining the attribute information of the source object, the attribute verification of the source object can be performed according to the source node data type, source node parameter requirements and predetermined source node parameter threshold corresponding to the attribute information of the source object to obtain the source object verification result. The source object verification result can be used to indicate whether the source object has passed the attribute verification.

[0090] According to an embodiment of the present disclosure, performing attribute verification on a source object according to source node data type, source node parameter requirements and predetermined source node parameter thresholds corresponding to source object attribute information, and obtaining a source object verification result may include the following operations.

[0091] For each source node identifier of at least one source node identifier, the source node information corresponding to the source node identifier is verified according to the source node parameter requirement to obtain a parameter requirement verification result. In response to the parameter requirement verification result indicating that the source node information passes the parameter requirement verification, the source node information corresponding to the source node identifier is verified according to the source node data type to obtain a data type verification result. In response to the data type verification result indicating that the source node information passes the data type verification, the source node information corresponding to the source node identifier is verified according to a predetermined source node parameter threshold to obtain a parameter verification result. In response to the parameter verification result indicating that the source node information passes the parameter threshold verification, a source object verification result indicating that the source object passes the attribute verification is determined.

[0092] According to an embodiment of the present disclosure, after determining the source object attribute information, the source node information corresponding to the source node identifier can be verified according to the source node parameter requirement to obtain a parameter requirement verification result. The source node parameter requirement can be used to verify whether the source node information corresponding to the source node identifier must be input. The parameter requirement verification result can be used to characterize whether the source node information passes the parameter requirement verification.

[0093] According to an embodiment of the present disclosure, when the parameter requirement verification result indicates that the source node information has not passed the parameter requirement verification, the source node that has not passed the parameter requirement verification can be marked, the first warning information indicating that the source node has not passed the parameter requirement verification can be output, and the source object verification result indicating that the source object has not passed the attribute verification can be determined. Alternatively, when the parameter requirement verification result indicates that the source node information has passed the parameter requirement verification, the data type verification can continue to be performed on the source node information.

[0094] According to an embodiment of the present disclosure, the source node information corresponding to the source node identifier can be verified according to the source node data type to obtain a data type verification result. The source node data type can be used to verify whether the data type of the source node information corresponding to the source node identifier is correct. The data type verification result can be used to indicate whether the source node information passes the data type verification.

[0095] According to an embodiment of the present disclosure, when the data type verification result indicates that the source node information has not passed the data type verification, the source node that has not passed the data type verification can be marked, a second warning message indicating that the source node has not passed the data type verification can be output, and a source object verification result indicating that the source object has not passed the attribute verification can be determined. Alternatively, when the data type verification result indicates that the source node information has passed the data type verification, parameter verification can continue to be performed on the source node information.

[0096] According to an embodiment of the present disclosure, the source node information corresponding to the source node identifier can be verified according to a predetermined source node parameter threshold to obtain a parameter verification result. The predetermined source node parameter threshold can be used to verify whether the source node information corresponding to the source node identifier meets the predetermined parameter threshold. The parameter verification result can be used to characterize whether the source node information passes the parameter verification.

[0097] According to an embodiment of the present disclosure, when the parameter verification result indicates that the source node information has not passed the parameter verification, the source node that has not passed the parameter verification can be marked, and a source object verification result indicating that the source object has not passed the attribute verification can be determined. Alternatively, when the parameter verification result indicates that the source node information has passed the parameter verification, a source object verification result indicating that the source object has passed the attribute verification can be determined.

[0098] According to the embodiments of the present disclosure, since the source object attribute information is determined based on the candidate source object attribute information corresponding to the target business identifier, and the target business identifier is obtained by matching at least one candidate business identifier in the data source according to the business identifier in the information processing request, the source object attribute information is automatically determined according to the business identifier. On this basis, since the source object verification result is obtained by performing attribute verification on the source object according to the source node data type, source node parameter requirements and predetermined source node parameter threshold corresponding to the source object attribute information, the source object verification result can be used to characterize whether the source object passes the attribute verification, thereby realizing automatic verification of the source object, thereby improving the accuracy of information processing.

[0099] Figure 4 The diagram schematically shows an example process of performing attribute verification on a source object in an information processing request according to source object attribute information in response to receiving an information processing request according to an embodiment of the present disclosure to obtain a source object verification result.

[0100] like Figure 4 As shown, in 400, in response to receiving the information processing request 401, at least one candidate business identifier 402 in the data source is matched according to the business identifier 4011 in the information processing request 401 to obtain the target business identifier 403. The candidate source object attribute information corresponding to the target business identifier 403 can be determined as the source object attribute information 404.

[0101] According to the source node parameter requirement 4041 in the source object attribute information 404, the source node information corresponding to the source node identifier may be verified to obtain a parameter requirement verification result 405. After obtaining the parameter requirement verification result 405, operation S410 may be performed.

[0102] In operation S410, does the parameter requirement verification result indicate that the source node information passes the parameter requirement verification? If not, the attribute verification process can be terminated. If so, the source node information corresponding to the source node identifier can be verified according to the source node data type in the source object attribute information 404 to obtain the data type verification result 406. After obtaining the parameter requirement verification result 406, operation S420 can be performed.

[0103] In operation S420, does the data type verification result indicate that the source node information passes the data type verification? If not, the attribute verification process can be terminated. If so, the source node information corresponding to the source node identifier can be verified according to the predetermined source node parameter threshold in the source object attribute information 404 to obtain the parameter verification result 407. After obtaining the parameter requirement verification result 407, operation S430 can be performed.

[0104] In operation S430, does the parameter verification result indicate that the source node information has passed the parameter threshold verification? If not, the attribute verification process can be terminated. If so, a source object verification result 408 indicating that the source object has passed the attribute verification can be determined.

[0105] According to an embodiment of the present disclosure, operation S220 may include the following operations.

[0106] In response to the source object verification result indicating that the source object passes the attribute verification, a source node key-value relationship corresponding to each of the at least one source node identifiers is constructed according to the source node information corresponding to each of the at least one source node identifiers. According to at least one mapping rule, the source node key-value relationship corresponding to each of the at least one source node identifiers is processed respectively to obtain a target key-value relationship corresponding to each of the at least one target node identifiers.

[0107] According to an embodiment of the present disclosure, the source object may include at least one source node identifier and source node information corresponding to each of the at least one source node identifier. The predetermined mapping relationship may include at least one mapping rule.

[0108] According to an embodiment of the present disclosure, when the source object verification result indicates that the source object has passed the attribute verification, for each source node identifier in at least one source node identifier, a source node key-value relationship corresponding to the source node identifier can be constructed according to the source node information corresponding to the source node identifier. The source node key-value relationship may include source key information (i.e., source Key) and source value information (i.e., source Value) corresponding to the source key information.

[0109] According to an embodiment of the present disclosure, after obtaining the source node key-value relationship corresponding to each of at least one source node identifier, at least one source node identifier corresponding to the mapping rule can be determined for each of at least one mapping rule. On this basis, the source node key-value relationship corresponding to each of the at least one source node identifier can be processed according to the mapping rule to obtain a target key-value relationship corresponding to the target node identifier. The target key-value relationship may include target key information (i.e., target Key) and target value information (i.e., target Value) corresponding to the target key information.

[0110] According to an embodiment of the present disclosure, based on source node information corresponding to at least one source node identifier, constructing a source node key-value relationship corresponding to each of the at least one source node identifiers may include the following operations.

[0111] For each source node identifier in at least one source node identifier, source key information and source value information corresponding to the source key information are determined according to source node information corresponding to the source node identifier. A source node key-value relationship corresponding to the source node identifier is constructed according to the source key information and the source value information corresponding to the source key information.

[0112] According to an embodiment of the present disclosure, when the source object verification result indicates that the source object has passed the attribute verification, the source object data can be sorted according to the source node based on the source node identifier, that is, the tree structure can be sorted into key-value pairs according to the hierarchy.

[0113] According to an embodiment of the present disclosure, the process of constructing a source node key-value relationship corresponding to at least one source node identifier according to source node information corresponding to at least one source node identifier is described below by taking source object A as an example. For example, source object A is as follows.

[0114]

[0115] According to an embodiment of the present disclosure, source object A may include three source node identifiers. The source node key-value relationship corresponding to source node identifier 1 may be represented as ReceiveTask.taskId="1011", and the source node key-value relationship corresponding to source node identifier 3 may be represented as ReceiveTask.containerNo="240101".

[0116] According to an embodiment of the present disclosure, the source node identifier 2 may include three sub-source node identifiers, namely ReceiveTask.location.x = "11", ReceiveTask.location.y = "22", and ReceiveTask.location.z = "33". On this basis, the source node key-value relationship corresponding to the source node identifier 2 can be expressed as ReceiveTask.location = {"x": "11", "y": "22", "z": "33"}. The key-value relationship corresponding to the source object A can be ReceiveTask = {"taskId": "1011", "location": {"x": "11", "y": "22", "z": "33"}, "containerNo": "240101"}.

[0117] Figure 5A An example schematic diagram of a process of constructing a source node key-value relationship according to an embodiment of the present disclosure is schematically shown.

[0118] like Figure 5A As shown, in 500A, source key information 503_1 and source value information 503_2 corresponding to source key information 503_1 can be determined according to source node information 502 corresponding to source node identifier 501. On this basis, source node key-value relationship 504 corresponding to source node identifier 501 can be constructed according to source key information 503_1 and source value information 503_2 corresponding to source key information 503_1.

[0119] According to an embodiment of the present disclosure, according to at least one mapping rule, source node key-value relationships corresponding to at least one source node identifier are processed separately to obtain target key-value relationships corresponding to at least one target node identifier, which may include the following operations.

[0120] For each mapping rule in at least one mapping rule, at least one source node identifier to be mapped corresponding to the mapping rule is determined in at least one source node identifier. According to the mapping rule and the source key information corresponding to the at least one source node identifier to be mapped, the source value information corresponding to the at least one source node identifier to be mapped is processed to obtain the target value information corresponding to the target node identifier. According to the target key information and the target value information corresponding to the target node identifier, a target key-value relationship corresponding to the target node identifier is constructed.

[0121] According to an embodiment of the present disclosure, the mapping rule may include target key information corresponding to the target node identifier.

[0122] According to an embodiment of the present disclosure, a mapping rule may refer to an expression set. An expression set may include at least one expression. An expression may refer to a data conversion rule from a source node to a target node. An expression may be used to characterize how to generate another value from a set of values. Expressions may include mathematical logic operators, relational operators, regular expressions, bitwise operation logic, and the like. The method of converting a source node to a target node according to an expression may be configured according to actual business needs and is not limited here. For example, an expression evaluation engine may be used to convert a source node to a target node according to an expression. The expression evaluation engine may include at least one of the following: Aviator, MVEL (i.e., MVFLEX ExpressionLanguage), OGNL (i.e., Object-Graph Navigation Language), and Jeval.

[0123] According to an embodiment of the present disclosure, source key information and source value information can be used as parameters of an expression to calculate the value of the expression, and the result is assigned to the target value information to form a target key-value relationship. The following takes mapping rule B as an example to illustrate the process of processing the source node key-value relationship corresponding to at least one source node identifier respectively according to the mapping rule to obtain the target key-value relationship corresponding to the target node identifier. For example, mapping rule B is as follows.

[0124]

[0125] According to the embodiment of the present disclosure, the source node identifier 2 to be mapped corresponding to the mapping rule B can be determined, and the source value information corresponding to the source node identifier 2 to be mapped is processed according to the mapping rule B and the source key information corresponding to the source node identifier 2 to be mapped, so as to obtain the target value information "112233" corresponding to the target node identifier 4. On this basis, according to the target key information "WcsTask.destination" corresponding to the target node identifier 4 and the target value information "112233", the target key-value relationship WcsTask.destination="112233" corresponding to the target node identifier 4 can be constructed.

[0126] According to an embodiment of the present disclosure, the following takes mapping rule C as an example to illustrate the process of processing the source node key-value relationship corresponding to at least one source node identifier respectively according to the mapping rule to obtain the target key-value relationship corresponding to the target node identifier respectively. For example, mapping rule C is as follows.

[0127]

[0128] According to the embodiment of the present disclosure, the source node identifier 1 to be mapped corresponding to the mapping rule C can be determined, and the source value information corresponding to the source node identifier 1 to be mapped is processed according to the mapping rule C and the source key information corresponding to the source node identifier 1 to be mapped, so as to obtain the target value information "1011" corresponding to the target node identifier 5. On this basis, according to the target key information "WcsTask.deviceTaskNo" corresponding to the target node identifier 5 and the target value information "WCS1011", the target key-value relationship WcsTask.deviceTaskNo="WCS1011" corresponding to the target node identifier 5 can be constructed.

[0129] According to an embodiment of the present disclosure, the following takes mapping rule D as an example to illustrate the process of processing the source node key-value relationship corresponding to at least one source node identifier respectively according to the mapping rule to obtain the target key-value relationship corresponding to the target node identifier respectively. For example, mapping rule D is as follows.

[0130]

[0131] According to the embodiment of the present disclosure, the source node identifier 3 to be mapped corresponding to the mapping rule D can be determined, and the source value information corresponding to the source node identifier 3 to be mapped can be processed according to the mapping rule D and the source key information corresponding to the source node identifier 3 to be mapped, so as to obtain the target value information "WCS240101" corresponding to the target node identifier 6. On this basis, according to the target key information "WcsTask.containerNo" corresponding to the target node identifier 6 and the target value information "WCS240101", the target key-value relationship WcsTask.contamerNo="WCS240101" corresponding to the target node identifier 6 can be constructed.

[0132] According to the embodiments of the present disclosure, since the target key-value relationship is obtained by processing the source node key-value relationship corresponding to the source node identifier according to the mapping rules, and the source node key-value relationship is constructed according to the source node information corresponding to the source node identifier, it is possible to realize automatic conversion mapping of the source node key-value relationship to the target key-value relationship based on the mapping rules, thereby improving the efficiency of object conversion and facilitating improving the accuracy of subsequent interface docking and information processing.

[0133] Figure 5B An example schematic diagram of a process of constructing a target node key-value relationship according to an embodiment of the present disclosure is schematically shown.

[0134] like Figure 5B As shown, in 500B, for each mapping rule 505 in at least one mapping rule 505, at least one to-be-mapped source node identifier 507 corresponding to the mapping rule 505 can be determined in at least one source node identifier 506.

[0135] The source value information corresponding to at least one source node identifier 507 to be mapped can be processed according to the mapping rule 505 and the source key information corresponding to at least one source node identifier 507 to be mapped to obtain the target value information 508 corresponding to the target node identifier.

[0136] On this basis, a target key-value relationship 510 corresponding to the target node identifier can be constructed according to the target key information 509 and the target value information 508 corresponding to the target node identifier.

[0137] According to an embodiment of the present disclosure, operation S230 may include the following operations.

[0138] According to the association relationship between the N target node identifiers and the target key information corresponding to each of the N target node identifiers, a target object template is constructed, wherein the target object template includes at least one target key information. According to the target object template and the target value information corresponding to each of the at least one target key information, a target object is determined.

[0139] According to an embodiment of the present disclosure, the target object attribute information may include a target node identifier corresponding to each of the N target nodes and an association relationship between the N target node identifiers.

[0140] According to an embodiment of the present disclosure, the target object attribute information may indicate a structural description of a reference entity, and is used to define a hierarchical relationship of the reference entity. The target object attribute information may include target node information corresponding to at least one target node. The target object attribute information may include a target node identifier, a target node data type, a target node parameter requirement, and a predetermined target node parameter threshold.

[0141] According to an embodiment of the present disclosure, the process of constructing a target object template according to the association relationship between N target node identifiers and the target key information corresponding to each of the N target node identifiers is described in combination with the above example. For example, the target object template can be constructed according to the target key information "WcsTask.destination" corresponding to the target node identifier 4, the target key information "WcsTask.deviceTaskNo" corresponding to the target node identifier 5, and the target key information "WcsTask.containerNo" corresponding to the target node identifier 6 as shown below.

[0142]

[0143] According to an embodiment of the present disclosure, after obtaining a target object template, the target object can be determined according to the target object template and the target value information corresponding to at least one target key information. For example, the target object can be constructed as shown below according to the target value information "112233" corresponding to the target key information "WcsTask.destination", the target value information "WCS1011" corresponding to the target key information "WcsTask.deviceTaskNo", and the target value information "WCS240101" corresponding to the target key information "WcsTask.containerNo".

[0144]

[0145] Figure 6 An example schematic diagram of an information processing process according to an embodiment of the present disclosure is schematically shown.

[0146] like Figure 6As shown, in 600, in response to receiving an information processing request 601, a target business identifier can be obtained by matching the business identifier 601_1 in the information processing request 601 and at least one candidate business identifier 602_1 in the data source 602. On this basis, source object attribute information 603, a predetermined mapping relationship 604, and target object attribute information 605 can be determined according to the target business identifier.

[0147] According to the source object attribute information 603, the source object 601_2 in the information processing request 601 may be subjected to attribute verification to obtain a source object verification result 606. In response to the source object verification result 606 indicating that the source object 601_2 passes the attribute verification, the source object 601_2 may be processed according to the predetermined mapping relationship 604 to obtain at least one target key-value relationship 607.

[0148] On this basis, the target key information and the target value information corresponding to at least one target key-value relationship 607 can be processed according to the target object attribute information 605 to obtain the target object 608.

[0149] The above are only exemplary embodiments, but are not limited thereto, and may also include other information processing methods known in the art, as long as they can improve the efficiency of object conversion and interface docking, thereby improving the accuracy of subsequent information processing.

[0150] Figure 7 The block diagram schematically shows an information processing device according to an embodiment of the present disclosure.

[0151] like Figure 7 As shown, the information processing device 700 may include a verification module 710 , a first processing module 720 , and a second processing module 730 .

[0152] The verification module 710 is used to respond to receiving an information processing request and perform attribute verification on the source object in the information processing request according to the source object attribute information to obtain a source object verification result, wherein the information processing request also includes a business identifier corresponding to the business to be processed.

[0153] The first processing module 720 is used to process the source object in response to the source object verification result indicating that the source object has passed the attribute verification according to a predetermined mapping relationship to obtain at least one target key-value relationship, wherein the target key-value relationship includes target key information and target value information corresponding to the target key information.

[0154] The second processing module 730 is used to process at least one target key information and target value information corresponding to the at least one target key information according to the target object attribute information to obtain the target object.

[0155] According to an embodiment of the present disclosure, source object attribute information, a predetermined mapping relationship, and target object attribute information are determined according to a service identifier.

[0156] According to an embodiment of the present disclosure, the source object includes at least one source node identifier and source node information corresponding to each of the at least one source node identifier, and the predetermined mapping relationship includes at least one mapping rule.

[0157] According to an embodiment of the present disclosure, the first processing module 720 may include a first construction submodule and a processing submodule.

[0158] The first construction submodule is used to construct a source node key-value relationship corresponding to at least one source node identifier in response to the source object verification result indicating that the source object has passed the attribute verification and according to the source node information corresponding to at least one source node identifier.

[0159] The processing submodule is used to process the source node key-value relationship corresponding to at least one source node identifier respectively according to at least one mapping rule to obtain the target key-value relationship corresponding to at least one target node identifier respectively.

[0160] According to an embodiment of the present disclosure, the first construction submodule may include a first determining unit and a first construction unit.

[0161] The first determination unit is used to determine, for each source node identifier in at least one source node identifier, source key information and source value information corresponding to the source key information according to source node information corresponding to the source node identifier.

[0162] The first construction unit is used to construct a source node key-value relationship corresponding to the source node identifier according to the source key information and the source value information corresponding to the source key information.

[0163] According to an embodiment of the present disclosure, the mapping rule includes target key information corresponding to the target node identifier.

[0164] According to an embodiment of the present disclosure, the processing submodule may include a second determining unit, a processing unit, and a second constructing unit.

[0165] The second determining unit is configured to determine, for each mapping rule in the at least one mapping rule, at least one source node identifier to be mapped corresponding to the mapping rule from the at least one source node identifier.

[0166] The processing unit is used to process the source value information corresponding to at least one source node identifier to be mapped according to the mapping rule and the source key information corresponding to at least one source node identifier to be mapped, so as to obtain the target value information corresponding to the target node identifier.

[0167] The second construction unit is used to construct a target key-value relationship corresponding to the target node identifier according to the target key information and target value information corresponding to the target node identifier.

[0168] According to an embodiment of the present disclosure, the target object attribute information includes target node identifiers corresponding to each of the N target nodes and association relationships between the N target node identifiers.

[0169] According to an embodiment of the present disclosure, the second processing module 730 may include a second construction submodule and a first determination submodule.

[0170] The second construction submodule is used to construct a target object template according to the association relationship between the N target node identifiers and the target key information corresponding to each of the N target node identifiers, wherein the target object template includes at least one target key information.

[0171] The first determination submodule is used to determine the target object according to the target object template and the target value information corresponding to at least one target key information.

[0172] According to an embodiment of the present disclosure, the information processing device 700 may further include a first determination module, a second determination module, a third determination module, a fourth determination module and an associated storage module.

[0173] The first determination module is used to determine, in response to detecting an information configuration request, M candidate source nodes corresponding to the candidate service identifier, source node configuration information of each of the M candidate source nodes, N candidate target nodes, target node configuration information of each of the N candidate target nodes, and a mapping relationship between the M candidate source nodes and the N candidate target nodes according to the candidate service identifier in the information configuration request, wherein M and N are both positive integers.

[0174] The second determination module is used to determine the candidate source object attribute information according to the M candidate source nodes and the source node configuration information of each of the M candidate source nodes.

[0175] The third determination module is used to determine the candidate target object attribute information according to the N candidate target nodes and the target node configuration information of each of the N candidate target nodes.

[0176] The fourth determination module is used to determine a candidate predetermined mapping relationship according to the mapping relationship between the M candidate source nodes and the N candidate target nodes.

[0177] The associated storage module is used to associate and store the candidate business identifier, the candidate source object attribute information, the candidate predetermined mapping relationship and the candidate target object attribute information to the data source.

[0178] According to an embodiment of the present disclosure, a source object includes at least one source node identifier and source node information corresponding to each of the at least one source node identifier.

[0179] According to an embodiment of the present disclosure, the candidate source object attribute information includes a candidate source node identifier corresponding to each of the M candidate source nodes, a source node data type, a source node parameter requirement, and a predetermined source node parameter threshold.

[0180] According to an embodiment of the present disclosure, a data source includes at least one candidate service identifier and candidate source object attribute information corresponding to each of the at least one candidate service identifier.

[0181] According to an embodiment of the present disclosure, the verification module 710 may include a matching submodule, a second determination submodule and a verification submodule.

[0182] The matching submodule is used to, in response to receiving an information processing request, match at least one candidate service identifier in the data source according to the service identifier in the information processing request to obtain a target service identifier.

[0183] The second determining submodule is used to determine the candidate source object attribute information corresponding to the target service identifier as the source object attribute information.

[0184] The verification submodule is used to perform attribute verification on the source object according to the source node data type, source node parameter requirements and predetermined source node parameter thresholds corresponding to the source object attribute information to obtain the source object verification result.

[0185] According to an embodiment of the present disclosure, the check submodule may include a first check unit, a second check unit, a third check unit and a third determination unit.

[0186] The first verification unit is used to verify the source node information corresponding to the source node identifier according to the source node parameter requirement for each source node identifier in the at least one source node identifier, and obtain a parameter requirement verification result.

[0187] The second verification unit is used to verify the source node information corresponding to the source node identifier according to the source node data type in response to the parameter requirement verification result indicating that the source node information has passed the parameter requirement verification to obtain a data type verification result.

[0188] The third verification unit is used to verify the source node information corresponding to the source node identifier according to a predetermined source node parameter threshold in response to the data type verification result indicating that the source node information has passed the data type verification, so as to obtain a parameter verification result.

[0189] The third determining unit is configured to determine a source object verification result indicating that the source object has passed the attribute verification in response to the parameter verification result indicating that the source node information has passed the parameter threshold verification.

[0190] According to the embodiments of the present invention, any one or more of the modules, submodules, units, and subunits, or at least part of the functions of any one of them can be implemented in one module. According to the embodiments of the present invention, any one or more of the modules, submodules, units, and subunits can be split into multiple modules for implementation. According to the embodiments of the present invention, any one or more of the modules, submodules, units, and subunits can be at least partially implemented as hardware circuits, such as field programmable gate arrays (FPGAs), programmable logic arrays (PLAs), systems on chips, systems on substrates, systems on packages, application specific integrated circuits (ASICs), or can be implemented by hardware or firmware in any other reasonable way of integrating or packaging the circuit, or implemented in any one of the three implementation methods of software, hardware, and firmware, or in any appropriate combination of any of them. Alternatively, according to the embodiments of the present invention, one or more of the modules, submodules, units, and subunits can be at least partially implemented as computer program modules, and when the computer program modules are run, the corresponding functions can be performed.

[0191] For example, any multiple of the verification module 710, the first processing module 720 and the second processing module 730 can be combined in one module / unit / subunit for implementation, or any one of the modules / units / subunits can be split into multiple modules / units / subunits. Alternatively, at least part of the functions of one or more modules / units / subunits in these modules / units / subunits can be combined with at least part of the functions of other modules / units / subunits and implemented in one module / unit / subunit. According to an embodiment of the present disclosure, at least one of the verification module 710, the first processing module 720 and the second processing module 730 can be at least partially implemented as a hardware circuit, such as a field programmable gate array (FPGA), a programmable logic array (PLA), a system on a chip, a system on a substrate, a system on a package, an application specific integrated circuit (ASIC), or can be implemented by hardware or firmware such as any other reasonable way of integrating or packaging the circuit, or by any one of the three implementation methods of software, hardware and firmware or by a suitable combination of any of them. Alternatively, at least one of the verification module 710, the first processing module 720, and the second processing module 730 may be at least partially implemented as a computer program module, and when the computer program module is executed, a corresponding function may be performed.

[0192] It should be noted that the information processing device part in the embodiments of the present disclosure corresponds to the information processing method part in the embodiments of the present disclosure. The description of the information processing device part specifically refers to the information processing method part, which will not be repeated here.

[0193] Figure 8A block diagram of an electronic device suitable for implementing an information processing method according to an embodiment of the present disclosure is schematically shown. Figure 8 The electronic device shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present disclosure.

[0194] like Figure 8 As shown, the computer electronic device 800 according to the embodiment of the present disclosure includes a processor 801, which can perform various appropriate actions and processes according to the program stored in the read-only memory (ROM) 802 or the program loaded from the storage part 809 to the random access memory (RAM) 803. The processor 801 may include, for example, a general-purpose microprocessor (such as a CPU), an instruction set processor and / or a related chipset and / or a special-purpose microprocessor (for example, an application-specific integrated circuit (ASIC)), etc. The processor 801 may also include an onboard memory for caching purposes. The processor 801 may include a single processing unit or multiple processing units for performing different actions of the method flow according to the embodiment of the present disclosure.

[0195] In RAM 803, various programs and data required for the operation of electronic device 800 are stored. Processor 801, ROM 802 and RAM 803 are connected to each other via bus 804. Processor 801 performs various operations of the method flow according to the embodiment of the present disclosure by executing the program in ROM 802 and / or RAM 803. It should be noted that the program can also be stored in one or more memories other than ROM 802 and RAM 803. Processor 801 can also perform various operations of the method flow according to the embodiment of the present disclosure by executing the program stored in the one or more memories.

[0196] According to an embodiment of the present disclosure, the electronic device 800 may further include an input / output (I / O) interface 805, which is also connected to the bus 804. The electronic device 800 may further include one or more of the following components connected to the input / output (I / O) interface 805: an input portion 806 including a keyboard, a mouse, etc.; an output portion 807 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and a speaker, etc.; a storage portion 808 including a hard disk, etc.; and a communication portion 809 including a network interface card such as a LAN card, a modem, etc. The communication portion 809 performs communication processing via a network such as the Internet. A drive 810 is also connected to the input / output (I / O) interface 805 as needed. A removable medium 811, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is installed on the drive 810 as needed, so that a computer program read therefrom is installed into the storage portion 808 as needed.

[0197] According to an embodiment of the present disclosure, the method flow according to an embodiment of the present disclosure can be implemented as a computer software program. For example, an embodiment of the present disclosure includes a computer program product, which includes a computer program carried on a computer-readable storage medium, and the computer program contains a program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from the network through the communication part 809, and / or installed from the removable medium 811. When the computer program is executed by the processor 801, the above-mentioned functions defined in the system of the embodiment of the present disclosure are executed. According to an embodiment of the present disclosure, the system, equipment, device, module, unit, etc. described above can be implemented by a computer program module.

[0198] The present disclosure also provides a computer-readable storage medium, which may be included in the device / apparatus / system described in the above embodiments; or may exist independently without being assembled into the device / apparatus / system. The above computer-readable storage medium carries one or more programs, and when the above one or more programs are executed, the method according to the embodiment of the present disclosure is implemented.

[0199] According to an embodiment of the present disclosure, the computer-readable storage medium may be a non-volatile computer-readable storage medium. For example, it may include, but is not limited to: a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination thereof. In the present disclosure, a computer-readable storage medium may be any tangible medium containing or storing a program that may be used by or in combination with an instruction execution system, apparatus, or device.

[0200] For example, according to an embodiment of the present disclosure, the computer-readable storage medium may include the ROM 802 and / or the RAM 803 described above and / or one or more memories other than the ROM 802 and the RAM 803 .

[0201] An embodiment of the present disclosure also includes a computer program product, which includes a computer program, and the computer program contains a program code for executing the method provided by the embodiment of the present disclosure. When the computer program product runs on an electronic device, the program code is used to enable the electronic device to implement the information processing method provided by the embodiment of the present disclosure.

[0202] When the computer program is executed by the processor 801, the above functions defined in the system / device of the embodiment of the present disclosure are executed. According to the embodiment of the present disclosure, the system, device, module, unit, etc. described above can be implemented by a computer program module.

[0203] In one embodiment, the computer program may rely on tangible storage media such as optical storage devices, magnetic storage devices, etc. In another embodiment, the computer program may also be transmitted and distributed in the form of signals on a network medium, and downloaded and installed through the communication part 809, and / or installed from a removable medium 811. The program code contained in the computer program may be transmitted using any appropriate network medium, including but not limited to: wireless, wired, etc., or any suitable combination of the above.

[0204] According to an embodiment of the present disclosure, the program code for executing the computer program provided by the embodiment of the present disclosure can be written in any combination of one or more programming languages. Specifically, these computing programs can be implemented using high-level process and / or object-oriented programming languages, and / or assembly / machine languages. Programming languages ​​include, but are not limited to, Java, C++, python, "C" language or similar programming languages. The program code can be executed entirely on the user computing device, partially on the user device, partially on the remote computing device, or entirely on the remote computing device or server. In the case of a remote computing device, the remote computing device can be connected to the user computing device through any type of network, including a local area network (LAN) or a wide area network (WAN), or can be connected to an external computing device (for example, using an Internet service provider to connect through the Internet).

[0205] The flowcharts and block diagrams in the accompanying drawings illustrate the possible architecture, functions and operations of the systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each box in the flowchart or block diagram may represent a module, a program segment, or a part of a code, and the above-mentioned module, program segment, or a part of the code contains one or more executable instructions for implementing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box may also occur in an order different from that marked in the accompanying drawings. For example, two boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should be noted that each box in the block diagram or flowchart, and the combination of boxes in the block diagram or flowchart, can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions. It can be understood by those skilled in the art that the features recorded in the various embodiments and / or claims of the present disclosure can be combined and / or combined in a variety of ways, even if such a combination or combination is not explicitly recorded in the present disclosure. In particular, without departing from the spirit and teaching of the present disclosure, the features described in the various embodiments and / or claims of the present disclosure may be combined and / or combined in a variety of ways. All of these combinations and / or combinations fall within the scope of the present disclosure.

[0206] The embodiments of the present disclosure are described above. However, these embodiments are only for illustrative purposes and are not intended to limit the scope of the present disclosure. Although the embodiments are described above separately, this does not mean that the measures in the various embodiments cannot be used in combination to advantage. The scope of the present disclosure is defined by the attached claims and their equivalents. Without departing from the scope of the present disclosure, those skilled in the art may make a variety of substitutions and modifications, which should all fall within the scope of the present disclosure.

Claims

1. An information processing method, comprising: In response to receiving the information processing request, performing attribute verification on the source object in the information processing request according to the source object attribute information to obtain a source object verification result, wherein the information processing request also includes a service identifier corresponding to the service to be processed; In response to the source object verification result indicating that the source object passes the attribute verification, the source object is processed according to a predetermined mapping relationship to obtain at least one target key-value relationship, wherein the target key-value relationship includes target key information and target value information corresponding to the target key information; and According to the target object attribute information, the at least one target key information and the target value information respectively corresponding to the at least one target key information are processed to obtain the target object; The source object attribute information, the predetermined mapping relationship and the target object attribute information are determined according to the service identifier.

2. The method according to claim 1, wherein: The source object includes at least one source node identifier and source node information corresponding to each of the at least one source node identifier, and the predetermined mapping relationship includes at least one mapping rule; In response to the source object verification result indicating that the source object passes the attribute verification, the source object is processed according to a predetermined mapping relationship to obtain at least one target key-value relationship, including: In response to the source object verification result indicating that the source object passes the attribute verification, constructing a source node key-value relationship corresponding to each of the at least one source node identifiers according to the source node information corresponding to each of the at least one source node identifiers; and According to the at least one mapping rule, the source node key-value relationships corresponding to the at least one source node identifier are processed respectively to obtain the target key-value relationships corresponding to the at least one target node identifier.

3. The method according to claim 2, wherein: The constructing the source node key-value relationship corresponding to each of the at least one source node identifiers according to the source node information corresponding to each of the at least one source node identifiers comprises: For each source node identifier in the at least one source node identifier, Determining source key information and source value information corresponding to the source key information according to the source node information corresponding to the source node identifier; and A source node key-value relationship corresponding to the source node identifier is constructed according to the source key information and the source value information corresponding to the source key information.

4. The method according to claim 2, wherein: The mapping rule includes target key information corresponding to the target node identifier; The step of processing the source node key-value relationship corresponding to each of the at least one source node identifiers according to the at least one mapping rule to obtain the target key-value relationship corresponding to each of the at least one target node identifiers comprises: For each mapping rule of the at least one mapping rule, Determine, among the at least one source node identifier, the at least one source node identifier to be mapped corresponding to the mapping rule; Processing source value information corresponding to each of the at least one source node identifier to be mapped according to the mapping rule and source key information corresponding to each of the at least one source node identifier to be mapped to obtain target value information corresponding to the target node identifier; and The target key-value relationship corresponding to the target node identifier is constructed according to the target key information and the target value information corresponding to the target node identifier.

5. The method according to any one of claims 1 to 4, wherein: The target object attribute information includes target node identifiers corresponding to the N target nodes respectively and association relationships between the N target node identifiers; The step of processing the at least one target key information and the target value information respectively corresponding to the at least one target key information according to the target object attribute information to obtain the target object comprises: Constructing a target object template according to the association relationship between the N target node identifiers and the target key information corresponding to each of the N target node identifiers, wherein the target object template includes the at least one target key information; and The target object is determined according to the target object template and the target value information respectively corresponding to the at least one target key information.

6. The method according to any one of claims 1 to 4, further comprising, in response to receiving the information processing request, performing attribute verification on the source object in the information processing request according to the source object attribute information to obtain the source object verification result: In response to detecting an information configuration request, determining, according to a candidate service identifier in the information configuration request, M candidate source nodes corresponding to the candidate service identifier, source node configuration information of each of the M candidate source nodes, N candidate target nodes, target node configuration information of each of the N candidate target nodes, and a mapping relationship between the M candidate source nodes and the N candidate target nodes, wherein: M and N are both positive integers; Determine candidate source object attribute information according to the M candidate source nodes and source node configuration information of each of the M candidate source nodes; Determining candidate target object attribute information according to the N candidate target nodes and target node configuration information of each of the N candidate target nodes; Determining the candidate predetermined mapping relationship according to the mapping relationship between the M candidate source nodes and the N candidate target nodes; as well as The candidate service identifier, the candidate source object attribute information, the candidate predetermined mapping relationship and the candidate target object attribute information are associated and stored in a data source.

7. The method according to any one of claims 1 to 4, wherein: The source object includes at least one source node identifier and source node information corresponding to each of the at least one source node identifier; The candidate source object attribute information includes a candidate source node identifier, a source node data type, a source node parameter requirement, and a predetermined source node parameter threshold corresponding to each of the M candidate source nodes; Wherein, the data source includes at least one candidate service identifier and candidate source object attribute information corresponding to each of the at least one candidate service identifier; In response to receiving the information processing request, performing attribute verification on the source object in the information processing request according to the source object attribute information, and obtaining the source object verification result includes: In response to receiving the information processing request, matching the at least one candidate service identifier in the data source according to the service identifier in the information processing request to obtain a target service identifier; Determine the candidate source object attribute information corresponding to the target service identifier as the source object attribute information; and According to the source node data type, the source node parameter requirement and the predetermined source node parameter threshold corresponding to the source object attribute information, the source object is subjected to attribute verification to obtain the source object verification result.

8. The method according to claim 7, wherein: The performing attribute verification on the source object according to the source node data type corresponding to the source object attribute information, the source node parameter requirement and the predetermined source node parameter threshold to obtain the source object verification result comprises: For each source node identifier in the at least one source node identifier, According to the source node parameter requirement, verify the source node information corresponding to the source node identifier to obtain a parameter requirement verification result; In response to the parameter requirement verification result indicating that the source node information has passed the parameter requirement verification, the source node information corresponding to the source node identifier is verified according to the source node data type to obtain a data type verification result; In response to the data type verification result indicating that the source node information passes the data type verification, verifying the source node information corresponding to the source node identifier according to the predetermined source node parameter threshold to obtain a parameter verification result; and In response to the parameter verification result indicating that the source node information passes the parameter threshold verification, the source object verification result indicating that the source object passes the attribute verification is determined.

9. An information processing device, comprising: A verification module, configured to, in response to receiving an information processing request, perform attribute verification on a source object in the information processing request according to source object attribute information to obtain a source object verification result, wherein the information processing request further includes a service identifier corresponding to the service to be processed; A first processing module is configured to, in response to the source object verification result indicating that the source object passes the attribute verification, process the source object according to a predetermined mapping relationship to obtain at least one target key-value relationship, wherein the target key-value relationship includes target key information and target value information corresponding to the target key information; and A second processing module is used to process the at least one target key information and the target value information corresponding to the at least one target key information according to the target object attribute information to obtain the target object; The source object attribute information, the predetermined mapping relationship and the target object attribute information are determined according to the service identifier.

10. An electronic device comprising: one or more processors; A memory for storing one or more instructions, Wherein, when the one or more instructions are executed by the one or more processors, the one or more processors are enabled to implement the method according to any one of claims 1 to 8.

11. A computer-readable storage medium having executable instructions stored thereon, wherein when the executable instructions are executed by a processor, the processor is enabled to implement the method according to any one of claims 1 to 8.

12. A computer program product, comprising computer executable instructions, which are used to implement the method of any one of claims 1 to 8 when executed.