An integral scheme searching method, device and equipment and storage medium

Abstract

The application discloses an integral scheme searching method and device, equipment and a storage medium, and relates to the technical field of computer software. The method comprises the following steps: acquiring an organization structure tree corresponding to a target merchant; determining different integral schemes contained in the organization structure tree, and acquiring scope nodes corresponding to the integral schemes; converting the integral schemes and the scope nodes corresponding to the integral schemes into an index structure and storing the index structure into a pre-designed integral scheme scope index table; wherein the integral scheme scope index table at least contains three fields of an integral scheme identification number, an index type and an index key; and searching for the integral schemes based on the integral scheme scope index table through an enterprise end and / or a client end. Through the technical scheme, different integral schemes can be used and operated under different regions and stores, and the system performance is greatly improved when searching for the schemes without relying on node traversal.

Description

Technical Field

[0001] This invention relates to the field of computer software technology, and in particular to a method, apparatus, device, and storage medium for finding integral schemes. Background Technology

[0002] Each merchant has an organizational structure, which is a top-down tree structure. The nodes in this tree structure can be divided from top to bottom according to their hierarchical relationship: Group, Brand, Region, Store, Pickup Point, etc. Figure 1 As shown. Chain merchants using CRM (Customer Relationship Management) systems need to operate points separately for directly operated and franchised areas. Merchants with weaker control also require separate management of multiple points account systems, supporting customers to earn and use points within designated store areas, and supporting independent calculation of points within franchised areas. Merchants can create multiple points schemes, each specifying different applicable organizational nodes to achieve points applicable and independently operated in different regions and stores. For example, Brand 1 creates a points scheme named "Gold Beans," specifying its applicable area as Area 2. Area 2 and its subordinate nodes, Stores 2 and 3, can earn and use "Gold Beans." Brand 1 and the group, as superiors, have the right to view or operate "Gold Beans." Therefore, there are scenarios involving the use and operation management of points schemes, requiring the determination of node permissions based on the organizational structure tree.

[0003] Currently, in scenarios involving the use and operation management of points programs, only applicable organizational nodes are stored. When searching for a program, the applicable scope is matched and calculated in memory by traversing the list of subordinate nodes of the current node in real time. However, when there are a large number of merchant nodes, the node traversal operation consumes a lot of system resources, affecting the normal response and stability of the system.

[0004] Therefore, how to provide a solution to the above-mentioned technical problems is a problem that needs to be solved by those skilled in the art. Summary of the Invention

[0005] In view of this, the purpose of this invention is to provide a method, apparatus, device, and storage medium for finding integration schemes, which eliminates the need for node traversal when searching for schemes, thus significantly improving system performance. The specific solution is as follows:

[0006] Firstly, this application discloses a method for finding an integration scheme, including:

[0007] Obtain the organizational structure tree corresponding to the target merchant;

[0008] Identify the different point schemes contained in the organizational structure tree, and obtain the applicable scope nodes corresponding to the point schemes;

[0009] The integration scheme and the applicable scope nodes corresponding to the integration scheme are converted into an index structure and stored in a pre-designed integration scheme applicable scope index table; wherein, the integration scheme applicable scope index table contains at least three fields: integration scheme identifier, index type, and index key;

[0010] Based on the index table of applicable scope of the points scheme, the points scheme can be searched through the enterprise terminal and / or client terminal.

[0011] Optionally, the step of converting the integration scheme and the applicable scope nodes corresponding to the integration scheme into an index structure and storing them in a pre-designed integration scheme applicable scope index table includes:

[0012] Each of the different scoring schemes is assigned a corresponding identifier, and the identifier is stored in the position of the scoring scheme identifier in the scoring scheme application scope index table;

[0013] Determine the current business scenario and store the business scenario in the index table of the applicable scope of the points scheme, at the position of the index type corresponding to the points scheme identifier number;

[0014] Based on the integration scheme identifier and the index type, the node identifier of the target node in the applicable scope node is determined, and the node identifier is stored in the position of the index key in the integration scheme applicable scope index table.

[0015] Optionally, determining the node identifier of the target node in the applicable scope nodes based on the integration scheme identifier and the index type, and storing the node identifier in the index key position of the integration scheme applicable scope index table, includes:

[0016] Set a corresponding node identifier for each node in the applicable scope;

[0017] Based on the points scheme identifier and the index type, determine the operational permissions of the target node in the applicable scope nodes;

[0018] If the operational permissions of the target node are only available to the current node, then obtain the first node identifier corresponding to the target node and store the first node identifier in the index key position of the index table of the applicable scope of the points scheme;

[0019] If the operational permissions of the target node are available to the current and descendant nodes, then obtain the second node identifier corresponding to the target node and store the second node identifier in the index key position of the index table of the applicable scope of the points scheme.

[0020] Optionally, the index table of the scope of application of the integration scheme is stored vertically.

[0021] Optionally, the step of searching for the points scheme based on the points scheme application scope index table through the enterprise terminal and / or client terminal includes:

[0022] When the enterprise searches for a points scheme using the points scheme application scope index table, it determines the third node identifier corresponding to the current node.

[0023] Based on the third node identifier, and according to the index table of applicable scope of the integration scheme, the integration scheme corresponding to the current node is determined using the first structured query statement.

[0024] Optionally, the step of searching for the points scheme based on the points scheme application scope index table through the enterprise terminal and / or client terminal includes:

[0025] When the client searches for an integration scheme through the integration scheme application scope index table, it determines the fourth node identifier corresponding to the current node and obtains the fifth node identifier corresponding to the node on the parent path of the current node.

[0026] Based on the fourth node identifier and the fifth node identifier, and according to the index table of applicable scope of the integration scheme, the integration scheme corresponding to the current node is determined using the second structured query statement.

[0027] Optionally, the integration scheme search method further includes:

[0028] Construct a scheme lookup interface based on the index table of applicable scope of the integration scheme;

[0029] Accordingly, based on the index table of applicable scope of the points scheme, the points scheme is searched through the enterprise end and / or client end, including:

[0030] Based on the index table of applicable scope of the points scheme, the points scheme can be searched by calling the scheme search interface through the preset points rule component on the enterprise side and / or the client side.

[0031] Secondly, this application discloses an integration scheme search device, comprising:

[0032] The architecture tree acquisition module is used to obtain the organizational structure tree corresponding to the target merchant;

[0033] The architecture tree structure acquisition module is used to determine the different points schemes contained in the organizational architecture tree and to obtain the applicable scope nodes corresponding to the points schemes.

[0034] The index table conversion module is used to convert the integration scheme and the applicable scope nodes corresponding to the integration scheme into an index structure and store them in a pre-designed integration scheme applicable scope index table; wherein, the integration scheme applicable scope index table contains at least three fields: integration scheme identifier, index type, and index key;

[0035] The points scheme search module is used to search for points schemes through the enterprise terminal and / or client terminal based on the points scheme application scope index table.

[0036] Thirdly, this application discloses an electronic device, which includes a processor and a memory; wherein the memory is used to store a computer program, which is loaded and executed by the processor to implement the integration scheme lookup method as described above.

[0037] Fourthly, this application discloses a computer-readable storage medium for storing a computer program; wherein the computer program, when executed by a processor, implements the integration scheme lookup method as described above.

[0038] This application provides a method for finding points schemes. First, the organizational structure tree corresponding to the target merchant is obtained. Second, the different points schemes contained in the organizational structure tree are identified, and the applicable scope nodes corresponding to each points scheme are obtained. Then, the points scheme and its corresponding applicable scope nodes are converted into an index structure and stored in a pre-designed points scheme applicable scope index table. The points scheme applicable scope index table contains at least three fields: points scheme identifier, index type, and index key. Finally, based on the points scheme applicable scope index table, the points scheme is searched through the enterprise end and / or the client end. It is evident that, using the technical solution of this application, only one traversal of the organizational structure tree corresponding to the target merchant is required, and then the corresponding points scheme and its applicable scope nodes are stored in the pre-designed points scheme applicable scope index table. In this way, after generating an index based on the organizational structure tree, searching for a solution no longer relies on node traversal. The enterprise side can search downwards for applicable points schemes at lower-level nodes based on the points scheme applicability index table. At the same time, the client can also trace upwards to the currently applicable points scheme based on the organizational structure tree through the points scheme applicability index table. This enables the use and operation of different points schemes in different regions and stores, greatly improving system performance.

[0039] In addition, the integration scheme search device, equipment and storage medium provided in this application correspond to the above-mentioned integration scheme search method and have the same effect. Attached Figure Description

[0040] To more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are only embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on the provided drawings without creative effort.

[0041] Figure 1 This is a schematic diagram of a merchant organizational structure disclosed in this application;

[0042] Figure 2 This is a flowchart of a method for finding an integral scheme disclosed in this application;

[0043] Figure 3 This is a schematic diagram of a two-level index table relationship disclosed in this application;

[0044] Figure 4 This application discloses a method for finding an integration scheme without using an index table.

[0045] Figure 5 This is a schematic diagram of an organizational structure tree disclosed in this application;

[0046] Figure 6 This is a schematic diagram of a product prototype disclosed in this application;

[0047] Figure 7 This is a flowchart of a specific method for finding an integral scheme disclosed in this application;

[0048] Figure 8 This is a schematic diagram of a method for finding an integral scheme disclosed in this application;

[0049] Figure 9 This is a schematic diagram illustrating the core model relationship of an integral scheme disclosed in this application;

[0050] Figure 10 This is a performance stress test diagram of a solution for finding an interface disclosed in this application;

[0051] Figure 11 This is a performance stress test diagram of a solution for finding an interface disclosed in this application;

[0052] Figure 12 This is a schematic diagram of an index table maintenance process disclosed in this application;

[0053] Figure 13 This is a schematic diagram illustrating the search and distribution of points according to a points system disclosed in this application;

[0054] Figure 14 This is a schematic diagram of the structure of an integral scheme search device disclosed in this application;

[0055] Figure 15 This is a structural diagram of an electronic device disclosed in this application. Detailed Implementation

[0056] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0057] Currently, chain merchants using CRM systems need to manage points separately for directly operated and franchised regions. Merchants with weaker control also require separate management of multiple points account systems. Therefore, scenarios exist involving the use and management of points schemes, requiring the determination of node permissions based on the organizational structure tree. Existing technology only stores applicable organizational nodes, and when tracing schemes, it iterates through the list of subordinate nodes of the current node in real time, performing applicable scope matching calculations in memory. However, existing technology has drawbacks: when the number of merchant nodes is large, the node traversal operation consumes significant system resources, affecting normal system response and stability.

[0058] To address this, this application provides an integral scheme search method that eliminates the need for node traversal during scheme search, significantly improving system performance.

[0059] This invention discloses a method for finding an integral scheme, see [link to relevant documentation]. Figure 2 As shown, the method includes:

[0060] Step S11: Obtain the organizational structure tree corresponding to the target merchant.

[0061] In this embodiment of the application, in order to find different points schemes used and operated in different regions and stores, the organizational structure tree corresponding to the target merchant is first obtained. The hierarchical relationship of the tree nodes in this organizational structure tree can include the brands created by the target merchant, as well as the points schemes applicable under different brands, the store nodes to which the points schemes apply, etc.

[0062] Step S12: Determine the different points schemes contained in the organizational structure tree, and obtain the applicable scope node corresponding to the points scheme.

[0063] In this embodiment, the organizational structure tree is traversed once to determine the different point allocation schemes contained in the organizational structure tree, and the applicable scope node corresponding to the point allocation scheme is obtained. It is understood that the applicable scope node may include the node that created the point allocation scheme, or it may include the node to which the point allocation scheme is applied.

[0064] Step S13: Convert the integration scheme and the applicable scope nodes corresponding to the integration scheme into an index structure and store them in a pre-designed integration scheme applicable scope index table; wherein the integration scheme applicable scope index table contains at least three fields: integration scheme identifier, index type, and index key.

[0065] In this embodiment, after determining the points scheme and the corresponding applicable scope node on the organizational structure tree, in order to better and more efficiently trace the points scheme, the applicable scope data of the points scheme is converted into an index structure and stored in a pre-designed points scheme applicable scope index table according to the organizational structure tree. That is, the points scheme and the corresponding applicable scope node are converted into an index structure and stored in the index table.

[0066] It should be noted that the points scheme application scope index table is a pre-designed index table used to store data transformed according to the organizational structure tree. The points scheme application scope index table contains at least three fields: points scheme identifier (ID), index type, and index key. The points scheme identifier indicates which points scheme the index belongs to; the index type indicates which business scenario the index is used for, such as management or usage scenarios; and the index key is the specific index information used to quickly find the corresponding points scheme identifier. Furthermore, to avoid interference between indexes from different business scenarios, in this embodiment, the points scheme application scope index table is stored vertically.

[0067] Table 1 illustrates an example of a points plan application scope index table, `point_plan_index`. As you can see, in addition to the three required fields—point plan identifier, index type, and index key—it may also include an index identifier (ID), a merchant unique identifier, priority, and some fields related to basic operations, such as whether it's deleted, creation time, and update time.

[0068] Table 1

[0069] field name type describe id bigint Index ID, auto-incrementing primary key bos_id bigint Merchant Unique Identifier plan_id bigint Points scheme ID apply_type tinyint Index type: 1-Use; 2-Management apply_key varchar(50) Index Key priority int Priority is_deleted tinyint Delete? create_time datetime Creation time update_time datetime Update time

[0070] Furthermore, such as Figure 3The diagram illustrates the table structure relationship between the points scheme application scope index table `point_plan_index` and the points scheme table `point_plan`. The points scheme table and the points scheme application scope index table have a 1:N relationship. Therefore, after determining the corresponding points scheme ID based on the points scheme application scope index table `point_plan_index`, the points scheme table can be searched using that ID to further determine the relevant information of the target merchant, achieving points scheme lookup based on a secondary index table. For example, Table 2 shows a schematic of a points scheme table `point_plan`. After finding the corresponding `plan_id` based on the points scheme application scope index table, the points scheme table can be searched using that `plan_id`.

[0071] Table 2

[0072]

[0073]

[0074] Step S14: Based on the index table of applicable scope of the points scheme, search for the points scheme through the enterprise terminal and / or client terminal.

[0075] In this embodiment, the points scheme applicability index table allows the enterprise (B-end, Business) to search downwards for applicable points schemes at lower-level nodes, that is, to find points schemes with operational permissions at lower-level nodes. Simultaneously, it allows the client (C-end, Consumer) to trace upwards to the currently applicable points scheme.

[0076] like Figure 4 The diagram illustrates a logical flowchart for finding an integration scheme without using an index table. Taking tracing the integration scheme upwards from the current node as an example: First, the current node is checked to see if there is an applicable scheme. This means that if there is an applicable scheme, the current node has a scheme to create, or the scope of the scheme created by the parent node covers the current node. If the current node has an applicable scheme, the scheme ID is directly output; otherwise, the parent node is checked to see if it has an applicable scheme. Similarly, if the parent node has an applicable scheme, the scheme ID is directly output; otherwise, the parent node is used as the current node, and the process of checking the parent node is repeated until the parent node becomes the top-level node, ending the current process. It is evident that without an index table, complex calculations need to be performed in memory, and this calculation process includes some repetitive query operations, such as organizing node traversal operations. This poses a high risk, especially in scenarios with extremely high QPS (Query Per Second) requirements.

[0077] Therefore, for this scenario, in one specific implementation of this application embodiment, when searching for an points scheme through a scheme index table, the process can be simplified to the following steps: That is, when the enterprise searches for a points scheme through the points scheme application scope index table, it determines the third node identifier corresponding to the current node; based on the third node identifier, according to the points scheme application scope index table, it uses a first structured query statement to determine the points scheme corresponding to the current node. In another specific implementation, the process can be simplified to the following two steps: That is, when the client searches for a points scheme through the points scheme application scope index table, it determines the fourth node identifier corresponding to the current node and obtains the fifth node identifier corresponding to the node on the parent path of the current node; based on the fourth node identifier and the fifth node identifier, according to the points scheme application scope index table, it uses a second structured query statement to determine the points scheme corresponding to the current node. It should be noted that each node corresponds to its own node identifier, which facilitates the management of each node.

[0078] like Figure 5 The diagram illustrates an exemplary organizational structure tree. Under node 100, scheme A001 is created by node 101, and scheme B001 is created by node 102. When a client searches for an integral scheme using the integral scheme applicability index table, that is, tracing the integral scheme within the usage scenario, taking node 106 as an example: First, the parent path of 106 is queried (this process is very time-efficient): 100, 101, 103, 106; second, the tracing scheme SQL statement is executed: `select planId from point_plan_index where applyType=1 and applyKey in('100 / ','101 / ','103 / ','106 / ','106')limit 1`; where adding a slash after the node identifier indicates that the node and its descendant nodes are subject to the current integral scheme. Thus, it can be found that the integral scheme applicable to node 106 is A001. Similarly, when searching for an points-based scheme in a management scenario, taking node 100 as an example: the query scope includes points-based schemes created or applicable to the current node and its child nodes (only those currently created have edit permissions, while the rest have view permissions). Without an index table, implementing this logic would require complex in-memory calculations. However, through this embodiment, based on the index table, it can be simplified to a single SQL statement: `select planId from point_plan_index where applyType=2 and applyKey=100`. It is evident that after generating an index based on the organizational structure tree, searching for a scheme no longer relies on node traversal, significantly improving system performance.

[0079] This application provides a method for finding points schemes. First, the organizational structure tree corresponding to the target merchant is obtained. Second, the different points schemes contained in the organizational structure tree are identified, and the applicable scope nodes corresponding to each points scheme are obtained. Then, the points scheme and its corresponding applicable scope nodes are converted into an index structure and stored in a pre-designed points scheme applicable scope index table. The points scheme applicable scope index table contains at least three fields: points scheme identifier, index type, and index key. Finally, based on the points scheme applicable scope index table, the points scheme is searched through the enterprise end and / or the client end. It is evident that, using the technical solution of this application, only one traversal of the organizational structure tree corresponding to the target merchant is required, and then the corresponding points scheme and its applicable scope nodes are stored in the pre-designed points scheme applicable scope index table. In this way, after generating an index based on the organizational structure tree, searching for a solution no longer relies on node traversal. The enterprise side can search downwards for applicable points schemes at lower-level nodes based on the points scheme applicability index table. At the same time, the client can also trace upwards to the currently applicable points scheme based on the organizational structure tree through the points scheme applicability index table. This enables the use and operation of different points schemes in different regions and stores, greatly improving system performance.

[0080] like Figure 6 The image shown is a schematic diagram of a product prototype. From the perspective of the points system on the consumer (C-end): As shown in the diagram, the system first checks if the current node has created or is applicable to a points system; if not, it checks if the nearest parent node has an applicable system, and if so, inherits the parent node's system. For example: Store B3 is within the scope of brand system P1, so system P1 is available; Store B1-1 has no system, but its parent node B1 is within the scope of region B's system P2, so it can inherit region B1's system P2. From the perspective of the points system operation and management on the business (B-end): As shown in the diagram, the system can manage the systems created by the current node and view the currently applicable and subordinate systems. For example: Region B can manage system P2 (created by Region B) and view systems P1 (available to Store B3) and P2.

[0081] In one specific implementation, see Figure 7 As shown, this involves a method for pre-generating an index table for the applicability scope of an points-based scheme under a multi-level organizational structure, and a method for finding target data. The step of converting the points-based scheme and the corresponding applicability scope nodes into an index structure and storing them in a pre-designed index table for the applicability scope of the points-based scheme includes:

[0082] Step S21: Set a corresponding identifier for each of the different integration schemes, and store the identifier in the position of the integration scheme identifier in the integration scheme application scope index table.

[0083] In this embodiment, during the process of determining the final index table for the applicable scope of the points scheme, a corresponding identifier is set for each different points scheme. Since the index table for the applicable scope of the points scheme contains at least three fields: points scheme ID, index type, and index key, converting the points scheme into an index structure and storing it in the index table for the applicable scope of the points scheme is equivalent to storing the identifier corresponding to each different points scheme in the index table for the points scheme identifier.

[0084] Step S22: Determine the current business scenario and store the business scenario in the index type corresponding to the points scheme identifier in the points scheme application scope index table.

[0085] In this embodiment, the index type is used to indicate which business scenario the index is applicable to. Currently, two scenarios are described: management scenario and usage scenario. The business scenario under the current points scheme is stored at the corresponding index type position in the index table within the index type's position of the points scheme application scope index table.

[0086] Step S23: Based on the integration scheme identifier and the index type, determine the node identifier of the target node in the applicable scope node, and store the node identifier in the position of the index key in the integration scheme applicable scope index table.

[0087] In this embodiment, each node is also assigned its own corresponding node identifier. It should be noted that during the process of converting the applicable scope nodes corresponding to the points scheme into an index structure and storing it in the points scheme applicable scope index table, it is necessary to further determine the operational permissions of the nodes stored in the index table. It should be noted that the conversion of the index key is divided into: available only to the current node and available to the current and descendant nodes. If the operational permission of the target node is available only to the current node, then the first node identifier corresponding to the target node is obtained, and the first node identifier is stored in the index key position of the points scheme applicable scope index table. If the operational permission of the target node is available to the current and descendant nodes, then the second node identifier corresponding to the target node is obtained, and the second node identifier is stored in the index key position of the points scheme applicable scope index table.

[0088] like Figure 8 As shown, when only the current node is available, the index key only needs to store the node identifier; when both the current and descendant nodes are available, the index key can be appended with a " / " to the end of the node identifier to indicate the index range. For example, in Figure 8In the diagram, 101 indicates that only node 101 is available, and 103 / indicates that node 103 and its descendant nodes are available. In the diagram, planId represents the integration scheme identifier; applyKey represents the index key; and applyType represents the index type. For ease of understanding, Chinese characters are used here, but in actual implementation, they can be replaced with an enumeration.

[0089] Figure 9 This is a data model relationship diagram in this embodiment. In the Merchant Center, `bosId` corresponds to the unique identifier of the merchant, and `vid` corresponds to the identifier of the store; the relationship between merchants and stores is 1:N. Merchants manage points accounts in the points business data through their pass `wid`, and in the points business data, points accounts and points transaction records also have a 1:N relationship. Merchants manage different points schemes, while stores correspond to points schemes of 0…1. The overall implementation reflects the relationship between the Merchant Center, points rules, and points business data.

[0090] In another specific implementation, the points scheme search method further includes: constructing a scheme search interface based on the points scheme applicability scope index table. Correspondingly, searching for points schemes through the enterprise end and / or client end based on the points scheme applicability scope index table includes: searching for points schemes through the enterprise end and / or client end by calling the scheme search interface via a preset points rule component based on the points scheme applicability scope index table.

[0091] In this embodiment of the application, a dedicated scheme lookup interface is provided when searching for an integration scheme through the integration scheme applicability index table. For example... Figure 10 , Figure 11 The diagram shows the performance test data of the solution search interface. Among them, Figure 10 The horizontal axis represents time, and the vertical axis represents TPS (Transactions Per Second). Figure 11 In the graph, the horizontal axis represents time, and the vertical axis represents the average response time. We can obtain the following: Average TPS: 14764; Maximum TPS: 16068; Average response time: 15.73ms; 90% Line: 31.45ms; 95% Line: 43.23ms; 99% Line: 178.43ms.

[0092] It should be noted that the integration scheme and index table can also be maintained in the embodiments of this application. For example Figure 12As shown, when editing a scheme, it checks if the applicable organization conflicts with other schemes. Understandably, a node can only apply to one scheme. If the current node conflicts with another scheme, an error is reported and returned to the front end, disallowing scheme editing. Only when the applicable organization does not conflict with other schemes can the applicable organization index structure transformation be further performed, and then the current scheme is saved. When an organization node changes, such as when points are updated or the applicable scheme for a node changes, the applicable organization index structure is transformed again, and then the index is updated and saved. Figure 13 The diagram illustrates a points distribution process. The points rules component can call a scheme lookup interface to trace the points scheme process. When points are distributed to a specific user under a particular points scheme, the points transaction component can perform account creation / update operations and write points transaction records. After the points transaction component completes its execution, it returns to the points business interface for updates.

[0093] Accordingly, this application also discloses an integration scheme search device, see [link to relevant documentation]. Figure 14 As shown, the device includes:

[0094] The architecture tree acquisition module 11 is used to acquire the organizational structure tree corresponding to the target merchant.

[0095] The architecture tree structure acquisition module 12 is used to determine the different points schemes contained in the organizational architecture tree and to acquire the applicable scope nodes corresponding to the points schemes.

[0096] The index table conversion module 13 is used to convert the integration scheme and the applicable scope nodes corresponding to the integration scheme into an index structure and store them in a pre-designed integration scheme applicable scope index table; wherein, the integration scheme applicable scope index table contains at least three fields: integration scheme identifier, index type, and index key;

[0097] The points scheme search module 14 is used to search for points schemes through the enterprise terminal and / or client terminal based on the points scheme application scope index table.

[0098] For more detailed information on the working process of each of the above modules, please refer to the relevant content disclosed in the foregoing embodiments, which will not be repeated here.

[0099] Therefore, the above-described solution in this embodiment first obtains the organizational structure tree corresponding to the target merchant; secondly, it determines the different points schemes contained in the organizational structure tree and obtains the applicable scope nodes corresponding to the points schemes; then, it converts the points schemes and the applicable scope nodes corresponding to the points schemes into an index structure and stores them in a pre-designed points scheme applicable scope index table; wherein, the points scheme applicable scope index table contains at least three fields: points scheme identifier, index type, and index key; finally, based on the points scheme applicable scope index table, it performs points scheme lookup through the enterprise end and / or client end. It is evident that, through the technical solution of this application, only one traversal of the organizational structure tree corresponding to the target merchant is required, and then the corresponding points scheme and the applicable scope nodes under that points scheme are stored in the pre-designed points scheme applicable scope index table. In this way, after generating an index based on the organizational structure tree, searching for a solution no longer relies on node traversal. The enterprise side can search downwards for applicable points schemes at lower-level nodes based on the points scheme applicability index table. At the same time, the client can also trace upwards to the currently applicable points scheme based on the organizational structure tree through the points scheme applicability index table. This enables the use and operation of different points schemes in different regions and stores, greatly improving system performance.

[0100] Furthermore, embodiments of this application also disclose an electronic device, Figure 15 This is a structural diagram of an electronic device 20 according to an exemplary embodiment. The content of the diagram should not be construed as limiting the scope of this application.

[0101] Figure 15 This is a schematic diagram of the structure of an electronic device 20 provided in an embodiment of this application. Specifically, the electronic device 20 may include: at least one processor 21, at least one memory 22, a power supply 23, a communication interface 24, an input / output interface 25, and a communication bus 26. The memory 22 stores a computer program, which is loaded and executed by the processor 21 to implement the relevant steps in the integration scheme search method disclosed in any of the foregoing embodiments. Alternatively, the electronic device 20 in this embodiment may specifically be a computer.

[0102] In this embodiment, the power supply 23 is used to provide operating voltage for each hardware device on the electronic device 20; the communication interface 24 can create a data transmission channel between the electronic device 20 and external devices, and the communication protocol it follows can be any communication protocol applicable to the technical solution of this application, and is not specifically limited here; the input / output interface 25 is used to acquire external input data or output data to the outside world, and its specific interface type can be selected according to specific application needs, and is not specifically limited here.

[0103] In addition, the memory 22, as a carrier for resource storage, can be a read-only memory, random access memory, disk, or optical disk, etc. The resources stored on it can include an operating system 221, computer programs 222, and data 223, etc. The data 223 can include various types of data. The storage method can be temporary storage or permanent storage.

[0104] The operating system 221 is used to manage and control the various hardware devices on the electronic device 20 and the computer program 222, which may be Windows Server, Netware, Unix, Linux, etc. In addition to including a computer program capable of performing the integration scheme search method executed by the electronic device 20 as disclosed in any of the foregoing embodiments, the computer program 222 may further include a computer program capable of performing other specific tasks.

[0105] Furthermore, this application also discloses a computer-readable storage medium, which includes random access memory (RAM), main memory, read-only memory (ROM), electrically programmable ROM, electrically erasable programmable ROM, registers, hard disks, magnetic disks, optical disks, or any other form of storage medium known in the art. The computer program, when executed by a processor, implements the aforementioned integration scheme search method. Specific steps of this method can be found in the corresponding content disclosed in the foregoing embodiments, and will not be repeated here.

[0106] The various embodiments in this specification are described in a progressive manner, with each embodiment focusing on its differences from other embodiments. Similar or identical parts between embodiments can be referred to interchangeably. For the apparatus disclosed in the embodiments, since it corresponds to the method disclosed in the embodiments, the description is relatively simple; relevant parts can be referred to in the method section.

[0107] The steps of the integration scheme search or algorithm described in conjunction with the embodiments disclosed herein can be implemented directly by hardware, a software module executed by a processor, or a combination of both. The software module can be located in random access memory (RAM), main memory, read-only memory (ROM), electrically programmable ROM, electrically erasable programmable ROM, registers, hard disk, removable disk, CD-ROM, or any other form of storage medium known in the art.

[0108] Finally, it should be noted that in this document, relational terms such as "first" and "second" are used only to distinguish one entity or operation from another, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Furthermore, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitations, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes said element.

[0109] The above provides a detailed description of the integration scheme search method, apparatus, device, and storage medium provided by the present invention. Specific examples have been used to illustrate the principles and implementation methods of the present invention. The description of the above embodiments is only for the purpose of helping to understand the method and core ideas of the present invention. At the same time, for those skilled in the art, there will be changes in the specific implementation methods and application scope based on the ideas of the present invention. Therefore, the content of this specification should not be construed as a limitation of the present invention.

Claims

1. An integral scheme search method characterized by, The application comprises the following steps: obtaining an organizational structure tree corresponding to a target merchant; determining different credit schemes contained in the organizational structure tree, and obtaining applicable range nodes corresponding to the credit schemes; converting the credit schemes and the applicable range nodes corresponding to the credit schemes into an index structure and storing them in a pre-designed credit scheme applicable range index table; wherein the credit scheme applicable range index table at least contains three fields of a credit scheme identification number, an index type, and an index key; based on the credit scheme applicable range index table, performing credit scheme searching through an enterprise end and / or a client end; the credit scheme searching through the enterprise end and / or the client end based on the credit scheme applicable range index table comprises the following steps: when the enterprise end performs credit scheme searching through the credit scheme applicable range index table, determining a third node identification corresponding to a current node; based on the third node identification, determining a credit scheme corresponding to the current node by using a first structured query statement according to the credit scheme applicable range index table; when the client end performs credit scheme searching through the credit scheme applicable range index table, determining a fourth node identification corresponding to the current node, and obtaining a fifth node identification corresponding to a node on a parent path of the current node; based on the fourth node identification and the fifth node identification, determining a credit scheme corresponding to the current node by using a second structured query statement according to the credit scheme applicable range index table.

2. The method of claim 1, wherein, the conversion of the credit schemes and the applicable range nodes corresponding to the credit schemes into an index structure and the storage of the index structure in the pre-designed credit scheme applicable range index table comprises the following steps: setting an identification number corresponding to each of the different credit schemes respectively, and storing the identification number in a position of the credit scheme identification number in the credit scheme applicable range index table; determining a current business scenario, and storing the business scenario in a position of an index type corresponding to the credit scheme identification number in the credit scheme applicable range index table; based on the credit scheme identification number and the index type, determining a node identification of a target node in the applicable range node, and storing the node identification in a position of the index key in the credit scheme applicable range index table.

3. The method of claim 2, wherein, the determination of the node identification of the target node in the applicable range node based on the credit scheme identification number and the index type, and the storage of the node identification in the position of the index key in the credit scheme applicable range index table comprises the following steps: setting a node identification corresponding to each of the nodes in the applicable range node respectively; based on the credit scheme identification number and the index type, judging an operation authority of a target node in the applicable range node; if the operation authority of the target node is only the current node available, obtaining a first node identification corresponding to the target node, and storing the first node identification in the position of the index key in the credit scheme applicable range index table; If the operation permission of the target node is available for current and descendant nodes, a second node identifier corresponding to the target node is acquired, and the second node identifier is stored in a position of the index key in the integral scheme applicable range index table.

4. The method of claim 1, wherein, The integral scheme applicable range index table is stored longitudinally.

5. The method of claim 1 to 4, wherein, Further comprising: A scheme lookup interface is constructed according to the integral scheme applicable range index table. Correspondingly, based on the integral scheme applicable range index table, integral scheme lookup is performed through the enterprise end and / or the client end, including: Based on the integral scheme applicable range index table, the scheme lookup interface is called through a preset integral rule component through the enterprise end and / or the client end to perform integral scheme lookup.

6. An award scheme lookup apparatus, characterized by Including: An organizational structure tree acquisition module is configured to acquire an organizational structure tree corresponding to a target merchant; An organizational structure tree structure acquisition module is configured to determine different integral schemes contained in the organizational structure tree and acquire applicable range nodes corresponding to the integral schemes; An index table conversion module is configured to convert the integral schemes and the applicable range nodes corresponding to the integral schemes into an index structure and store the index structure in a pre-designed integral scheme applicable range index table; wherein the integral scheme applicable range index table contains at least three fields of an integral scheme identifier number, an index type and an index key; An integral scheme lookup module is configured to perform integral scheme lookup through the enterprise end and / or the client end based on the integral scheme applicable range index table; The integral scheme lookup module is specifically configured to: When the enterprise end performs integral scheme lookup through the integral scheme applicable range index table, a third node identifier corresponding to a current node is determined; Based on the third node identifier, a first structured query statement is used to determine an integral scheme corresponding to the current node according to the integral scheme applicable range index table; When the client end performs integral scheme lookup through the integral scheme applicable range index table, a fourth node identifier corresponding to a current node is determined, and a fifth node identifier corresponding to a node on a parent path of the current node is acquired; Based on the fourth node identifier and the fifth node identifier, a second structured query statement is used to determine an integral scheme corresponding to the current node according to the integral scheme applicable range index table.

7. An electronic device, comprising: The electronic device includes a processor and a memory; wherein the memory is used to store a computer program, the computer program is loaded and executed by the processor to realize the integral scheme lookup method in any one of claims 1 to 5.

8. A computer-readable storage medium, characterized in that, A computer program is stored; wherein the computer program is executed by a processor to realize the integral scheme lookup method in any one of claims 1 to 5.

Images