Electronic certificate relation storage and query method

Abstract

The invention relates to an electronic certificate relation storage and query method. The method comprises the following steps: collecting an existing electronic certificate relation log of each service; according to the electronic certificate relationship of each service, allocating a link tracking ID and a hierarchy counting ID to each electronic certificate of each service to form an electronic certificate relationship storage structure; designing a query interface based on the electronic certificate relation storage structure of each service; calling the query interface in an actual business scene, and querying the electronic certificate through the interface; the storage method of the complex electronic certificate relationship can be realized, and efficient query is guaranteed to meet business requirements.

Description

Technical Field

[0001] The invention relates to an electronic voucher relationship storage and query method, and relates to the technical field of associated data storage and retrieval. Background Art

[0002] In the current context of the popularization of electronic credentials, the way of credential management is undergoing profound changes. A large number of credentials not only need to be stored digitally, but also need to establish clear and accurate relationship mappings between them. The storage and management of such relationships are crucial to improving business processing efficiency. As enterprises and institutions gradually rely on information systems for operations, it has become a common requirement to quickly retrieve relevant credential relationship information from massive data. However, the relationships between electronic credentials are often very complex, involving multi-level and multi-dimensional interactions and rules. Traditional storage and retrieval methods are difficult to cope with this complexity.

[0003] This complexity is reflected in many aspects. First, the voucher relationships in different business scenarios are different, and these relationships are often adjusted and updated as business needs change. Second, due to the huge amount of data involved in electronic vouchers, the speed and accuracy of retrieval place higher demands on system performance. Especially in emergency situations, being able to quickly and accurately obtain the required voucher relationship information is of great significance for decision-making and operation execution.

[0004] Therefore, the current challenge facing the credential management field is not only how to store and organize these complex relationships in massive data, but also to optimize the retrieval algorithm on this basis and improve the efficiency of information acquisition. Summary of the invention

[0005] In order to solve the above problems existing in the prior art, the present invention proposes an electronic certificate relationship storage and query method.

[0006] The technical solution of the present invention is as follows:

[0007] In one aspect, the present invention provides a method for storing and querying electronic credential relationships, comprising the following steps:

[0008] Collect the existing electronic voucher relationship log for each business;

[0009] According to the electronic voucher relationship of each business, a link tracking ID and a layer counting ID are allocated to each electronic voucher of each business to form an electronic voucher relationship storage structure;

[0010] Design query interface based on the electronic voucher relationship storage structure of each business;

[0011] In actual business scenarios, the query interface is called to query the electronic voucher through the interface.

[0012] As a preferred embodiment of the present invention, the link tracking ID is a globally unique identifier, and the same link tracking ID is assigned to all electronic certificates involved in the same business.

[0013] As a preferred embodiment of the present invention, the hierarchical counting ID is a single identifier, and for all electronic certificates involved in the business, a unique identifier is assigned to each electronic certificate according to its different hierarchical levels.

[0014] As a preferred embodiment of the present invention, the electronic credential relationship storage structure is specifically as follows:

[0015] Consider each business as a root node. Starting from the root node, the electronic certificates involved in the business are sorted in a tree structure according to the hierarchical relationship in the relationship log. Each layer of the tree structure represents a level, and each node of the tree structure represents an electronic certificate. The child node of each node represents the electronic certificate of the next level contained in the electronic certificate, and the parent node of each node represents the electronic certificate of the previous level to which the electronic certificate belongs.

[0016] On the other hand, the present invention also provides an electronic credential relationship storage and query system, including an electronic credential acquisition module, a storage structure building block, and a query module;

[0017] The electronic voucher collection module is used to collect the existing electronic voucher relationship logs of each business;

[0018] The storage structure building block is used to allocate a link tracking ID and a layer counting ID to each electronic voucher of each business according to the electronic voucher relationship of each business, form an electronic voucher relationship storage structure, and design a query interface based on the electronic voucher relationship storage structure of each business;

[0019] The query module is used to call the query interface in an actual business scenario and query the electronic certificate through the interface.

[0020] As a preferred embodiment of the present invention, the link tracking ID is a globally unique identifier, and the same link tracking ID is assigned to all electronic certificates involved in the same business.

[0021] As a preferred embodiment of the present invention, the hierarchical counting ID is a single identifier, and for all electronic certificates involved in the business, a unique identifier is assigned to each electronic certificate according to its different hierarchical levels.

[0022] As a preferred embodiment of the present invention, the electronic credential relationship storage structure is specifically as follows:

[0023] Consider each business as a root node. Starting from the root node, the electronic certificates involved in the business are sorted in a tree structure according to the hierarchical relationship in the relationship log. Each layer of the tree structure represents a level, and each node of the tree structure represents an electronic certificate. The child node of each node represents the electronic certificate of the next level contained in the electronic certificate, and the parent node of each node represents the electronic certificate of the previous level to which the electronic certificate belongs.

[0024] On the other hand, the present invention further provides an electronic device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the program, the method described in any embodiment of the present invention is implemented.

[0025] In yet another aspect, the present invention further provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the method described in any embodiment of the present invention.

[0026] The present invention has the following beneficial effects:

[0027] 1. The present invention stores electronic credential relationships through link tracking IDs and hierarchical counters. The structure is simple and easy to understand. The query efficiency is significantly improved based on the simple storage structure. At the same time, the query supports flexible queries of multi-level upstream and downstream relationships to adapt to various business needs. It realizes a storage method for complex electronic credential relationships and ensures efficient queries to meet business needs. BRIEF DESCRIPTION OF THE DRAWINGS

[0028] Figure 1 is a flow chart of the method of the present invention;

[0029] Figure 2 It is a diagram of the electronic certificate relationship storage structure of the present invention;

[0030] Figure 3 It is a diagram of the link tracking ID storage structure of the present invention;

[0031] Figure 4 This is a diagram of the hierarchical counting ID storage structure of the present invention. DETAILED DESCRIPTION

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

[0033] It should be understood that the step numbers used in this document are only for convenience of description and are not intended to limit the order in which the steps are executed.

[0034] It should be understood that the terms used in the present specification are only for the purpose of describing specific embodiments and are not intended to limit the present invention. As used in the present specification and the appended claims, unless the context clearly indicates otherwise, the singular forms "a", "an" and "the" are intended to include plural forms.

[0035] The terms “include” and “comprising” indicate the presence of described features, integers, steps, operations, elements and / or components, but do not exclude the presence or addition of one or more other features, integers, steps, operations, elements, components and / or combinations thereof.

[0036] The term "and / or" means and includes any and all possible combinations of one or more of the associated listed items.

[0037] Embodiment 1:

[0038] See also Figure 1 , an electronic voucher relationship storage and query method, comprising the following steps:

[0039] Collect the existing electronic voucher relationship log for each business;

[0040] According to the electronic voucher relationship of each business, a link tracking ID and a layer counting ID are allocated to each electronic voucher of each business to form an electronic voucher relationship storage structure;

[0041] Design a query interface based on the electronic voucher relationship storage structure of each business, which supports relationship link query, upstream and downstream relationship query, cascade relationship query and other functions;

[0042] In actual business scenarios, the query interface is called to query the electronic voucher through the interface.

[0043] See also Figure 3 As a preferred implementation of this embodiment, the link tracking ID (TraceId) is a globally unique identifier. The same link tracking ID is assigned to all electronic certificates involved in the same business, and the same TraceId is assigned to the certificates involved in each business node. In this way, the certificates with no relationship description scattered in various business processes can be connected in series, and the flow of certificates in various business nodes can be effectively tracked and managed, realizing the intelligent collection and organization of certificate information, thereby improving the transparency and efficiency of the entire business process.

[0044] See also Figure 4As a preferred implementation of this embodiment, the hierarchical counting ID is a single identifier, and for all electronic certificates involved in the business, a unique identifier is assigned to each electronic certificate according to its different hierarchical levels;

[0045] In this embodiment, the hierarchical counting ID is generated based on the hierarchical counter. RPCID is also called a hierarchical counter, and its full name is Remote Procedure Call Identifier. By assigning a unique RPCID to each voucher, the flow of the voucher in each business node can be tracked and managed. In this way, vouchers at different levels can be clearly linked to form a complete voucher chain. Whether in procurement, reimbursement, or sales scenarios, the application of this hierarchical counter can significantly improve the efficiency and transparency of voucher management, making the voucher circulation process clearer and traceable, thereby improving the overall operating efficiency and accuracy of business processes.

[0046] See also Figure 2 As a preferred implementation of this embodiment, the electronic certificate relationship storage structure is specifically:

[0047] Consider each business as a root node. Starting from the root node, the electronic certificates involved in the business are sorted in a tree structure according to the hierarchical relationship in the relationship log. Each layer of the tree structure represents a level, and each node of the tree structure represents an electronic certificate. The child node of each node represents the electronic certificate of the next level contained in the electronic certificate, and the parent node of each node represents the electronic certificate of the previous level to which the electronic certificate belongs.

[0048] Embodiment 2:

[0049] An electronic credential relationship storage and query system, comprising an electronic credential collection module, a storage structure building block and a query module;

[0050] The electronic voucher collection module is used to collect the existing electronic voucher relationship logs of each business;

[0051] The storage structure building block is used to allocate a link tracking ID and a layer counting ID to each electronic voucher of each business according to the electronic voucher relationship of each business, form an electronic voucher relationship storage structure, and design a query interface based on the electronic voucher relationship storage structure of each business;

[0052] The query module is used to call the query interface in an actual business scenario and query the electronic certificate through the interface.

[0053] As a preferred implementation of this embodiment, the link tracking ID is a globally unique identifier, and the same link tracking ID is allocated to all electronic certificates involved in the same business.

[0054] As a preferred implementation of this embodiment, the hierarchical counting ID is a single identifier, and for all electronic certificates involved in the business, a unique identifier is assigned to each electronic certificate according to its different hierarchies.

[0055] As a preferred implementation of this embodiment, the electronic certificate relationship storage structure is specifically:

[0056] Consider each business as a root node. Starting from the root node, the electronic certificates involved in the business are sorted in a tree structure according to the hierarchical relationship in the relationship log. Each layer of the tree structure represents a level, and each node of the tree structure represents an electronic certificate. The child node of each node represents the electronic certificate of the next level contained in the electronic certificate, and the parent node of each node represents the electronic certificate of the previous level to which the electronic certificate belongs.

[0057] Embodiment three:

[0058] This embodiment provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the method described in any embodiment of the present invention when executing the program.

[0059] Embodiment 4:

[0060] This embodiment provides a computer-readable storage medium on which a computer program is stored. When the program is executed by a processor, the method described in any embodiment of the present invention is implemented.

[0061] In the embodiments of the present application, "at least one" refers to one or more, and "more than one" refers to two or more. "And / or" describes the association relationship of associated objects, indicating that three relationships may exist. For example, A and / or B can represent the existence of A alone, the existence of A and B at the same time, and the existence of B alone. Among them, A and B can be singular or plural. The character " / " generally indicates that the previous and next associated objects are in an "or" relationship. "At least one of the following" and similar expressions refer to any combination of these items, including any combination of single or plural items. For example, at least one of a, b and c can be represented by: a, b, c, a and b, a and c, b and c, or a and b and c, where a, b, c can be single or multiple.

[0062] Those of ordinary skill in the art will appreciate that the various units and algorithm steps described in the embodiments disclosed herein can be implemented in a combination of electronic hardware, computer software, and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application.

[0063] 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.

[0064] In several embodiments provided in the present application, if any function 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, or the part that contributes to the prior art or the part of the technical solution, can be embodied in the form of a software product, which is stored in a storage medium and includes several instructions for 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 (Read-Only Memory; hereinafter referred to as: ROM), random access memory (Random Access Memory; hereinafter referred to as: RAM), disk or optical disk, and other media that can store program codes.

[0065] The above descriptions are merely embodiments of the present invention and are not intended to limit the patent scope of the present invention. Any equivalent structure or equivalent process transformation made using the contents of the present invention specification and drawings, or directly or indirectly applied in other related technical fields, are also included in the patent protection scope of the present invention.

Claims

1. A method for storing and querying electronic voucher relationships, characterized in that: The following steps are involved: Collect the existing electronic voucher relationship log for each business; According to the electronic voucher relationship of each business, a link tracking ID and a layer counting ID are allocated to each electronic voucher of each business to form an electronic voucher relationship storage structure; Design query interface based on the electronic voucher relationship storage structure of each business; In actual business scenarios, the query interface is called to query the electronic voucher through the interface.

2. The electronic voucher relationship storage and query method according to claim 1, characterized in that: The link tracking ID is a globally unique identifier, and the same link tracking ID is assigned to all electronic certificates involved in the same business.

3. The electronic voucher relationship storage and query method according to claim 1, characterized in that: The hierarchical counting ID is a single identifier. For all electronic certificates involved in a business, a unique identifier is assigned to each electronic certificate according to its different hierarchical levels.

4. The electronic voucher relationship storage and query method according to claim 1, characterized in that: The electronic certificate relationship storage structure is specifically as follows: Consider each business as a root node. Starting from the root node, the electronic certificates involved in the business are sorted in a tree structure according to the hierarchical relationship in the relationship log. Each layer of the tree structure represents a level, and each node of the tree structure represents an electronic certificate. The child node of each node represents the electronic certificate of the next level contained in the electronic certificate, and the parent node of each node represents the electronic certificate of the previous level to which the electronic certificate belongs.

5. An electronic voucher relationship storage and query system, characterized in that: It includes an electronic voucher collection module, a storage structure building block, and a query module; The electronic voucher collection module is used to collect the existing electronic voucher relationship logs of each business; The storage structure building block is used to allocate a link tracking ID and a layer counting ID to each electronic voucher of each business according to the electronic voucher relationship of each business, form an electronic voucher relationship storage structure, and design a query interface based on the electronic voucher relationship storage structure of each business; The query module is used to call the query interface in an actual business scenario and query the electronic certificate through the interface.

6. The electronic voucher relationship storage and query system according to claim 5, characterized in that: The link tracking ID is a globally unique identifier, and the same link tracking ID is assigned to all electronic certificates involved in the same business.

7. The electronic voucher relationship storage and query system according to claim 5, characterized in that: The hierarchical counting ID is a single identifier. For all electronic certificates involved in a business, a unique identifier is assigned to each electronic certificate according to its different hierarchical levels.

8. The electronic voucher relationship storage and query system according to claim 5, characterized in that: The electronic certificate relationship storage structure is specifically as follows: Consider each business as a root node. Starting from the root node, the electronic certificates involved in the business are sorted in a tree structure according to the hierarchical relationship in the relationship log. Each layer of the tree structure represents a level, and each node of the tree structure represents an electronic certificate. The child node of each node represents the electronic certificate of the next level contained in the electronic certificate, and the parent node of each node represents the electronic certificate of the previous level to which the electronic certificate belongs.

9. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the program, the method according to any one of claims 1 to 4 is implemented.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, the method according to any one of claims 1 to 4 is implemented.

Images