CN111290948A

CN111290948A - Test data acquisition method and device, computer equipment and readable storage medium

Info

Publication number: CN111290948A
Application number: CN202010057496.1A
Authority: CN
Inventors: 陆梓瀚; 李立波
Original assignee: Tencent Technology Shenzhen Co Ltd
Current assignee: Tencent Technology Shenzhen Co Ltd
Priority date: 2020-01-19
Filing date: 2020-01-19
Publication date: 2020-06-16
Anticipated expiration: 2040-01-19
Also published as: CN111290948B

Abstract

The application provides a test data acquisition method and device, computer equipment and a readable storage medium, and belongs to the technical field of computers. The method comprises the following steps: the method comprises the steps of obtaining at least one table entry field in a data table of an application test task, using the at least one table entry field as a node, automatically generating a target directed acyclic graph according to generation relation information among the table entry fields and association information among the table entry fields, further automatically generating data meeting the generation relation information and the association information according to a topological relation represented by the target directed acyclic graph, using the data as test data of the application test task, wherein the generated test data is not actually checked and corrected, so that the problems found in the test process can be ensured to be comprehensive, and the application test effect is improved.

Description

Test data acquisition method and device, computer equipment and readable storage medium

Technical Field

The present application relates to the field of computer technologies, and in particular, to a method and an apparatus for acquiring test data, a computer device, and a readable storage medium.

Background

Before the application is deployed on line, the application is often required to be tested in advance, and as the requirement of the market on the application quality is continuously improved, the application test becomes more and more important. In the application using process, read-write operation is often required to be performed on data in the database, and therefore, in the application testing process, the database operation codes in the application related codes need to be tested by using the test data.

Currently, the database operation code in the application-related code is mainly tested by using the data of the real database as test data.

When data of a real database is directly used as test data, because the data in the real database is actually obtained in the application use process, the existing problems are few, and the problems which can be found in the application test are very limited, so that the application test effect is poor.

Disclosure of Invention

The embodiment of the application provides a test data acquisition method, a test data acquisition device, computer equipment and a readable storage medium, and can improve the accuracy of application test. The technical scheme is as follows:

in one aspect, a method for acquiring test data is provided, and the method includes:

acquiring at least one table entry field in a data table of an application test task;

generating a target directed acyclic graph by taking the at least one table entry field as a node according to the generation relation information among the table entry fields and the association information among the table entry fields, wherein edges in the target directed acyclic graph are used for expressing the topological relation among the table entry fields;

and generating data meeting the generation relation information and the association information according to the topological relation represented by the target directed acyclic graph, wherein the data is used as the test data of the application test task.

In one aspect, a test data acquisition apparatus is provided, the apparatus including:

the field acquisition module is used for acquiring at least one table entry field in a data table of the application test task;

the directed acyclic graph generation module is used for generating a target directed acyclic graph by taking the at least one table entry field as a node according to the generation relation information among the table entry fields and the association information among the table entry fields, wherein edges in the target directed acyclic graph are used for representing the topological relation among the table entry fields;

and the data generation module is used for generating data meeting the generation relation information and the association information according to the topological relation represented by the target directed acyclic graph, and the data is used as the test data of the application test task.

In one possible implementation, the apparatus further includes:

a node determining module, configured to determine, according to the association information between the entry fields, two nodes corresponding to the first possible generation relationship information corresponding to any association relationship in the association information in the intermediate directed graph;

the adding module is used for adding a second directed edge to the middle directed graph to obtain a target directed acyclic graph if the middle directed graph after the second directed edge is added between the two nodes meets a target condition;

the adjusting module is further configured to, if the intermediate directed graph to which the second directed edge is added does not satisfy the target condition, adjust the intermediate directed graph according to second possible generation relationship information corresponding to any one of the association relationships in the association information to obtain the target directed acyclic graph.

In a possible implementation manner, the node determining module is further configured to determine, according to the generation relationship information between the entry fields, at least two nodes corresponding to any generation relationship information in the intermediate directed graph;

the adding module is further configured to add a third directed edge to the intermediate directed graph if the intermediate directed graph after the third directed edge is added between the at least two nodes meets a target condition, so as to obtain an updated intermediate directed graph;

the device also includes:

and the directed graph determining module is used for determining the middle directed graph without the third directed edge as the updated middle directed graph if the middle directed graph after the third directed edge is added does not meet the target condition.

In one possible implementation, the target condition includes:

the intermediate directed graph does not have the same directed edge of the terminal node;

none of the directed edges in the middle directed graph can form a ring.

In one possible implementation, the apparatus further includes:

and the field determining module is used for determining at least one item field in the data table of the application test task according to the task name of the application test task, the name of the target database and the data table structure of the target database, which are acquired in the newly added task interface.

In one possible implementation, the apparatus further includes:

the repetition rate determining module is used for determining the repetition rate of the table entry fields in the data table of the application testing task if the application testing task comprises at least two data tables;

and the merging module is used for merging the at least two data tables according to the field with the repetition rate larger than the preset threshold value to obtain a merged data table.

In one possible implementation, the apparatus further includes:

the operation module is used for carrying out target operation on the operators in the generation relation information among the table entry fields and the association information among the table entry fields according to the operation instruction received by the operator management interface of the application test task;

the operation module is further configured to perform a target operation on the table structure of the data table in the target database according to an operation instruction received at the table structure management interface of the application test task.

In one possible implementation, the apparatus further includes:

the data acquisition module is used for acquiring data input in a configuration interface of the application test task;

and the information determining module is used for determining the object related information of the application test task according to the data.

In one aspect, a computer device is provided that includes one or more processors and one or more memories having at least one program code stored therein, the program code being loaded and executed by the one or more processors to perform the operations performed by the test data acquisition method.

In one aspect, a computer-readable storage medium having at least one program code stored therein is provided, the program code being loaded and executed by a processor to implement the operations performed by the test data acquisition method.

According to the technical scheme provided by the embodiment of the application test task, at least one table entry field in the data table of the application test task is obtained, the at least one table entry field is used as a node, the target directed acyclic graph can be automatically generated according to the generation relation information between the table entry fields and the association information between the table entry fields, further, data meeting the generation relation information and the association information can be automatically generated according to the topological relation represented by the target directed acyclic graph and used as the test data of the application test task, the generated test data is not subjected to actual verification and correction, the found problems during testing can be guaranteed to be comprehensive, and the application test effect is improved.

Drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.

FIG. 1 is a schematic diagram of an implementation environment of a test data acquisition method according to an embodiment of the present disclosure;

FIG. 2 is a flowchart of a test data acquisition method according to an embodiment of the present disclosure;

fig. 3 is an interface schematic diagram of a basic information filling interface provided in an embodiment of the present application;

FIG. 4 is an interface diagram of a table structure setting interface provided by an embodiment of the present application;

FIG. 5 is an interface diagram of a table structure management interface according to an embodiment of the present disclosure;

FIG. 6 is a schematic diagram of a generating relationship information setting interface between entry fields according to an embodiment of the present application;

FIG. 7 is an interface diagram of an operator management interface according to an embodiment of the present disclosure;

FIG. 8 is a diagram illustrating an association information setting interface between entry fields according to an embodiment of the present application;

FIG. 9 is an interface schematic diagram of a configuration interface provided by an embodiment of the present application;

FIG. 10 is an interface diagram of a task presentation interface provided by an embodiment of the present application;

fig. 11 is a structural diagram of a test data acquisition apparatus according to an embodiment of the present application;

fig. 12 is a schematic structural diagram of a computer device according to an embodiment of the present application.

Detailed Description

To make the objects, technical solutions and advantages of the present application more clear, embodiments of the present application will be described in further detail below with reference to the accompanying drawings.

Graph Theory (Graph Theory): is a branch of combined mathematics, and has close relation with other mathematical branches such as group theory, matrix theory, topology and the like. The graph is the main research object of graph theory, and is a graph formed by a plurality of given vertexes and edges connecting the two vertexes, and the graph is generally used for describing a certain specific relationship between certain things. Vertices are used to represent things, and edges connecting two vertices are used to represent that two things have some relationship between them.

Operator: meaning operations, computations, etc.

Generating an operator: the term "custom" refers to an operator used to generate data.

A database: in short, it can be regarded as an electronic file cabinet, i.e. a place for storing electronic files, and a user can add, intercept, update, delete, etc. to the data in the files.

Fig. 1 is a schematic diagram of an implementation environment of a test data acquisition method provided in an embodiment of the present application, and referring to fig. 1, the implementation environment includes: a computer device 101.

The computer device 101 may be at least one of a desktop computer, a portable computer, a laptop computer, a tablet computer, etc. The computer device 101 may be installed and run with a relevant application program for acquiring test data, a user may set relevant information of the test data, such as a name of a target database, generation relationship information, association information, and the like, on a visual interface of the computer device 101, and the computer device 101 may acquire the information set by the user and acquire the test data according to the acquired information. The computer device 101 may also maintain at least one database for storing data tables or the like carrying test data.

The computer device 101 may be broadly referred to as one of a plurality of computer devices, and the embodiment is illustrated only with the computer device 101. Those skilled in the art will appreciate that the number of computer devices described above may be greater or fewer. For example, the number of the computer devices may be only a few, or the number of the computer devices may be several tens or hundreds, or more, and the number and the type of the computer devices are not limited in the embodiments of the present application.

Fig. 2 is a flowchart of a test data obtaining method provided in an embodiment of the present application, and referring to fig. 2, the method includes:

201. the computer device obtains at least one entry field in a data table of the application test task.

It should be noted that the application test task may be a task for testing a database operation code of an offline application program, and when the application test task is performed, a test is performed by using test data stored in a data table, where the data table includes at least one entry field, and each entry field may be used to indicate a type, an actual meaning, and the like of data in each column in the data table.

In a possible implementation manner, the computer device may perform the obtaining of the information through a visual interface, for example, the computer device may determine at least one entry field in the data table of the application test task according to the task name of the application test task obtained in the newly added task interface, the name of the target database, and the data table structure of the target database.

The method comprises the steps that an application test task corresponds to a newly added task interface, the newly added task interface can provide a plurality of sub-interfaces based on different setting objects to jointly form the newly added task interface, the plurality of sub-interfaces can be based on a continuous starting relation of confirmation operation, namely, after the content of one sub-interface is set, a user can trigger the display of the next sub-interface through manual operation on the sub-interface. For example, the newly added task interface may include multiple sub-interfaces, such as a basic information filling interface, a table structure setting interface, a generation relationship information setting interface between table entry fields, and an association information setting interface between table entry fields, and optionally, the newly added task interface may further include other sub-interfaces, which is not limited in this embodiment of the present application. A user may fill in a task name and a target database name of an application test task on a visual interface according to a need of the user, referring to fig. 3, where fig. 3 is an interface schematic diagram of a basic information filling interface provided in an embodiment of the present application, and the user may name the task name of the application test task according to a wish of the user, which is not limited in the embodiment of the present application, and the user may fill in the named name to the task name in the interface 301, determine a database that needs to perform data read-write operation in an application program running process as a target database, fill in the name of the database to the database name in the interface 301, and the target database may be used to store a data table corresponding to the test data. After the basic information is filled in, the user may trigger a "next" button of the basic information filling interface to trigger a jump instruction, the computer device responds to the jump instruction, and automatically jumps to a table structure setting interface as shown in fig. 4, where the user may set a table structure of a data table carrying the test data, see fig. 4, where fig. 4 is an interface schematic diagram of a table structure setting interface provided in an embodiment of the present application, the user may name the data table carrying the test data on an interface 401 as shown in fig. 4, fill the named data table name into a table name in the interface 401, the user may further set at least one table entry field in the data table in the field table in the interface 401, set a type, a comment, and the like for each table entry field, the user may further set a partition field, determine a number of rows corresponding to each data table partition, in order to perform operations such as reading and writing data in a corresponding data table partition in a specific Structured Query Language (SQL) operation, reduce the total amount of data reading and writing to reduce response time, a user may further trigger a new table button in the interface 401 to newly build a data table in the target database, and trigger an import table button in the interface 401 to import the table structure of the existing data table into the target database. After the table structure is set, the user may trigger a "next" button in the interface 401 to trigger a jump instruction, and the computer device automatically jumps to the generating relationship information setting interface between the table entry fields as shown in fig. 6 in response to the jump instruction, and the user may set the generating relationship information between the table entry fields in the interface as shown in fig. 6, where the specific setting process may refer to step 202.

It should be noted that fig. 5 is an interface schematic diagram of a table structure management interface provided in an embodiment of the present application, referring to fig. 5, a user may trigger buttons such as "add table structure", "edit", "delete", and the like in an interface 501 shown in fig. 5 to trigger an operation instruction for performing a corresponding target operation on a table structure of a data table, and a computer device, in response to the operation instruction, performs a corresponding target operation on the table structure of the data table in a target database according to the target operation corresponding to the operation instruction, where the target operation may be an addition, an edit, a deletion, and the like, which is not limited in the embodiment of the present application. After the user sets the table structure of the data table, the generation relationship information between the table entry fields and the association information between the table entry fields in the data table may also be set in other sub-interfaces of the newly added task interface, and the computer device may abstract the generation relationship information and the association information set by the user into a model, so as to construct the target directed acyclic graph according to the model, and the specific setting process of the generation relationship information and the association information may refer to the following step 202 and step 205, which is not described herein again.

202. And the computer equipment takes the at least one table entry field as a node, and determines at least two nodes corresponding to any generation relation information in the intermediate directed graph according to the generation relation information among the table entry fields.

It should be noted that the generation relationship information may be used to indicate that the corresponding data in each row of the two fields of the data table is calculated by some kind of operator to obtain new data in the other columns. The generation relationship information is also a generation rule between data corresponding to each field, and the generation relationship information may include a rule type, a rule parameter, and the like, and optionally, the generation relationship information may also include other contents, which is not limited in this embodiment of the present application. The rule type can include a plurality of operators to realize different calculation methods, and the embodiment of the application does not limit the types and the number of the operators. For example, the generation relationship information may be { a and b generate c by a certain calculation method, d and e generate f by a certain calculation method, c and f generate g by a certain calculation method, a generates h by a certain calculation method, and g generates i by a certain calculation method }, and the computer device may determine, based on the generation relationship information, that the nodes corresponding to the respective generation relationship information are a and c, b and c, d and f, e and f, c and g, f and g, a and h, g and i, respectively. Wherein a, b, c, d, e, f, g, h and i are all variables in the data table. It should be emphasized that the generation relationship information may be a many-to-one case or a one-to-one case, and each variable in the generation relationship information cannot have multiple pieces of generation relationship information, that is, each variable cannot be a generation result of multiple generation relationships, and a connection line between nodes cannot form a directed loop.

Continuing with the example shown in fig. 4, a user may set generation relationship information between entry fields in an interface 601 shown in fig. 6, see fig. 6, where fig. 6 is a schematic diagram of a generation relationship information setting interface between entry fields provided in the embodiment of the present application, and the user may set rule types and rule parameters of each field in a data table in the interface 601, where the embodiment of the present application does not limit the number of the data table and the number of the rule parameters. After the setting of the generated relationship information is completed, the user may trigger a "next" button in the interface 601 to trigger a jump instruction, the computer device automatically jumps to the interface for setting the relationship information between the entry fields as shown in fig. 8 in response to the jump instruction, and the user may set the relationship information between the entry fields in the interface as shown in fig. 8, where the specific setting process may refer to step 205.

The rule type may include a plurality of generation rules, which is not limited in this embodiment of the present application, for example, the rule type may be a regular type, a random type, a built-in type, an enumeration type, a self-defined type, or the like. If the rule type is a regular type, the user can fill the regular expression into the field corresponding to the rule type, and the computer device can generate data meeting the regular expression according to the regular expression filled by the user through the subsequent steps 203 to 208; if the rule type is a random type, the user can fill the required data type into the field corresponding to the rule type, and the computer device can generate random value data according to the data type set by the user through the subsequent steps 203 to 208; if the rule type is a built-in type, the computer device may acquire a built-in common data type, such as a name, an address, a mobile phone number, and the like, from the system, and generate data satisfying the data type through subsequent steps 203 to 208; if the rule type is an enumeration type, the computer equipment can randomly select an enumeration value as test data; if the rule type is a self-defined type, the user can fill the self-defined operator into the field corresponding to the rule type, and the computer device can calculate the randomly generated input data through the subsequent steps 203 to 208 to obtain the test data, wherein the input data can be data of other columns in the data table.

In a possible implementation manner, the computer device may obtain generation relationship information between entry fields set on the visual interface by the user, use the at least one entry field as a node, and determine at least two nodes corresponding to any generation relationship information in the intermediate directed graph according to the generation relationship information between the entry fields.

It should be noted that fig. 7 is an interface schematic diagram of an operator management interface provided in this embodiment of the present application, referring to fig. 7, a user may perform a target operation on an operator corresponding to generation relationship information in an interface 701 shown in fig. 7 to trigger an operation instruction corresponding to a different target operation, and a computer device performs a corresponding target operation on an operator in the generation relationship information between the entry fields in response to the operation instruction, where the target operation may be addition, editing, deletion, and the like, which is not limited in this embodiment of the present application. The operator corresponding to the generated relationship information may be an element-level operator, a column-level operator, and the like, where the element-level operator may obtain data in a certain row by calculation according to values of some columns of data in the certain row, and the column-level operator may obtain one column of data in other columns by calculation according to values of some columns.

203. If the intermediate directed graph after the third directed edge is added between the at least two nodes meets the target condition, the computer equipment adds the third directed edge to the intermediate directed graph to obtain an updated intermediate directed graph, wherein the edge in the intermediate directed graph is used for representing the topological relation between the table entry fields.

The target condition comprises that the directed edges which are the same as the terminal nodes do not exist in the middle directed graph, and the directed edges in the middle directed graph cannot form a ring.

It should be noted that, after determining a node corresponding to any generated relationship information, the computer device may add directed edges between the nodes one by one to construct a graph, and when adding a directed edge, the computer device may virtually add the directed edge to the intermediate directed graph, that is, assuming that the directed edge has been added to the intermediate directed graph, it may be determined whether the intermediate directed graph after virtually adding the directed edge satisfies a target condition.

In a possible implementation manner, before adding the directed edge corresponding to the generation relationship information, the computer device may determine whether a directed edge that is the same as the end point of a third directed edge corresponding to the generation relationship information exists in the intermediate directed graph, if no directed edge that is the same as the end point of the third directed edge exists in the intermediate directed graph, the computer device may determine whether the third directed edge forms a ring with the directed edge in the intermediate directed graph after adding the third directed edge, and if the third directed edge does not form a ring with the directed edge in the intermediate directed graph, the computer device may add the third directed edge to the intermediate directed graph to obtain an updated intermediate directed graph.

The number of the third directed edges may be one or more, which is not limited in the embodiment of the present application, and multiple third directed edges correspond to the same generation relationship information, for example, if a and b generate c by a certain calculation method, the third directed edge may have two cases, i.e., a → c and b → c.

204. And if the intermediate directed graph to which the third directed edge is added does not meet the target condition, the computer equipment takes the intermediate directed graph to which the third directed edge is not added as the updated intermediate directed graph.

In one possible implementation, if there is a directed edge in the intermediate directed graph that is the same as the end point of the third directed edge, it may be determined that the third directed edge is an unreasonable input, and the computer device may abandon adding the third directed edge to the intermediate directed graph, and directly take the intermediate directed graph to which the third directed edge is not added as the updated intermediate directed graph.

In another possible implementation manner, if there is no directed edge in the intermediate directed graph that is the same as the end point of the third directed edge, the computer device may determine whether the third directed edge forms a ring with the directed edge in the intermediate directed graph after the third directed edge is added, and if the third directed edge forms a ring with the directed edge in the intermediate directed graph, it may be determined that the third directed edge is an unreasonable input, and the computer device may abandon adding the third directed edge to the intermediate directed graph, and directly take the intermediate directed graph to which the third directed edge is not added as the updated intermediate directed graph.

It should be noted that the process shown in the above steps 203 to 204 is a process of determining each directed edge that needs to be added in the process of constructing the intermediate directed graph, in other possible implementation manners, the computer device may further generate the intermediate directed graph according to all the directed edges corresponding to the generation relationship information, check the first directed edge between every two nodes in the intermediate directed graph, delete the first directed edge whose check result does not satisfy the target condition from the intermediate directed graph, and obtain the updated intermediate directed graph.

205. And the computer equipment determines two nodes corresponding to the first possible generation relation information corresponding to any association relation in the association information in the intermediate directed graph according to the association information among the table entry fields.

The association information may be used to indicate an association relationship between two fields of the data table, where the association relationship may be a one-to-one case, for example, the association information may be { a associates b }, and there may be two possible generation relationships between a and b, where a may generate b or b may generate a, and when adding a directed edge, there is no need to specify in advance, and an actual generation relationship needs to be determined according to an actual situation.

It should be noted that, a user may set association information between entry fields in the interface 801 shown in fig. 8, referring to fig. 8, fig. 8 is a schematic diagram of an association information setting interface between entry fields provided in the embodiment of the present application, a user may set an association rule of each field in a data table in the interface 801, and a user may formulate an association relationship between two columns in the data table by setting association information. After the associated information is set, the user may trigger a "complete" operation in the interface 801 to trigger a complete instruction, and the computer device may determine that the associated information required for obtaining the test data is all set and completed in response to the complete instruction, and then the computer device may obtain the test data according to the set associated information.

In a possible implementation manner, the computer device may obtain association information between entry fields set on the visual interface by the user, randomly designate a possible generation relationship according to the association information, serve as first possible generation relationship information corresponding to any association relationship in the association information, and determine two nodes corresponding to the first possible generation relationship information in the middle directed graph. For example, for the association information of { a associates b }, the computer device may make the determination of subsequent steps 206 to 207 with a generation b as the first possible generation relationship information and a → b as the second directed edge.

It should be noted that, when the user sets the association information between the entry fields, the user may also set the repetition rate of the data in each column, and if the application test task includes at least two data tables, the repetition rate of the entry fields in the data table of the application test task is determined, and the at least two data tables are merged according to the field whose repetition rate is greater than the preset threshold, so as to obtain a merged data table. The preset threshold may be any value, which is not limited in the embodiment of the present application.

206. And if the intermediate directed graph after the second directed edge is added between the two nodes meets the target condition, the computer equipment adds the second directed edge to the intermediate directed graph to obtain a target directed acyclic graph, wherein the edge in the target directed acyclic graph is used for representing the topological relation between the table entry fields.

In a possible implementation manner, before adding the directed edge corresponding to the first possible generation relationship information, the computer device may determine whether a directed edge that is the same as an end point of a second directed edge corresponding to the first possible generation relationship information exists in the intermediate directed graph, if no directed edge that is the same as an end point of the second directed edge exists in the intermediate directed graph, the computer device may determine whether the second directed edge forms a ring with the directed edge in the intermediate directed graph after adding the second directed edge, and if the second directed edge does not form a ring with the directed edge in the intermediate directed graph, the computer device may add the second directed edge to the intermediate directed edge to obtain the target directed acyclic graph.

207. And if the intermediate directed graph added with the second directed edge does not meet the target condition, the computer equipment adjusts the intermediate directed graph according to second possible generation relation information corresponding to any association relation in the association information to obtain the target directed acyclic graph.

In a possible implementation manner, if there is a directed edge in the intermediate directed graph that is the same as the end point of the second directed edge, it may be determined that the second directed edge is an unreasonable input, and the computer device may abandon adding the second directed edge to the intermediate directed graph, determine two nodes corresponding to the second possible generated relationship information according to the second possible generated relationship information corresponding to another association relationship in the association information, and determine whether the intermediate directed graph after adding the fourth directed edge corresponding to the second possible generated relationship information satisfies a target condition.

In another possible implementation manner, if there is no directed edge in the intermediate directed graph that is the same as the end point of the second directed edge, the computer device may determine whether the second directed edge forms a ring with the directed edge in the intermediate directed graph after the second directed edge is added, if the second directed edge forms a ring with the directed edge in the intermediate directed graph, it may be determined that the second directed edge is an unreasonable input, the computer device may abandon adding the second directed edge to the intermediate directed graph, and determine, according to second possible generation relationship information corresponding to another association relationship in the association information, two nodes corresponding to the second possible generation relationship information, and determine whether the intermediate directed graph after adding a fourth directed edge corresponding to the second possible generation relationship information satisfies a target condition.

It should be noted that, for the association information { a associates b }, the second possible generation relationship information may be b to generate a, and the computer device may use the directional edge b → a as a fourth directional edge to perform similar determination as in steps 206 to 207, which is not described herein again.

208. And the computer equipment generates data meeting the generation relation information and the association information according to the topological relation represented by the target directed acyclic graph, and the data is used as the test data of the application test task.

In a possible implementation manner, the computer device may determine, according to the topological relation represented by the target directed acyclic graph, topological order arrangement of each entry field, and generate, according to the topological order arrangement, data that satisfies the generated relation information and the association information in combination with the generated relation information and the association information, as test data of the application test task.

When determining the topological order arrangement of each entry field, the computer device may determine the degree of entry of each node in the target directed acyclic graph, determine a node with the degree of entry of 0 in each node as a first node, delete the first node and a directed edge starting from the first node from the target directed acyclic graph, obtain an updated target directed acyclic graph, determine a node with the degree of entry of 0 in the updated target directed acyclic graph as a second node, delete the second node and a directed edge starting from the second node from the updated target directed acyclic graph, continue to update the updated target directed acyclic graph until all nodes in the target directed acyclic graph are deleted, and determine the topological order arrangement of each entry field according to the order of the first node, the second node, and … …. Optionally, other manners may also be used to determine the topological order arrangement of each entry field, which is not limited in this embodiment of the present application.

It should be noted that fig. 9 is an interface schematic diagram of a configuration interface provided in the embodiment of the present application, referring to fig. 9, a user may input relevant data of a certain application test task in an interface 901 shown in fig. 9, a computer device may obtain the data input in the configuration interface of the application test task, and determine object related information of the application test task according to the data, where the related information may include a creator, a responsible person, a business group identification code, a product identification code, an application group, and the like, and optionally, the related information may also include other contents, which is not limited in this embodiment of the present application.

In the above embodiment, only the operation performed when the test data is acquired for one application test task is involved, and the user may also acquire the test data for a plurality of application test tasks through a visual interface provided by the present application, referring to fig. 10, fig. 10 is an interface schematic diagram of a task display interface provided by the embodiment of the present application, and the interface 1001 may include a task that has already acquired the test data, a task that is performing the test data acquisition, a task that is to be performed the test data acquisition, and the like, which is not limited in the embodiment of the present application.

In the scheme provided by the embodiment of the application, at least one table entry field in a data table of an application test task is obtained, the target directed acyclic graph can be automatically generated by taking the at least one table entry field as a node according to the generation relation information between the table entry fields and the association information between the table entry fields, further, data meeting the generation relation information and the association information can be automatically generated according to the topological relation represented by the target directed acyclic graph and used as test data of the application test task, the generated test data is not actually checked and corrected, the problems found during the test can be ensured to be comprehensive, the application test effect is improved, for some applications related to the joint parallel development with other teams, the data in the application use process can be obtained by depending on the original data of other teams, and the real data is not necessary in the application test process, by the scheme provided by the embodiment of the application, the test data of various applications can be acquired, and the smooth application test is ensured. In addition, a user can specify a table structure of the data table, a user-defined generation operator and an incidence relation among the data tables through the visual interface provided by the embodiment of the application, data meeting testing requirements are automatically generated, a business team does not need to develop testing codes specially aiming at specific projects to obtain testing data, application testing cost is reduced, and application testing efficiency is improved.

All the above optional technical solutions may be combined arbitrarily to form optional embodiments of the present application, and are not described herein again.

Fig. 11 is a structural diagram of a test data acquisition apparatus according to an embodiment of the present application, and referring to fig. 11, the apparatus includes:

a field obtaining module 1101, configured to obtain at least one entry field in a data table of an application test task;

a directed acyclic graph generating module 1102, configured to generate a target directed acyclic graph according to generation relationship information between the table entry fields and association information between the table entry fields by using the at least one table entry field as a node, where an edge in the target directed acyclic graph is used to represent a topological relationship between the table entry fields;

a data generating module 1103, configured to generate, according to the topological relation represented by the target directed acyclic graph, data that satisfies the generation relation information and the association information, as test data of the application test task.

The device can automatically generate the target directed acyclic graph by acquiring at least one table entry field in the data table of the application test task and taking the at least one table entry field as a node according to the generation relationship information between the table entry fields and the association information between the table entry fields, and further can automatically generate data meeting the generation relationship information and the association information according to the topological relation represented by the target directed acyclic graph, wherein the data is used as the test data of the application test task, and the generated test data is not actually checked and corrected, so that the problems found during the test can be ensured to be comprehensive, and the application test effect is improved.

In one possible implementation, the apparatus further includes:

the directed graph generating module is used for generating a middle directed graph by taking the at least one table entry field as a node according to the generation relation information among the table entry fields, wherein edges in the middle directed graph are used for expressing the topological relation among the table entry fields;

and the adjusting module is used for adjusting the intermediate directed graph according to the association information among the table entry fields to obtain the target directed acyclic graph.

In one possible implementation, the apparatus further includes:

the checking module is used for checking a first directed edge between every two nodes in the middle directed graph;

and the deleting module is used for deleting the first directed edge of which the check result does not meet the target condition from the intermediate directed graph to obtain an updated intermediate directed graph.

In one possible implementation, the apparatus further includes:

the device also includes:

In one possible implementation, the target condition includes:

none of the directed edges in the middle directed graph can form a ring.

In one possible implementation, the apparatus further includes:

It should be noted that: in the test data acquiring apparatus provided in the above embodiment, when the test data is acquired, only the division of the functional modules is illustrated, and in practical applications, the function distribution may be completed by different functional modules according to needs, that is, the internal structure of the computer device is divided into different functional modules to complete all or part of the functions described above. In addition, the test data acquisition device and the test data acquisition method provided by the above embodiments belong to the same concept, and specific implementation processes thereof are detailed in the method embodiments and are not described herein again.

Fig. 12 is a schematic structural diagram of a computer device according to an embodiment of the present application. The computer device 1200 may be: a smart phone, a tablet computer, an MP3 player (Moving Picture Experts Group Audio layer iii, motion video Experts compression standard Audio layer 3), an MP4 player (Moving Picture Experts Group Audio layer IV, motion video Experts compression standard Audio layer 4), a notebook computer, or a desktop computer. Computer device 1200 may also be referred to by other names such as user device, portable computer device, laptop computer device, desktop computer device, and so forth.

Generally, computer device 1200 includes: one or more processors 1201 and one or more memories 1202.

The processor 1201 may include one or more processing cores, such as a 4-core processor, an 8-core processor, or the like. The processor 1201 may be implemented in at least one hardware form of a DSP (Digital Signal Processing), an FPGA (Field-Programmable Gate Array), and a PLA (Programmable Logic Array). The processor 1201 may also include a main processor and a coprocessor, where the main processor is a processor for processing data in an awake state, and is also called a Central Processing Unit (CPU); a coprocessor is a low power processor for processing data in a standby state. In some embodiments, the processor 1201 may be integrated with a GPU (Graphics Processing Unit) that is responsible for rendering and drawing content that the display screen needs to display. In some embodiments, the processor 1201 may further include an AI (Artificial Intelligence) processor for processing a computing operation related to machine learning.

Memory 1202 may include one or more computer-readable storage media, which may be non-transitory. Memory 1202 may also include high-speed random access memory, as well as non-volatile memory, such as one or more magnetic disk storage devices, flash memory storage devices. In some embodiments, a non-transitory computer readable storage medium in the memory 1202 is used to store at least one program code for execution by the processor 1201 to implement the test data acquisition methods provided by the method embodiments herein.

In some embodiments, the computer device 1200 may further optionally include: a peripheral interface 1203 and at least one peripheral. The processor 1201, memory 1202, and peripheral interface 1203 may be connected by a bus or signal line. Various peripheral devices may be connected to peripheral interface 1203 via a bus, signal line, or circuit board. Specifically, the peripheral device includes: at least one of radio frequency circuitry 1204, display 1205, camera 1206, audio circuitry 1207, positioning components 1208, and power source 1209.

The peripheral interface 1203 may be used to connect at least one peripheral associated with I/O (Input/Output) to the processor 1201 and the memory 1202. In some embodiments, the processor 1201, memory 1202, and peripheral interface 1203 are integrated on the same chip or circuit board; in some other embodiments, any one or two of the processor 1201, the memory 1202 and the peripheral device interface 1203 may be implemented on a separate chip or circuit board, which is not limited in this embodiment.

The Radio Frequency circuit 1204 is used for receiving and transmitting RF (Radio Frequency) signals, also called electromagnetic signals. The radio frequency circuit 1204 communicates with a communication network and other communication devices by electromagnetic signals. The radio frequency circuit 1204 converts an electric signal into an electromagnetic signal to transmit, or converts a received electromagnetic signal into an electric signal. Optionally, the radio frequency circuit 1204 comprises: an antenna system, an RF transceiver, one or more amplifiers, a tuner, an oscillator, a digital signal processor, a codec chipset, a subscriber identity module card, and so forth. The radio frequency circuit 1204 may communicate with other computer devices via at least one wireless communication protocol. The wireless communication protocols include, but are not limited to: metropolitan area networks, various generation mobile communication networks (2G, 3G, 4G, and 5G), Wireless local area networks, and/or WiFi (Wireless Fidelity) networks. In some embodiments, the rf circuit 1204 may further include NFC (Near Field Communication) related circuits, which are not limited in this application.

The display screen 1205 is used to display a UI (User Interface). The UI may include graphics, text, icons, video, and any combination thereof. When the display screen 1205 is a touch display screen, the display screen 1205 also has the ability to acquire touch signals on or over the surface of the display screen 1205. The touch signal may be input to the processor 1201 as a control signal for processing. At this point, the display 1205 may also be used to provide virtual buttons and/or a virtual keyboard, also referred to as soft buttons and/or a soft keyboard. In some embodiments, the display 1205 may be one, providing the front panel of the computer device 1200; in other embodiments, the display 1205 may be at least two, respectively disposed on different surfaces of the computer device 1200 or in a folded design; in still other embodiments, the display 1205 may be a flexible display disposed on a curved surface or on a folded surface of the computer device 1200. Even further, the display screen 1205 may be arranged in a non-rectangular irregular figure, i.e., a shaped screen. The Display panel 1205 can be made of a material such as an LCD (Liquid Crystal Display), an OLED (organic light-Emitting Diode), and the like.

Camera assembly 1206 is used to capture images or video. Optionally, camera assembly 1206 includes a front camera and a rear camera. Generally, a front camera is disposed on a front panel of a computer apparatus, and a rear camera is disposed on a rear surface of the computer apparatus. In some embodiments, the number of the rear cameras is at least two, and each rear camera is any one of a main camera, a depth-of-field camera, a wide-angle camera and a telephoto camera, so that the main camera and the depth-of-field camera are fused to realize a background blurring function, and the main camera and the wide-angle camera are fused to realize panoramic shooting and VR (Virtual Reality) shooting functions or other fusion shooting functions. In some embodiments, camera assembly 1206 may also include a flash. The flash lamp can be a monochrome temperature flash lamp or a bicolor temperature flash lamp. The double-color-temperature flash lamp is a combination of a warm-light flash lamp and a cold-light flash lamp, and can be used for light compensation at different color temperatures.

The audio circuitry 1207 may include a microphone and a speaker. The microphone is used for collecting sound waves of a user and the environment, converting the sound waves into electric signals, and inputting the electric signals into the processor 1201 for processing or inputting the electric signals into the radio frequency circuit 1204 to achieve voice communication. For stereo capture or noise reduction purposes, the microphones may be multiple and located at different locations on the computer device 1200. The microphone may also be an array microphone or an omni-directional pick-up microphone. The speaker is used to convert electrical signals from the processor 1201 or the radio frequency circuit 1204 into sound waves. The loudspeaker can be a traditional film loudspeaker or a piezoelectric ceramic loudspeaker. When the speaker is a piezoelectric ceramic speaker, the speaker can be used for purposes such as converting an electric signal into a sound wave audible to a human being, or converting an electric signal into a sound wave inaudible to a human being to measure a distance. In some embodiments, the audio circuitry 1207 may also include a headphone jack.

The Location component 1208 is used to locate a current geographic Location of the computer device 1200 for navigation or LBS (Location Based Service). The Positioning component 1208 can be a Positioning component based on the united states GPS (Global Positioning System), the chinese beidou System, the russian graves System, or the european union galileo System.

The power supply 1209 is used to power the various components in the computer device 1200. The power source 1209 may be alternating current, direct current, disposable or rechargeable. When the power source 1209 includes a rechargeable battery, the rechargeable battery may support wired or wireless charging. The rechargeable battery may also be used to support fast charge technology.

In some embodiments, the computer device 1200 also includes one or more sensors 1210. The one or more sensors 1210 include, but are not limited to: acceleration sensor 1211, gyro sensor 1212, pressure sensor 1213, fingerprint sensor 1214, optical sensor 1215, and proximity sensor 1216.

The acceleration sensor 1211 may detect magnitudes of accelerations on three coordinate axes of a coordinate system established with the computer apparatus 1200. For example, the acceleration sensor 1211 may be used to detect components of the gravitational acceleration in three coordinate axes. The processor 1201 may control the display screen 1205 to display the user interface in a landscape view or a portrait view according to the gravitational acceleration signal collected by the acceleration sensor 1211. The acceleration sensor 1211 may also be used for acquisition of motion data of a game or a user.

The gyro sensor 1212 may detect a body direction and a rotation angle of the computer device 1200, and the gyro sensor 1212 may collect a 3D motion of the user on the computer device 1200 in cooperation with the acceleration sensor 1211. The processor 1201 can implement the following functions according to the data collected by the gyro sensor 1212: motion sensing (such as changing the UI according to a user's tilting operation), image stabilization at the time of photographing, game control, and inertial navigation.

Pressure sensors 1213 may be disposed on the side bezel of computer device 1200 and/or underlying display 1205. When the pressure sensor 1213 is disposed on the side frame of the computer device 1200, the holding signal of the user to the computer device 1200 can be detected, and the processor 1201 performs left-right hand recognition or quick operation according to the holding signal acquired by the pressure sensor 1213. When the pressure sensor 1213 is disposed at a lower layer of the display screen 1205, the processor 1201 controls the operability control on the UI interface according to the pressure operation of the user on the display screen 1205. The operability control comprises at least one of a button control, a scroll bar control, an icon control and a menu control.

The fingerprint sensor 1214 is used for collecting a fingerprint of the user, and the processor 1201 identifies the user according to the fingerprint collected by the fingerprint sensor 1214, or the fingerprint sensor 1214 identifies the user according to the collected fingerprint. When the user identity is identified as a trusted identity, the processor 1201 authorizes the user to perform relevant sensitive operations, including unlocking a screen, viewing encrypted information, downloading software, paying, changing settings, and the like. The fingerprint sensor 1214 may be provided on the front, back or side of the computer device 1200. When a physical key or vendor Logo is provided on the computer device 1200, the fingerprint sensor 1214 may be integrated with the physical key or vendor Logo.

The optical sensor 1215 is used to collect the ambient light intensity. In one embodiment, the processor 1201 may control the display brightness of the display 1205 according to the ambient light intensity collected by the optical sensor 1215. Specifically, when the ambient light intensity is high, the display luminance of the display panel 1205 is increased; when the ambient light intensity is low, the display brightness of the display panel 1205 is turned down. In another embodiment, processor 1201 may also dynamically adjust the camera head 1206 shooting parameters based on the ambient light intensity collected by optical sensor 1215.

A proximity sensor 1216, also called a distance sensor, is generally provided on a front panel of the computer apparatus 1200. The proximity sensor 1216 is used to collect the distance between the user and the front of the computer device 1200. In one embodiment, the processor 1201 controls the display screen 1205 to switch from the bright screen state to the dark screen state when the proximity sensor 1216 detects that the distance between the user and the front of the computer device 1200 is gradually decreasing; when the proximity sensor 1216 detects that the distance between the user and the front of the computer device 1200 is gradually increased, the display 1205 is controlled by the processor 1201 to switch from the rest state to the bright state.

Those skilled in the art will appreciate that the configuration shown in FIG. 12 is not intended to be limiting of the computer device 1200 and may include more or fewer components than those shown, or some components may be combined, or a different arrangement of components may be used.

In an exemplary embodiment, a computer-readable storage medium, such as a memory including program code, which is executable by a processor to perform the test data acquisition method in the above-described embodiments, is also provided. For example, the computer-readable storage medium may be a Read-Only Memory (ROM), a Random Access Memory (RAM), a Compact Disc Read-Only Memory (CD-ROM), a magnetic tape, a floppy disk, an optical data storage device, and the like.

It will be understood by those skilled in the art that all or part of the steps for implementing the above embodiments may be implemented by hardware, or may be implemented by hardware associated with program code, and the program may be stored in a computer readable storage medium, where the above mentioned storage medium may be a read-only memory, a magnetic or optical disk, etc.

The above description is only exemplary of the present application and should not be taken as limiting, as any modification, equivalent replacement, or improvement made within the spirit and principle of the present application should be included in the protection scope of the present application.

Claims

1. A method for test data acquisition, the method comprising:

generating a target directed acyclic graph by taking the at least one table entry field as a node according to the generation relationship information between the table entry fields and the association information between the table entry fields, wherein edges in the target directed acyclic graph are used for representing the topological relationship between the table entry fields;

2. The method of claim 1, wherein generating the target directed acyclic graph according to the generation relationship information between the entry fields and the association information between the entry fields with the at least one entry field as a node comprises:

generating a middle directed graph by taking the at least one table entry field as a node according to the generation relationship information among the table entry fields, wherein edges in the middle directed graph are used for representing the topological relationship among the table entry fields;

and adjusting the intermediate directed graph according to the association information among the table entry fields to obtain a target directed acyclic graph.

3. The method according to claim 2, wherein before the adjusting the intermediate directed graph according to the association information between the entry fields to obtain the target directed acyclic graph, the method further comprises:

checking a first directed edge between every two nodes in the middle directed graph;

and deleting the first directed edge of which the check result does not meet the target condition from the intermediate directed graph to obtain an updated intermediate directed graph.

4. The method of claim 2, wherein the adjusting the intermediate directed graph according to the association information between the entry fields to obtain the target directed acyclic graph comprises:

determining two nodes corresponding to first possible generation relation information corresponding to any association relation in the association information in the intermediate directed graph according to the association information among the table entry fields;

if the intermediate directed graph after the second directed edge is added between the two nodes meets the target condition, adding the second directed edge to the intermediate directed graph to obtain a target directed acyclic graph;

and if the intermediate directed graph added with the second directed edge does not meet the target condition, adjusting the intermediate directed graph according to second possible generation relationship information corresponding to any association relationship in the association information to obtain the target directed acyclic graph.

5. The method of claim 2, wherein generating an intermediate directed graph according to the generation relationship information between the entry fields by using the at least one entry field as a node comprises:

determining at least two nodes corresponding to any generation relation information in the intermediate directed graph according to the generation relation information among the table entry fields;

if the intermediate directed graph after the third directed edge is added between the at least two nodes meets the target condition, adding the third directed edge to the intermediate directed graph to obtain an updated intermediate directed graph;

and if the intermediate directed graph to which the third directed edge is added does not meet the target condition, determining the intermediate directed graph to which the third directed edge is not added as the updated intermediate directed graph.

6. The method according to any one of claims 3 to 5, wherein the target conditions include:

the intermediate directed graph does not have directed edges which are the same as the end nodes;

none of the directed edges in the middle directed graph can form a ring.

7. The method of claim 1, wherein prior to obtaining at least one entry field in a data table of an application test task, the method further comprises:

and determining at least one table entry field in the data table of the application test task according to the task name of the application test task, the name of the target database and the data table structure of the target database, which are acquired from the newly added task interface.

8. The method of claim 7, wherein after determining at least one entry field in the data table of the application test task according to the task name of the application test task, the name of the target database, and the data table structure of the target database, which are acquired from the newly added task interface, the method further comprises:

if the application test task comprises at least two data tables, determining the repetition rate of the table entry fields in the data tables of the application test task;

and combining the at least two data tables according to the field with the repetition rate larger than the preset threshold value to obtain a combined data table.

9. The method of claim 7, further comprising at least one of:

performing target operation on operators in the generation relation information among the table entry fields and the association information among the table entry fields according to an operation instruction received by an operator management interface of the application test task;

and performing target operation on the table structure of the data table in a target database according to an operation instruction received at a table structure management interface of the application test task.

10. The method of claim 7, further comprising:

acquiring data input in a configuration interface of the application test task;

and determining object related information of the application test task according to the data.

11. A test data acquisition apparatus, characterized in that the apparatus comprises:

12. The apparatus of claim 11, further comprising:

the directed graph generating module is used for generating a middle directed graph by taking the at least one table entry field as a node according to the generation relation information among the table entry fields, wherein edges in the middle directed graph are used for representing the topological relation among the table entry fields;

13. The apparatus of claim 11, further comprising:

14. A computer device comprising one or more processors and one or more memories having at least one program code stored therein, the program code being loaded and executed by the one or more processors to perform the operations performed by the test data acquisition method of any one of claims 1 to 10.

15. A computer-readable storage medium having at least one program code stored therein, the program code being loaded and executed by a processor to perform operations performed by the test data acquisition method of any one of claims 1 to 10.