CN115687744A - Data identification method and device - Google Patents
Data identification method and device Download PDFInfo
- Publication number
- CN115687744A CN115687744A CN202110859798.5A CN202110859798A CN115687744A CN 115687744 A CN115687744 A CN 115687744A CN 202110859798 A CN202110859798 A CN 202110859798A CN 115687744 A CN115687744 A CN 115687744A
- Authority
- CN
- China
- Prior art keywords
- data
- extensible
- data item
- item
- server
- 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
Links
Images
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The embodiment of the application relates to the technical field of internet and provides a data identification method and device. The method comprises the following steps: a data structure is preconfigured, which comprises at least one non-extensible data item and at least one extensible data item. And then, after the terminal collects the data generated in the running process of the application program, the collected data is sent to the server according to the data structure. And then, the server identifies the data content corresponding to each data item in the received data to be identified according to the data structure. By adopting the implementation mode, each embedded point of the terminal application program reports data according to the data structure, so that the flexibility is better, and the applicability and the expandability are also better. Furthermore, the server can identify the data reported by any buried point based on the data structure, so that the efficiency of identifying the data of the buried point by the server can be improved, and the identification cost can be reduced.
Description
Technical Field
The embodiment of the application relates to the technical field of internet, in particular to a data identification method and device.
Background
The analysis of the user behavior data plays an important role in the aspects of obtaining user requirements and optimizing application programs. In general, behavior data of a user is captured by deploying buried points in an application program, and then, a server acquires data captured by each buried point in the application program and identifies and analyzes the data.
The embedded points are usually deployed in a customized manner based on a demand scene, and due to the fact that the number of scenes supported by an application program is large, types of data reported by each embedded point in the application program are complex and various, and therefore time for a server to identify the embedded point data is long, and cost is high.
Disclosure of Invention
The embodiment of the application provides a data identification method and device, and aims to solve the problems of long data identification time and high cost caused by complex and various types of existing buried data.
In a first aspect, an embodiment of the present application provides a data identification method, where the method includes:
receiving data to be identified from a terminal, wherein the data to be identified comprises at least one non-expandable data item and at least one expandable data item;
and identifying the data content corresponding to each data item in the data to be identified according to the pre-configured data structure.
In a second aspect, an embodiment of the present application provides a data identification method, where the method includes:
collecting data generated in the running process of an application program;
and sending the collected data to a server according to the preconfigured data structure so that the server identifies data contents corresponding to at least one non-extensible data item and at least one extensible data item in the collected data according to the preconfigured data structure.
In a third aspect, an embodiment of the present application further provides a data identification apparatus, where the apparatus includes:
the terminal comprises a receiving module, a judging module and a judging module, wherein the receiving module is used for receiving data to be identified from the terminal, and the data to be identified comprises at least one non-expandable data item and at least one expandable data item;
and the identification module is used for identifying the data content corresponding to each data item in the data to be identified according to the pre-configured data structure.
In a possible implementation manner, the identification module is further configured to identify, according to a preconfigured data structure, a name of at least one non-extensible data item, a name of at least one extensible data item, and a field type of data content corresponding to each data item name included in the data to be identified.
In a possible implementation manner, the identification module is further configured to identify, according to a name of the at least one non-extensible data item, a name of the at least one extensible data item, and a field type of the data content corresponding to each data item name, the data content corresponding to each data item name in the data to be identified.
In one possible implementation, the extensible data item includes at least one extensible tag and a value corresponding to each extensible tag, and the at least one extensible tag indicates variable data of different attributes respectively.
In one possible implementation, the non-extensible data item includes at least one of:
application ID, event ID, data type, start date, acquisition type, buried point event creation time, buried point event modification time, and buried point event status.
In a fourth aspect, an embodiment of the present application further provides a data identification apparatus, where the apparatus includes:
the acquisition module is used for acquiring data generated in the running process of the application program;
the sending module is used for sending the collected data to the server according to the preconfigured data structure so that the server can identify data contents corresponding to at least one non-extensible data item and at least one extensible data item in the collected data according to the preconfigured data structure.
In a fifth aspect, an embodiment of the present application provides a server, where the server includes a processor and a memory, where the memory stores an instruction or a program, and the instruction or the program is executed by the processor to perform the data identification method according to the first aspect.
In a sixth aspect, an embodiment of the present application provides a terminal, where the terminal includes a processor and a memory, where the memory stores instructions or a program, and the instructions or the program are executed by the processor to perform the data identification method according to the second aspect.
In a seventh aspect, an embodiment of the present application provides a computer-readable storage medium, where instructions or a program are stored in the computer-readable storage medium, and the instructions or the program are executed by the processor to perform the data identification method according to the first aspect or the second aspect.
In an eighth aspect, the present application provides a computer program product, where the computer program product includes computer program code, and when the computer program code runs on a computer, the computer is caused to implement the data identification method according to the first aspect or the second aspect.
In summary, according to the technical scheme of the embodiment of the application, each embedded point of the terminal application program reports data according to the data structure by pre-configuring the data structure with the extensible data item, so that the flexibility is good, and the applicability and the extensibility are good. Furthermore, the data reported by each embedded point of the application program adopts a uniform data structure, so that the server can identify the data reported by any embedded point based on the data structure, the efficiency of identifying the data of the embedded points by the server can be improved, and the identification cost can be reduced.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings required to be used in the embodiments of the present application will be briefly described below. It should be understood that other figures may be derived from these figures by those of ordinary skill in the art without inventive exercise.
Fig. 1 is a schematic diagram of a system architecture of a data reporting system according to an embodiment of the present application;
fig. 2 is a schematic flowchart of a data identification method according to an embodiment of the present disclosure;
fig. 3 is another schematic flow chart of a data identification method according to an embodiment of the present application;
FIG. 4 is an exemplary structural diagram of a preconfigured data structure provided by an embodiment of the present application;
fig. 5A is a schematic diagram illustrating an exemplary composition of a data recognition device according to an embodiment of the present application;
fig. 5B is a schematic diagram of an exemplary component of a data identification device according to an embodiment of the present application;
fig. 6 is a schematic structural diagram of an electronic device according to an embodiment of the present application.
Detailed Description
The following describes technical solutions of the embodiments of the present application with reference to the drawings in the embodiments of the present application.
The terminology used in the following examples of the present application is for the purpose of describing particular embodiments and is not intended to be limiting of the technical solutions of the present application. As used in the specification of this application and the appended claims, the singular forms "a", "an", "the" and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise.
The following describes related art related to embodiments of the present application.
The collection of the user behavior data can be obtained by adopting a buried point reporting mode. The 'buried point' refers to a program code which is deployed in advance and used for capturing behavior data of a user in an application program, and the 'reporting' refers to a process that the buried point transmits the captured behavior data from the application program to a server.
Referring to fig. 1, fig. 1 shows a system architecture of an exemplary data reporting system according to the present application, where the data reporting system includes: a server 10 and a terminal 20. Illustratively, the terminal 20 reports data to the server 10 via the network 30. The network 30 may be a wired network or a wireless network, which is not limited in the embodiment of the present application.
It should be understood that fig. 1 is only a schematic illustration, and does not limit the data reporting system according to the embodiment of the present application. In practical implementation, the data reporting system according to the embodiment of the present application may further include more or fewer devices. The embodiments of the present application do not limit this.
The server 10 may be a service device or cloud platform that provides computing resources for applications. The server 10 may be configured to receive, identify and maintain operation data of the application program reported by the terminal 20, and process logic related to configuration and parameters of the application program, such as providing services for the application program, such as parameters for calculating reported data, storing data reported by the application program, network services, security services, big data and artificial intelligence platforms, and the like. For example, the server 10 may identify the data content of the reported data, maintain the execution logic of statistical reporting rates, etc. The server 10 may be an independent physical server, or may be a server cluster or a distributed system formed by a plurality of physical servers.
The terminal 20 may be implemented as an electronic device such as a mobile phone, a tablet Computer, a game console, a wearable device, and a PC (Personal Computer). Optionally, the terminal 20 supports the running of applications. Alternatively, the application program may rely on the operating system of the terminal 20 to implement a particular application purpose by running a series of pre-configured computer data and instructions. The Application programs include, for example, a mobile phone APP (Application), which includes a game APP, an instant messaging APP, a browser APP, and the like. Optionally, when the application runs in the terminal 20, the terminal 20 may report data generated during the running process of the application to the server 10 via the network 30.
Alternatively, data generated during the running process of the application program may also be referred to as a log (log) or an event. The data may include running data of the application (e.g., data of calling a certain function by the application, data of loading a game scene of a user by the application, etc.), operation data of the user (e.g., operation data of clicking to play a certain video by the user, data of displaying a function interface of the application in response to the operation of the user, etc.), and the like. Alternatively, each data may include an application identification (AppID) for identifying the service identity, and a device identification (unique id) for identifying the terminal identity. Obviously, data generated in the running process of the application program can reflect the behavior of the user and can be regarded as user behavior data. Based on this, the application program can report the data to the server 10 through the pre-configured embedded point, so that the server 10 can optimize the application program to meet more demands of users by analyzing the data.
It is understood that fig. 1 illustrates a data reporting system at a logic function level, in an actual implementation, the terminal 20 may include at least one terminal equipment entity, the server 12 may also include at least one server equipment entity, and the network 13 may include at least one communication link. And are not limited herein.
The technical solutions of the embodiments of the present application and the technical effects produced by the technical solutions of the present application will be described below through descriptions of several exemplary embodiments.
Referring to fig. 2, fig. 2 illustrates a data recognition method. The present embodiment takes the data identification method as an example applied to a server, which may be the server 10 shown in fig. 1. The data identification method comprises the following steps:
step S101, receiving data to be identified from a terminal, wherein the data to be identified comprises at least one non-extensible data item and at least one extensible data item.
The data to be identified can be captured and reported by any embedded point of the application program operated by the terminal.
The data structure of the data to be identified may be a pre-configured data structure. The preconfigured data structure, as shown, for example, in fig. 4, includes a fixed data portion and an extensible data portion. Wherein the fixed data portion can be used to deploy at least one non-extensible data item, such as operation data for initialization, login, logout, cancellation, event status (start, success, failure, cancellation), and the like. The extensible data portion may be for deploying at least one extensible data item. The at least one extensible data item includes at least one extensible tag and a value corresponding to each extensible tag, the at least one extensible tag respectively indicating variable data of different attributes.
In an actual implementation scenario, the non-extensible data item related to the embodiment of the present application includes at least one of the following items: application ID, event ID, data type, start date, acquisition type, buried point event creation time, buried point event modification time, and buried point event status. The extensible data items related to the embodiments of the present application may include different numbers of extensible tags and corresponding tag values in different implementation scenarios. For example, in a game scenario, 4 extensible tags including a level of a character, a user level, an energy value, and a current owned monetary value are included, where data contents corresponding to the level of the character, the user level, the energy value, and the current owned monetary value are tag values corresponding to each of the 4 extensible tags, respectively. For another example, in another implementation scenario, the data content includes 5 extensible tags corresponding to the user ID, the gender, the age, the drama age, and the number of representatives, where each tag value corresponds to each extensible tag of the 5 extensible tags.
Step S102, identifying the data content corresponding to each data item in the data to be identified according to the pre-configured data structure.
The server can identify the data content corresponding to each data item name in the data to be identified according to the name of at least one non-extensible data item, the name of at least one extensible data item and the field type of the data content corresponding to each data item name in the data structure.
As can be seen from the foregoing description of the preconfigured data structure, the data item in the preconfigured data structure may include a data item name and a specific data content of the data item, the data item name being data describing the specific data content. Based on this, in the embodiment of the present application, the name of the data item in the preconfigured data structure is referred to as the metadata of the data structure.
Based on this, optionally, after receiving the data to be identified, the server may identify, according to a preconfigured data structure, metadata included in the data to be identified, that is, a name of at least one non-extensible data item included in the data to be identified, a name of at least one extensible data item, and a field type of data content corresponding to each data item name, and then, based on the identified metadata, the server identifies data content corresponding to each data item in the data to be identified.
It can be seen that, with this implementation, the data to be identified reported by the terminal is a preconfigured data structure, that is, the data to be identified includes at least one non-extensible data item and at least one extensible data item. That is to say, in the embodiment of the present application, each embedded point of the application program reports data by using a preconfigured data structure, so that the formats of the data reported by each embedded point in the application program are the same. Furthermore, the server identifies the data content corresponding to each data item in the data to be identified according to the pre-configured data structure, so that the efficiency of identifying the buried point data by the server can be improved, and the identification cost can be reduced.
Fig. 2 illustrates an embodiment of a data identification method according to an embodiment of the present application, which is described in terms of operations performed by a server. The data identification method of the embodiment of the present application is described below from the perspective of operations performed by the terminal.
Referring to fig. 3, fig. 3 illustrates another data recognition method. The present embodiment takes the data recognition method as an example applied to a terminal, which may be the terminal 20 shown in fig. 1. It should be noted that the embodiment shown in fig. 3 corresponds to the embodiment shown in fig. 2, so that technical features of the embodiment shown in fig. 3, which are the same as or similar to those of the embodiment shown in fig. 2, can be described with reference to the embodiment shown in fig. 2, and the description of this embodiment is not repeated.
The data identification method comprises the following steps:
step S201, collecting data generated during the running process of the application program.
A plurality of buried points may be pre-deployed in an application, and the plurality of buried points collect operation-related data during the operation of the application.
Step S202, the collected data is sent to a server according to a pre-configured data structure.
Each embedded point of the application program reports the collected data to the server according to a preconfigured data structure, so that the server identifies data contents corresponding to at least one non-extensible data item and at least one extensible data item in the collected data according to the embodiment shown in fig. 2. For details, see the description of the above embodiments, the implementation of the server and the implementation of the preconfigured data structure are not described herein again.
Optionally, the data structure according to the embodiment of the present application may be configured in advance, and then, for example, the data structure may be presented in a form of an SDK (Software Development Kit), so that the data is reported by the embedded point of the application based on the data structure defined by the SDK.
In summary, according to the technical scheme of the embodiment of the application, a data structure with an extensible data item is configured in advance, so that each embedded point of a terminal application program reports data according to the data structure, and the data structure is good in flexibility, applicability and extensibility. Furthermore, the data reported by each embedded point of the application program adopts a uniform data structure, so that the server can identify the data reported by any embedded point based on the data structure, the efficiency of identifying the data of the embedded points by the server can be improved, and the identification cost can be reduced.
The technical solution of the embodiment of the present application is described below by taking a game application as an example.
The data structure can be configured in advance, so that each embedded point of the game application program reports data according to the data structure. The data structure, as shown for example in fig. 4, includes a fixed data portion and an extensible data portion.
The data structure includes data items and field types of data contents corresponding to the data items, as shown in table 1.
TABLE 1
Where the appID is used to identify the gaming application of this example. The eventID is used to identify the buried point event for each buried point in the gaming application. tagKey is used to identify the extensible tag of a buried point event. begDate is used to indicate the start date of a buried point misbehaving event. getType is used to indicate the type of data captured by the buried point. createTime is used to indicate the buried event creation time. updateTime is used to indicate the buried event modification update time. status is used to indicate the buried point event status, for example, 0 indicates that the buried point event status is normal, and 1 indicates that the buried point event status is deleted.
The extensible data item tagKey identifies the content of eventValue in the buried point data, and the content of eventValue in different scenes is different. For example, in one piece of data: "eventID": user registration "," eventValue ": {" gender ":" M "," name ":" Q "}, wherein tagKey in the data includes tagKey 1" gender "and tagKey 2" name ", tagvalue corresponding to tagKey 1 is" M ", and tagvalue corresponding to tagKey 2 is" Q ". Data items AppID and eventID come from a game application, colType is defined when configuring a data structure, begDate, getType, createTime, updateTime, and status are all system parameters, i.e., data items other than the data item tagKey, and other data items in table 1 are all non-expandable data items (i.e., fixed data items) in the data structure.
It is to be understood that table 1 is only an illustrative description, and does not limit the data items and the field types of the respective data items according to the embodiment of the present application. In practical implementations, the data structure may contain more or less data items depending on different applications, and the number of extensible data items and non-extensible data items may be different from the embodiment shown in table 1.
Alternatively, the aforementioned data structure may be defined by an SDK. Each embedded point of the game application program captures the running data of the game application program, and reports the captured data to the server by adopting the data structure.
According to the description of the meaning of each data item in table 1, in the data reported by different buried points, the number of items of the extensible data item tagKey may be different, the attribute of the data corresponding to each tagKey may also be different, and the attribute of the data corresponding to the non-extensible data item is the same. In the following example, only data of an extensible data item is shown, and data of a non-extensible data item is not shown.
The data a transmitted by the buried point a includes, for example, the following scalable data:
the eventID in the data A is an unexpanded data item, the eventvalue is an expandable data item, and the items "level of player", "player battle force", and "number of revival" including 4 tagkeys under the eventvalue corresponding to the eventID, and the tag value (tagvalue) corresponding to each tagkey item.
Alternatively, if the data a is the first data sent by the buried point a received by the server, the server may identify the metadata of the data structure shown in table 1 according to the data structure of the data a. Also, the server can identify the specific data content in the data a based on the metadata illustrated in table 1. The specific data content of the data a is shown in table 2, for example.
TABLE 2
| appID | eventID | tagKey | tagvalue |
| XXXX | barrier | Number of checkpoints | 100 |
| XXXX | barrier | Player level | 100 |
| XXXX | barrier | Player's battle force | 100 |
| XXXX | barrier | Number of revival | 100 |
The "XXXX" corresponding to appID in table 2 indicates the name of the game application, where "X" does not represent english letters, but rather any character, such as the character "king". Each row in table 2 represents a correspondence, for example, tagvalue "100" in the same row as tagKey "level number" indicates that the level number is 100. Other similar processes are not described in detail herein.
It is understood that table 2 is only schematically depicted, and in practical implementation, table 2 also includes other data relative data indicated in table 1, which are not shown here.
It should be noted that the server may first identify the metadata shown in table 1 based on the data a, and then identify the specific data content shown in table 2 based on the metadata shown in table 1. The server can also identify both the metadata shown in table 1 and the specific data content shown in table 2 based on data a.
Further, the server receives data B sent by the buried point a, for example, where the data B includes the following extensible data:
the server may then identify the specific data content in data B based on the previously identified metadata of the data structure (i.e., table 1), such as the data content illustrated in table 3.
TABLE 3
| appID | eventID | tagKey | tagvalue |
| XXXX | barrier | Number of checkpoints | 100 |
| XXXX | barrier | Player level | 100 |
| XXXX | barrier | Player's battle force | 100 |
| XXXX | barrier | Number of revival | 100 |
| XXXX | barrier | Number of checkpoints | 89 |
| XXXX | barrier | Player level | 222 |
| XXXX | barrier | Player's battle force | 333 |
| XXXX | barrier | Number of revival | 4 |
Table 3 is a data table to which the specific data content of data B is added in addition to table 2. After the server receives more data reported by the buried point a, the identified data content may be added in sequence in table 3, which is not described herein.
It should be understood that the above is only a schematic description taking a game application as an example, in practical implementation, the data identification method of the present application is not limited to this application scenario, and in other embodiments, the data identification method of the present application is also applied to, for example, an online shopping application, and the like, and correspondingly, in other application scenarios, the tagKey may contain more or fewer items, for example, in a scenario corresponding to the online shopping application, the tagKey includes "number of browsing times", "number of times of adding a shopping cart", and "number of payments.
In summary, according to the technical scheme of the embodiment of the application, each embedded point of the terminal application program reports data according to the data structure by pre-configuring the data structure with the extensible data item, so that the flexibility is good, and the applicability and the extensibility are good. Furthermore, the data reported by each embedded point of the application program adopts a uniform data structure, so that the server can identify the data reported by any embedded point based on the data structure, the efficiency of identifying the data of the embedded points by the server can be improved, and the identification cost can be reduced.
The foregoing embodiments describe various embodiments of the data identification method provided in the embodiments of the present application from the perspective of data collection and actions performed by various devices, such as identification of data to be identified based on a data structure. It should be understood that, in the embodiments of the present application, the functions described above may be implemented in hardware or a combination of hardware and computer software corresponding to the steps of collecting data and identifying data to be identified based on a data structure. Whether a function is performed as hardware or computer software drives hardware depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
For example, if the above implementation steps implement the corresponding functions through software modules, as shown in fig. 5A, the embodiment of the present application provides a data identification apparatus, which includes a receiving module 501 and an identifying module 502. The data recognition device may be used to perform some or all of the operations described above for the server of fig. 2 and 3.
For example: the receiving module 501 may be configured to receive data to be identified from a terminal, where the data to be identified includes at least one non-extensible data item and at least one extensible data item. The identification module 502 may be configured to identify data content corresponding to each data item in the data to be identified according to a preconfigured data structure.
It can be seen that, since the data to be identified is a pre-configured data structure, that is, the data to be identified includes at least one non-extensible data item and at least one extensible data item. That is to say, in the embodiment of the present application, each embedded point of the application program reports data by using a preconfigured data structure, so that the formats of the data reported by each embedded point in the application program are the same. Furthermore, the data identification device identifies the data content corresponding to each data item in the data to be identified according to the pre-configured data structure, so that the efficiency of identifying the buried point data can be improved, and the identification cost can be reduced.
Optionally, the identifying module 502 is further configured to identify, according to a preconfigured data structure, a name of at least one non-extensible data item, a name of at least one extensible data item, and a field type of data content corresponding to each data item name, which are included in the data to be identified.
Optionally, the identifying module 502 is further configured to identify, according to a name of at least one non-extensible data item, a name of at least one extensible data item, and a field type of the data content corresponding to each data item name, the data content corresponding to each data item name in the data to be identified.
Optionally, the extensible data item includes at least one extensible tag and a value corresponding to each extensible tag, and the at least one extensible tag indicates variable data of different attributes respectively.
Optionally, the non-extensible data item includes at least one of:
application ID, event ID, data type, start date, acquisition type, buried point event creation time, buried point event modification time, and buried point event status.
As shown in fig. 5B, an embodiment of the present application further provides a data identification device, which may be used to perform some or all of the operations of the terminal in fig. 2 and fig. 3, including an acquisition module 511 and a sending module 512.
For example: the collection module 511 may be used to collect data generated during the operation of the application. The sending module 512 may be configured to send the collected data to the server according to the preconfigured data structure, so that the server identifies, according to the preconfigured data structure, data contents corresponding to at least one non-extensible data item and at least one extensible data item in the collected data, respectively.
It is understood that the above division of the modules is only a division of logical functions, and in actual implementation, the functions of the above modules may be integrated into a hardware entity, for example, the functions of the receiving module 501 in fig. 5A may be integrated into a transceiver, and the functions of the identifying module 502 may be integrated into a processor. The function of the acquisition module 511 in fig. 5B may be implemented by being integrated into a processor, and the function of the transmission module 512 may be implemented by being integrated into a transceiver.
As shown in fig. 6, fig. 6 illustrates an electronic apparatus 4000, and the electronic apparatus 4000 may be used as the aforementioned server or terminal. The electronic apparatus 4000 shown in fig. 6 includes: a processor 4001 and a memory 4003. Processor 4001 is coupled to memory 4003, such as via bus 4002. Optionally, the electronic device 4000 may further comprise a transceiver 4004. In addition, the transceiver 4004 is not limited to one in practical applications, and the structure of the electronic device 4000 is not limited to the embodiment of the present application.
The Processor 4001 may be a CPU (Central Processing Unit), a general-purpose Processor, a DSP (Digital Signal Processor), an ASIC (Application Specific Integrated Circuit), an FPGA (Field Programmable Gate Array), or other Programmable logic device, transistor logic device, hardware component, or any combination thereof. Which may implement or execute the various illustrative logical blocks, modules, and circuits described in connection with the disclosure herein. The processor 4001 may also be a combination that performs a computing function, e.g., comprising one or more microprocessors, a combination of DSPs and microprocessors, etc.
The Memory 4003 may be a ROM (Read Only Memory) or other types of static storage devices that can store static information and instructions, a RAM (Random Access Memory) or other types of dynamic storage devices that can store information and instructions, an EEPROM (Electrically Erasable Programmable Read Only Memory), a CD-ROM (Compact Disc Read Only Memory) or other optical Disc storage, optical Disc storage (including Compact Disc, laser Disc, optical Disc, digital versatile Disc, blu-ray Disc, etc.), a magnetic Disc storage medium or other magnetic storage devices, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer, but is not limited to these.
The memory 4003 is used for storing application codes for implementing the present scheme, and execution is controlled by the processor 4001. Processor 4001 is configured to execute application code stored in memory 4003 to implement what is shown in the foregoing method embodiments. The embodiment of the present application further provides a computer-readable storage medium, in which instructions related to the present technical solution are stored, and when the instructions are executed on a computer, the computer is enabled to perform some or all of the steps in the method described in the foregoing embodiments shown in fig. 2 and fig. 3.
Also provided in embodiments of the present application is a computer program product which, when run on a computer, causes the computer to perform some or all of the steps of the method described in the embodiments of fig. 2 and 3 above.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the embodiments provided in the present application, the disclosed system, apparatus and method can be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one type of logical functional division, and other divisions may be realized in practice, for example, multiple units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit may be implemented in the form of hardware, or may also be implemented in the form of a software functional unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solutions of the present application, which are essential or part of the technical solutions contributing to the prior art, or all or part of the technical solutions, can be embodied in the form of a software product, which is stored in a storage medium and includes several instructions for causing a computer device (which may be a personal computer, a control device of a game, or a network device, etc.) to execute all or part of the steps of the methods described in the embodiments of the present application. And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
The above description is only for the specific embodiments of the present application and is not intended to limit the scope of the present application, and any modification, equivalent replacement, or improvement made on the basis of the technical solutions of the present application should be included in the scope of the present invention.
Claims (11)
1. A method of data identification, the method comprising:
receiving data to be identified from a terminal, wherein the data to be identified comprises at least one non-expandable data item and at least one expandable data item;
and identifying the data content corresponding to each data item in the data to be identified according to a pre-configured data structure.
2. The method of claim 1, further comprising:
and identifying the name of the at least one non-extensible data item, the name of the at least one extensible data item and the field type of the data content corresponding to each data item name contained in the data to be identified according to the pre-configured data structure.
3. The method of claim 2, wherein the identifying data content corresponding to each data item in the data to be identified according to the preconfigured data structure comprises:
and identifying the data content corresponding to each data item name in the data to be identified according to the name of the at least one non-extensible data item, the name of the at least one extensible data item and the field type of the data content corresponding to each data item name.
4. The method according to any one of claims 1 to 3,
the extensible data item includes at least one extensible tag and a value corresponding to each extensible tag, the at least one extensible tag respectively indicating variable data of different attributes.
5. A method according to any one of claims 1 to 3, wherein the non-expandable data items comprise at least one of:
application ID, event ID, data type, start date, acquisition type, buried point event creation time, buried point event modification time, and buried point event status.
6. A method of data identification, the method comprising:
collecting data generated in the running process of an application program;
sending the collected data to a server according to a pre-configured data structure so that the server identifies data contents corresponding to at least one non-extensible data item and at least one extensible data item in the collected data respectively according to the pre-configured data structure.
7. A data recognition apparatus, the apparatus comprising:
the terminal comprises a receiving module, a judging module and a judging module, wherein the receiving module is used for receiving data to be identified from the terminal, and the data to be identified comprises at least one non-expandable data item and at least one expandable data item;
and the identification module is used for identifying the data content corresponding to each data item in the data to be identified according to a pre-configured data structure.
8. A data recognition apparatus, the apparatus comprising:
the acquisition module is used for acquiring data generated in the running process of the application program;
a sending module, configured to send the collected data to a server according to a preconfigured data structure, so that the server identifies, according to the preconfigured data structure, data contents corresponding to at least one non-extensible data item and at least one extensible data item in the collected data, respectively.
9. A server, characterized in that the server comprises a processor and a memory, in which are stored instructions or programs that, when executed by the processor, implement a data identification method according to any one of claims 1 to 5.
10. A terminal characterized in that it comprises a processor and a memory, in which are stored instructions or programs that, when executed by the processor, implement the data recognition method of claim 6.
11. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the data identification method of any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110859798.5A CN115687744A (en) | 2021-07-28 | 2021-07-28 | Data identification method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110859798.5A CN115687744A (en) | 2021-07-28 | 2021-07-28 | Data identification method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115687744A true CN115687744A (en) | 2023-02-03 |
Family
ID=85058221
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110859798.5A Pending CN115687744A (en) | 2021-07-28 | 2021-07-28 | Data identification method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115687744A (en) |
-
2021
- 2021-07-28 CN CN202110859798.5A patent/CN115687744A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111367562B (en) | Data acquisition method, device, storage medium and processor | |
| CN110609937A (en) | Crawler identification method and device | |
| CN108829769B (en) | Suspicious group discovery method and device | |
| CN110688319B (en) | Application keep-alive capability test method and related device | |
| CN109062807B (en) | Method and device for testing application program, storage medium and electronic device | |
| CN111612085B (en) | Method and device for detecting abnormal points in peer-to-peer group | |
| CN110188276B (en) | Data transmission device, method, electronic device, and computer-readable storage medium | |
| CN111078560B (en) | Test method and device based on flow pruning, electronic equipment and storage medium | |
| CN112379946A (en) | Template configuration method and device based on YAML and computer equipment | |
| CN111951114A (en) | Task execution method and device, electronic equipment and readable storage medium | |
| CN115687744A (en) | Data identification method and device | |
| CN110852338A (en) | User portrait construction method and device | |
| CN115496481A (en) | Automatic picking bill generation method, computer equipment and computer storage medium | |
| CN103502977B (en) | The stand-by period of the application program serviced is reduced by intended pretreatment | |
| CN112190950B (en) | Method and device for detecting abnormal player account | |
| CN111126503B (en) | Training sample generation method and device | |
| CN112860456B (en) | Log processing method and device | |
| CN110891097B (en) | Cross-device user identification method and device | |
| CN114462502A (en) | Training method and device for core-body recommendation model | |
| CN107171949B (en) | Information pushing method, device and system | |
| CN112634088A (en) | House resource dynamic information pushing method and device | |
| CN111191222A (en) | Password verification method | |
| CN113209637A (en) | Game team forming method and device, electronic equipment and storage medium | |
| CN109829103A (en) | A kind of method for down loading and device of application program | |
| CN105988917A (en) | Method and device for obtaining abnormal information |
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 |