Identification analysis method and device, equipment and storage medium

Abstract

The embodiment of the invention discloses an identifier analysis method and device, equipment and a storage medium. The method comprises the following steps: receiving an input to-be-analyzed identifier; obtaining a nested identifier template corresponding to the to-be-analyzed identifier; according to a nested identifier template corresponding to the to-be-analyzed identifier, analyzing the to-be-analyzed identifier to obtain a first attribute of the to-be-analyzed identifier and a second attribute of a nested identifier associated with the to-be-analyzed identifier; aiming at the first attribute and the second attribute, generating and executing an attribute value query task to obtain an attribute value of the first attribute and an attribute value of the second attribute; and splicing and displaying the to-be-analyzed identifier, the first attribute, the attribute value of the first attribute, the nested identifier, the second attribute and the attribute value of the second attribute. The first attribute associated with the to-be-analyzed identifier, the nested identifier and the second attribute of the nested identifier can be quickly obtained by using the nested identifier template. In addition, the generated attribute value query task supports parallel execution, and the analysis efficiency and speed of the complex nested hierarchy product and the sub-articles thereof are greatly improved.

Description

Technical Field

[0001] The embodiments of the present application relate to the field of identity resolution, and in particular to identity resolution methods, devices, equipment and storage media. Background Art

[0002] With the rapid development of the industrial Internet, the relationship between products and their sub-items such as parts and components, raw materials, etc. is becoming increasingly complex. When parsing the product composition structure, the existing technology usually needs to parse the product identification first, and then obtain the sub-items and their nested information one by one by calling the application programming interface (API) multiple times. This parsing process of layer-by-layer parsing and frequent API calls not only increases the complexity and time-consuming of the parsing, but also affects the efficiency of the parsing. Especially in scenarios such as real-time traceability of industrial production lines and quality inspection that require the processing of massive amounts of data, as the complexity of the hierarchical nested structure between products, parts, and raw materials continues to increase, the efficiency of data parsing and combination will also drop significantly, resulting in the parsing process taking too long and making it difficult to meet the real-time and efficient data display requirements. Summary of the invention

[0003] Based on the above problems, the embodiments of the present application provide an identification resolution method, apparatus, device and storage medium, the purpose of which is to improve the efficiency of data resolution of the hierarchical nested structure of industrial products while ensuring the traceability of the resolution results.

[0004] In a first aspect, an embodiment of the present application provides an identity resolution method, including:

[0005] Receive the input identifier to be parsed;

[0006] Obtaining a nested identifier template corresponding to the identifier to be resolved;

[0007] Parsing the identifier to be resolved according to the nested identifier template corresponding to the identifier to be resolved to obtain a first attribute of the identifier to be resolved and a second attribute of the nested identifier associated with the identifier to be resolved;

[0008] Generate an attribute value query task for the first attribute of the identifier to be resolved and the second attribute of the nested identifier;

[0009] Calling a data query interface to execute the attribute value query task to obtain the attribute value of the first attribute and the attribute value of the second attribute;

[0010] The identifier to be resolved, the first attribute, the attribute value of the first attribute, the nested identifier, the second attribute, and the attribute value of the second attribute are concatenated and displayed.

[0011] In a second aspect, the embodiment of the present application further provides an identification resolution device, including:

[0012] A receiving unit, used for receiving an input identifier to be parsed;

[0013] An acquisition unit, used to acquire a nested identifier template corresponding to the identifier to be resolved;

[0014] An identifier resolution unit, configured to resolve the identifier to be resolved according to a nested identifier template corresponding to the identifier to be resolved, so as to obtain a first attribute of the identifier to be resolved and a second attribute of the nested identifier associated with the identifier to be resolved;

[0015] A task generating unit, used for generating an attribute value query task for the first attribute of the to-be-parsed identifier and the second attribute of the nested identifier;

[0016] A task execution unit, used to call a data query interface to execute the attribute value query task to obtain the attribute value of the first attribute and the attribute value of the second attribute;

[0017] A data splicing unit is used to splice and display the identifier to be parsed, the first attribute, the attribute value of the first attribute, the nested identifier, the second attribute and the attribute value of the second attribute.

[0018] In a third aspect, an embodiment of the present application further provides a computer device, including:

[0019] CPU, memory, input and output interfaces;

[0020] The memory is a short-term storage memory or a persistent storage memory;

[0021] The central processing unit is configured to communicate with the memory and execute instruction operations in the memory to perform any one of the above-mentioned identification resolution methods.

[0022] In a fourth aspect, an embodiment of the present application further provides a computer-readable storage medium on which a computer program is stored. When the computer program is executed by a processor, any one of the above-mentioned identification resolution methods is executed.

[0023] In a fifth aspect, an embodiment of the present application further provides a computer program product, wherein the computer program product includes computer instructions, and when the computer instructions are executed by a processor, any one of the above-mentioned identification resolution methods is implemented.

[0024] It can be seen from the above technical solutions that the embodiments of the present application have the following advantages:

[0025] The embodiment of the present application can obtain the first attribute of the identifier to be resolved, the nested identifier associated with the identifier to be resolved, and the second attribute of the nested identifier more quickly by utilizing the nested identifier template. The attribute value query task generated based on the first attribute and the second attribute supports parallel execution, and can also greatly improve the efficiency and speed of parsing products with complex nesting levels and their associated sub-items. In addition, by splicing and displaying the attribute value of the first attribute and the attribute value of the second attribute obtained after the attribute value query task is completed with the identifier to be resolved, the first attribute, and the second attribute, the composition structure view of the product can be presented more intuitively, meeting the needs of real-time traceability and efficient management in the industrial Internet. BRIEF DESCRIPTION OF THE DRAWINGS

[0026] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on the provided drawings without paying creative work.

[0027] Figure 1 A schematic diagram of the system architecture of an identification resolution method provided in an embodiment of the present application;

[0028] Figure 2 A flowchart of an identification resolution method provided in an embodiment of the present application;

[0029] Figure 3 A schematic diagram of a nested identification template construction process provided in an embodiment of the present application;

[0030] Figure 4 A schematic diagram of another identification resolution method flow provided in an embodiment of the present application;

[0031] Figure 5 A schematic diagram of the structure of an identification resolution device provided in an embodiment of the present application;

[0032] Figure 6 A schematic diagram of the structure of a computer device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0033] The following will be combined with the drawings in the embodiments of the present application to clearly and completely describe the technical solutions in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.

[0034] The terms "first", "second", "third", "fourth", etc. (if any) in the specification and claims of the present application and the drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchangeable where appropriate, so that the embodiments described herein can be implemented in an order other than that illustrated or described herein. In addition, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device that includes a series of steps or units is not necessarily limited to those steps or units that are clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0035] In the following description, similar expressions such as "a specific implementation" or "a specific example" are involved, which describe a subset of all possible embodiments, but it can be understood that "a specific implementation" or "a specific example" can be the same subset or different subsets of all possible embodiments, and can be combined with each other without conflict. In the following description, the term multiple refers to at least two. In some specific examples, the numerical value mentioned in this application reaches the threshold value (if any), which may include the case where the former is greater than the latter of the threshold value; if similar expressions such as "any" or "at least one" are mentioned, it can specifically refer to any one of the listed examples or any combination of these examples.

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

[0037] The method provided in the embodiment of the present application can be applied to Figure 1 In the system architecture shown, the terminal 102 communicates with the server 101 through the network, and the data storage system 100 can store the data that the server 101 needs to process or needs. The data storage system 100 can be integrated on the server 101, or it can be placed on the cloud or other network servers. The terminal 102 can be, but is not limited to, various personal computers, laptops, smart phones, tablet computers and portable wearable devices. The portable wearable device can be a smart watch, a smart bracelet, a head-mounted device, etc. The server 101 can be implemented as an independent server or a server cluster consisting of multiple servers.

[0038] The terminal 102 can receive the input identifier to be resolved and send the input identifier to be resolved to the server 101. The server 101 will obtain the corresponding nested identifier template based on the received identifier to be resolved and resolve the identifier to be resolved; the server 101 can also generate an attribute value query task based on the first attribute and the second attribute to obtain the attribute value of the first attribute and the attribute value of the second attribute; in addition, the server 101 can also splice the obtained identifier to be resolved, the first attribute, the attribute value of the first attribute, the nested identifier, the second attribute and the attribute value of the second attribute and return them to the terminal 102 for display. In this way, the composition structure of the product is automatically parsed, and the specific attribute values ​​of each sub-item that constitutes the product are quickly obtained and displayed, meeting the needs of real-time traceability and efficient management in the industrial Internet.

[0039] It should be noted that the method provided in the embodiment of the present application can be implemented jointly by the terminal device and the server as described above, or it can be implemented entirely on the server side, or it can be implemented entirely on the terminal device side. The specific method can be determined according to the actual application scenario and is not limited here.

[0040] The following will explain the method of parsing relevant data such as industrial products in the prior art. In the prior art, it is first necessary to parse the product identification, and call the API according to the product identification to query the sub-item information related to the product one by one (that is, the sub-item identification). Then, parse each sub-item identification one by one. Specifically, it is necessary to call the API according to the sub-item identification to query the relevant information of the sub-item; if the return information contains a nested sub-item identification, it is necessary to call the API again to obtain the relevant information of the nested sub-item identification. It can be seen that the product parsing process of the prior art requires layer-by-layer parsing of the product and frequent calls to the API, which not only increases the complexity of parsing and execution time, but also seriously affects the parsing efficiency, making it difficult to meet the requirements of efficient processing and real-time performance.

[0041] In order to solve these problems in the prior art, the embodiment of the present application designs a nested identification template to integrate the data of the various parts or raw materials of the product and its components to form an organic association. For the convenience of description, the parts and raw materials of the product are collectively referred to as sub-items below. The sub-items form an association relationship through the nested identification template. When it is necessary to know the composition structure of a certain product, the nested identification template can be used to more quickly obtain which sub-items the product is composed of, and then the specific data of these sub-items can be obtained more quickly, thereby improving the efficiency and accuracy of data processing.

[0042] The method of the present application will be further described in detail below, and some specific possible implementation examples will be provided. In actual applications, the implementation contents between these examples can be combined or implemented separately as needed according to the corresponding functional principles and application logic. If implemented in combination, the execution order between the combined examples can be determined according to their respective processing logics, which may be determined by the actual scenario.

[0043] See also Figure 2 , the embodiment of the present application provides an identification resolution method, such as Figure 2 As shown, the method includes steps S201-S206.

[0044] S201: receiving an input identifier to be resolved.

[0045] The identifier to be resolved refers to the input object in the process of executing product structure resolution, which can be understood as the root identifier in the nested identifier template mentioned above. The identifier to be resolved is used to indicate a specific product object that needs to be resolved, such as a mobile phone, computer, etc. The form of the identifier to be resolved can be set according to actual conditions, and this application does not make specific restrictions on this. For example, the identifier to be resolved can be a digital number, a hierarchical path or a string, etc.

[0046] During the parsing process, the core function of the identifier to be parsed is to determine the nested identifier template corresponding to the identifier to be parsed. Through the nested identifier template, the sub-items associated with the product corresponding to the identifier can be quickly obtained, and the attribute data of the sub-items can be further obtained for splicing and display, thereby generating a complete structured data view of the product.

[0047] S202: Obtain a nested identifier template corresponding to the identifier to be resolved;

[0048] In the embodiment of the present application, the nested identifier template records the identifier to be resolved, the first attribute of the identifier to be resolved, the nested identifier associated with the identifier to be resolved, and the second attribute of the nested identifier. Figure 3 As shown, the generation process of the nested logo template can be completed by receiving the composition structure of each sub-item predefined according to business requirements. For example, Figure 3 The identifier 1 on the left and its subordinate attributes 1, 2, 3, and 4 represent a common identifier. Its subordinate data does not contain nested identifiers, so the identifier 1 can be regarded as equivalent to the child item of the leaf node.

[0049] Figure 3The middle identifier 2 can be regarded as a specific identifier of a product. The identifier corresponding to the product is usually a nested identifier. For example, identifier 2 contains three independent attributes (attribute 5, attribute 6, attribute 7), as well as the nested identifier 1 and attributes 1, 2, 3, and 4 under identifier 1. Attributes 5, 6, and 7 of identifier 2 can be regarded as the first attributes of identifier 2, identifier 1 can be regarded as a nested identifier associated with identifier 2, and attributes 1, 2, 3, and 4 under identifier 1 are the second attributes of identifier 1.

[0050] When generating a nested identifier template, you can define unique identifiers for all attributes under identifier 2 (attributes 5, 6, and 7), identifier 1 and its subordinate attributes (attributes 1, 2, 3, and 4), respectively, to indicate the hierarchical position of each attribute. For example, Figure 3 The nested identifier template on the far right shows the top-level attributes of identifier 2 (attributes 5, 6, and 7), which are assigned unique identifiers 1, 2, and 3 respectively. At the same time, unique identifier 4 is assigned to nested identifier 1, and attributes 1, 2, 3, and 4 under identifier 1 are mounted under unique identifier 4 of identifier 1. For example, 4.1 indicates that attribute 1 under identifier 1 is the first child node under the 4th node (identifier 1) of identifier 2.

[0051] It should be noted that the specific form of the unique identifier is not limited in the embodiments of the present application. For example, it can also be a combination of letters and numbers, such as A1, B2.1, etc.; or a tree path identifier, that is, a hierarchical path representation, for example, attribute 1 under identifier 1 associated with attribute 1 of identifier 2 can be represented by "1 / 4 / 4.1"; or it can be represented by a universally unique identifier (UUID, Universally Unique Identifier), such as the unique identifier of attribute 1 is 550e8400; in addition, you can also define the rule number according to business needs, for example, use P001-A5 to indicate that the product identity (ID, Identity) is the 5th attribute of P001. In addition, in actual use, the identifier to be resolved (also such as Figure 3 The logo in 2) can use specific product names, such as mobile phones, computers, etc.; nested logos and their second attributes, that is, Figure 3 The identifier 1, attribute 5, attribute 1, etc. in the above table can be represented by the specific names of specific parts or raw materials, such as battery, hard disk, central processing unit, etc.

[0052] Through this process, intelligent Figure 3 The nested identification template shown on the right is determined as the template corresponding to the product with identification 2. If the identification to be resolved is received later as identification 2, the corresponding nested identification template can be quickly matched and resolved, so as to obtain the sub-item data of the product with identification 2 more quickly, providing a more efficient and more relevant solution for data management and query of complex product structures.

[0053] S203: Parse the identifier to be resolved according to the nested identifier template corresponding to the identifier to be resolved to obtain a first attribute of the identifier to be resolved and a second attribute of the nested identifier associated with the identifier to be resolved.

[0054] Specifically, according to the nested identifier template corresponding to the identifier to be resolved, the received identifier to be resolved can be used as the current node, and the current node can be resolved to obtain the resolution data of the current node; wherein, when the identifier to be resolved is used as the current node, the resolution data of the current node includes the first attribute of the current node and at least one nested identifier associated with the current node;

[0055] If there are one or more associated nested identifiers in the parsed data of the current node, it is necessary to continue parsing these nested identifiers. Specifically, for each nested identifier, the nested identifier is used as the current node, and the step of "parsing the current node to obtain the parsed data of the current node" is returned until there are no nested identifiers associated with the current node in the parsed data. At this point, the parsing of the node and all its child nodes has been completed. Among them, when the nested identifier is used as the current node, the parsed data of the current node includes: the second attribute of the current node, and / or, the nested identifier associated with the current node.

[0056] The embodiment of the present application uses the nested identification template to pre-record the identification to be resolved and its first attribute, as well as the nested identification associated with the identification to be resolved and the second attribute of the nested identification, so that the parsing process can directly obtain the association relationship between the product and its sub-items through the nested identification template, avoiding repeated API calls during layer-by-layer recursive parsing. The parsing process of the embodiment of the present application is template-driven, which can quickly locate and parse the identification to be resolved and its nested identification, greatly shortening the parsing time, improving the simplicity and stability of the parsing process, and meeting the parsing needs of complex nested multi-level structure products in the industrial Internet.

[0057] S204: generating an attribute value query task for the first attribute of the identifier to be resolved and the second attribute of the nested identifier;

[0058] The attribute value query task is used to query the value of a specified attribute from a data source (such as a database, API interface, etc.). Each first attribute and each second attribute corresponds to an attribute value query task. Each attribute value query task usually includes attribute information (the name of the attribute to be queried, such as "hard disk", "battery" or Figure 3 ), query target (i.e., the identifier of the attribute, such as the unique identifier assigned to each attribute or each identifier as mentioned above, such as UUID or hierarchical path, etc.), query conditions, etc.

[0059] The embodiment of the present application generates an attribute value query task for the first attribute of the identifier to be resolved and the second attribute of the nested identifier, that is, decomposing these attributes into independent query units, clarifying the query targets (attribute names, belonging identifiers) and query scopes of different attribute value query tasks, and organizing them into task queues for subsequent parallel execution. In this way, the main component information of the product can be quickly obtained, significantly improving the efficiency and speed of data query, thereby meeting the high concurrency and real-time data processing requirements.

[0060] S205: calling a data query interface to execute an attribute value query task to obtain an attribute value of the first attribute and an attribute value of the second attribute;

[0061] In order to obtain the specific attribute values ​​of the first attribute and the second attribute from the data source, the data query interface provided by the system can be used to complete the specific execution of the attribute value query task. The data query interface may include: (1) an API interface used to call external or internal services to query the required data. For example, attribute values ​​are obtained through a RESTful interface (a network API interface designed based on the REST (Representational State Transfer) architectural style) or a GraphQL (GraphQuery Language) interface; (2) a secondary node interface used in a distributed system to obtain data by calling a secondary node interface such as a database shard or cache node. The data query interface call can process multiple attribute value query tasks in parallel, accelerate the data acquisition process, and improve the efficiency of querying and managing the internal component structure of the product.

[0062] S206: The identifier to be parsed, the first attribute, the attribute value of the first attribute, the nested identifier, the second attribute and the attribute value of the second attribute are concatenated and displayed.

[0063] The splicing method can be flexibly defined according to the system or user needs, such as splicing data through indentation or nested structure, or converting data into tables, comma-separated values ​​(CSV), JavaScript object notation (JSON) and other formats for splicing, or splicing and exporting each data into the required file format with the help of reporting tools. When displaying the output, it can be displayed in a tree diagram on the interface, or in a table or other form.

[0064] Exemplarily, the nested identification template corresponding to the mobile phone can set the identification corresponding to the mobile phone to identification 2, and the attributes under identification 2 include CPU (attribute 5), memory (attribute 6), and battery (attribute 7); the identification 1 associated with identification 2 is nested as CPU, and the attributes under identification 1 include CPU type (attribute 1), number of cores (attribute 2), frequency (attribute 3), and wafer (attribute 4); identification 1 is preset with an associated nested identification, namely identification 4, which corresponds to the wafer, and the attributes of the wafer include manufacturer (attribute 10) and serial number (attribute 11). The following is a data display table after splicing (Table 1 below), which shows the splicing results of the relevant attributes and attribute values ​​of the mobile phone (identification 2) and its nested identification.

[0065] Table 1

[0066]

[0067] In summary, the embodiment of the present application effectively solves the problems of weak data association and data isolation by recording a nested identifier template that records an identifier to be resolved, a first attribute of the identifier to be resolved, a nested identifier associated with the identifier to be resolved, and a second attribute of the nested identifier. Using the nested identifier template, the first attribute of the identifier to be resolved, the nested identifier associated with the identifier to be resolved, and the second attribute of the nested identifier can be obtained more quickly. The attribute value query task generated based on the first attribute and the second attribute supports parallel execution, and can also greatly improve the parsing efficiency and rate of products with complex nesting hierarchies and their associated sub-items. In addition, by splicing and displaying the attribute value of the first attribute and the attribute value of the second attribute obtained after the attribute value query task is completed with the identifier to be resolved, the first attribute, and the second attribute, the composition structure view of the product can be presented more intuitively, meeting the needs of real-time traceability and efficient management in the industrial Internet.

[0068] Based on the above examples, Figure 4 Provide some concrete examples of possible implementations.

[0069] based on Figure 2In some specific examples, in order to improve the adaptability to complex business needs and ensure the integrity and accuracy of the attribute value data obtained, each attribute (i.e., each first attribute and each second attribute) can be set with a verification rule; when obtaining the nested identification template corresponding to the identification to be resolved, if the attribute of the template has a verification rule, the template processor will parse the verification rule corresponding to the attribute to subsequently verify the legitimacy of the attribute. If there are multiple first attributes and second attributes, the specific operation process of step S204 may include: based on the preset verification rule corresponding to each first attribute and the preset verification rule corresponding to each second attribute, each first attribute and each second attribute are verified respectively; for each first attribute that passes the verification and each second attribute that passes the verification, a corresponding attribute value query task is generated respectively.

[0070] Exemplarily, each attribute is verified by a preset verification rule of the attribute to ensure that each attribute complies with the business logic rules before generating an attribute value query task. For example, the preset verification rules may include format checking, value range verification, association relationship verification, etc. If the attribute verification passes, an attribute generation query task corresponding to the attribute may be generated to obtain the specific value of the attribute from the data source. Each attribute value query task generated after verification by the preset rules may be placed in a task queue to be processed.

[0071] The embodiment of the present application can use the preset verification rules for each first attribute or each second attribute to first verify and then generate the attribute value query task, and can filter out invalid or rule-incompatible attributes to avoid wasting query resources. At the same time, it can also ensure that the generated attribute value query task is only for valid attributes, thereby improving the accuracy of the attribute value obtained after the query task is completed.

[0072] based on Figure 2 In some specific examples, when generating an attribute value query task, the attribute is not verified, but the attribute value query tasks corresponding to all attributes are directly generated. In the stage after the task is generated and before execution, the attribute corresponding to each attribute value query task is verified by rules, and only the attribute value query tasks that pass the verification will be actually executed. Compared with the previous embodiment of verifying first and then generating the attribute value query task, it is more suitable for scenarios with complex rules or requiring real-time dynamic adjustment, thereby avoiding delays caused by complex rules in the task generation stage.

[0073] Specifically, if there are multiple first attributes and multiple second attributes, the specific operation process of step S205 may include: determining the target attribute corresponding to the attribute value query task; the target attribute includes the first attribute and the second attribute; based on the preset verification rule corresponding to the target attribute, verifying the target attribute corresponding to the attribute value query task; for each attribute value query task, if the target attribute corresponding to the attribute value query task passes the verification, calling the data query interface to execute the attribute value query task to obtain the attribute value of the target attribute.

[0074] The embodiment of the present application may preset verification rules for each first attribute or each second attribute. For the convenience of description, any one of the first attribute and the second attribute will be described as a "target attribute" below. Based on the target attribute corresponding to each attribute value query task, each attribute value query task is verified. Specifically, assuming that the attribute value query task A corresponds to the target attribute A1, the attribute value query task A is verified according to the preset verification rules of attribute A1. If the attribute value query task A passes the verification corresponding to the target attribute A1, the attribute value query task A can be directly submitted to the task pool to call the data query interface to execute the attribute value query to obtain the attribute value of the target attribute.

[0075] Please note that, please refer to Figure 4 , the attribute value query task to be verified in the embodiment of the present application is located in the task queue. The attribute value query task in the task queue can be submitted to the task pool for processing. Specifically, the task pool can be understood as a collection of attribute value query tasks that have been verified by management, and is used to store and schedule all attribute value query tasks related to each root identifier (such as the identifier 2 corresponding to a product) (such as the attribute value query task corresponding to the first attribute under the identifier 2, and the attribute value query task of the second attribute of the nested identifier-identifier 1 associated with identifier 2). In order to coordinate the interaction between the task pool and the thread pool, the system can introduce a listening thread. The role of the listening thread is to monitor the task status in the task pool in real time, such as dynamically adjusting the task scheduling strategy according to the state of the task pool, or suspending the processing of the task queue when the task pool capacity is insufficient, or supplementing new tasks from the task queue after the task pool task is taken away, or triggering further task scheduling and thread resource allocation after the task pool adds tasks. The thread pool is used to manage and execute multiple threads. The thread pool contains a predefined number of threads, which can take tasks from each task pool for parallel processing. The above three work together, with the task pool managing tasks, the listening thread listening to the task pool to complete task scheduling, and the thread pool executing tasks, which can further provide efficient concurrency capabilities and realize efficient query and parsing of attribute values ​​​​of complex nested identifiers.

[0076] It should be noted that the generation of the above-mentioned attribute value query task can use the ReentrantLock class in Java to manage the addition and deletion of tasks in the task queue, ensuring that only one thread can modify the task queue at a time, thereby solving the problem of competition for shared resources.

[0077] based on Figure 2 In some specific examples, there are multiple first attributes and multiple second attributes, and the preset verification rule is a verification based on the input source identifier and the query source identifier; the verification process of the preset verification rule includes: obtaining the input source of the identifier to be resolved, and determining the input source identifier of the input source; obtaining the creation source identifier of the first attribute and the creation source identifier of the second attribute; the creation source identifier is used to identify the creation source of the first attribute or the second attribute; according to the creation source identifier of the first attribute, the creation source identifier of the second attribute and the input source identifier, each first attribute and each second attribute is verified; if the creation source identifier of the first attribute is the same as the input source identifier, the verification of the first attribute passes; if the creation source identifier of the second attribute is the same as the input source identifier, the verification of the second attribute passes.

[0078] Specifically, the embodiment of the present application determines whether the target attribute meets the current business requirements by comparing the creation source identifier (indicating the source of the attribute) and the input source identifier (indicating the source of the current initiation of parsing the identifier to be resolved) of each target attribute, thereby deciding whether to pass the verification.

[0079] Here, the input source identifier can be an enterprise resource planning system (ERP), a manufacturing execution system (MES), or a unique identifier of a device (which can be a number, serial number, network address, etc.), indicating that the request to resolve the identifier to be resolved is initiated by this system or device. In addition, the input source identifier can also be an account identity ID or number of a user (such as a data uploader), for example, it can be obtained from the session Session when the user logs in to the system, or the token (Token) obtained when the user initiates the request or logs in to the system to resolve the account ID or number.

[0080] The creation source indicates the creation source of the attribute, and is used to identify the data source of a certain attribute. For example, when the attribute is entered or generated, the system automatically assigns it a creation source identifier, or directly uses the unique identifier of the device or user that performs the entry of the attribute / data upload as the creation source identifier.

[0081] In a feasible embodiment, the creation source identifier of attribute 25 can be obtained: account ID-56789; and the input source identifier when the input identifier to be resolved is obtained: account ID-23456. It can be seen that if the creation source identifier is inconsistent with the input source identifier, the attribute 25 will not generate an attribute value query task, or the attribute value query task corresponding to the attribute 25 will not be submitted to the task pool to execute the attribute value query.

[0082] based on Figure 2 In some specific examples, there are multiple first attributes and multiple second attributes. In order to prevent the attributes from being accessed during unauthorized time and ensure data security, the preset verification rule can be set to a verification based on the input time; the verification process of the preset verification rule includes: obtaining the input time of the input identifier to be resolved; obtaining the restricted access time period of the first attribute and the restricted access time period of the second attribute; verifying each first attribute and each second attribute according to the restricted access time period of the first attribute, the restricted access time period of the second attribute and the input time; if the input time is within the restricted access time period of the first attribute, the verification of the first attribute passes; if the input time is within the restricted access time period of the second attribute, the verification of the second attribute passes.

[0083] In a feasible embodiment, assuming that the restricted access time of attribute 25 is 09:00-15:00, and the time for inputting the identifier to be resolved (that is, the time for initiating the resolution request for the identifier to be resolved) is 15:01, since the input time (the time for initiating the resolution request for the identifier to be resolved) is not within the restricted access time period of the attribute, the system will not generate an attribute value query task corresponding to attribute 25, or the attribute value query task of attribute 25 will not be submitted to the task pool for query execution.

[0084] It should be noted that the embodiments of the present application do not limit the specific units of the restricted access time and input time. For example, the restricted access time and input time can be verified with an accuracy of seconds or microseconds, or can be verified based on a date (such as year, month, day), and the specific accuracy can be set according to actual needs.

[0085] The embodiment of the present application can effectively prevent access during unauthorized time periods by verifying the restricted access time period of each attribute and the input time of the current identifier to be resolved, thereby ensuring the security and compliance of data access.

[0086] based on Figure 2According to the example content, in some specific examples, after generating an attribute value query task for the first attribute of the identifier to be resolved and the second attribute of the nested identifier, the method of the embodiment of the present application also includes: submitting the attribute value query task to a task pool; reading the attribute value query tasks of a preset task processing amount in the task pool, and planning the attribute value query tasks of the preset task processing amount as attribute value query tasks in the same task execution round; and allocating corresponding task threads to the attribute value query tasks in the same task execution round in turn, so as to execute each attribute value query task in each task execution round in parallel.

[0087] In actual applications, there may be a large number of attribute value query tasks. Directly executing all tasks will lead to resource competition, system resource overload, and system bottleneck, thereby reducing the efficiency of task execution.

[0088] Therefore, the embodiment of the present application can dynamically adjust the task execution strategy according to the system load by managing multiple tasks in the task pool corresponding to each product. For example, there are 50 tasks submitted to the task pool, and tasks are read from the task pool at 10 tasks per round. The first task execution round is assigned to include tasks 1 to 10; the second task execution round includes tasks 11 to 20... In the first round, 10 tasks are assigned to 10 threads for parallel execution. After the first round is completed, the second round will continue to be executed until all 50 tasks are completed in rounds.

[0089] By managing tasks through the task pool, scheduling tasks by rounds, and using the thread pool to execute tasks in parallel, the execution efficiency and resource utilization of tasks can be effectively improved. This is suitable for scenarios such as the industrial Internet that need to process a large number of tasks, and provides a basis for the flexible scheduling of attribute value query tasks.

[0090] based on Figure 2 In some specific examples, in order to avoid system resource exhaustion or reduced efficiency due to long execution time of certain tasks or deadlock problems, the method of the embodiment of the present application also includes: calculating the cumulative execution time of each attribute value query task; if the cumulative execution time of the attribute value query task meets the preset time threshold, stopping the attribute value query task and returning the acquired attribute value.

[0091] In actual applications, some attribute value query tasks may take too long to execute or even fail to complete due to network delays, insufficient resources or other abnormal reasons. If the execution time is not limited, other tasks may be blocked or resources may be occupied, affecting the overall efficiency of the system.

[0092] Therefore, the cumulative execution time of each attribute value query task can be monitored. If the task execution time exceeds the preset time threshold, the execution of the task is stopped to avoid resource waste or system blocking. Exemplarily, there are 10 attribute value query tasks in the task pool, and a time threshold of 5 seconds is set for each task. The execution time of each task is recorded when it is executed. If Task 1 is completed within 4 seconds, the result is returned normally. If Task 2 is not completed for more than 5 seconds, Task 2 is stopped and some of the acquired attribute value results are returned. It should be pointed out that the preset time threshold in this embodiment can be flexibly set to different time units according to the actual needs of the attribute value query task, for example, it can be set to 5 seconds, or to adapt to fast requests between microservices, it can be set to 100 microseconds, etc.

[0093] The embodiment of the present application can release long-term occupied resources (such as threads and locks) through task execution time monitoring and timing lock mechanism, and allocate them to other tasks, thereby avoiding system blocking, improving system throughput, and ensuring the stability of the method during execution of the embodiment of the present application.

[0094] In order to implement the identification resolution method of the embodiment of the present application, the embodiment of the present application also provides an identification resolution device, such as Figure 5 As shown, the device comprises:

[0095] The receiving unit 501 is used to receive an input identifier to be resolved;

[0096] An acquisition unit 502 is used to acquire a nested identifier template corresponding to the identifier to be resolved;

[0097] The identifier resolution unit 503 is used to resolve the identifier to be resolved according to the nested identifier template corresponding to the identifier to be resolved, so as to obtain a first attribute of the identifier to be resolved and a second attribute of the nested identifier associated with the identifier to be resolved;

[0098] A task generating unit 504 is used to generate an attribute value query task for the first attribute of the to-be-parsed identifier and the second attribute of the nested identifier;

[0099] A task execution unit 505 is used to call a data query interface to execute the attribute value query task to obtain the attribute value of the first attribute and the attribute value of the second attribute;

[0100] The data splicing unit 506 is used to splice and display the identifier to be parsed, the first attribute, the attribute value of the first attribute, the nested identifier, the second attribute and the attribute value of the second attribute.

[0101] In one embodiment, the task generation unit 504 is specifically used to:

[0102] Based on a preset verification rule corresponding to each first attribute and a preset verification rule corresponding to each second attribute, respectively verify each first attribute and each second attribute;

[0103] For each first attribute that passes the verification and each second attribute that passes the verification, a corresponding attribute value query task is generated respectively.

[0104] In one embodiment, the task execution unit 505 is specifically used to:

[0105] Determine a target attribute corresponding to the attribute value query task; the target attribute includes the first attribute and the second attribute;

[0106] Verifying the target attribute corresponding to the attribute value query task based on a preset verification rule corresponding to the target attribute;

[0107] For each of the attribute value query tasks, if the target attribute corresponding to the attribute value query task passes verification, a data query interface is called to execute the attribute value query task to obtain the attribute value of the target attribute.

[0108] In one embodiment, the device further includes: a processing unit; the processing unit is specifically configured to:

[0109] Obtaining the input source of the identifier to be resolved, and determining the input source identifier of the input source;

[0110] Acquire a creation source identifier of the first attribute and a creation source identifier of the second attribute; the creation source identifier is used to identify a creation source of the first attribute or the second attribute;

[0111] Verify each of the first attributes and each of the second attributes according to the creation source identifier of the first attribute, the creation source identifier of the second attribute, and the input source identifier;

[0112] If the creation source identifier of the first attribute is the same as the input source identifier, the verification of the first attribute passes;

[0113] If the creation source identifier of the second attribute is the same as the input source identifier, the verification of the second attribute passes.

[0114] In one embodiment, the processing unit is specifically configured to:

[0115] Obtaining the input time of the identifier to be resolved;

[0116] Acquire the restricted access time period of the first attribute and the restricted access time period of the second attribute;

[0117] Verify each of the first attributes and each of the second attributes according to the restricted access time period of the first attribute, the restricted access time period of the second attribute, and the input time;

[0118] If the input time is within the restricted access time period of the first attribute, the verification of the first attribute passes;

[0119] If the input time is within the restricted access time period of the second attribute, the verification of the second attribute passes.

[0120] In one embodiment, the task execution unit 505 is specifically used to:

[0121] Submitting the attribute value query task to the task pool;

[0122] Reading attribute value query tasks of a preset task processing amount in the task pool, and planning the attribute value query tasks of the preset task processing amount as attribute value query tasks in the same task execution round;

[0123] Corresponding task threads are sequentially allocated to the attribute value query tasks in the same task execution round, so as to execute each attribute value query task in each task execution round in parallel.

[0124] In one embodiment, the task execution unit 505 is specifically used to:

[0125] Calculating the cumulative execution time of each of the attribute value query tasks;

[0126] If the accumulated execution time of the attribute value query task meets the preset time threshold, the attribute value query task is stopped and the acquired attribute value is returned.

[0127] It should be noted that: the above embodiment provides an identification resolution device, and only uses the division of the above program modules as an example when performing identification resolution. In actual applications, the above processing can be assigned to different program modules as needed, that is, the internal structure of the device is divided into different program modules to complete all or part of the processing described above. In addition, the identification resolution device and the identification resolution method embodiment provided in the above embodiment belong to the same concept, and the specific implementation process is detailed in the method embodiment, which will not be repeated here.

[0128] Based on the hardware implementation of the above program modules, and in order to implement an identification resolution method provided in an embodiment of the present application, an embodiment of the present application further provides a computer device, such as Figure 6 As shown, the computer device 600 includes:

[0129] CPU 601, memory 602 and input / output interface 603;

[0130] The memory 602 is a temporary storage memory or a permanent storage memory;

[0131] The central processor 601 is configured to communicate with the memory 602 and execute instructions in the memory 602 to perform any of the above-mentioned identification resolution methods.

[0132] Of course, in actual application, the various components in the computer device 600 are coupled together through the bus system 604. It can be understood that the bus system 604 is used to realize the connection and communication between these components. In addition to the data bus, the bus system 604 also includes a power bus, a control bus and a status signal bus. However, for the sake of clarity, Figure 6 Various buses are labeled as bus system 604 .

[0133] The memory 602 in the embodiment of the present application is used to store various types of data to support the operation of the computer device 600. Examples of such data include: any computer program used to operate on the computer device 600.

[0134] It is understandable that when the processor in the computer device described above executes the computer program, it can also implement the functions of the various units in the above-mentioned corresponding device embodiments, which will not be repeated here. Exemplarily, the computer program can be divided into one or more modules / units, one or more modules / units are stored in the memory, and executed by the processor to complete the various embodiments of the present application. One or more modules / units can be a series of computer program instruction segments that can perform specific functions, and the instruction segments are used to describe the execution process of the computer program in the computer device. For example, the computer program can be divided into the various units in the above-mentioned computer device, and each unit can implement the specific functions described in the above-mentioned corresponding computer device.

[0135] The computer device may be a computing device such as a desktop computer, a notebook, a PDA, and a cloud server. The computer device may include, but is not limited to, a processor and a memory. Those skilled in the art will appreciate that the processor and the memory are merely examples of computer devices and do not constitute a limitation on the computer device. The computer device may include more or fewer components, or a combination of certain components, or different components. For example, the computer device may also include input and output devices, network access devices, buses, etc.

[0136] The processor can be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. A general-purpose processor can be a microprocessor or any conventional processor, etc. The processor is the control center of the computer device, and uses various interfaces and lines to connect various parts of the entire computer device.

[0137] The memory can be used to store computer programs and / or modules. The processor implements various functions of the computer device by running or executing the computer programs and / or modules stored in the memory, and calling the data stored in the memory. The memory can mainly include a program storage area and a data storage area, wherein the program storage area can store an operating system, at least one application required for a function, etc.; the data storage area can store data created according to the use of the terminal, etc. In addition, the memory can include a high-speed random access memory, and can also include a non-volatile memory, such as a hard disk, a memory, a plug-in hard disk, a smart memory card (SMC, Smart Media Card), a secure digital (SD, Secure Digital) card, a flash card (Flash Card), at least one disk storage device, a flash memory device, or other volatile solid-state storage devices.

[0138] An embodiment of the present application also provides a computer-readable storage medium on which a computer program is stored. When the computer program is executed by a processor, any one of the above-mentioned identification resolution methods is executed.

[0139] An embodiment of the present application also provides a computer program product having a computer program / instruction stored thereon. When the computer program / instruction is executed by a processor, it is used to implement the identification resolution method described in the first aspect of the embodiment of the present application or any specific implementation method of the first aspect.

[0140] Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working processes of the systems, devices and units described above can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.

[0141] In the several embodiments provided in the present application, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. For example, the device embodiments described above are only schematic. For example, the division of the units is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be an indirect coupling or communication connection through some interfaces, devices or units, which can be electrical, mechanical or other forms.

[0142] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[0143] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above-mentioned integrated unit may be implemented in the form of hardware or in the form of software functional units.

[0144] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application is essentially or the part that contributes to the prior art or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a number of instructions to enable a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), disk or optical disk and other media that can store program code.

Claims

1. A method for identity resolution, characterized in that: include: Receive the input identifier to be parsed; Obtaining a nested identifier template corresponding to the identifier to be resolved; Parsing the identifier to be resolved according to the nested identifier template corresponding to the identifier to be resolved to obtain a first attribute of the identifier to be resolved and a second attribute of the nested identifier associated with the identifier to be resolved; Generate an attribute value query task for the first attribute of the identifier to be resolved and the second attribute of the nested identifier; Calling a data query interface to execute the attribute value query task to obtain the attribute value of the first attribute and the attribute value of the second attribute; The identifier to be resolved, the first attribute, the attribute value of the first attribute, the nested identifier, the second attribute, and the attribute value of the second attribute are concatenated and displayed.

2. The identification resolution method according to claim 1, characterized in that: There are multiple first attributes and multiple second attributes, and generating an attribute value query task for the first attribute of the identifier to be resolved and the second attribute of the nested identifier includes: Based on a preset verification rule corresponding to each first attribute and a preset verification rule corresponding to each second attribute, respectively verify each first attribute and each second attribute; For each first attribute that passes the verification and each second attribute that passes the verification, a corresponding attribute value query task is generated respectively.

3. The identification resolution method according to claim 1, characterized in that: The calling of the data query interface to execute the attribute value query task to obtain the attribute value of the first attribute and the attribute value of the second attribute includes: Determine a target attribute corresponding to the attribute value query task; the target attribute includes the first attribute and the second attribute; Verifying the target attribute corresponding to the attribute value query task based on a preset verification rule corresponding to the target attribute; For each of the attribute value query tasks, if the target attribute corresponding to the attribute value query task passes verification, a data query interface is called to execute the attribute value query task to obtain the attribute value of the target attribute.

4. The identification resolution method according to any one of claims 2 and 3, characterized in that: There are multiple first attributes and multiple second attributes, and the preset verification rule is a verification based on the input source identifier and the query source identifier; the verification process of the preset verification rule includes: Obtaining the input source of the identifier to be resolved, and determining the input source identifier of the input source; Acquire a creation source identifier of the first attribute and a creation source identifier of the second attribute; the creation source identifier is used to identify a creation source of the first attribute or the second attribute; Verify each of the first attributes and each of the second attributes according to the creation source identifier of the first attribute, the creation source identifier of the second attribute, and the input source identifier; If the creation source identifier of the first attribute is the same as the input source identifier, the verification of the first attribute passes; If the creation source identifier of the second attribute is the same as the input source identifier, the verification of the second attribute passes.

5. The identification resolution method according to any one of claims 2 and 3, characterized in that: There are multiple first attributes and multiple second attributes, and the preset verification rule is a verification based on input time; The verification process of the preset verification rule includes: Obtaining the input time of the identifier to be resolved; Acquire the restricted access time period of the first attribute and the restricted access time period of the second attribute; Verify each of the first attributes and each of the second attributes according to the restricted access time period of the first attribute, the restricted access time period of the second attribute, and the input time; If the input time is within the restricted access time period of the first attribute, the verification of the first attribute passes; If the input time is within the restricted access time period of the second attribute, the verification of the second attribute passes.

6. The identification resolution method according to claim 1, characterized in that: After generating an attribute value query task for the first attribute of the to-be-parsed identifier and the second attribute of the nested identifier, the method further includes: Submitting the attribute value query task to the task pool; Reading attribute value query tasks of a preset task processing amount in the task pool, and planning the attribute value query tasks of the preset task processing amount as attribute value query tasks in the same task execution round; Corresponding task threads are sequentially allocated to the attribute value query tasks in the same task execution round, so as to execute each attribute value query task in each task execution round in parallel.

7. The identification resolution method according to claim 1, characterized in that: The method further comprises: Calculating the cumulative execution time of each of the attribute value query tasks; If the accumulated execution time of the attribute value query task meets the preset time threshold, the attribute value query task is stopped and the acquired attribute value is returned.

8. An identification resolution device, characterized in that: include: A receiving unit, used for receiving an input identifier to be parsed; An acquisition unit, used to acquire a nested identifier template corresponding to the identifier to be resolved; An identifier resolution unit, configured to resolve the identifier to be resolved according to a nested identifier template corresponding to the identifier to be resolved, so as to obtain a first attribute of the identifier to be resolved and a second attribute of the nested identifier associated with the identifier to be resolved; A task generating unit, used for generating an attribute value query task for the first attribute of the to-be-parsed identifier and the second attribute of the nested identifier; A task execution unit, used to call a data query interface to execute the attribute value query task to obtain the attribute value of the first attribute and the attribute value of the second attribute; A data splicing unit is used to splice and display the identifier to be parsed, the first attribute, the attribute value of the first attribute, the nested identifier, the second attribute and the attribute value of the second attribute.

9. A computer device, characterized in that: include: CPU, memory and input / output interface; The memory is a short-term storage memory or a persistent storage memory; The central processing unit is configured to communicate with the memory and execute instruction operations in the memory to perform the identification resolution method described in any one of claims 1 to 7.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the identification resolution method as described in any one of claims 1 to 7 is performed.

11. A computer program product, characterized in that The computer program product comprises computer instructions, and when the computer instructions are executed by a processor, the identification resolution method as claimed in any one of claims 1 to 7 is implemented.

Images