CN112541793B - Information processing method, information processing device and electronic equipment - Google Patents
Information processing method, information processing device and electronic equipment Download PDFInfo
- Publication number
- CN112541793B CN112541793B CN202011548654.XA CN202011548654A CN112541793B CN 112541793 B CN112541793 B CN 112541793B CN 202011548654 A CN202011548654 A CN 202011548654A CN 112541793 B CN112541793 B CN 112541793B
- Authority
- CN
- China
- Prior art keywords
- node
- resource allocation
- current
- stored
- policy
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/02—Marketing; Price estimation or determination; Fundraising
- G06Q30/0207—Discounts or incentives, e.g. coupons or rebates
- G06Q30/0222—During e-commerce, i.e. online transactions
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
- G06F16/2246—Trees, e.g. B+trees
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2455—Query execution
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/02—Marketing; Price estimation or determination; Fundraising
- G06Q30/0207—Discounts or incentives, e.g. coupons or rebates
- G06Q30/0239—Online discounts or incentives
Abstract
The embodiment of the invention provides an information processing method, an information processing device and electronic equipment, wherein the method comprises the following steps: responding to a received query request for a current resource allocation strategy of a target product, and acquiring a current node identifier corresponding to the current resource allocation strategy in a node tree of the resource allocation strategy; each node is used for storing a resource allocation strategy, each node is provided with a node identifier, and a target path of the current node in the node tree is obtained according to the current node identifier, wherein the target path is a path from the current node to a root node; and acquiring a merging result of the resource allocation strategies stored by each node on the target path, and sending the merging result as the current resource allocation strategy to a terminal corresponding to the query request. The invention realizes the association between different resource allocation strategies through the node tree, and is convenient for developers to manage the association between the resource allocation strategies by utilizing the node tree.
Description
Technical Field
The present invention relates to the field of data communication, and in particular, to an information processing method, an information processing apparatus, and an electronic device.
Background
With the continuous progress of internet technology and society, the internet provides more and more convenience for the life of people. In particular, online shopping realized through the Internet meets the requirement that people cannot go home to buy articles.
To facilitate consumption, large online platforms typically offer items for sale in a variety of promotional programs, each of which is essentially a resource allocation strategy. Although the number of items is large, the resource allocation policies that different items can participate in may be the same or different, and therefore not too many resource allocation policies are involved. In order to conveniently inquire the resource allocation strategies which can be participated in by the articles, a resource allocation strategy library is adopted at present, and all the resource allocation strategies are randomly placed together, wherein different resource allocation strategies have different strategy identifications. When the resource allocation strategy which can be participated by the article is inquired, the corresponding resource allocation strategy can be inquired in the resource allocation strategy library through the strategy identification stored in the article attribute.
However, in general, there is a certain association between different resource allocation policies, and such an irregular storage manner of the resource allocation policy base cannot embody the association between the resource allocation policies, and cannot manage the association between the resource allocation policies.
Disclosure of Invention
In view of the above problems, embodiments of the present invention are provided to provide a pricing rule query method, a pricing rule query device, and an electronic device that overcome or at least partially solve the above problems.
In a first aspect, an embodiment of the present invention provides an information processing method, where the method includes:
responding to a received query request for a current resource allocation strategy of a target product, and acquiring a current node identifier corresponding to the current resource allocation strategy in a node tree of the resource allocation strategy; in the node tree, each node is used for storing a resource allocation strategy, each node has a node identifier, the resource allocation strategy stored by each father node is compatible with the resource allocation strategy stored by each child node under the father node, and the resource allocation strategies stored by each child node under the same father node are mutually exclusive;
acquiring a target path of a current node in the node tree according to the current node identifier, wherein the target path is a path from the current node to a root node;
and acquiring a merging result of the resource allocation strategies stored by each node on the target path, and sending the merging result as the current resource allocation strategy to a terminal corresponding to the query request.
Optionally, creating the node tree of storage resource allocation policies includes:
in response to receiving a selection of an Nth resource allocation policy for a target product, creating an Mth node storing the Nth resource allocation policy, wherein N, M are positive integers;
in response to receiving a selection of an N +1 th resource allocation policy under the nth resource allocation policy, creating an M +1 th node under the M-th node directory that stores the N +1 th resource allocation policy;
in response to the received selection of the N +2 th resource allocation policy under the N-th resource allocation policy, and the N +2 th resource allocation policy and the N +1 th resource allocation policy are mutually exclusive, an M +2 th node storing the N +2 th resource allocation policy is created under the M-th node directory, where the M +1 th node and the M +2 th node are child nodes of the M-th node, respectively.
Optionally, the obtaining a merged result of the resource allocation policies stored in each node on the target path as the current resource allocation policy and sending the merged result to the terminal corresponding to the query request includes:
and acquiring a merging result of the resource allocation strategies stored by the effective nodes in the nodes on the target path, and sending the merging result as the current resource allocation strategy to the terminal corresponding to the query request, wherein the current time is located in the effective time corresponding to the effective nodes.
Optionally, the method further comprises: when the invalid node appears in each node on the node tree, deleting the invalid node, and adjusting the child node of the invalid node to be the child node of the father node of the invalid node; and the current moment is positioned outside the effective time corresponding to the invalid node.
Optionally, when the number of the current node identifiers is at least two, a path from a node corresponding to a first node identifier to a root node in the at least two current node identifiers does not include nodes corresponding to the remaining node identifiers; wherein the remaining node identifiers are node identifiers of the at least two current node identifiers except the first node identifier;
the acquiring a merging result of the resource allocation policies stored by each node on the target path, serving as the current resource allocation policy, and sending the current resource allocation policy to the terminal corresponding to the query request includes:
and acquiring a merging result of the resource allocation strategies stored by each node on any one target path, and sending the merging result as the current resource allocation strategy to a terminal corresponding to the query request.
In a second aspect, an embodiment of the present invention further provides an information processing apparatus, where the apparatus includes:
the first response module is used for responding to a received query request for a current resource allocation strategy of a target product and acquiring a current node identifier corresponding to the current resource allocation strategy in a node tree of the resource allocation strategy; in the node tree, each node is used for storing a resource allocation strategy, each node has a node identifier, the resource allocation strategy stored by each father node is compatible with the resource allocation strategy stored by each child node under the father node, and the resource allocation strategies stored by each child node under the same father node are mutually exclusive;
a path module, configured to obtain a target path of a current node in the node tree according to the current node identifier, where the target path is a path from the current node to a root node;
and the resource allocation module is used for acquiring a merging result of the resource allocation strategies stored by each node on the target path, and sending the merging result as the current resource allocation strategy to the terminal corresponding to the query request.
Optionally, the apparatus further comprises:
a second response module, configured to create an mth node storing an nth resource allocation policy of a target product in response to a received selection of the nth resource allocation policy, where N, M are positive integers;
a third response module, configured to create, in response to the received selection of the (N + 1) th resource allocation policy under the nth resource allocation policy, an (M + 1) th node storing the (N + 1) th resource allocation policy under the M-th node directory;
a fourth response module, configured to, in response to a received selection of an N +2 th resource allocation policy under the N-th resource allocation policy, where the N +2 th resource allocation policy and the N +1 th resource allocation policy are mutually exclusive, create an M +2 th node storing the N +2 th resource allocation policy under the M-th node directory, where the M +1 th node and the M +2 th node are child nodes of the M-th node, respectively.
Optionally, each node in the node tree corresponds to an effective time, and the resource allocation module is specifically configured to obtain a merged result of resource allocation policies stored in effective nodes in each node on the target path, and send the merged result as the current resource allocation policy to the terminal corresponding to the query request, where the current time is located in the effective time corresponding to the effective node.
In a third aspect, an embodiment of the present invention further provides an electronic device, where the electronic device includes a memory, a processor, and a computer program stored in the memory and executable on the processor, and the processor implements the steps in the information processing method when executing the computer program.
In a fourth aspect, the embodiment of the present invention further provides a computer-readable storage medium, where a computer program is stored on the computer-readable storage medium, and when the computer program is executed by a processor, the computer program implements the steps in the information processing method described above.
In the embodiment of the invention, a node tree is set, wherein the node tree is created in response to the resource allocation strategy selected by the user and stored in at least one child node under the resource allocation strategy of the root node, each node is used for storing a resource allocation strategy, and each node has a node identifier. The method comprises the steps of storing a plurality of resource allocation strategies by adopting a tree structure, and reflecting the association among different resource allocation strategies by utilizing the association among nodes of the tree structure, namely the resource allocation strategy stored by each father node is compatible with the resource allocation strategy stored by each child node under the father node, and the resource allocation strategies stored by each child node under the same father node are mutually exclusive. When an inquiry request for a current resource allocation strategy of a target product is received, a target path from a current node corresponding to the current node identifier to a root node is determined according to the current node identifier corresponding to the current resource allocation strategy of the target product in a node tree, and then a combined result of the resource allocation strategies stored by each node on the target path is sent to a terminal corresponding to the inquiry request as the current resource allocation strategy.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the description of the embodiments of the present invention will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art that other drawings can be obtained according to these drawings without inventive labor.
FIG. 1 is a flowchart illustrating steps of an information processing method according to an embodiment of the present invention;
FIG. 2 is a diagram illustrating a structure of a node tree according to an embodiment of the present invention;
FIG. 3 is a second schematic diagram illustrating a node tree structure according to an embodiment of the present invention;
fig. 4 is a block diagram of an information processing apparatus according to an embodiment of the present invention;
fig. 5 is a block diagram of an electronic device according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
It should be appreciated that reference throughout this specification to "one embodiment" or "an embodiment" means that a particular feature, structure or characteristic described in connection with the embodiment is included in at least one embodiment of the present invention. Thus, the appearances of the phrases "in one embodiment" or "in an embodiment" in various places throughout this specification are not necessarily all referring to the same embodiment. Furthermore, the particular features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.
In various embodiments of the present invention, it should be understood that the sequence numbers of the following processes do not mean the execution sequence, and the execution sequence of each process should be determined by its function and inherent logic, and should not constitute any limitation to the implementation process of the embodiments of the present invention.
Referring to fig. 1, an embodiment of the present invention provides an information processing method, where the method includes:
step 101: and responding to the received query request for the current resource allocation strategy of the target product, and acquiring the current node identification corresponding to the current resource allocation strategy in the node tree of the resource allocation strategy.
It should be noted that the resource allocation policy may be a promotional policy for sale of the product. The product may be a physical product or a virtual product, such as a product on a shopping platform, in-game virtual currency, virtual equipment, and the like. Accordingly, the resource allocation policy may be full XX minus YY, full XX YY, top XX for YY, XX for giveaway, XX coupon, etc., where "XX" and "YY" may be any values.
In the process that a user purchases a target product through a terminal, the terminal sends a query request for querying a current resource allocation strategy of the target product to a server. Here, the current resource allocation policy for the target product refers to one or more promotional policies to which the target product participates. The promotion strategy participated by the product adopts a tree structure for storage, namely, a node storage resource allocation strategy in a node tree is adopted. In the node tree, each node is used for storing a resource allocation strategy, each node has a node identifier, the resource allocation strategy stored by each father node is mutually compatible with the resource allocation strategy stored by each child node under the father node, and the resource allocation strategies stored by each child node under the same father node are mutually exclusive. The two resource allocation strategies are compatible with each other, which means that no conflict occurs between the two resource allocation strategies, that is, a product can participate in a plurality of resource allocation strategies that are compatible with each other at the same time. For example, the two resource allocation policies are full 100 yuan minus 10 yuan and shop coupon 5 yuan, and when the product participates in the two resource allocation policies simultaneously, the two resource allocation policies are compatible with each other. The mutual exclusion of the two resource allocation strategies means that the two resource allocation strategies conflict with each other, namely, a product cannot participate in a plurality of mutually exclusive resource allocation strategies at the same time. For example, the two resource allocation strategies are full two seven-fold and full three-fold and five-fold respectively, and when a product can only participate in one of the resource allocation strategies at the same time, the two resource allocation strategies are mutually exclusive. Preferably, the node identifier may be a number, a letter, a special symbol, but is not limited thereto.
Step 102: and acquiring a target path of the current node in the node tree according to the current node identifier.
It should be noted that the node indicated by the current node identifier is the current node. It is also understood that the current node is the node having the current node identification. The target path is a path from the current node to the root node. Here, there is only one path from any node to the root node for each node in the node tree.
Step 103: and acquiring a merging result of the resource allocation strategies stored by each node on the target path, and sending the merging result as the current resource allocation strategy to a terminal corresponding to the query request.
It should be noted that the number of nodes on the target path may be one or more. And under the condition that the number of the nodes on the target path is multiple, the merging result of the resource allocation strategies stored by all or part of the nodes on the target path can be obtained and sent to the terminal corresponding to the query request as the current resource allocation strategy. Here, the terminal corresponding to the query request is the terminal that sent the query request before step 101. The merging result of the resource allocation policies stored in each node on the target path is obtained, and a policy set can be formed for obtaining the resource allocation policies stored in each node on the target path according to the obtained resource allocation policies. As shown in fig. 2, which is a schematic structural diagram of a node tree, when a current node is a node 4, a target path may be determined to be a path formed by the node 4, the node 2, and the node 1, and a current resource allocation policy of a target product includes resource allocation policies stored in the node 4, the node 2, and the node 1. Preferably, after the current resource allocation policy is sent to the terminal, the terminal may bill the target product according to the current resource allocation policy. Specifically, in the pricing, the account resources may be deducted (coupon, account balance, etc.) or given (return cash, resource giving, etc.) with reference to the resource conditions (coupon, account fund, return cash, etc.) of the consumption account, so as to generate the final settlement price.
In the embodiment of the invention, a node tree is set, wherein the node tree is created in response to a resource allocation strategy selected by a user and stored in at least one child node under the resource allocation strategy of a root node, each node is used for storing a resource allocation strategy, and each node has a node identifier. The method comprises the steps of storing a plurality of resource allocation strategies by adopting a tree structure, and reflecting the association among different resource allocation strategies by utilizing the association among nodes of the tree structure, namely the resource allocation strategy stored by each father node is compatible with the resource allocation strategy stored by each child node under the father node, and the resource allocation strategies stored by each child node under the same father node are mutually exclusive. When an inquiry request for a current resource allocation strategy of a target product is received, a target path from a current node corresponding to the current node identifier to a root node is determined according to the current node identifier corresponding to the current resource allocation strategy of the target product in a node tree, and then a combined result of the resource allocation strategies stored by each node on the target path is sent to a terminal corresponding to the inquiry request as the current resource allocation strategy.
Optionally, creating a node tree of storage resource allocation policies includes:
in response to receiving a selection of an Nth resource allocation policy for the target product, an Mth node storing the Nth resource allocation policy is created, wherein N, M are all positive integers.
It should be noted that M and N may be the same or different. For the target product, the user selects the resource allocation strategy that the target product can participate in, and the server can create a node according to the resource allocation strategy selected by the user and store the resource allocation strategy selected by the user in the node.
In response to receiving a selection of an N +1 th resource allocation policy under the nth resource allocation policy, an M +1 th node storing the N +1 th resource allocation policy is created under an M-th node directory.
It should be noted that the N +1 th resource allocation policy under the nth resource allocation policy means that the nth resource allocation policy and the N +1 th resource allocation policy have a mutual compatibility relationship.
And in response to the received selection of the (N + 2) th resource allocation strategy under the (N) th resource allocation strategy, wherein the (N + 2) th resource allocation strategy is mutually exclusive with the (N + 1) th resource allocation strategy, creating an (M + 2) th node for storing the (N + 2) th resource allocation strategy under the (M) th node directory.
It should be noted that the (N + 2) th resource allocation policy and the (N + 1) th resource allocation policy are both resource allocation policies under the nth resource allocation policy. Because the (N + 2) th resource allocation strategy and the (N + 1) th resource allocation strategy are mutually exclusive, the brother nodes are adopted for storage respectively, namely the (M + 1) th node and the (M + 2) th node are child nodes of the (M) th node respectively, namely the (M + 1) th node and the (M + 2) th node are brother nodes.
Of course, in general, the number of products is large, and the same node tree may be perfected according to the resource allocation strategy of each product. For example, if the resource allocation policy includes: cross store full 1000 minus 200, full 800 minus 200, full 1000 back 20, full 3-fold 7, full 300 minus 60, full 200 minus 30, and store coupons 100, the current resource allocation policy for product a includes cross store full 1000 minus 200, full 800 minus 200, and store coupons 100. The current resource allocation policy for product B includes a cross store full 1000 minus 200, full 1000 return 20, and store coupons 100. The current resource allocation policy for product C includes a cross store full 1000 minus 200, full 3-fold 7, and store coupons 100. The current resource allocation policy for product D includes full 1000 minus 200 and full 300 minus 60 across the store. The current resource allocation policy of product E includes full 1000 minus 200 and full 200 minus 30 across the store, and the generated node tree is shown in fig. 3, where nid is the node identification. At this time, if the target product is product a, the obtained current node identifier is 0071. And if the target product is the product B, the acquired current node identifier is 0072. And if the target product is the product C, the acquired current node identifier is 0073. If the target product is product D, the obtained current node identifier is 002. And if the target product is the product E, the acquired current node identifier is 001. When the current resource allocation policy of the product is changed, it is only necessary to modify the node tree.
In the embodiment of the invention, the resource allocation strategies can be stored by nodes with different relations according to the relation among the resource allocation strategies, so that the relation among the resource allocation strategies is clear and clear; and management of each resource allocation strategy is facilitated.
Optionally, each node in the node tree corresponds to an effective time, and the method for sending the merging result of the resource allocation policies stored in each node on the target path to the terminal corresponding to the query request as the current resource allocation policy includes:
and acquiring a merging result of the resource allocation strategies stored by the effective nodes in the nodes on the target path, and sending the merging result as a current resource allocation strategy to a terminal corresponding to the query request, wherein the current time is within the effective time corresponding to the effective nodes.
It should be noted that each node on the target path may be divided into an effective node and an ineffective node, and if a certain node is an ineffective node, the resource allocation policy stored by the node is invalid. The division basis is whether the current time is within the valid time of the node, if the current time is within the valid time of a certain node, the node is a valid node, and if the current time is out of the valid time of the certain node, the node is an invalid node. Preferably, the effective time of each node can be flexibly configured to meet the actual requirement. For example, for some festival-developed sales promotion activities, the valid time of the corresponding node may be set as the festival period, and after the festival passes, the corresponding node becomes an invalid node, and the pricing rule corresponding to the invalid node is invalid, so that no further operation by a developer is required. Specifically, the validity period includes a start time and an end time.
Of course, when there is an invalid node on the target path, the resource allocation policy stored in each valid node on the path from the current node to the invalid node closest to the current node may also be obtained, and sent to the terminal corresponding to the query request as the current resource allocation policy. That is, all nodes on the target path from the invalid node to the root node are culled. Here, the configuration policy may be preset, for example, when the configuration policy is the first policy, the resource allocation policy stored in the valid node of the nodes on the target path may be selected and sent to the terminal corresponding to the query request as the current resource allocation policy. When the configuration policy is the second policy, the resource allocation policy stored in each valid node on the path from the target node to the invalid node closest to the target node may be selected, and sent to the terminal corresponding to the query request as the current resource allocation policy.
In the embodiment of the invention, the actual requirements of merchants can be met by setting the effective time of the nodes, and the workload of developers is reduced.
Optionally, the method further comprises: when the invalid nodes appear in all the nodes on the node tree, deleting the invalid nodes, and adjusting the child nodes of the invalid nodes to be child nodes of the father nodes of the invalid nodes; and the current moment is positioned outside the effective time corresponding to the invalid node.
It should be noted that the current time is outside the valid time corresponding to the invalid node. When the node becomes an invalid node, the resource allocation policy stored by the invalid node is invalid, and at this time, the invalid node may be deleted, so as to avoid interference, and with reference to fig. 2, if the node 5 becomes an invalid node, the node 5 is deleted, and the node 6 is adjusted to be a child node of the node 2. Of course, the invalid node and all nodes below the invalid node may be deleted, and referring to fig. 2, if the node 5 becomes the invalid node, the node 5 and the node 6 are deleted.
In the embodiment of the invention, the invalid nodes on the node tree are deleted, so that the interference of the invalid nodes can be avoided, and the data volume is reduced.
Optionally, when the number of the current node identifiers is at least two, a path from a node corresponding to a first node identifier to the root node in the at least two current node identifiers does not include nodes corresponding to the remaining node identifiers; the rest node identification is the node identification except the first node identification in the at least two current node identifications;
acquiring a merging result of the resource allocation strategies stored by each node on the target path, and sending the merging result as the current resource allocation strategy to a terminal corresponding to the query request, wherein the merging result comprises the following steps:
and acquiring a merging result of the resource allocation strategies stored by each node on any target path, and sending the merging result as the current resource allocation strategy to a terminal corresponding to the query request.
It should be noted that the number of current node identifiers is the same as the number of current nodes, and the number of current nodes is the same as the number of target paths. And under the condition that the number of the current node identifications is at least two, the number of the current nodes is also at least two, and the number of the target paths is also at least two. Obtaining a merged result of the resource allocation policies stored by each node on any target path, as a current resource allocation policy, and sending the merged result to a terminal corresponding to the query request, may include: and randomly selecting any one of the at least two target paths, acquiring a combination result of the resource allocation strategies stored by each node on the selected target path, and sending the combination result as a current resource allocation strategy to a terminal corresponding to the query request.
Of course, when the resource allocation policy relates to pricing, the target product may also be priced according to the resource allocation policies stored in the nodes on each target path, and the merged result of the resource allocation policies stored in the nodes on the target path indicated by the pricing result with the smallest value is selected as the current resource allocation policy and sent to the terminal corresponding to the query request. For example, with continued reference to fig. 2, the target path includes a first target path composed of node 4, node 2, and node 1, and a second target path composed of node 7, node 3, and node 1. When the current resource allocation strategy of the target product is determined, the target product is priced according to the resource allocation strategies respectively stored by the node 4, the node 2 and the node 1, and a first pricing result is obtained. And pricing the target product according to the resource allocation strategies respectively stored in the node 7, the node 3 and the node 1 to obtain a second pricing result. And comparing the first pricing result with the second pricing result, and if the first pricing result is the minimum, selecting a combination result of the resource allocation strategies stored in the node 4, the node 2 and the node 1 as a current resource allocation strategy to be sent to a terminal corresponding to the query request. And if the second pricing result is the minimum, selecting a combination result of the resource allocation strategies stored in the node 7, the node 3 and the node 1 as the current resource allocation strategy and sending the combination result to a terminal corresponding to the query request.
In the embodiment of the invention, under the condition that the number of the target paths is at least two, the merging result of the resource allocation strategies stored by each node on one of the target paths can be freely selected as the current resource allocation strategy, so that the flexibility of setting the current resource allocation strategy of the target product is improved.
Having described the information processing method according to the embodiment of the present invention, an information processing apparatus according to the embodiment of the present invention will be described with reference to the drawings.
Referring to fig. 4, an embodiment of the present invention further provides an information processing apparatus, including:
a first response module 41, configured to, in response to a received query request for a current resource allocation policy of a target product, obtain a current node identifier corresponding to the current resource allocation policy in a node tree of the resource allocation policy; in the node tree, each node is used for storing a resource allocation strategy, each node has a node identifier, the resource allocation strategy stored by each father node is compatible with the resource allocation strategy stored by each child node under the father node, and the resource allocation strategies stored by each child node under the same father node are mutually exclusive;
a path module 42, configured to obtain a target path of the current node in the node tree according to the current node identifier, where the target path is a path from the current node to the root node;
and the resource allocation module 43 is configured to obtain a combination result of the resource allocation policies stored in each node on the target path, and send the combination result as the current resource allocation policy to the terminal corresponding to the query request.
Optionally, the apparatus further comprises:
a second response module, configured to create an mth node storing an nth resource allocation policy of the target product in response to the received selection of the nth resource allocation policy, where N, M are positive integers;
a third response module, configured to create, in response to the received selection of the (N + 1) th resource allocation policy under the nth resource allocation policy, an (M + 1) th node storing the (N + 1) th resource allocation policy under the (M) th node directory;
and the fourth response module is used for responding to the received selection of the (N + 2) th resource allocation strategy under the N resource allocation strategy, and if the (N + 2) th resource allocation strategy is mutually exclusive with the (N + 1) th resource allocation strategy, creating an (M + 2) th node for storing the (N + 2) th resource allocation strategy under the M node directory, wherein the (M + 1) th node and the (M + 2) th node are respectively child nodes of the M node.
Optionally, each node in the node tree corresponds to an effective time, and the resource allocation module 43 is specifically configured to obtain a merged result of resource allocation policies stored in the effective nodes in each node on the target path, and send the merged result as a current resource allocation policy to the terminal corresponding to the query request, where the current time is located in the effective time corresponding to the effective node.
Optionally, the apparatus further comprises: the adjusting module is used for deleting the invalid nodes and adjusting the child nodes of the invalid nodes to be child nodes of father nodes of the invalid nodes when the invalid nodes are monitored to appear in all the nodes on the node tree; and the current moment is positioned outside the effective time corresponding to the invalid node.
Optionally, when the number of the current node identifiers is at least two, a path from a node corresponding to a first node identifier to the root node in the at least two current node identifiers does not include nodes corresponding to the remaining node identifiers; the rest node identification is the node identification except the first node identification in the at least two current node identifications;
the resource allocation module 43 is specifically configured to obtain a combination result of the resource allocation policies stored in each node on any target path, and send the combination result as the current resource allocation policy to the terminal corresponding to the query request.
The information processing apparatus provided in the embodiment of the present invention can implement each process implemented by the information processing method in the method embodiment of fig. 1, and is not described herein again to avoid repetition.
In the embodiment of the invention, a node tree is set, wherein the node tree is created in response to the resource allocation strategy selected by a user and stored in at least one child node under the resource allocation strategy of the root node, each node is used for storing a resource allocation strategy, and each node has a node identifier. The method comprises the steps of storing a plurality of resource allocation strategies by adopting a tree structure, and reflecting the association among different resource allocation strategies by utilizing the association among nodes of the tree structure, namely the resource allocation strategy stored by each father node is compatible with the resource allocation strategy stored by each child node under the father node, and the resource allocation strategies stored by each child node under the same father node are mutually exclusive. When an inquiry request for a current resource allocation strategy of a target product is received, a target path from a current node corresponding to the current node identifier to a root node is determined according to the current node identifier corresponding to the current resource allocation strategy of the target product in a node tree, and then a combined result of the resource allocation strategies stored by each node on the target path is sent to a terminal corresponding to the inquiry request as the current resource allocation strategy.
On the other hand, the embodiment of the present invention further provides an electronic device, which includes a memory, a processor, a bus, and a computer program stored on the memory and executable on the processor, and when the processor executes the computer program, the steps in the information processing method are implemented.
For example, fig. 5 shows a schematic physical structure diagram of an electronic device.
As shown in fig. 5, the electronic device may include: a processor (processor)510, a communication Interface (Communications Interface)520, a memory (memory)530 and a communication bus 540, wherein the processor 510, the communication Interface 520 and the memory 530 communicate with each other via the communication bus 540. Processor 510 may call logic instructions in memory 530 to perform the following method:
responding to a received query request for a current resource allocation strategy of a target product, and acquiring a current node identifier corresponding to the current resource allocation strategy in a node tree of the resource allocation strategy; in the node tree, each node is used for storing a resource allocation strategy, each node has a node identifier, the resource allocation strategy stored by each father node is compatible with the resource allocation strategy stored by each child node under the father node, and the resource allocation strategies stored by each child node under the same father node are mutually exclusive;
acquiring a target path of a current node in a node tree according to the current node identifier, wherein the target path is a path from the current node to a root node;
and acquiring a merging result of the resource allocation strategies stored by each node on the target path, and sending the merging result as the current resource allocation strategy to a terminal corresponding to the query request.
Furthermore, the logic instructions in the memory 530 may be implemented in the form of software functional units and stored in a computer readable storage medium when the software functional units are sold or used as independent products. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
In still another aspect, an embodiment of the present invention further provides a computer-readable storage medium, on which a computer program is stored, where the computer program is implemented to, when executed by a processor, perform the information processing method provided in the foregoing embodiments, for example, including:
responding to a received query request for a current resource allocation strategy of a target product, and acquiring a current node identifier corresponding to the current resource allocation strategy in a node tree of the resource allocation strategy; in the node tree, each node is used for storing a resource allocation strategy, each node has a node identifier, the resource allocation strategy stored by each father node is compatible with the resource allocation strategy stored by each child node under the father node, and the resource allocation strategies stored by each child node under the same father node are mutually exclusive;
acquiring a target path of a current node in a node tree according to the current node identifier, wherein the target path is a path from the current node to a root node;
and acquiring a merging result of the resource allocation strategies stored by each node on the target path, and sending the merging result as the current resource allocation strategy to a terminal corresponding to the query request.
The above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.
Through the above description of the embodiments, those skilled in the art will clearly understand that each embodiment can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware. With this understanding in mind, the above-described technical solutions may be embodied in the form of a software product, which can be stored in a computer-readable storage medium such as ROM/RAM, magnetic disk, optical disk, etc., and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the methods described in the embodiments or some parts of the embodiments.
Finally, it should be noted that: the above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.
Claims (8)
1. An information processing method, characterized in that the method comprises:
responding to a received query request for a current resource allocation strategy of a target product, and acquiring a current node identifier corresponding to the current resource allocation strategy in a node tree of the resource allocation strategy; in the node tree, each node is used for storing a resource allocation strategy, each node has a node identifier, the resource allocation strategy stored by each father node is compatible with the resource allocation strategy stored by each child node under the father node, and the resource allocation strategies stored by each child node under the same father node are mutually exclusive;
acquiring a target path of a current node in the node tree according to the current node identifier, wherein the target path is a path from the current node to a root node;
acquiring a merging result of the resource allocation strategies stored by each node on the target path, and sending the merging result as the current resource allocation strategy to a terminal corresponding to the query request;
each node in the node tree corresponds to an effective time, and the acquiring of the merged result of the resource allocation policies stored by each node on the target path as the current resource allocation policy is sent to the terminal corresponding to the query request includes:
and acquiring a merging result of the resource allocation strategies stored by the effective nodes in the nodes on the target path, and sending the merging result as the current resource allocation strategy to the terminal corresponding to the query request, wherein the current time is located in the effective time corresponding to the effective nodes.
2. The method of claim 1, wherein creating the node tree of storage resource allocation policies comprises:
in response to receiving a selection of an Nth resource allocation policy for a target product, creating an Mth node storing the Nth resource allocation policy, wherein N, M are positive integers;
in response to receiving a selection of an N +1 th resource allocation policy under the nth resource allocation policy, creating an M +1 th node under the M-th node directory that stores the N +1 th resource allocation policy;
in response to the received selection of the N +2 th resource allocation policy under the N-th resource allocation policy, and the N +2 th resource allocation policy and the N +1 th resource allocation policy are mutually exclusive, an M +2 th node storing the N +2 th resource allocation policy is created under the M-th node directory, where the M +1 th node and the M +2 th node are child nodes of the M-th node, respectively.
3. The method of claim 1, further comprising: when the invalid node appears in each node on the node tree, deleting the invalid node, and adjusting the child node of the invalid node to be the child node of the father node of the invalid node; and the current moment is positioned outside the effective time corresponding to the invalid node.
4. The method according to claim 1, wherein when the number of the current node identifiers is at least two, a path from a node corresponding to a first node identifier to a root node in the at least two current node identifiers does not include nodes corresponding to the remaining node identifiers; wherein the remaining node identifiers are node identifiers of the at least two current node identifiers except the first node identifier;
the acquiring a merging result of the resource allocation policies stored by each node on the target path, serving as the current resource allocation policy, and sending the current resource allocation policy to the terminal corresponding to the query request includes:
and acquiring a merging result of the resource allocation strategies stored by each node on any one target path, and sending the merging result as the current resource allocation strategy to a terminal corresponding to the query request.
5. An information processing apparatus characterized in that the apparatus comprises:
the first response module is used for responding to a received query request for a current resource allocation strategy of a target product and acquiring a current node identifier corresponding to the current resource allocation strategy in a node tree of the resource allocation strategy; in the node tree, each node is used for storing a resource allocation strategy, each node has a node identifier, the resource allocation strategy stored by each father node is compatible with the resource allocation strategy stored by each child node under the father node, and the resource allocation strategies stored by each child node under the same father node are mutually exclusive;
a path module, configured to obtain a target path of a current node in the node tree according to the current node identifier, where the target path is a path from the current node to a root node;
the resource allocation module is used for acquiring a merging result of the resource allocation strategies stored by each node on the target path, and sending the merging result as the current resource allocation strategy to the terminal corresponding to the query request;
and the resource allocation module is specifically configured to obtain a combination result of resource allocation policies stored by effective nodes in each node on the target path, serve as the current resource allocation policy, and send the current resource allocation policy to the terminal corresponding to the query request, where the current time is located in the effective time corresponding to the effective nodes.
6. The apparatus of claim 5, further comprising:
a second response module, configured to create an mth node storing an nth resource allocation policy of a target product in response to a received selection of the nth resource allocation policy, where N, M are positive integers;
a third response module, configured to create, in response to the received selection of the (N + 1) th resource allocation policy under the nth resource allocation policy, an (M + 1) th node storing the (N + 1) th resource allocation policy under the M-th node directory;
a fourth response module, configured to, in response to a received selection of an N +2 th resource allocation policy under the N-th resource allocation policy, where the N +2 th resource allocation policy and the N +1 th resource allocation policy are mutually exclusive, create an M +2 th node storing the N +2 th resource allocation policy under the M-th node directory, where the M +1 th node and the M +2 th node are child nodes of the M-th node, respectively.
7. An electronic device comprising a processor, a memory and a computer program stored on the memory and executable on the processor, characterized in that the computer program, when executed by the processor, implements the steps of the information processing method according to any one of claims 1 to 4.
8. A computer-readable storage medium, characterized in that a computer program is stored thereon, which computer program, when being executed by a processor, realizes the steps of the information processing method according to any one of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011548654.XA CN112541793B (en) | 2020-12-23 | 2020-12-23 | Information processing method, information processing device and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011548654.XA CN112541793B (en) | 2020-12-23 | 2020-12-23 | Information processing method, information processing device and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112541793A CN112541793A (en) | 2021-03-23 |
| CN112541793B true CN112541793B (en) | 2022-04-26 |
Family
ID=75018039
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011548654.XA Active CN112541793B (en) | 2020-12-23 | 2020-12-23 | Information processing method, information processing device and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112541793B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1674517A (en) * | 2004-03-24 | 2005-09-28 | 华为技术有限公司 | Method and apparatus for realizing charge metering |
| CN101257386A (en) * | 2008-03-11 | 2008-09-03 | 南京邮电大学 | Dynamic accesses control method based on trust model |
| CN109544238A (en) * | 2018-11-26 | 2019-03-29 | 深圳乐信软件技术有限公司 | User behavior method for tracing, device, server and storage medium |
| CN110020905A (en) * | 2018-01-09 | 2019-07-16 | 阿里巴巴集团控股有限公司 | A kind of method, apparatus and system of digitization selection |
| CN110928710A (en) * | 2019-11-21 | 2020-03-27 | 网易（杭州）网络有限公司 | Information prompting method and device, electronic equipment and storage medium |
| CN110942338A (en) * | 2019-11-01 | 2020-03-31 | 支付宝(杭州)信息技术有限公司 | Marketing enabling strategy recommendation method and device and electronic equipment |
| CN111597193A (en) * | 2020-04-28 | 2020-08-28 | 广东亿迅科技有限公司 | Method for locking and unlocking tree-shaped data |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2003096669A2 (en) * | 2002-05-10 | 2003-11-20 | Reisman Richard R | Method and apparatus for browsing using multiple coordinated device |
| CN100411350C (en) * | 2005-03-01 | 2008-08-13 | 联想(北京)有限公司 | Mixed policy loading system and method for realizing policy management |
| CN102360452A (en) * | 2011-10-26 | 2012-02-22 | 西安电子科技大学 | Method for figuring out shortest path of large scale graphs based on fewest resource neural networks |
| CN105890609B (en) * | 2016-06-02 | 2019-01-25 | 同济大学 | A kind of paths planning method and system based on distributed dynamic road network |
-
2020
- 2020-12-23 CN CN202011548654.XA patent/CN112541793B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1674517A (en) * | 2004-03-24 | 2005-09-28 | 华为技术有限公司 | Method and apparatus for realizing charge metering |
| CN101257386A (en) * | 2008-03-11 | 2008-09-03 | 南京邮电大学 | Dynamic accesses control method based on trust model |
| CN110020905A (en) * | 2018-01-09 | 2019-07-16 | 阿里巴巴集团控股有限公司 | A kind of method, apparatus and system of digitization selection |
| CN109544238A (en) * | 2018-11-26 | 2019-03-29 | 深圳乐信软件技术有限公司 | User behavior method for tracing, device, server and storage medium |
| CN110942338A (en) * | 2019-11-01 | 2020-03-31 | 支付宝(杭州)信息技术有限公司 | Marketing enabling strategy recommendation method and device and electronic equipment |
| CN110928710A (en) * | 2019-11-21 | 2020-03-27 | 网易（杭州）网络有限公司 | Information prompting method and device, electronic equipment and storage medium |
| CN111597193A (en) * | 2020-04-28 | 2020-08-28 | 广东亿迅科技有限公司 | Method for locking and unlocking tree-shaped data |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112541793A (en) | 2021-03-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8484158B2 (en) | Managing information about avatars across virtual worlds | |
| CN104599153B (en) | Commodity recommendation method, commodity recommendation server and commodity recommendation terminal | |
| CN110827114A (en) | Commodity recommendation method and device | |
| CN108537576A (en) | Community's advertisement placement method, device, terminal device and storage medium | |
| CN107485859A (en) | Game invitation method, device and electronic equipment | |
| CN107870942A (en) | A kind of store panic buying design application process based on electric business platform | |
| CN109165953A (en) | Art sales method, apparatus, equipment and readable storage medium storing program for executing | |
| CN110807596A (en) | Cross-border e-commerce consignment warehouse storage management system and method | |
| CN106600373A (en) | Commodity transaction data processing method based on instant communication and system thereof | |
| CN110471904A (en) | A kind of store commodity data management method, device and storage medium | |
| CN111507673A (en) | Method and device for managing commodity inventory | |
| CN111080342A (en) | Resource allocation method and device, storage medium and electronic device | |
| CN111144970B (en) | Order splitting method and device, electronic equipment and readable medium | |
| CN109523336A (en) | Data processing method, device, electronic equipment and readable storage medium storing program for executing | |
| CN110458544A (en) | A kind of method of payment and payment services system across more cash register system | |
| CN112541793B (en) | Information processing method, information processing device and electronic equipment | |
| CN109146614A (en) | A kind of store data processing method and system based on small routine | |
| CN110503467B (en) | Cross-platform consumer group acquisition method and device | |
| CN109450770A (en) | Service executing apparatus, device, computer equipment and storage medium | |
| CN113837557A (en) | Order distribution processing method and device | |
| CN112837131A (en) | Sales application development method, device, equipment and storage medium | |
| CN107886346A (en) | Data object resource information processing method and device | |
| CN112184319A (en) | User relationship establishing method and device, electronic equipment and readable storage medium | |
| CN111870960A (en) | Virtual article acquisition method and device, electronic equipment and storage medium | |
| US20060143108A1 (en) | Negotiation system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |