CN113126971A - Data embedding point processing method, device and system, electronic device and storage medium - Google Patents

Data embedding point processing method, device and system, electronic device and storage medium Download PDF

Info

Publication number
CN113126971A
CN113126971A CN202110370424.7A CN202110370424A CN113126971A CN 113126971 A CN113126971 A CN 113126971A CN 202110370424 A CN202110370424 A CN 202110370424A CN 113126971 A CN113126971 A CN 113126971A
Authority
CN
China
Prior art keywords
buried point
data
buried
point
trigger function
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202110370424.7A
Other languages
Chinese (zh)
Inventor
赵玉红
王秀双
赵春波
李良敏
郑峰
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Particle Culture Technology Group Hangzhou Co ltd
Original Assignee
Particle Culture Technology Group Hangzhou Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Particle Culture Technology Group Hangzhou Co ltd filed Critical Particle Culture Technology Group Hangzhou Co ltd
Priority to CN202110370424.7A priority Critical patent/CN113126971A/en
Publication of CN113126971A publication Critical patent/CN113126971A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F8/00Arrangements for software engineering
    • G06F8/30Creation or generation of source code
    • G06F8/37Compiler construction; Parser generation
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/30Monitoring
    • G06F11/3003Monitoring arrangements specially adapted to the computing system or computing system component being monitored
    • G06F11/302Monitoring arrangements specially adapted to the computing system or computing system component being monitored where the computing system component is a software system
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F8/00Arrangements for software engineering
    • G06F8/40Transformation of program code
    • G06F8/41Compilation

Abstract

The application relates to a data embedding point processing method, a data embedding point processing device, a data embedding point processing system, an electronic device and a storage medium, wherein the processing method comprises the following steps: defining a preset buried point trigger function; acquiring a first buried point injection solution, and acquiring a preset buried point execution function according to the first buried point injection solution; wherein, the embedded point execution function comprises a service code; and moving the service code to the embedded point trigger function based on the first embedded point injection solution, further acquiring embedded point data through the embedded point trigger function, and acquiring a processing result of the embedded point data through the embedded point execution function. By the method and the device, the problem of low processing efficiency of data embedding is solved, and the steps of acquiring and processing the data embedding data are separated.

Description

Data embedding point processing method, device and system, electronic device and storage medium
Technical Field
The present application relates to the field of computer technologies, and in particular, to a method, an apparatus, a system, an electronic apparatus, and a storage medium for processing data embedding points.
Background
The embedded point refers to the relevant technology for capturing, processing and sending specific user behaviors or events and the implementation process thereof; in order to monitor various data of a product, a buried point operation is added in a software running process, and key data in the process are uploaded to a server through the buried point operation. Common methods for embedding points include: code buried points, full buried points and visual buried points.
In the related art, most of the point burying schemes are realized based on function call, that is, a point burying method is prepared in advance, and then a corresponding point burying method is called by a service layer under a specific service scene. However, in the actual service development process, since the service layer has a plurality of repeated service scenarios, the same embedded point logic needs to be processed in all the repeated scenarios, which is a drag and burden for the service layer, and the embedded point module is coupled with the service module, and the code expansibility is limited, so that the service code and the embedded point code have high coupling performance, which is not beneficial to the maintenance of the service code, and thus the processing efficiency of the data embedded point is low.
At present, no effective solution is provided for the problem of low processing efficiency of data embedding points in the related technology.
Disclosure of Invention
The embodiment of the application provides a method, a device, a system, an electronic device and a storage medium for processing data embedding points, so as to at least solve the problem of low processing efficiency of the data embedding points in the related art.
In a first aspect, an embodiment of the present application provides a method for processing a data buried point, where the method includes:
defining a preset buried point trigger function;
acquiring a first buried point injection solution, and acquiring a preset buried point execution function according to the first buried point injection solution; wherein the embedded point execution function comprises a service code;
and moving the service code to the buried point trigger function based on the first buried point annotation, further acquiring buried point data through the buried point trigger function, and acquiring a processing result of the buried point data through the buried point execution function.
In one possible embodiment, said moving said business code to said buried point trigger function based on said first buried point annotation comprises:
defining a second buried point annotation of the buried point trigger function; wherein the second buried point annotation matches the first buried point annotation;
obtaining a search result of the service code according to the first buried point annotation solution through an AspectJ compiler;
and performing byte code pile insertion processing on the obtained service code according to the search result and the second buried point annotation, and further moving the processed service code to the buried point trigger function.
In one possible embodiment, the defining the preset buried trigger function includes:
defining a second buried point annotation of the buried point trigger function;
acquiring a buried point interface, and acquiring the buried point trigger function through the buried point interface and the second buried point injection solution; wherein the buried point interface is matched with the second buried point injection solution.
In a possible embodiment, the obtaining of the buried point data by the buried point trigger function includes:
and defining a data collection code in the buried point trigger function, and acquiring the buried point data through the data collection code.
In a possible embodiment, after the moving the service code into the buried point trigger function, the method further includes:
under the condition of executing and setting the buried point trigger function, executing the buried point execution function, and further executing the service code; wherein the service code comprises a buried data transmission code.
In a second aspect, an embodiment of the present application provides a device for processing data landed points, where the device includes: the system comprises a definition module, a service module and a mobile module;
the definition module is used for defining a preset buried point trigger function;
the service module is used for acquiring a first embedded point annotation solution and acquiring a preset embedded point execution function according to the first embedded point annotation solution; wherein the embedded point execution function comprises a service code;
the mobile module is used for moving the service code to the buried point trigger function based on the first buried point annotation, further acquiring buried point data through the buried point trigger function, and acquiring a processing result of the buried point data through the buried point execution function.
In one possible embodiment, the definition module is further configured to define a second buried point annotation of the buried point trigger function; wherein the second buried point annotation matches the first buried point annotation;
the mobile module is further used for obtaining a search result of the service code according to the first buried point annotation solution through an AspectJ compiler;
and the mobile module performs byte code instrumentation on the acquired service code according to the search result and the second buried point annotation, and then moves the processed service code to the buried point trigger function.
In a third aspect, an embodiment of the present application provides a system for processing data embedding points, where the system includes: a terminal device, a transmission device and a server device; the terminal equipment is connected with the server equipment through the transmission equipment;
the terminal equipment is used for defining a buried point triggering function;
the transmission equipment is used for transmitting the buried point trigger function;
the server device is configured to execute the data burial point processing method according to the first aspect.
In a fourth aspect, an embodiment of the present application provides an electronic device, which includes a memory, a processor, and a computer program stored on the memory and executable on the processor, and when the processor executes the computer program, the processor implements the method for processing the data buried point according to the first aspect.
In a fifth aspect, the present application provides a storage medium, on which a computer program is stored, where the computer program is executed by a processor to implement the processing method of the data buried point as described in the first aspect.
Compared with the related art, the data buried point processing method, the data buried point processing device, the data buried point processing system, the electronic device and the storage medium provided by the embodiment of the application define the preset buried point trigger function; acquiring a first buried point injection solution, and acquiring a preset buried point execution function according to the first buried point injection solution; wherein, the embedded point execution function comprises a service code; and moving the service code to the embedded point trigger function based on the first embedded point injection solution, further acquiring embedded point data through the embedded point trigger function, and acquiring a processing result of the embedded point data through the embedded point execution function, so that the problem of low processing efficiency of data embedded points is solved, and the steps of acquiring and processing the embedded point data are separated.
The details of one or more embodiments of the application are set forth in the accompanying drawings and the description below to provide a more thorough understanding of the application.
Drawings
The accompanying drawings, which are included to provide a further understanding of the application and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the application and together with the description serve to explain the application and not to limit the application. In the drawings:
FIG. 1 is a flow chart of a method for data site processing according to an embodiment of the present application;
FIG. 2 is a flow chart of another method for data site processing according to an embodiment of the present application;
FIG. 3 is a schematic illustration of a method of data site processing according to a preferred embodiment of the present application;
FIG. 4 is a flow chart of a method for data site processing according to the preferred embodiment of the present application;
FIG. 5 is a block diagram of a data-embedding processing apparatus according to an embodiment of the present disclosure;
FIG. 6 is a block diagram of a data-embedded processing system according to an embodiment of the present application;
fig. 7 is a block diagram of the inside of a computer device according to an embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application will be described and illustrated below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application. All other embodiments obtained by a person of ordinary skill in the art based on the embodiments provided in the present application without any inventive step are within the scope of protection of the present application. Moreover, it should be appreciated that in the development of any such actual implementation, as in any engineering or design project, numerous implementation-specific decisions must be made to achieve the developers' specific goals, such as compliance with system-related and business-related constraints, which may vary from one implementation to another.
Reference in the specification to "an embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment can be included in at least one embodiment of the specification. The appearances of the phrase in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. Those of ordinary skill in the art will explicitly and implicitly appreciate that the embodiments described herein may be combined with other embodiments without conflict.
Unless defined otherwise, technical or scientific terms referred to herein shall have the ordinary meaning as understood by those of ordinary skill in the art to which this application belongs. Reference to "a," "an," "the," and similar words throughout this application are not to be construed as limiting in number, and may refer to the singular or the plural. The present application is directed to the use of the terms "including," "comprising," "having," and any variations thereof, which are intended to cover non-exclusive inclusions; for example, a process, method, system, article, or apparatus that comprises a list of steps or modules (elements) is not limited to the listed steps or elements, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus. Reference to "connected," "coupled," and the like in this application is not intended to be limited to physical or mechanical connections, but may include electrical connections, whether direct or indirect. Reference herein to "a plurality" means greater than or equal to two. "and/or" describes an association relationship of associated objects, meaning that three relationships may exist, for example, "A and/or B" may mean: a exists alone, A and B exist simultaneously, and B exists alone. Reference herein to the terms "first," "second," "third," and the like, are merely to distinguish similar objects and do not denote a particular ordering for the objects.
The present embodiment provides a method for processing data embedding points, and fig. 1 is a flowchart of a method for processing data embedding points according to an embodiment of the present application, and as shown in fig. 1, the flowchart includes the following steps:
step S102, a preset buried point trigger function is defined.
Wherein, the buried point triggering function is a function containing a buried point data collecting code; the buried point trigger function may be set in advance by a user.
Step S104, acquiring a first buried point injection solution, and acquiring a preset buried point execution function according to the first buried point injection solution; wherein the buried point execution function includes a service code.
The first embedded point annotation solution is used for identifying the position of a service code in the embedded point execution function, which is stored in a Java class file; for example, the first buried point annotation solution may be @ Aspect. The first buried point injection is used for identifying the buried point execution function and further associating the buried point execution function with the buried point trigger function.
Step S106, moving the service code to the embedded point trigger function based on the first embedded point injection solution, further obtaining embedded point data through the embedded point trigger function, and obtaining a processing result of the embedded point data through the embedded point execution function.
It can be understood that the role of the data burial point is to collect relevant data of a specific event when a business function in the business code is executed. Through the identification of the first buried point annotation, the position of the business code in the storage file can be determined, and the business code is obtained based on the determined position, so that the buried point execution function containing the business code is inserted into the buried point trigger function, and the separation between the step of collecting buried point data and the step of sending data is realized.
Specifically, after the step S106 is executed, the embedded point trigger function already contains the service codes in the embedded point execution function, and these service codes are the processing and sending logic of the embedded point data, and when the embedded point trigger function is executed, the service codes in the embedded point execution function are executed in a phase-changing manner, so that the focus separation is realized, and the embedded point trigger function and the embedded point execution function can be divided into two places and are not associated with each other when the codes are written. The advantage of doing so is that the same buried point logic can be merged and processed, reducing redundancy and improving efficiency. For example, the buried point trigger function has N places in the application, and all the buried point logic needs to be processed, but the buried point logic is the same, the same buried point logic can be extracted from the buried point execution function, and the buried point trigger function and the buried point execution function have clear responsibilities, so that the respective extended maintenance is facilitated.
In the related art, code extensibility is limited in the face of a repetitive service scenario. For example, in an exposure event, 100 exposure elements are configured in one page, and all the elements need to be processed to obtain buried point data, pre-process the data and call a buried point function; if 100 elements are newly added and configured on the page, the elements also need to process the steps of acquiring the embedded data, preprocessing the data and calling the embedded function, so that the burden of a service layer is increased, and the processing efficiency of the data embedded function is low.
In the present application, through the above steps S102 to S106, the service code of the buried point execution function is inserted into the buried point trigger function through the first buried point annotation, so as to establish a relationship between the buried point execution function and the buried point trigger function, the buried point data is collected by the buried point trigger function, and the buried point execution function processes the buried point data, so that the step of acquiring data can be separated from the step of sending data.
In a possible embodiment, a method for processing a data buried point is provided, and fig. 2 is a flowchart of another method for processing a data buried point according to an embodiment of the present application, as shown in fig. 2, the flowchart includes step S102 and step S104 in fig. 1, and further includes the following steps:
step S202, defining a second buried point annotation of the buried point trigger function; wherein the second buried point annotation matches the first buried point annotation.
The second buried point solution may be preset by a user.
Step S204, obtaining a search result of the service code according to the first buried point annotation solution through an AspectJ compiler; and performing byte code instrumentation on the acquired service code according to the search result and the second buried point annotation, and further moving the processed service code to the buried point trigger function.
Specifically, a compiling task is inserted in a java compiling stage through a byte code instrumentation technology, and a service code in the buried point execution function is moved to the buried point trigger function identified by the second buried point annotation based on the first buried point annotation through an AspectJ compiler, for example, the service code in the onPlay method is moved to the playVod method.
Through the above steps S202 to S204, in the software compiling stage, the point in the software running flow is pre-instrumented through the byte code instrumentation technology, that is, the code is inserted into the function of the key node flow, and the function will execute the pre-instrumented code logic when executed in the running period, and the embedded point logic can be processed uniformly in this part of code logic, thereby effectively improving the processing efficiency of data embedded point.
In a possible embodiment, the step S102 further includes the following steps: defining a second buried point annotation of the buried point trigger function; acquiring a buried point interface, and acquiring the buried point trigger function through the buried point interface and the second buried point injection solution; wherein, the buried point interface is matched with the second buried point injection solution.
The second buried point annotation and the buried point interface appear in pairs, and the buried point execution specification is specified. The second buried point annotation, as an identifier, may be marked on any function, for example, the second buried point annotation is @ play. The buried point interface and the second buried point annotation are in one-to-one correspondence, for example, playParam is an interface corresponding to the @ play buried point annotation; the buried point annotation solution is used for identifying the business object to which the annotated function belongs.
How to use the second buried point annotation solution and the interface corresponding to the second buried point annotation solution are demonstrated by the code below. A is a business object, wherein the business object comprises a playVod method, an @ play annotation identifier is marked on the playVod method, and a playParam identifier is marked on an A object to which the playVod belongs. An example of the development code of the buried point trigger function provided with the second buried point annotation is as follows:
A implement playParam{
@play
void playVod(){}
String param(){}
}
through the embodiment, the embedded point trigger function is identified through the embedded point interface and the second embedded point injection solution, so that the efficiency of the processor for executing the embedded point trigger function is accelerated, and the processing efficiency of data embedded points is further effectively improved.
In a possible embodiment, the obtaining of the buried point data by the buried point trigger function further includes the following steps: and defining a data collection code in the buried point trigger function, and acquiring the buried point data through the data collection code. Specifically, the data collection code is used for collecting buried point data, and may be implemented by, for example, String param () { }. Through the embodiment, the data collection codes are defined in the buried point trigger function, so that the buried point trigger function only needs to pay attention to the buried point data collection service, and the processing efficiency of data buried points is further improved.
In a possible embodiment, after the service code is moved to the buried point trigger function, the data buried point processing method further includes the following steps: executing the embedded point execution function under the condition of executing and setting the embedded point trigger function, and further executing the service code; wherein the service code comprises a buried data transmission code.
The embedded point execution function which needs to be executed when the embedded point trigger function identified by the second embedded point annotated solution @ play is executed is defined in the embodiment of the application; an example of the development code of the buried point execution function labeled with the first buried point annotation is as follows:
@Aspect(retention=“play”)
void onPlay(playParam){
service code …
}
The above pseudo code demonstrates that a buried point execution function will execute when the function identified by @ play executes. Through the embodiment, the embedded point executing function which is executed synchronously with the embedded point triggering function is defined, and the steps of collecting data by the embedded point triggering function, processing the embedded point executing function and sending the data are separated.
The embodiments of the present application are described and illustrated below by means of preferred embodiments. Fig. 3 is a schematic diagram of a data embedding processing method according to a preferred embodiment of the present application, and as shown in fig. 3, during the normal logic execution of the code, a embedding execution function is inserted into the embedding trigger function. Fig. 4 is a flowchart of a data embedding processing method according to a preferred embodiment of the present application, and as shown in fig. 4, the data embedding processing method includes the following steps:
step S402, defining a buried point annotation. The self-defined buried point annotation refers to the second buried point annotation used for representing the buried point trigger function.
And step S404, annotating the buried point trigger function.
In step S406, a buried point execution function is defined. And identifying the buried point execution function through a first buried point annotation solution such as @ Aspect.
In step S408, the embedded point executing function is compiled and inserted into the embedded point triggering function. Wherein, the service code of the embedded point execution function is inserted into the embedded point trigger function through a compiling tool
It should be understood that although the steps in the flowcharts of fig. 1, 2 and 4 are shown in order as indicated by the arrows, the steps are not necessarily performed in order as indicated by the arrows. The steps are not performed in the exact order shown and described, and may be performed in other orders, unless explicitly stated otherwise. Moreover, at least some of the steps in fig. 1, 2, and 4 may include multiple sub-steps or multiple stages that are not necessarily performed at the same time, but may be performed at different times, and the order of performing the sub-steps or stages is not necessarily sequential, but may be performed alternately or alternatingly with other steps or at least some of the sub-steps or stages of other steps.
The present embodiment further provides a data point burying processing apparatus, which is used to implement the foregoing embodiments and preferred embodiments, and the description of the apparatus is omitted for brevity. As used hereinafter, the terms "module," "unit," "subunit," and the like may implement a combination of software and/or hardware for a predetermined function. Although the means described in the embodiments below are preferably implemented in software, an implementation in hardware, or a combination of software and hardware is also possible and contemplated.
Fig. 5 is a block diagram of a data-embedded processing device according to an embodiment of the present application, and as shown in fig. 5, the device includes: a definition module 52, a traffic module 54 and a mobility module 56.
The defining module 52 is configured to define a preset buried point trigger function; the service module 54 is configured to obtain a first buried point annotation solution, and obtain a preset buried point execution function according to the first buried point annotation solution; wherein, the embedded point execution function comprises a service code; the moving module 56 is configured to move the service code to the embedded point trigger function based on the first embedded point annotation, further obtain embedded point data through the embedded point trigger function, and obtain a processing result of the embedded point data through the embedded point execution function.
Through the embodiment, the mobile module 56 inserts the service code of the buried point execution function into the buried point trigger function based on the first buried point annotation, so as to establish the relationship between the buried point execution function and the buried point trigger function, collect the buried point data from the buried point trigger function, and process the buried point data by the buried point execution function, so that the step of acquiring the data can be separated from the step of sending the data, and the problem of low processing efficiency of the data buried point is solved.
In one possible embodiment, the defining module 52 is further configured to define a second buried point annotation of the buried point trigger function; wherein the second buried point annotation matches the first buried point annotation; the mobile module 56 is further configured to obtain, by an AspectJ compiler, a search result of the service code according to the first buried point annotation solution; the moving module 56 performs bytecode instrumentation on the obtained service code according to the search result and the second buried point annotation, and then moves the processed service code to the buried point trigger function.
In a possible embodiment, the defining module 52 is further configured to obtain a buried point interface, and obtain the buried point trigger function through the buried point interface and the second buried point injection solution; wherein, the buried point interface is matched with the second buried point injection solution.
In a possible embodiment, the moving module 56 is further configured to define a data collection code in the buried point trigger function, and obtain the buried point data through the data collection code.
In a possible embodiment, the processing device of the data burying point further includes an execution module; the execution module is used for executing the embedded point execution function under the condition of executing and setting the embedded point trigger function, and further executing the service code; wherein the service code comprises a buried data transmission code.
The above modules may be functional modules or program modules, and may be implemented by software or hardware. For a module implemented by hardware, the modules may be located in the same processor; or the modules can be respectively positioned in different processors in any combination.
The present embodiment further provides a system for processing data embedding points, and fig. 6 is a block diagram of a structure of a system for processing data embedding points according to an embodiment of the present application, as shown in fig. 6, the system includes: a terminal device 62, a transmission device 64, and a server device 66; wherein the terminal device 62 is connected to a server device 66 via a transmission device 64.
The terminal device 62 is used for defining a buried point trigger function; the transmission device 64 is used for transmitting the buried point trigger function; the server device 66 is configured to obtain a first buried point annotation solution, and obtain a preset buried point execution function according to the first buried point annotation solution; wherein, the embedded point execution function comprises a service code; the server device 66 moves the service code to the buried point trigger function based on the first buried point annotation, and then obtains buried point data through the buried point trigger function, and obtains a processing result of the buried point data through the buried point execution function.
Through the embodiment, the server device 66 inserts the service code of the embedded point execution function into the embedded point trigger function through the first embedded point annotation, so as to establish a relationship between the embedded point execution function and the embedded point trigger function, and collects the embedded point data from the embedded point trigger function, and the embedded point execution function processes the embedded point data, so that the step of acquiring data and the step of sending data can be separated, and the problem of low processing efficiency of the data embedded point is solved.
In one possible embodiment, the terminal device 62 is further configured to define a second buried point annotation of the buried point trigger function by the user; wherein the second buried point annotation matches the first buried point annotation; the server device 66 is further configured to obtain, by an AspectJ compiler, a search result of the service code according to the first buried point annotation solution; the server device 66 performs bytecode instrumentation on the obtained service code according to the search result and the second buried point annotation, and then moves the processed service code to the buried point trigger function.
In a possible embodiment, the server device 66 is further configured to obtain a buried point interface, and obtain the buried point trigger function through the buried point interface and the second buried point injection solution; wherein, the buried point interface is matched with the second buried point injection solution.
In one possible embodiment, the server device 66 is further configured to define a data collection code in the buried point trigger function, and obtain the buried point data through the data collection code.
In a possible embodiment, the server device 66 is further configured to execute the buried point execution function and further execute the service code in case of executing the setting of the buried point trigger function; wherein the service code comprises a buried data transmission code.
In one possible embodiment, a computer device is provided, and the computer device may be a server, and fig. 7 is a structural diagram of the inside of a computer device according to an embodiment of the present application, as shown in fig. 7. The computer device includes a processor, a memory, a network interface, and a database connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device comprises a nonvolatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program, and a database. The internal memory provides an environment for the operation of an operating system and computer programs in the non-volatile storage medium. The database of the computer device is used for storing the buried point trigger function. The network interface of the computer device is used for communicating with an external terminal through a network connection. The computer program is executed by a processor to implement a method of data-embedding.
Those skilled in the art will appreciate that the architecture shown in fig. 7 is merely a block diagram of some of the structures associated with the disclosed aspects and is not intended to limit the computing devices to which the disclosed aspects apply, as particular computing devices may include more or less components than those shown, or may combine certain components, or have a different arrangement of components.
The present embodiment also provides an electronic device comprising a memory having a computer program stored therein and a processor configured to execute the computer program to perform the steps of any of the above method embodiments.
Optionally, the electronic apparatus may further include a transmission device and an input/output device, wherein the transmission device is connected to the processor, and the input/output device is connected to the processor.
Optionally, in this embodiment, the processor may be configured to execute the following steps by a computer program:
and S1, defining a preset buried point trigger function.
S2, acquiring a first buried point injection solution, and acquiring a preset buried point execution function according to the first buried point injection solution; wherein the buried point execution function includes a service code.
S3, moving the service code to the embedded point trigger function based on the first embedded point solution, further obtaining the embedded point data through the embedded point trigger function, and obtaining the processing result of the embedded point data through the embedded point executing function.
It should be noted that, for specific examples in this embodiment, reference may be made to examples described in the foregoing embodiments and optional implementations, and details of this embodiment are not described herein again.
In addition, in combination with the data embedding processing method in the foregoing embodiment, the embodiment of the present application may provide a storage medium to implement. The storage medium having stored thereon a computer program; the computer program, when executed by a processor, implements any one of the above-described data-embedding processing methods.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by hardware instructions of a computer program, which can be stored in a non-volatile computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. Any reference to memory, storage, database, or other medium used in the embodiments provided herein may include non-volatile and/or volatile memory, among others. Non-volatile memory can include read-only memory (ROM), Programmable ROM (PROM), Electrically Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDRSDRAM), Enhanced SDRAM (ESDRAM), Synchronous Link DRAM (SLDRAM), Rambus Direct RAM (RDRAM), direct bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).
It should be understood by those skilled in the art that various features of the above-described embodiments can be combined in any combination, and for the sake of brevity, all possible combinations of features in the above-described embodiments are not described in detail, but rather, all combinations of features which are not inconsistent with each other should be construed as being within the scope of the present disclosure.
The above-mentioned embodiments only express several embodiments of the present application, and the description thereof is more specific and detailed, but not construed as limiting the scope of the invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the concept of the present application, which falls within the scope of protection of the present application. Therefore, the protection scope of the present patent shall be subject to the appended claims.

Claims (10)

1. A method for processing data landings, the method comprising:
defining a preset buried point trigger function;
acquiring a first buried point injection solution, and acquiring a preset buried point execution function according to the first buried point injection solution; wherein the embedded point execution function comprises a service code;
and moving the service code to the buried point trigger function based on the first buried point annotation, further acquiring buried point data through the buried point trigger function, and acquiring a processing result of the buried point data through the buried point execution function.
2. The processing method of claim 1, wherein the moving the business code to the buried point trigger function based on the first buried point annotation comprises:
defining a second buried point annotation of the buried point trigger function; wherein the second buried point annotation matches the first buried point annotation;
obtaining a search result of the service code according to the first buried point annotation solution through an AspectJ compiler;
and performing byte code pile insertion processing on the obtained service code according to the search result and the second buried point annotation, and further moving the processed service code to the buried point trigger function.
3. The process of claim 1, wherein said defining a preset buried trigger function comprises:
defining a second buried point annotation of the buried point trigger function;
acquiring a buried point interface, and acquiring the buried point trigger function through the buried point interface and the second buried point injection solution; wherein the buried point interface is matched with the second buried point injection solution.
4. The processing method according to claim 1, wherein the obtaining of the buried point data by the buried point trigger function comprises:
and defining a data collection code in the buried point trigger function, and acquiring the buried point data through the data collection code.
5. The processing method according to any of claims 1 to 4, wherein after moving the service code into the buried point trigger function, the method further comprises:
under the condition of executing and setting the buried point trigger function, executing the buried point execution function, and further executing the service code; wherein the service code comprises a buried data transmission code.
6. A data site processing apparatus, the apparatus comprising: the system comprises a definition module, a service module and a mobile module;
the definition module is used for defining a preset buried point trigger function;
the service module is used for acquiring a first embedded point annotation solution and acquiring a preset embedded point execution function according to the first embedded point annotation solution; wherein the embedded point execution function comprises a service code;
the mobile module is used for moving the service code to the buried point trigger function based on the first buried point annotation, further acquiring buried point data through the buried point trigger function, and acquiring a processing result of the buried point data through the buried point execution function.
7. The processing apparatus according to claim 6, wherein the definition module is further configured to define a second buried point annotation of the buried point trigger function; wherein the second buried point annotation matches the first buried point annotation;
the mobile module is further used for obtaining a search result of the service code according to the first buried point annotation solution through an AspectJ compiler;
and the mobile module performs byte code instrumentation on the acquired service code according to the search result and the second buried point annotation, and then moves the processed service code to the buried point trigger function.
8. A system for processing data landings, the system comprising: a terminal device, a transmission device and a server device; the terminal equipment is connected with the server equipment through the transmission equipment;
the terminal equipment is used for defining a buried point triggering function;
the transmission equipment is used for transmitting the buried point trigger function;
the server device is used for executing the data burying point processing method according to any one of claims 1 to 5.
9. An electronic device comprising a memory and a processor, wherein the memory stores a computer program, and the processor is configured to execute the computer program to perform the method of data processing of data burial point according to any one of claims 1 to 5.
10. A storage medium having a computer program stored thereon, wherein the computer program is configured to execute the method of processing data buried points according to any one of claims 1 to 5 when the computer program is executed.
CN202110370424.7A 2021-04-07 2021-04-07 Data embedding point processing method, device and system, electronic device and storage medium Pending CN113126971A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110370424.7A CN113126971A (en) 2021-04-07 2021-04-07 Data embedding point processing method, device and system, electronic device and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110370424.7A CN113126971A (en) 2021-04-07 2021-04-07 Data embedding point processing method, device and system, electronic device and storage medium

Publications (1)

Publication Number Publication Date
CN113126971A true CN113126971A (en) 2021-07-16

Family

ID=76775112

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110370424.7A Pending CN113126971A (en) 2021-04-07 2021-04-07 Data embedding point processing method, device and system, electronic device and storage medium

Country Status (1)

Country Link
CN (1) CN113126971A (en)

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8656367B1 (en) * 2011-07-11 2014-02-18 Wal-Mart Stores, Inc. Profiling stored procedures
CN106970789A (en) * 2017-03-07 2017-07-21 武汉斗鱼网络科技有限公司 A kind of Android end groups bury point methods and system automatically in AOP and AspectJ daily record
CN107168757A (en) * 2017-03-31 2017-09-15 武汉斗鱼网络科技有限公司 A kind of Android ends prevent View controls from clicking on the method and device of shake
CN108345542A (en) * 2018-02-28 2018-07-31 腾讯科技(深圳)有限公司 Abnormality eliminating method and device in a kind of application program
CN109766241A (en) * 2018-12-29 2019-05-17 中国银行股份有限公司 System monitoring method, apparatus, computer equipment and computer readable storage medium
CN110209386A (en) * 2019-05-17 2019-09-06 北京奇艺世纪科技有限公司 The acquisition methods and device that data bury setting method a little, bury point data
CN111190573A (en) * 2018-11-14 2020-05-22 北京字节跳动网络技术有限公司 Application program point burying method and device and electronic equipment

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8656367B1 (en) * 2011-07-11 2014-02-18 Wal-Mart Stores, Inc. Profiling stored procedures
CN106970789A (en) * 2017-03-07 2017-07-21 武汉斗鱼网络科技有限公司 A kind of Android end groups bury point methods and system automatically in AOP and AspectJ daily record
CN107168757A (en) * 2017-03-31 2017-09-15 武汉斗鱼网络科技有限公司 A kind of Android ends prevent View controls from clicking on the method and device of shake
CN108345542A (en) * 2018-02-28 2018-07-31 腾讯科技(深圳)有限公司 Abnormality eliminating method and device in a kind of application program
CN111190573A (en) * 2018-11-14 2020-05-22 北京字节跳动网络技术有限公司 Application program point burying method and device and electronic equipment
CN109766241A (en) * 2018-12-29 2019-05-17 中国银行股份有限公司 System monitoring method, apparatus, computer equipment and computer readable storage medium
CN110209386A (en) * 2019-05-17 2019-09-06 北京奇艺世纪科技有限公司 The acquisition methods and device that data bury setting method a little, bury point data

Similar Documents

Publication Publication Date Title
CN110647438B (en) Event monitoring method and device, computer equipment and storage medium
CN110290212B (en) Service call recording method, device, computer equipment and storage medium
CN109474578B (en) Message checking method, device, computer equipment and storage medium
CN109766124B (en) Service development method, device, computer equipment and storage medium
CN110941528B (en) Log buried point setting method, device and system based on fault
CN109656778B (en) Data acquisition method and device, computer equipment and storage medium
CN110135129B (en) Code segment protection method and device, computer equipment and storage medium
CN106293972B (en) single-page application page communication method and device
CN110442502B (en) Point burying method, device, equipment and storage medium
CN112099972B (en) Office file processing method, device and equipment based on RPA robot
CN111835756A (en) APP privacy compliance detection method and device, computer equipment and storage medium
CN111666112B (en) Method, device and system for realizing platform plug-in and computer equipment
CN109325010A (en) Log inspection method, device, computer equipment and storage medium
CN110837956A (en) Underground cable inspection task distribution method and device
CN111008132A (en) Application debugging method and device for Android system, computer equipment and storage medium
CN112631633A (en) Function module upgrading method and device based on double-core intelligent electric meter
CN104917813A (en) Resource request method and device
CN115344533A (en) Microservice log retrieval method, microservice log retrieval system, microservice log retrieval control device, and storage medium
CN108512948A (en) Address book updating method, device, computer equipment and storage medium
CN111683083B (en) Block chain user identity authentication method, device, equipment and medium
CN108389124B (en) Data processing method, data processing device, computer equipment and storage medium
CN113126971A (en) Data embedding point processing method, device and system, electronic device and storage medium
CN107145342B (en) Method and device for processing channel information of application
CN112256532A (en) Test interface generation method and device, computer equipment and readable storage medium
CN112637085B (en) Flow recording method and device, computer equipment and storage medium

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination