A data processing method and device, electronic equipment and storage medium

Abstract

Embodiments of the present application provide a data processing method and device, electronic equipment and storage medium, the method comprises: obtaining the node information of the first node where the user currently stays in the target journey graph, the node information comprising node flow transfer conditions; when the first node is a waiting node, sending a waiting message to a preset message queue, and monitoring the waiting time through the preset message queue; when the waiting time meets the node flow transfer conditions of the waiting node, generating node flow transfer information; according to the node flow transfer information, determining the second node to be transferred in the target journey graph; wherein the second node is a node different from the first node in the target journey graph; transferring the user from the first node to the second node in the target journey graph, and updating the first node stored in the preset storage location by using the second node. By applying the embodiments of the present application, the storage space can be saved while improving the efficiency of node flow transfer.

Description

Technical Field

[0001] This invention relates to the field of data processing technology, and in particular to a data processing method, apparatus, electronic device, and storage medium. Background Technology

[0002] User journey marketing is a user-centric marketing strategy based on user behavior and needs. By deeply understanding user needs and experiences, it provides personalized products and services to improve user experience and conversion rates. For example, user journey marketing can develop different operational strategies at each stage of the user lifecycle (from when a user becomes aware of their need to when they finally purchase the product) based on the user's continuous behavior over a predetermined period (such as several days). Each stage corresponds to a node, allowing users to continuously move between nodes corresponding to different stages, thereby providing personalized products and services.

[0003] Traditional user journey marketing, after identifying target users, uses a journey map to describe the various stages users may experience during their purchase decision-making process. The flow between nodes at each stage of the journey map works as follows: users can only proceed to the next node and have their strategy displayed if their behavior within a preset timeframe meets the policy conditions of the marketing strategy corresponding to the previous node. For example, the policy conditions of the marketing strategy corresponding to the previous node might be meeting the requirements for displaying target resource positions a certain number of times over a certain number of days. However, this method requires judging user behavior within a preset timeframe and then storing that behavior, resulting in a large amount of data, consuming significant storage space, and hindering the flow of nodes, thus impacting personalized recommendations. Summary of the Invention

[0004] The purpose of this invention is to provide a data processing method, apparatus, electronic device, and storage medium to improve node flow efficiency while saving storage space, thereby enabling personalized recommendations for users. The specific technical solution is as follows:

[0005] In a first aspect of this invention, a data processing method is provided, the method comprising:

[0006] Obtain the node information of the first node where the user is currently located in the target journey graph. The node information includes node transition conditions. The node transition conditions are used to determine whether the user can enter the next node of the target journey graph.

[0007] When the first node is a waiting node, a waiting message is sent to a preset message queue, and the waiting time is monitored through the preset message queue; the waiting node represents a node that needs to be delayed for a set time before entering the next node of the target journey map;

[0008] When the waiting time meets the node transfer condition of the waiting node, node transfer information is generated; the node transfer information is used to indicate that the user is transferred from the current node to the next node of that node;

[0009] Based on the node flow information, a second node in the target journey graph is determined for the user to flow through; wherein, the second node is a node in the target journey graph that is different from the first node;

[0010] The user is transferred from the first node currently in the target journey graph to the second node, and the second node is used to update the first node stored at a preset storage location.

[0011] In one possible implementation, the method further includes:

[0012] When the first node is not a waiting node, the user's historical information at the first node is obtained from the preset storage location; the historical information represents the behavioral information generated when the user accesses the requested resource bit within a historical time period.

[0013] When the historical information satisfies the node transfer conditions of the first node, node transfer information is generated.

[0014] In one possible implementation, after transferring the user from the first node currently in the target journey graph to the second node, the method further includes:

[0015] When the user triggers the target behavior, the target behavior verification message of the user is obtained; the target behavior verification message is used to indicate whether the target behavior triggered by the user meets the conditions for node flow.

[0016] Based on the target behavior verification message, the user's historical target behavior information at the second node is obtained from the preset storage location;

[0017] When the historical target behavior information satisfies the node transition conditions of the second node, node transition information is generated, and the third node to be transitioned by the user in the target journey graph is determined.

[0018] The user is transferred from the second node in the target journey graph to the third node, and the third node is used to update the second node stored at the preset storage location.

[0019] In one possible implementation, the target journey graph includes nodes and corresponding display information for each node; after transferring the user from the first node currently in the target journey graph to the second node, the method further includes:

[0020] Based on the target journey map, the display information corresponding to the second node is determined; the display information includes the recommendation information corresponding to the second node;

[0021] The displayed information is sent to the target terminal for display.

[0022] In one possible implementation, updating the first node stored at a preset storage location using the second node includes:

[0023] Based on the target journey map, obtain the node information of the second node;

[0024] The first node where the user is currently located in the target journey map stored at the preset storage location is updated to the second node, and the node information of the first node is updated to the node information of the second node.

[0025] In one possible implementation, obtaining the node information of the first node where the user is currently located in the target journey graph includes:

[0026] When the user's target request is obtained, based on the user identity identifier and the request resource identifier in the target request, the corresponding relationship at the preset storage location is queried to obtain the target journey map corresponding to the user identity identifier and the request resource identifier; the corresponding relationship is used to represent the relationship between the user identity identifier, the request resource identifier and the journey map.

[0027] Query the target journey graph to determine the first node where the user is currently located in the target journey graph and the node information of the first node.

[0028] In one possible implementation, the method further includes:

[0029] If the waiting time does not meet the node transfer conditions of the waiting node, the current node transfer ends, and the node where the user is located in the target journey graph is not updated.

[0030] In a second aspect of the invention, a data processing apparatus is also provided, the apparatus comprising:

[0031] The acquisition module is used to acquire node information of the first node where the user is currently located in the target journey graph. The node information includes node transition conditions. The node transition conditions are used to determine whether the user can enter the next node of the target journey graph.

[0032] The monitoring module is used to send a waiting message to a preset message queue when the first node is a waiting node, and to monitor the waiting time through the preset message queue; the waiting node refers to a node that needs to be delayed for a set time before it can enter the next node of the target journey map;

[0033] The first information generation module is used to generate node transfer information when the waiting time meets the node transfer condition of the waiting node; the node transfer information is used to indicate that the user is transferred from the current node to the next node of the node.

[0034] The node determination module is used to determine, based on the node flow information, a second node in the target journey graph to which the user is to flow; wherein the second node is a node in the target journey graph that is different from the first node;

[0035] The first node transfer module is used to transfer the user from the first node currently in the target journey map to the second node, and use the second node to update the first node stored at a preset storage location.

[0036] In another aspect of the present invention, an electronic device is also provided, including a processor, a communication interface, a memory, and a communication bus, wherein the processor, the communication interface, and the memory communicate with each other through the communication bus.

[0037] Memory, used to store computer programs;

[0038] A processor, when executing a program stored in memory, implements any of the data processing methods described above.

[0039] In another aspect of the present invention, a computer-readable storage medium is also provided, wherein a computer program is stored therein, and the computer program, when executed by a processor, implements any of the data processing methods described above.

[0040] In another aspect of the present invention, a computer program product containing instructions is also provided, which, when run on a computer, causes the computer to perform any of the data processing methods described above.

[0041] This invention provides a data processing method, apparatus, electronic device, and storage medium that adds waiting nodes. When a user navigates to a waiting node in the target journey graph, the message is sent and stored in the message stream instead of being stored in physical memory, saving storage space. The waiting time is monitored through a preset message queue. When the waiting time meets the node transition conditions of the waiting node, node transition information is directly generated and node transition is performed, improving the efficiency of node transition and facilitating personalized recommendations for users. Attached Figure Description

[0042] To more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the accompanying drawings used in the description of the embodiments or the prior art will be briefly introduced below.

[0043] Figure 1 This is a schematic flowchart of a data processing method in an embodiment of the present invention;

[0044] Figure 2 This is a schematic diagram of another data processing method in an embodiment of the present invention;

[0045] Figure 3 This is another flowchart illustrating the data processing method in an embodiment of the present invention;

[0046] Figure 4 This is a schematic diagram illustrating the principle of data processing in an embodiment of the present invention;

[0047] Figure 5 This is a schematic diagram illustrating an application of data processing in an embodiment of the present invention;

[0048] Figure 6 This is a schematic diagram of a data processing device in an embodiment of the present invention;

[0049] Figure 7 This is a schematic diagram of the structure of an electronic device provided in an embodiment of the present invention. Detailed Implementation

[0050] The technical solutions of the present invention will now be described with reference to the accompanying drawings in the embodiments of the present invention.

[0051] To improve node flow efficiency while saving storage space and enabling personalized recommendations for users, embodiments of the present invention provide a data processing method, apparatus, electronic device, and storage medium. The data processing method provided by these embodiments can be applied to personalized recommendation scenarios such as user journey marketing, and can be used with electronic devices, such as servers.

[0052] The data processing method provided in the embodiments of the present invention will be described in detail below:

[0053] like Figure 1 As shown, Figure 1 This is a flowchart illustrating a data processing method according to an embodiment of the present invention. The method includes the following steps:

[0054] S101, Obtain the node information of the first node where the user is currently located in the target journey graph;

[0055] The node information includes node transition conditions; the node transition conditions are used to determine whether a user can enter the next node of the target journey graph.

[0056] S102, when the first node is a waiting node, send a waiting message to a preset message queue, and monitor the waiting time through the preset message queue;

[0057] Among them, the waiting node represents a node that needs to be delayed for a set period of time before it can enter the next node of the target journey graph;

[0058] S103, when the waiting time meets the node transfer conditions of the waiting node, generate node transfer information;

[0059] Node flow information is used to indicate how to move a user from their current node to the next node.

[0060] S104, Based on the node flow information, determine the second node in the target journey graph where the user is to flow;

[0061] The second node is a node in the target journey map that is different from the first node;

[0062] S105, the user is moved from the first node in the target journey graph to the second node, and the first node stored at the preset storage location is updated using the second node.

[0063] In this embodiment of the invention, a waiting node is added. When a user moves to a waiting node in the target journey graph, the message is stored in the message stream by sending a message, saving storage space by eliminating the need to store it in physical memory. The waiting time is monitored by a preset message queue (MQ). When the waiting time meets the node transfer conditions of the waiting node, node transfer information is directly generated and node transfer is performed, which improves the efficiency of node transfer and facilitates personalized recommendations for users.

[0064] The data processing method provided in this invention is applied to an electronic device, which may include a cache, a node flow strategy device, and a message queue. Specifically, the node flow strategy device can determine whether the user's current node in the target journey graph and the user's behavior meet the node flow conditions of the current node. When the user's behavior meets the node flow conditions, the device controls the user to flow through nodes in the target journey graph and updates the node of the user in the target journey graph stored at a preset storage location. It also provides or displays corresponding recommendation information to the user to achieve personalized recommendations based on the user's lifecycle. The journey graph is a graphical representation of the journey progress and structural relationships within a user's lifecycle, similar to a knowledge graph. The journey graph may include nodes, connections between nodes, display information (including recommendation information) for each node, and node flow conditions.

[0065] In this embodiment of the invention, a journey graph, set by developers for different resource locations within the application (APP), is pre-stored in a preset storage location on the electronic device. There is a correspondence between the APP, resource locations, and the journey graph. Resource locations represent various display positions within the APP, specifically corresponding to different display areas. These display areas may showcase marketing strategies such as APP-underlying navigation-VIP (very important person, VIP) images or APP-VIP channel overlays. The journey graph has multiple nodes, each corresponding to display information and node flow conditions. These nodes are interconnected. The connection / structural relationship between nodes in the journey graph can be represented as a journey map or journey tree structure, including a series of nodes such as start and end points, and parent-child relationships. In one example, the journey graph may specifically include the connection relationships between nodes, the content to be displayed to the user at each node, the content display method, and the node flow conditions. The content display method may be, for example, displaying a target advertisement as a video in a preset location within the APP, or displaying a target advertisement as text, etc. The node transition condition is used to determine whether a user can enter the next node of the target journey graph.

[0066] The target journey graph is the journey graph corresponding to the resource bit requested by the user. The preset storage location can be, for example, the cache of an electronic device or a designated storage location. In this embodiment of the invention, the preset storage location is illustrated using a cache as an example. The cache stores the correspondence between the requested resource bit identifier and the journey graph, the journey graph itself, and the node information corresponding to each node in the journey graph. The node information may include the node identifier or node code corresponding to that node, display information, and node flow conditions, etc.

[0067] When a user opens a target application (such as a video playback application) through a client, they access the node flow strategy device of the electronic device and send a target request (such as a request to access a target resource bit) to the node flow strategy device. The target request carries the user's identity identifier (such as a user ID) and the requested resource bit identifier. Corresponding to step S101 above, the node flow strategy device of the electronic device, based on the user's identity identifier and the requested resource bit identifier, determines the target journey graph corresponding to the requested resource bit identifier by querying the correspondence between the requested resource bit identifier and the journey graph stored in the cache. It further determines the user's current first node and its node information within the corresponding target journey graph. Here, the requested resource bit represents the location or area on a page (such as an app page) used to display marketing strategies when the user accesses it.

[0068] When a user visits a target resource location for the first time, it is recognized that user information has not yet been generated at the corresponding node in the target journey graph. Therefore, user information for the current node is generated, such as user identification, access time, and number of accesses. A mapping relationship is created between the user identification, the target resource location's identifier, and the corresponding target journey graph. When a user first visits a target resource location, they are at the first node in the corresponding target journey graph. Typically, the node transition condition for the first node in the target journey graph is whether the user is a first-time visitor. For example, the node transition condition for the first node could be set to indicate that the user is not a first-time visitor. If a user is confirmed to be a first-time visitor (not meeting the node transition conditions for the first node), the current node transition ends, and the display information corresponding to the target resource position for the first visit (i.e., the marketing strategy / recommendation information corresponding to the first node) is shown, such as a first-month discount of XX yuan for purchasing a product. The user's information at that node in the target journey graph is stored in the cache, along with a corresponding relationship between the user's identity, the target resource position's identifier, the corresponding target journey graph, and the user's current node, stored in a designated location in the cache. This ensures accurate identification of the user's node in the target journey graph when the user revisits the target resource position. If a user is confirmed to be a non-first-time visitor (i.e., meeting the node transition conditions for the first node), the user's node in the target journey graph is transitioned to the next node in the target journey graph.

[0069] This embodiment of the invention sets up a waiting node. Corresponding to step S102 above, when it is determined that the first node in the corresponding target journey graph where the user accesses the target resource location is a waiting node, an operation to send a waiting message to a preset message queue is triggered. The waiting message contains the timestamp of the user's first access to the target resource location, so as to monitor the waiting time through the preset message queue. A waiting node represents a node that needs to be delayed for a set time before entering the next node in the target journey graph. For example, the set time can be 2 days, 3 days, or 5 days.

[0070] The preset message queue can monitor the waiting time in real time. When the monitoring shows that the waiting time meets the node transfer conditions of the waiting node, a transfer message is sent to the node transfer strategy device. Corresponding to step S103 above, the node transfer strategy device receives the transfer message, determines that the waiting time meets the node transfer conditions of the waiting node, and generates node transfer information. This node transfer information is used to indicate that the user should be transferred from the current node to the next node of that node. For example, the node transfer conditions of the waiting node may be a preset number of days, such as 2 days, 3 days, or 5 days.

[0071] Corresponding to step S104 above, after generating node flow information, the corresponding target journey graph in the cache is read. Since the target journey graph contains the interconnections between nodes, and these interconnections contain the flow order between nodes, the second node to be traversed by the user can be determined by querying the target journey graph. The second node is the node in the target journey graph that is different from the first node.

[0072] Furthermore, corresponding to step S105 above, the node transfer strategy device transfers the user from the first node currently in the target journey graph to the second node, and updates the cached first node currently in the target journey graph to the second node currently in the target journey graph, so as to quickly obtain the user's current node and corresponding node information in the target journey graph next time.

[0073] In this embodiment of the invention, a waiting node is added. When a user navigates to a waiting node in the target journey graph, the message is sent and stored in the message stream, saving storage space by eliminating the need for physical memory storage. The waiting time is monitored through a preset message queue. When the waiting time meets the node transition conditions of the waiting node, node transition information is directly generated and node transition is performed, improving the efficiency of node transition. This facilitates personalized recommendations for users and allows for real-time updates of the user's current node in the target journey graph, thereby ensuring efficient delivery of user journey marketing and improving revenue and conversion rates.

[0074] like Figure 2 As shown, Figure 2 This is another flowchart illustrating the data processing method in an embodiment of the present invention. The method includes the following steps:

[0075] S201, when the user's target request is obtained, based on the user identity identifier and the request resource identifier in the target request, query the corresponding relationship at the preset storage location to obtain the target journey map corresponding to the user identity identifier and the request resource identifier.

[0076] When a user opens the target application through a client or terminal to access the target resource bit, a target request is sent to the node flow strategy device of the electronic device. The target request carries the user's identity identifier and the identifier of the requested resource bit (i.e. the identifier of the target resource bit). The target request is triggered by the user through the client or terminal and is used to indicate that the user is currently accessing a certain requested resource bit.

[0077] After receiving a target request, the node flow strategy device of the electronic device reads the cache and queries whether it contains a corresponding relationship. This relationship represents the connection between the user's identity identifier, the requested resource identifier, and the journey graph. In other words, the relationship includes the correspondence between the user's identity identifier, the requested resource identifier, and the corresponding journey graph. If the relationship is not found, it indicates that the user is accessing the target resource for the first time. In this case, the user's information is stored in the first node of the target journey graph corresponding to the requested resource identifier, and the cache stores the user's identity identifier, the requested resource identifier, the corresponding target journey graph, and the correspondence between the user's current node. If the relationship is found, it indicates that the user has accessed the target resource before. By querying the cache, the target journey graph corresponding to the user's identity identifier and the requested resource identifier can be determined.

[0078] S202, query the target journey graph to determine the first node the user is currently in and the node information of the first node.

[0079] The cache not only stores the correspondence between user identity identifier, requested resource bit identifier and corresponding journey graph, but also the correspondence between user identity identifier, requested resource bit identifier, corresponding journey graph and the node where the user is located. Therefore, by reading the cache, the current node of the user in the target journey graph, i.e. the first node, can be determined, and the node information of the first node of the target journey graph in the cache can be read.

[0080] The cache of electronic devices stores the correspondence between user identity identifiers, requested resource identifiers, and corresponding journey graphs. This enables timely and accurate acquisition of the user's current node and node information in the target journey graph when the user accesses the target resource, facilitating accurate judgment of node flow and improving the efficiency of node flow.

[0081] S203, when the first node is a waiting node, send a waiting message to a preset message queue, and monitor the waiting time through the preset message queue.

[0082] S204. When the waiting time meets the node transfer conditions of the waiting node, node transfer information is generated.

[0083] If the waiting time does not meet the node transition conditions of the waiting node, the current node transition ends, and the node where the user is located in the target journey graph is not updated.

[0084] In other words, if the waiting time does not meet the node transition conditions of the waiting node, it means that the user's current first node cannot transition to the next node in the target journey graph, and therefore the current node transition ends. Without node transition, the user's current node in the cached target journey graph will not be updated; that is, the user remains at the first node. At this point, the client or terminal can continue to display the information corresponding to the first node to the user. However, since the user's operation to access the target resource has already occurred, the corresponding behavioral information needs to be stored in the user information section of the first node for subsequent determination of whether the user meets the node transition conditions.

[0085] If the waiting time does not meet the node transition conditions of the waiting node, the current node transition ends, and the node where the user is located in the cached target journey graph is not updated. This ensures the accuracy of the user's current node in the target journey graph, so as to achieve more accurate user journey marketing.

[0086] S205, when the first node is not a waiting node, retrieve the user's historical information at the first node from the preset storage location.

[0087] The cache also stores user information at nodes in the target journey graph. This user information includes behavioral information generated when the user accessed the requested resource within a historical time period, i.e., historical information. This historical information can be stored, for example, as logs, including the user's identity, access time, and user behavior when the user accessed the requested resource within a historical time period. The historical time period can be, for example, one month, six months, or one year.

[0088] S206. When the historical information meets the node transfer conditions of the first node, node transfer information is generated.

[0089] For example, the marketing strategy of the first node is to notify users of a discount of XX yuan for purchasing products in the first month via information (such as SMS). The node transition condition for the first node is that the resource slot is displayed more than M times within 7 days, where M is an integer value, such as 1, 2, or 3. To avoid the need for users to meet the strategy conditions of the marketing strategy corresponding to the preceding node within a preset time period, as in related technologies, before transitioning to the next node and displaying the strategy, which requires storing a large amount of data and occupying a large storage space, in this embodiment of the invention, M can be set to a relatively small value, and a waiting node is added to achieve user journey marketing with a delay time based on the waiting node. When it is determined that the obtained historical information meets the node transition condition of the first node, node transition information is generated to indicate that the user can be transitioned to the next node in the target journey graph of the first node.

[0090] Optionally, if the historical information does not meet the node transfer conditions of the first node, the current node transfer is terminated, and the node where the user is located in the cached target journey graph is not updated. Instead, the marketing strategy of the current first node is displayed to the user through the client or terminal, that is, the user is prompted with information to receive a discount of XX yuan for purchasing products in the first month.

[0091] S207, Based on the node flow information, determine the second node in the target journey graph where the user is to flow.

[0092] S208, the user is moved from the first node in the target journey graph to the second node, and the node information of the second node is obtained based on the target journey graph.

[0093] S209, update the first node where the user is currently located in the target journey map stored at the preset storage location to the second node, and update the node information of the first node to the node information of the second node.

[0094] The system moves the user from the first node in the target journey graph to the second node, and reads the target journey graph in the cache to obtain the node identifier or node code, display information and node transition conditions of the second node. Simultaneously, the system updates the first node in the target journey graph stored in the cache to the second node, and updates the node information of the first node to the node information of the second node.

[0095] In one optional implementation, the target journey graph includes nodes and corresponding display information for each node. After the user is moved from the first node in the target journey graph to the second node, the display information corresponding to the second node can be determined based on the target journey graph. This display information includes recommendation information corresponding to the second node, and the display information is then sent to the target terminal for display.

[0096] The journey graph has multiple nodes, each with corresponding display information and node transition conditions. A user's journey from the first node to the second node in the target journey graph indicates that their behavior meets the transition conditions for the first node, allowing them to access the marketing strategies at the second node. Specifically, the display information for the second node is retrieved by reading the cached target journey graph, and then this information, including recommendations and marketing strategies, is sent to the target terminal for display.

[0097] For example, the marketing strategy for the first node is to inform the user of a discount of XX yuan for purchasing a product in the first month via information. The node transition condition is that the resource slot is displayed more than M times within 7 days. The marketing strategy for the second node is to display a cross-industry cooperation discount program. The node transition condition is to wait for a preset number of days. When the user's behavior information meets the node transition condition of the first node and enters the second node, the target journey graph in the cache is read to obtain the marketing strategy corresponding to the second node: display the cross-industry cooperation discount program, and this marketing strategy is sent to the target terminal for display. The cross-industry cooperation discount program could be, for example, purchasing a product and receiving another product as a gift, or purchasing a product and receiving a one-month membership to another product as a gift, etc.

[0098] This invention incorporates a waiting node. When a user navigates to a waiting node in the target journey graph, the message is sent and stored in a message stream, saving storage space by eliminating the need for physical memory storage. A preset message queue monitors the waiting time. If the waiting time meets the node transition conditions, node transition information is directly generated and the transition is initiated, improving efficiency and facilitating personalized recommendations. If the waiting time does not meet the transition conditions, the transition ends without updating the user's current node in the cached target journey graph, ensuring accuracy and enabling more precise user journey marketing. Furthermore, when a user transitions from their current node to a second node in the target journey graph, the first node is updated to the second node, and the cached node information is updated accordingly. This real-time updating of the user's current node ensures efficient delivery of journey marketing, improving revenue and conversion rates. After guiding the user from the first node in the target journey graph to the second node, the display information corresponding to the second node is determined based on the target journey graph, and the display information is sent to the target terminal for display, thus achieving more accurate user journey marketing.

[0099] In the above Figure 1 or Figure 2Based on the previous example, after the user transitions from the first node currently in the target journey graph to the second node, such as... Figure 3 As shown, the data processing method provided in this embodiment of the invention may further include the following steps:

[0100] S301: When a user triggers a target action, obtain the user's target action verification message.

[0101] The target behavior can be a pre-defined behavior, such as a user entering the checkout page, initiating a purchase request, or clicking on a movie or TV series to preview or purchase.

[0102] In one embodiment, when a business system monitoring user behavior detects that a user has triggered a target behavior, it sends a target behavior verification message to a preset message queue on the electronic device. The preset message queue forwards the target behavior verification message to a node flow strategy device, which then receives the target behavior verification message. The target behavior verification message indicates whether the user-triggered target behavior meets the conditions for node flow, thereby enabling behavior-based user journey marketing.

[0103] S302, based on the target behavior verification message, retrieve the user's historical target behavior information at the second node from the preset storage location.

[0104] When a user first navigates to the second node, the second node does not cache user information, meaning there is no historical target behavior information. Therefore, it is impossible to retrieve the user's historical target behavior information at the second node from the cache. At this time, a target behavior verification message for the user is obtained, and the user's target behavior information is cached in the user information at the second node so that the user's historical target behavior information at the second node can be retrieved from the cache the next time the user triggers the target behavior.

[0105] When a user is not navigating to the second node for the first time and has triggered a target behavior, the node navigation strategy device receives a target behavior verification message for the user. At this point, it can retrieve the user's historical target behavior information from the cache at the second node to determine whether to proceed with navigation to the user's current node. This historical target behavior information records relevant information about the user triggering the target behavior within a historical time period, such as the time of triggering the target behavior and the cumulative number of times. For example, the historical time period can represent the period from when the user navigates to the second node until they navigate to the next node (the third node).

[0106] S303, when the historical target behavior information meets the node transition conditions of the second node, generate node transition information and determine the third node to be transitioned in the target journey graph for the user.

[0107] For example, the node transition condition for the second node is that the user enters the checkout page T times, where T is a value greater than 1, such as 2, 3, or 4. The cumulative number of times the user triggers the target behavior in the historical target behavior information is compared with the node transition condition for the second node. If the historical target behavior information meets the node transition condition for the second node, node transition information is generated, and the corresponding target journey graph in the cache is read to obtain the third node to which the user will transition. If the historical target behavior information does not meet the node transition condition for the second node, it means that the user cannot transition from the current second node to the next node. Therefore, the current node transition ends, and the node where the user is located in the cached target journey graph is not updated. However, the user information in the cached node where the user is located, i.e., the cumulative number of times the user triggers the target behavior, is updated (i.e., incremented by 1).

[0108] S304, the user is moved from the second node in the target journey graph to the third node, and the second node stored at the preset storage location is updated using the third node.

[0109] In one example, when a user is moved from the second node to the third node in the target journey graph and the third node is used to update the cached second node, the user information (i.e., the user's target behavior information) cached at the second node can also be cleared to save storage space.

[0110] In this embodiment of the invention, user journey marketing based on behavioral conditions is implemented through messages. This allows for real-time judgment of node transitions based on user-triggered behaviors, improving the real-time performance of node transitions. Furthermore, when a user's behavioral conditions meet the node transition conditions, the user information cached at the previous node can be cleared, saving storage space.

[0111] In one possible implementation, the node transition conditions in the node information corresponding to each node in the aforementioned target journey graph can be automatically adjusted based on the user's level or relevant data of users who have purchased the corresponding product. For example, if the user's level is a new user, the node transition condition for the waiting node can be adjusted to a shorter waiting time, such as 1 day; if the user's level is a retained user (old user or user closely related to an old user, etc.), the node transition condition for the waiting node can be adjusted to an even shorter waiting time, such as 0.5 days. Relevant data for users who have purchased the corresponding product could include, for example, the user's purchase cycle (the time period from initial interest to purchase) and the number of times the target behavior was triggered.

[0112] For example, such as Figure 4 As shown, Figure 4 This is a schematic diagram illustrating the principle of data processing in an embodiment of the present invention. The system for implementing data processing includes: a C-end (personal user terminal, consumer) and an electronic device. The electronic device may include a cache, a node flow strategy device, and a message queue, etc.

[0113] Users send requests to electronic devices via the C-end, and the requests include the user's identity identifier and the identifier of the requested resource bit.

[0114] When the node flow strategy device of the electronic device receives a request triggered by a user through the C-end, it reads the cache and queries the correspondence between the user identity identifier, the request resource identifier and the journey graph in the cache according to the user identity identifier and the request resource identifier in the request. It obtains the target journey graph corresponding to the user identity identifier and the request resource identifier, and queries the target journey graph in the cache to obtain the first node where the user is currently in the target journey graph and the node flow conditions corresponding to the first node. Figure 4 1. Read the user's node information.

[0115] Furthermore, when the first node is a waiting node, a waiting message is sent to the message queue. Figure 4 2.1. Entering the waiting node and sending a waiting message. The message queue monitors the waiting time in real time. When the monitoring shows that the waiting time meets the node transfer conditions of the waiting node, it sends a transfer message to the node transfer strategy device. Figure 4 2.2. Waiting time meets the condition to send a transfer message). Upon receiving the transfer message, the node transfer strategy device determines that the waiting time meets the node transfer condition for the waiting node, generates node transfer information, reads the corresponding target journey graph from the cache, determines the second node in the target journey graph where the user is to be transferred, transfers the user from the first node currently in the target journey graph to the second node, and updates the cached first node in the target journey graph to the second node currently in the user's position. Figure 4 4. Update the user's current node information. And based on the target journey graph, determine the display information corresponding to the second node and send the display information to the C-end for display. Figure 4 (Return to marketing strategy results).

[0116] When a user triggers a target action, the electronic device's message queue receives a verification message for the user's target action. Figure 4 In section 3.1, the user triggers a target action and sends a verification message. The message queue forwards the user's target action verification message to the node flow strategy device. Figure 43.2. Determining User Flow. The node flow strategy device, based on the target behavior verification message, retrieves the user's historical target behavior information at the second node from the cache, and determines whether the historical target behavior information meets the node flow conditions of the second node. If it does, it generates node flow information, reads the corresponding target journey graph from the cache, determines the third node to which the user should flow, flows the user from the second node in the target journey graph to the third node, and updates the cached second node in the target journey graph to the user's current third node. Figure 4 4. Update the user's current node information, and based on the target journey graph, determine the display information corresponding to the third node, and send the display information to the C-end for display.

[0117] For example, such as Figure 5 As shown, Figure 5 This is a schematic diagram illustrating one application of data processing in an embodiment of the present invention. Figure 5 The user marketing journey for a specific resource position consists of 7 layers. Layers 1, 3, 4 and 6 correspond to nodes in the target journey graph. Layer 2 displays the marketing strategies for the nodes corresponding to Layer 1. The left side of Layer 4 (SMS notification of the first month's 6 yuan promotion) displays the marketing strategies for the nodes corresponding to Layer 3. Layer 5 displays the marketing strategies for the nodes corresponding to Layer 4. Layer 7 displays the marketing strategies for the nodes corresponding to Layer 6.

[0118] Layer 1 corresponds to the first node in the target journey graph. The marketing strategy for this node is: displaying a first-month N-yuan promotion, or a VIP image in the APP-bottom navigation, or a large overlay in the APP-VIP channel, etc. (Layer 2). The node transition condition for this node is that the user is not a first-time visitor. If it is determined that the user is a first-time visitor, i.e., the node transition condition is not met, the node transition does not occur. Instead, the first-month N-yuan promotion, or the VIP image in the APP-bottom navigation, or a large overlay in the APP-VIP channel, etc., is displayed, ending the current node transition. The user information at this node is stored in the cache, along with the user's identity identifier, resource location identifier, the corresponding target journey graph, and the user's current node, all corresponding to a specified location in the cache. If it is determined that the user is not a first-time visitor, i.e., the node transition condition is met, node transition information is generated, and the user is transitioned to the corresponding node in Layer 3. The cache is then updated with the user's current node in the target journey graph, along with the node information and user information.

[0119] The marketing strategy for the node corresponding to Layer 3 is to send an SMS notification about the 6 yuan promotion for the first month. The node transition condition is that the resource slot is displayed more than M times within 7 days. The system retrieves the user's historical information for that node from the cache. If the historical information meets the node transition condition, no node transition occurs, the user's current node in the cached target journey graph is not updated, and the user is shown the current node's marketing strategy (the SMS notification about the 6 yuan promotion for the first month), ending the current node transition. The user's information for that node in the target journey graph is updated in the cache. If the historical information meets the node transition condition, node transition information is generated, the user is transitioned to the node corresponding to Layer 4, and the user's current node in the target journey graph, along with the node information and user information, are updated in the cache.

[0120] The marketing strategy for the node corresponding to Layer 4 is a cross-industry cooperation strategy display, and the node transfer condition is a preset waiting period of days. If the waiting time does not meet the node transfer condition of the waiting node, node transfer will not occur, the node where the user is located in the cached target journey graph will not be updated, and the marketing strategy of the current node, i.e., the cross-industry cooperation strategy display (Layer 5), will be displayed to the user, ending the current node transfer. The user information of the node where the user is located in the target journey graph will be updated in the cache. When the message queue monitors that the waiting time meets the node transfer condition of the waiting node in Layer 4, the node transfer strategy device determines that the waiting time meets the node transfer condition of the waiting node, generates node transfer information, transfers the user to the node corresponding to Layer 6, and updates the node where the user is located in the target journey graph, as well as the node information and user information of the current node, in the cache.

[0121] The marketing strategies for the node corresponding to layer 6 (the last node in the target journey graph) are a points-for-membership strategy and a coupon strategy. The node transition condition is that the user triggers the target behavior T times. If the user's triggering of the target behavior does not meet the node transition condition, the node transition does not occur, the user's current node in the cached target journey graph is not updated, and the user is shown the marketing strategy for the current node, i.e., points-for-membership experience material A, points-for-membership experience days, and points-for-membership experience material B, for the user to choose from. The node transition ends, and the user information for the current node in the target journey graph is updated in the cache. Conversely, if the user's triggering of the target behavior meets the node transition condition, the node transition also does not occur, the user's current node in the cached target journey graph is not updated, and the user is shown the marketing strategy for the current node, i.e., a coupon strategy, such as "optimized XXX yuan," etc. The node transition ends, and the user information for the current node in the target journey graph is updated in the cache. This facilitates user journey marketing and increases the probability of user membership conversion.

[0122] Corresponding to the above method embodiments, the present invention also provides corresponding device embodiments.

[0123] like Figure 6 As shown, an embodiment of the present invention provides a data processing apparatus, which includes:

[0124] The acquisition module 601 is used to acquire the node information of the first node where the user is currently located in the target journey graph. The node information includes node transition conditions. The node transition conditions are used to determine whether the user can enter the next node of the target journey graph.

[0125] The monitoring module 602 is used to send a waiting message to a preset message queue when the first node is a waiting node, and to monitor the waiting time through the preset message queue; the waiting node refers to a node that needs to be delayed for a set time before it can enter the next node of the target journey map;

[0126] The first information generation module 603 is used to generate node transfer information when the waiting time meets the node transfer condition of the waiting node; the node transfer information is used to indicate that the user is transferred from the current node to the next node of the node.

[0127] The node determination module 604 is used to determine, based on the node flow information, a second node in the target journey map to which the user is to flow; wherein, the second node is a node in the target journey map that is different from the first node;

[0128] The first node transfer module 605 is used to transfer the user from the first node currently in the target journey map to the second node, and use the second node to update the first node stored at a preset storage location.

[0129] In one possible implementation, the above-described apparatus further includes:

[0130] The first information acquisition module is used to acquire the user's historical information at the first node from the preset storage location when the first node is not a waiting node; the historical information represents the behavioral information generated when the user accesses the requested resource bit within a historical time period.

[0131] The second information generation module is used to generate node flow information when the historical information satisfies the node flow conditions of the first node.

[0132] In one possible implementation, the above-described apparatus further includes:

[0133] The second information acquisition module is used to acquire the target behavior verification message of the user when the user triggers the target behavior; the target behavior verification message is used to indicate whether the target behavior triggered by the user meets the conditions for node flow.

[0134] The third information acquisition module is used to acquire the user's historical target behavior information at the second node from the preset storage location based on the target behavior verification message;

[0135] The third information generation module is used to generate node flow information when the historical target behavior information satisfies the node flow conditions of the second node, and to determine the third node to be flowed by the user in the target journey graph.

[0136] The second node transfer module is used to transfer the user from the second node in the target journey graph to the third node, and use the third node to update the second node stored at the preset storage location.

[0137] In one possible implementation, the target journey map includes nodes and corresponding display information for each node; the device further includes:

[0138] The information determination module is used to determine the display information corresponding to the second node based on the target journey map; the display information includes the recommendation information corresponding to the second node;

[0139] The display module is used to send the display information to the target terminal for display.

[0140] In one possible implementation, the first node transfer module 605 described above is specifically used for:

[0141] Based on the target journey map, obtain the node information of the second node;

[0142] The first node where the user is currently located in the target journey map stored at the preset storage location is updated to the second node, and the node information of the first node is updated to the node information of the second node.

[0143] In one possible implementation, the acquisition module 601 is specifically used to, when acquiring the user's target request, query the correspondence at the preset storage location based on the user identity identifier and the request resource identifier in the target request, to obtain a target journey map corresponding to the user identity identifier and the request resource identifier; the correspondence is used to represent the relationship between the user identity identifier, the request resource identifier and the journey map; query the target journey map to determine the first node where the user is currently in the target journey map and the node information of the first node.

[0144] In one possible implementation, the above-described apparatus further includes:

[0145] The third node transfer module is used to end the current node transfer when the waiting time does not meet the node transfer conditions of the waiting node, and does not update the node where the user is located in the target journey graph.

[0146] This invention also provides an electronic device, such as... Figure 7 As shown, it includes a processor 701, a communication interface 702, a memory 703, and a communication bus 704, wherein the processor 701, the communication interface 702, and the memory 703 communicate with each other through the communication bus 704.

[0147] Memory 703 is used to store computer programs;

[0148] When the processor 701 executes the program stored in the memory 703, it implements the steps of any of the above method embodiments to achieve the same technical effect.

[0149] The communication bus mentioned above can be a Peripheral Component Interconnect (PCI) bus or an Extended Industry Standard Architecture (EISA) bus, etc. This communication bus can be divided into address bus, data bus, control bus, etc. For ease of illustration, only one thick line is used to represent it in the diagram, but this does not mean that there is only one bus or one type of bus.

[0150] The communication interface is used for communication between the aforementioned terminal and other devices.

[0151] The memory may include random access memory (RAM) or non-volatile memory, such as at least one disk storage device. Optionally, the memory may also be at least one storage device located remotely from the aforementioned processor.

[0152] The processors mentioned above can be general-purpose processors, including central processing units (CPUs), network processors (NPs), etc.; they can also be digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components.

[0153] In another embodiment of the present invention, a computer-readable storage medium is also provided, wherein a computer program is stored therein, and when the computer program is executed by a processor, it implements any of the data processing methods described in the above embodiments to achieve the same technical effect.

[0154] In another embodiment of the present invention, a computer program product containing instructions is also provided, which, when run on a computer, causes the computer to execute any of the data processing methods described in the above embodiments to achieve the same technical effect.

[0155] In the above embodiments, implementation can be achieved, in whole or in part, through software, hardware, firmware, or any combination thereof. When implemented in software, it can be implemented, in whole or in part, as a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, all or part of the processes or functions described in the embodiments of the present invention are generated. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another. For example, the computer instructions can be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via wired (e.g., coaxial cable, fiber optic, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) means. The computer-readable storage medium can be any available medium accessible to a computer or a data storage device such as a server or data center that integrates one or more available media. The available medium can be a magnetic medium (e.g., floppy disk, hard disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., solid-state disk (SSD)).

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

[0157] The various embodiments in this specification are described in a related manner. Similar or identical parts between embodiments can be referred to mutually. Each embodiment focuses on describing the differences from other embodiments. In particular, the device and electronic device embodiments are basically similar to the method embodiments, so the descriptions are relatively simple; relevant parts can be referred to the descriptions of the method embodiments.

[0158] The above description is merely a preferred embodiment of the present invention and is not intended to limit the scope of protection of the present invention. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the present invention are included within the scope of protection of the present invention.

Claims

1. A data processing method, characterized in that, The method includes: Obtain the node information of the first node where the user is currently located in the target journey graph. The node information includes node transition conditions. The node transition conditions are used to determine whether the user can enter the next node of the target journey graph. When the first node is a waiting node, a waiting message is sent to a preset message queue, and the waiting time is monitored through the preset message queue; the waiting node represents a node that needs to be delayed for a set time before entering the next node of the target journey map; When the waiting time meets the node transfer condition of the waiting node, node transfer information is generated; the node transfer information is used to indicate that the user is transferred from the current node to the next node of that node; Based on the node flow information, a second node in the target journey graph is determined for the user to flow through; wherein, the second node is a node in the target journey graph that is different from the first node; The user is transferred from the first node currently in the target journey graph to the second node, and the second node is used to update the first node stored at a preset storage location.

2. The method according to claim 1, characterized in that, The method further includes: When the first node is not a waiting node, the user's historical information at the first node is obtained from the preset storage location; the historical information represents the behavioral information generated when the user accesses the requested resource bit within a historical time period. When the historical information satisfies the node transfer conditions of the first node, node transfer information is generated.

3. The method according to claim 1, characterized in that, After transferring the user from the first node currently in the target journey graph to the second node, the method further includes: When the user triggers the target behavior, the target behavior verification message of the user is obtained; the target behavior verification message is used to indicate whether the target behavior triggered by the user meets the conditions for node flow. Based on the target behavior verification message, the user's historical target behavior information at the second node is obtained from the preset storage location; When the historical target behavior information satisfies the node transition conditions of the second node, node transition information is generated, and the third node to be transitioned by the user in the target journey graph is determined. The user is transferred from the second node in the target journey graph to the third node, and the third node is used to update the second node stored at the preset storage location.

4. The method according to claim 1, characterized in that, The target journey graph includes nodes and corresponding display information for each node; After transferring the user from the first node currently in the target journey graph to the second node, the method further includes: Based on the target journey map, the display information corresponding to the second node is determined; the display information includes the recommendation information corresponding to the second node; The displayed information is sent to the target terminal for display.

5. The method according to claim 1, characterized in that, The step of updating the first node stored at the preset storage location using the second node includes: Based on the target journey map, obtain the node information of the second node; The first node where the user is currently located in the target journey map stored at the preset storage location is updated to the second node, and the node information of the first node is updated to the node information of the second node.

6. The method according to any one of claims 1-5, characterized in that, The step of obtaining the node information of the first node where the user is currently located in the target journey graph includes: When the user's target request is obtained, based on the user identity identifier and the request resource identifier in the target request, the corresponding relationship at the preset storage location is queried to obtain the target journey map corresponding to the user identity identifier and the request resource identifier; the corresponding relationship is used to represent the relationship between the user identity identifier, the request resource identifier and the journey map. Query the target journey graph to determine the first node where the user is currently located in the target journey graph and the node information of the first node.

7. The method according to any one of claims 1-5, characterized in that, The method further includes: If the waiting time does not meet the node transfer conditions of the waiting node, the current node transfer ends, and the node where the user is located in the target journey graph is not updated.

8. A data processing apparatus, characterized in that, The device includes: The acquisition module is used to acquire node information of the first node where the user is currently located in the target journey graph. The node information includes node transition conditions. The node transition conditions are used to determine whether the user can enter the next node of the target journey graph. The monitoring module is used to send a waiting message to a preset message queue when the first node is a waiting node, and to monitor the waiting time through the preset message queue; the waiting node refers to a node that needs to be delayed for a set time before it can enter the next node of the target journey map; The first information generation module is used to generate node transfer information when the waiting time meets the node transfer condition of the waiting node; the node transfer information is used to indicate that the user is transferred from the current node to the next node of the node. The node determination module is used to determine, based on the node flow information, a second node in the target journey graph to which the user is to flow; wherein the second node is a node in the target journey graph that is different from the first node; The first node transfer module is used to transfer the user from the first node currently in the target journey map to the second node, and use the second node to update the first node stored at a preset storage location.

9. An electronic device, characterized in that, It includes a processor, a communication interface, a memory, and a communication bus, wherein the processor, the communication interface, and the memory communicate with each other through the communication bus; Memory, used to store computer programs; A processor, when executing a program stored in memory, implements the method described in any one of claims 1-7.

10. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program that, when executed by a processor, implements the method described in any one of claims 1-7.

Images