Method and device for reporting buried point data, computer device and readable storage medium

Abstract

The application belongs to the technical field of data analysis, and provides a method and device for reporting buried point data, computer equipment and a readable storage medium, which comprises: creating a buried point data storage queue; when receiving first buried point data, setting a running node of the first buried point data; storing the first buried point data to the buried point data storage queue according to the running node; in the case where it is detected that a running condition meets a running condition corresponding to the running node, executing the first buried point data; and reporting a matter of executing the first buried point data according to an execution sequence. The application can realize that the queue executes the buried point data in the set sequence, reports the matter of executing the first buried point data according to the execution sequence, facilitates recording the sequence of execution and reducing the number of times of executing the buried point data reporting, realizes reporting the executed data based on the execution sequence of the queue in the process of reporting the data, does not need to report in real time, avoids missing data while throttling.

Description

Technical Field

[0001] This application relates to the field of data analysis technology, and in particular to a method, apparatus, computer device, and readable storage medium for reporting embedded data. Background Technology

[0002] To increase user engagement, it is often necessary to push data to users, thereby improving interaction with them.

[0003] The operational data seen by each user will vary depending on the customer acquisition rules. Each operational data point requires exposure and click tracking to facilitate statistical analysis and provide data support for operational campaigns. The page needs to load a large number of user visits simultaneously, resulting in a significant amount of tracking exposure. Currently, tracking data reporting typically uses a throttling method. This typical throttling method means that regardless of how many times the same event is triggered at the same location, a reporting event will only be triggered once at preset intervals. When tracking events trigger simultaneously, this throttling method can lead to missed tracking data reports. Summary of the Invention

[0004] The main purpose of this application is to provide a method, device, computer equipment, and readable storage medium for reporting embedded data. It aims to pre-set the execution nodes of embedded data so that the queue executes the embedded data in a set order, which facilitates recording the execution order and reduces the number of times the embedded data is reported. During the data reporting process, the execution data is reported based on the execution order of the queue, eliminating the need for real-time reporting. This saves resources, avoids missing data reports, and facilitates business personnel in carrying out operational work.

[0005] Firstly, this application provides a method for reporting embedded data, the method comprising:

[0006] Create a queue for storing event tracking data;

[0007] Upon receiving the first data point data, set the execution node for the first data point data;

[0008] According to the running node, the first embedded data is stored in the embedded data storage queue;

[0009] If the operating conditions are found to meet the operating conditions corresponding to the operating node, the first embedded data is executed;

[0010] Report the items for executing the first data entry point according to the execution order.

[0011] Secondly, this application also provides a device for reporting embedded data, the device comprising:

[0012] Create a module for creating data storage queues for embedded data;

[0013] The setting module is used to set the running node of the first embedded data when the first embedded data is received;

[0014] A storage module is used to store the first embedded data into the embedded data storage queue according to the running node;

[0015] The execution module is used to execute the first embedded data when the running conditions are detected to meet the running conditions corresponding to the running node;

[0016] The reporting module is used to report the items for executing the first data point according to the execution order.

[0017] Thirdly, this application also provides a computer device, which includes a processor, a memory, and a computer program stored in the memory and executable by the processor, wherein when the computer program is executed by the processor, it implements the steps of the above-described method for reporting embedded data.

[0018] Fourthly, this application also provides a computer-readable storage medium storing a computer program, wherein when the computer program is executed by a processor, it implements the above-described method for reporting embedded data.

[0019] This application discloses a method, apparatus, computer device, and readable storage medium for reporting event tracking data. The method first creates an event tracking data storage queue; upon receiving first event tracking data, it sets the execution node for the first event tracking data; according to the execution node, it stores the first event tracking data in the event tracking data storage queue; when the execution conditions are detected to meet the conditions corresponding to the execution node, it executes the first event tracking data, thereby executing the first event tracking data according to the order of the execution nodes. By pre-setting the execution nodes of the event tracking data, execution is only performed at specific times, eliminating the need for real-time execution, reducing the number of executions, and alleviating the pressure of concurrent calls, thus achieving cost savings. Furthermore, the method reports the execution of the first event tracking data according to the execution order. During the data reporting process, the execution data is reported based on the queue's execution order. Since the timestamp of each event tracking report is unique, it alleviates the call pressure of the backend interface to a certain extent. Even if multiple event tracking data are executed at the same time, it ensures that each event tracking data can be normally stored in the database without real-time reporting, thus saving costs and avoiding missed data reports, which is beneficial for business personnel to carry out operational work.

[0020] It should be understood that the above general description and the following detailed description are exemplary and explanatory only, and do not limit this application. Attached Figure Description

[0021] To more clearly illustrate the technical solutions of the embodiments of this application, the drawings used in the description of the embodiments will be briefly introduced below. Obviously, the drawings described below are some embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0022] Figure 1 This is a flowchart illustrating an embodiment of the data reporting method for embedded points in this application;

[0023] Figure 2 This is a flowchart illustrating another embodiment of the data reporting method for embedded points in this application;

[0024] Figure 3 This is an example diagram illustrating the addition of first-level data in one embodiment of the data reporting method of this application.

[0025] Figure 4 A schematic block diagram of a data reporting device for embedded points provided in an embodiment of this application;

[0026] Figure 5 This is a schematic block diagram of the structure of a computer device according to an embodiment of this application.

[0027] The realization of the purpose, functional features and advantages of this application will be further explained in conjunction with the embodiments and with reference to the accompanying drawings. Detailed Implementation

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

[0029] The flowchart shown in the attached diagram is for illustrative purposes only and does not necessarily include all content and operations / steps, nor does it necessarily have to be performed in the order described. For example, some operations / steps can be broken down, combined, or partially merged, so the actual execution order may change depending on the actual situation.

[0030] It should be understood that the terminology used in this specification is for the purpose of describing particular embodiments only and is not intended to limit the scope of the application. As used in this specification and the appended claims, the singular forms “a,” “an,” and “the” are intended to include the plural forms unless the context clearly indicates otherwise.

[0031] It should also be understood that the term "and / or" as used in this application specification and the appended claims means any combination of one or more of the associated listed items and all possible combinations, and includes such combinations.

[0032] Embodiments of this application provide a method, apparatus, computer device, and readable storage medium for reporting embedded data. This method is primarily applied to data reporting devices, which can be terminal devices with data processing capabilities, such as servers.

[0033] The server can be a standalone server or a cloud server that provides basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communication, middleware services, domain name services, security services, content delivery networks (CDN), and big data and data analysis platforms.

[0034] The following detailed description of some embodiments of this application is provided in conjunction with the accompanying drawings. Unless otherwise specified, the following embodiments and features can be combined with each other.

[0035] This application provides a method, apparatus, computer device, and readable storage medium for reporting event tracking data. The method aims to report execution data based on the execution order of the queue, thereby avoiding data omissions and facilitating business personnel in carrying out operational work.

[0036] Please refer to Figure 1 , Figure 1 This is a flowchart illustrating a method for reporting embedded data, provided as an embodiment of this application.

[0037] like Figure 1 As shown, the data reporting method includes steps S101 to S105.

[0038] Step S101: Create a data storage queue for embedded data.

[0039] In this embodiment, the event tracking data to be reported is stored through a created queue. When creating the queue, the capacity must be specified, i.e., the queue length must be set. Specifically, the queue length can be set according to the size of the data, and there is no limitation here. Event tracking data refers to user behavior data, specifically obtained by tracking data on the product and collecting user click behavior data based on event tracking analysis, or obtained directly from the user's corresponding terminal.

[0040] Step S102: When the first embedded data is received, set the running node of the first embedded data.

[0041] Upon receiving the first data point, which is the data that needs to be executed, the execution node for the first data point is set according to its attributes. Execution can be understood as reporting or pushing the data point. Taking reporting as an example, a switch `running` (management) and a timer (a time node) are defined to control whether each reported data is executed immediately. For instance, if the attribute of the first data point is that it needs to be reported immediately, the execution node is set to "execute immediately"; if the attribute of the first data point is that it needs to be reported after one hour, the execution node is set to "execute after one hour".

[0042] Step S103: According to the running node, store the first embedded data into the embedded data storage queue.

[0043] After setting up the execution node, the first event tracking data can be stored in the event tracking data storage queue according to the execution node. For example, if the execution node for the first event tracking data is to immediately execute reporting or immediately execute push, the first event tracking data will be stored at the front of the event tracking data storage queue, thereby prioritizing the execution reporting or push of the first event tracking data.

[0044] During the storage of the first tracking data, it can be first identified whether the tracking data storage queue is full. If the tracking data storage queue is not full, the first tracking data is stored in the tracking data storage queue. If the tracking data storage queue is full, the data that first entered the tracking data storage queue is removed from the tracking data storage queue, and then the first tracking data is stored in the tracking data storage queue.

[0045] Step S104: If the running conditions are found to meet the running conditions corresponding to the running node, execute the first embedded data.

[0046] If the running conditions are detected to meet the running conditions corresponding to the running node, the first embedded data is executed. The running conditions may include time nodes, location nodes, etc.

[0047] When the operating conditions include time nodes, step S104 specifically involves: detecting the running node of the data storage queue; comparing the time point corresponding to the running node with the current time point; and if the difference between the time point corresponding to the running node and the current time point is less than a preset threshold, obtaining the first data point corresponding to the running node, popping it from the data storage queue, and executing it.

[0048] The system detects the running nodes of the data storage queue, i.e., the time points corresponding to the running nodes of each first data point, and compares the time points corresponding to the running nodes with the current time point. If the difference between the time point corresponding to the running node and the current time point is less than a preset threshold, it indicates that there is a first data point that needs to be reported at the current time. In this case, the first data point corresponding to the running node is obtained, popped from the data storage queue, and executed.

[0049] If the operating conditions include location nodes, obtain the position of the first tracking data in the tracking data storage queue. If the first tracking data is at the head of the tracking data storage queue, pop the first tracking data from the tracking data storage queue and perform execution reporting.

[0050] Furthermore, to ensure the rigor of the program execution and to reduce the number of program executions, before step 104, the process may include: determining whether the data length of the embedded data storage queue is greater than 0; and if the embedded data storage queue is greater than 0, detecting whether the current operating conditions meet the operating conditions corresponding to the operating node.

[0051] Specifically, first determine if the data length of the data storage queue is greater than 0; only if the data storage queue is greater than 0 will the current running conditions be checked to see if they meet the running conditions corresponding to the running node, thereby reducing the number of checks and the number of program executions.

[0052] Step S105: Report the items for executing the first embedded data according to the execution order.

[0053] After collecting the first data point, the execution node can be set to report immediately after data collection, or the execution order of the data can be recorded first, and then reported according to the recorded order when the recorded values ​​reach a certain threshold. Since the execution data is sequential, whether reporting immediately after collection or recording first and then reporting, data can be reported according to the execution order. This ensures that the timestamp of each data point report is unique, alleviating the pressure on the backend interface to some extent and guaranteeing that each data point is correctly entered into the database without data omission.

[0054] Specifically, in the case of push execution, step S105 is as follows: when it is detected that the running conditions meet the running conditions corresponding to the running node, the first embedded data is pushed.

[0055] In this embodiment, the execution of the first data point may include pushing the first data point. In this case, if the running conditions are detected to meet the running conditions corresponding to the running node, the first data point will be pushed.

[0056] Specifically, the first data point can be data corresponding to the operational product or data collected from user behavior. Specifically, it can be data transmitted in real-time by the user's corresponding data source terminal after user authorization, or data collected from the user's browsing and clicking behaviors after user authorization. After obtaining the first data point transmitted in real-time by the data source terminal, it is added to the data point data storage queue and then pushed through the data point data storage queue to the relevant monitoring subscribers. Specifically, the subscriber's push target address can be obtained when the subscriber subscribes, and the address information can be attached to the first data point when sending it, or the subscriber's address information can be mapped to the data source terminal to establish a mapping relationship or address link between the subscriber and the data source terminal. The subscriber's target address information can be carried in the first data point, obtained through the data storage queue, and then pushed. Alternatively, the address information can be obtained from the mapping relationship, attached to the first data point, and then obtained through the data storage queue for pushing. The specific settings can be configured according to actual conditions, and this invention does not impose specific limitations here.

[0057] Furthermore, step 105 may further include: obtaining the identification information of the data source terminal of the first embedded data; and storing the first embedded data into the corresponding push sub-queue in the data storage queue according to the identification information.

[0058] Furthermore, in order to ensure that data from the same terminal is allocated to the same data storage queue, the data storage queue can be divided into multiple push sub-queues, and the first-point data can be placed in the corresponding identification information, i.e., the push sub-queue of the terminal identifier. This is mainly used to place the first-point data from the same data source terminal into the same push sub-queue. In other words, the first-point data transmitted from the same data source terminal is allocated to the same push sub-queue for processing, thus avoiding out-of-order pushes.

[0059] After reporting the execution status of the data, the data storage queue can be further supplemented, as detailed in the following reference. Figure 2 After step 105, steps S106 to S107 may also be included.

[0060] Step S106: Obtain the second data point data;

[0061] Step S107: Insert the second embedded data into the back end of the data storage queue.

[0062] Specifically, refer to Figure 3 First, an `addData` function is defined to add data. Then, the second tracking data is retrieved and inserted into the rear of the tracking data storage queue. Before inserting the second tracking data into the rear of the tracking data storage queue, the state of the tracking data storage queue can be further determined. If the tracking data storage queue is not full, the second tracking data is recorded and stored at the rear of the tracking data storage queue. If the tracking data storage queue is full, the second tracking data is recorded first, and then stored in the first available space from the rear to the front of the queue.

[0063] By following the steps above, we can ensure that the data in the data storage queue is recorded to the end of the queue, and that the data storage queue always follows the execution order from the head to the tail.

[0064] Specifically, when the data storage queue is full, if the operating conditions are met, the first data point at the head of the queue is removed for execution. The current first data point in the queue is then moved sequentially to the position of the removed first data point within the queue. After this movement, the acquired second data point is recorded in an empty position within the queue. This ensures that the first data request entering the queue is recorded at the head, guaranteeing that data is always recorded from the tail to the head.

[0065] To better understand the above embodiments, the following are some application scenarios:

[0066] In this embodiment, a data storage queue for storing the first data entry point is created. When creating the queue, the capacity (i.e., the queue length) must be specified, and the queue length can be set according to the data size. Upon receiving the first data entry point (i.e., the data to be executed), a running node for the first data entry point is set based on its attributes. This involves defining a "running" switch and a "timer" (a time node) to control whether each reported data is executed immediately. After setting the running node, the first data entry point is stored in the data storage queue according to the running node. For example, if the running node for the first data entry point is "execute immediately," the first data entry point is stored at the front of the data storage queue, thus prioritizing its execution. The first data entry point is executed when the running conditions are found to match the running conditions corresponding to the running node. These running conditions may include time nodes, location nodes, etc. After executing the first data entry point, the execution conditions can be set to either report immediately after execution or record the execution order of the data first, and then report according to the recorded order when the recorded values ​​reach a certain threshold. By pre-setting the execution nodes of the event tracking data, execution is only performed at specific times, eliminating the need for real-time execution. This reduces the number of executions and alleviates the pressure of concurrent calls, thus saving resources. On the other hand, the items executing the first event tracking data are reported according to the execution order. During the data reporting process, execution data is reported based on the queue execution order. Since the timestamp of each event tracking data report is unique, it alleviates the call pressure of the backend interface to a certain extent. At the same time, even if multiple event tracking data are executed at the same time, it can be ensured that each event tracking data can be entered into the database normally without real-time reporting. This saves resources and avoids missing data, which is beneficial for business personnel to carry out operational work.

[0067] The above-described method for reporting event tracking data first creates an event tracking data storage queue. Upon receiving the first event tracking data, a running node for the first event tracking data is set. Based on the running node, the first event tracking data is stored in the event tracking data storage queue. When the running conditions are detected to match the running conditions corresponding to the running node, the first event tracking data is executed. By pre-setting the running node for the event tracking data, execution is only performed at specific times, eliminating the need for real-time execution, reducing the number of executions, and alleviating the pressure of concurrent calls, thus achieving cost savings. Furthermore, the method reports the execution of the first event tracking data according to the execution order. During the data reporting process, the execution data is reported based on the queue's execution order. Since the timestamp of each event tracking data report is unique, it alleviates the pressure of backend interface calls to a certain extent. Even if multiple event tracking data are executed simultaneously, it ensures that each event tracking data can be normally stored in the database without real-time reporting. This saves costs while preventing data omissions, facilitating operational work for business personnel.

[0068] Please refer to Figure 4 , Figure 4 This is a schematic block diagram of a data reporting device for embedded points, provided as an embodiment of this application.

[0069] like Figure 4 As shown, the device 400 includes: a creation module 401, a setting module 402, a storage module 403, an execution module 405, and a reporting module 406.

[0070] Create module 401 to create the data storage queue for the embedded data points;

[0071] The setting module 402 is used to set the running node of the first embedded data when the first embedded data is received;

[0072] Storage module 403 is used to store the first embedded data into the embedded data storage queue according to the running node;

[0073] Execution module 404 is used to execute the first embedded data when it is detected that the running conditions meet the running conditions corresponding to the running node;

[0074] The reporting module 405 is used to report the items for executing the first embedded data according to the execution order.

[0075] It should be noted that those skilled in the art will understand that, for the sake of convenience and brevity, the specific working processes of the device and each module and unit described above can be referred to the corresponding processes in the aforementioned embodiments of the embedded data reporting method, and will not be repeated here.

[0076] The apparatus provided in the above embodiments can be implemented as a computer program, which can be used in, for example... Figure 5 It runs on the computer device shown.

[0077] Please see Figure 5 , Figure 5 This is a schematic block diagram illustrating the structure of a computer device provided in an embodiment of this application. The computer device can be a personal computer (PC), a server, or other device with data processing capabilities.

[0078] like Figure 5 As shown, the computer device includes a processor, memory, and network interface connected via a system bus, wherein the memory may include non-volatile storage media and internal memory.

[0079] Non-volatile storage media can store operating systems and computer programs. These computer programs include program instructions that, when executed, cause the processor to perform any method for reporting embedded data.

[0080] The processor provides computing and control capabilities, supporting the operation of the entire computer device.

[0081] Internal memory provides an environment for the execution of computer programs in non-volatile storage media. When the computer program is executed by the processor, it enables the processor to execute any method of reporting embedded data.

[0082] This network interface is used for network communication, such as sending assigned tasks. Those skilled in the art will understand that... Figure 5 The structure shown is merely a block diagram of a portion of the structure related to the present application and does not constitute a limitation on the computer device to which the present application is applied. Specific computer devices may include more or fewer components than those shown in the figure, or combine certain components, or have different component arrangements.

[0083] It should be understood that the processor can be a Central Processing Unit (CPU), but it can also be other general-purpose processors, 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, discrete hardware components, etc. Among these, a general-purpose processor can be a microprocessor or any conventional processor.

[0084] In one embodiment, the processor is configured to run a computer program stored in memory to perform the following steps:

[0085] Create a queue for storing event tracking data;

[0086] Upon receiving the first data point data, set the execution node for the first data point data;

[0087] According to the running node, the first embedded data is stored in the embedded data storage queue;

[0088] If the operating conditions are found to meet the operating conditions corresponding to the operating node, the first embedded data is executed;

[0089] Report the items for executing the first data entry point according to the execution order.

[0090] In some embodiments, when the processor executes the first embedded data upon detecting that the running conditions meet the running conditions corresponding to the running node, it is configured to:

[0091] Detect the running node of the embedded data storage queue;

[0092] Compare the time point corresponding to the running node with the current time point;

[0093] If the difference between the time point corresponding to the running node and the current time point is less than a preset threshold, the first embedded data corresponding to the running node is obtained, popped from the embedded data storage queue, and executed.

[0094] In some embodiments, the processor, before executing the first embedded data when the running conditions are detected to meet the running conditions corresponding to the running node, is configured to:

[0095] Determine whether the data length of the embedded data storage queue is greater than 0;

[0096] If the data storage queue of the embedded points is greater than 0, check whether the current running conditions meet the running conditions corresponding to the running node.

[0097] In some embodiments, after the processor implements the action of reporting the execution of the first embedded data according to the execution order, it is configured to implement:

[0098] Obtain the data from the second data point;

[0099] Insert the second tracking data into the back end of the tracking data storage queue.

[0100] In some embodiments, when the processor executes the first embedded data upon detecting that the running conditions meet the running conditions corresponding to the running node, it is configured to:

[0101] If the operating conditions are found to meet the operating conditions corresponding to the operating node, the first data point data will be pushed.

[0102] In some embodiments, after the processor implements the step of storing the first data entry point into the data entry point storage queue according to the running node, it is used to achieve:

[0103] Obtain the identification information of the data source terminal of the first embedded data;

[0104] The first embedded data is stored in the corresponding push sub-queue in the embedded data storage queue based on the identification information.

[0105] This application also provides a computer-readable storage medium storing a computer program, the computer program including program instructions, and the method implemented when the program instructions are executed can refer to various embodiments of the data reporting method of this application.

[0106] The computer-readable storage medium may be an internal storage unit of the computer device described in the foregoing embodiments, such as the hard disk or memory of the computer device. The computer-readable storage medium may also be an external storage device of the computer device, such as a plug-in hard disk, SmartMedia Card (SMC), Secure Digital (SD) card, or Flash Card equipped on the computer device.

[0107] Furthermore, the computer-readable storage medium may primarily include a program storage area and a data storage area, wherein the program storage area may store the operating system, at least one application required for a function, etc.; and the data storage area may store data created based on the use of blockchain nodes, etc.

[0108] The blockchain referred to in this invention is a novel application model of computer technologies such as distributed data storage, peer-to-peer transmission, consensus mechanisms, and encryption algorithms. Essentially, a blockchain is a decentralized database, a chain of data blocks linked together using cryptographic methods. Each data block contains information about a batch of network transactions, used to verify the validity of the information (anti-counterfeiting) and generate the next block. A blockchain can include an underlying blockchain platform, a platform product service layer, and an application service layer.

[0109] It should be noted that, in this document, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or system 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 system. Unless otherwise specified, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or system that includes that element.

[0110] The sequence numbers of the embodiments in this application are for descriptive purposes only and do not represent the superiority or inferiority of the embodiments. The above descriptions are merely specific implementations of this application, but the scope of protection of this application is not limited thereto. Any person skilled in the art can easily conceive of various equivalent modifications or substitutions within the technical scope disclosed in this application, and these modifications or substitutions should all be covered within the scope of protection of this application. Therefore, the scope of protection of this application should be determined by the scope of the claims.

Claims

1. A method for reporting embedded data, characterized in that, The method includes the following steps: Create a queue for storing event tracking data; Upon receiving the first data point data, set the execution node for the first data point data; According to the running node, the first embedded data is stored in the embedded data storage queue; Determine whether the data length of the embedded data storage queue is greater than 0; If the data storage queue of the embedded points is greater than 0, check whether the current running conditions meet the running conditions corresponding to the running node; If the running conditions are detected to meet the running conditions corresponding to the running node, the first embedded data is executed, and the running conditions include at least a time node and a location node; Report the items for executing the first data entry point according to the execution order.

2. The method for reporting embedded data according to claim 1, characterized in that, The step of executing the first embedded data when the operating conditions are detected to meet the operating conditions corresponding to the operating node includes: Detect the running node of the embedded data storage queue; Compare the time point corresponding to the running node with the current time point; If the difference between the time point corresponding to the running node and the current time point is less than a preset threshold, the first embedded data point corresponding to the running node is obtained, popped from the data storage queue, and executed.

3. The method for reporting embedded data according to claim 1, characterized in that, After the step of reporting the execution of the first data point according to the execution order, the method further includes: Obtain the data from the second data point; Insert the second tracking data into the back end of the tracking data storage queue.

4. The method for reporting embedded data according to claim 1, characterized in that, The step of executing the first embedded data when the operating conditions are detected to meet the operating conditions corresponding to the operating node includes: If the operating conditions are found to meet the operating conditions corresponding to the operating node, the first data point data will be pushed.

5. The method for reporting embedded data according to claim 1, characterized in that, After storing the first embedded data point into the embedded data point data storage queue according to the running node, the method further includes: Obtain the identification information of the terminal from which the first embedded data is sourced; The first embedded data is stored in the corresponding push sub-queue in the embedded data storage queue based on the identification information.

6. A device for reporting embedded data, characterized in that, The embedded data reporting device includes: Create a module for creating data storage queues for embedded data; The setting module is used to set the running node of the first embedded data when the first embedded data is received; A storage module is used to store the first embedded data into the embedded data storage queue according to the running node; The execution module is used to determine whether the data length of the data storage queue is greater than 0; if the data storage queue is greater than 0, it checks whether the current running conditions meet the running conditions corresponding to the running node. The execution module is used to execute the first embedded data when the running conditions are detected to meet the running conditions corresponding to the running node. The running conditions include at least a time node and a location node. The reporting module is used to report the items for executing the first data point according to the execution order.

7. The embedded data reporting device according to claim 6, characterized in that, The execution module includes: The detection submodule is used to detect the running nodes of the embedded data storage queue; The comparison submodule is used to compare the time point corresponding to the running node with the current time point; The acquisition submodule is used to acquire the first embedded data corresponding to the running node when the difference between the time point corresponding to the running node and the current time point is less than a preset threshold, and then pop the data from the embedded data storage queue and execute it.

8. A computer device, characterized in that, The computer device includes a processor, a memory, and a computer program stored in the memory and executable by the processor, wherein when the computer program is executed by the processor, it implements the steps of the data reporting method for embedded data as described in any one of claims 1 to 5.

9. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program, wherein when the computer program is executed by a processor, it implements the steps of the data reporting method for embedded data as described in any one of claims 1 to 5.

Images