CN112783507A - Data stream guiding playback method and device, electronic equipment and readable storage medium - Google Patents

Data stream guiding playback method and device, electronic equipment and readable storage medium Download PDF

Info

Publication number
CN112783507A
CN112783507A CN202110126137.1A CN202110126137A CN112783507A CN 112783507 A CN112783507 A CN 112783507A CN 202110126137 A CN202110126137 A CN 202110126137A CN 112783507 A CN112783507 A CN 112783507A
Authority
CN
China
Prior art keywords
data
interface request
request data
instruction information
cleaning instruction
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.)
Granted
Application number
CN202110126137.1A
Other languages
Chinese (zh)
Other versions
CN112783507B (en
Inventor
杨丽秦
何赛松
郝伟
孟倩茹
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Baidu Netcom Science and Technology Co Ltd
Original Assignee
Beijing Baidu Netcom Science and Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Baidu Netcom Science and Technology Co Ltd filed Critical Beijing Baidu Netcom Science and Technology Co Ltd
Priority to CN202110126137.1A priority Critical patent/CN112783507B/en
Publication of CN112783507A publication Critical patent/CN112783507A/en
Application granted granted Critical
Publication of CN112783507B publication Critical patent/CN112783507B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F8/00Arrangements for software engineering
    • G06F8/40Transformation of program code
    • G06F8/41Compilation
    • G06F8/42Syntactic analysis
    • G06F8/427Parsing
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/21Design, administration or maintenance of databases
    • G06F16/215Improving data quality; Data cleansing, e.g. de-duplication, removing invalid entries or correcting typographical errors
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22Indexing; Data structures therefor; Storage structures
    • G06F16/2228Indexing structures
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D10/00Energy efficient computing, e.g. low power processors, power management or thermal management

Abstract

The disclosure discloses a data drainage playback method, a data drainage playback device, an electronic device and a readable storage medium, and relates to the field of artificial intelligence such as cloud computing and knowledge charts, wherein the method comprises the following steps: acquiring original data to be processed, wherein the original data comprises N pieces of interface request data, and N is a positive integer greater than one; analyzing the incidence relation between the interface request data to obtain cleaning instruction information; and performing drainage playback according to the original data and the cleaning instruction information. By applying the scheme disclosed by the invention, the success rate of the playback result can be improved.

Description

Data stream guiding playback method and device, electronic equipment and readable storage medium
Technical Field
The present disclosure relates to the field of artificial intelligence technologies, and in particular, to a data drainage playback method and apparatus in the fields of cloud computing and knowledge graph, an electronic device, and a readable storage medium.
Background
With the high-speed development of cloud services, the cloud computing capability is continuously improved, product architectures of cloud manufacturers are increasingly huge, the service products have an intricate and complex dependency relationship, the cloud manufacturers generally promise higher reliability guarantee, the problem of user scene coverage can be well solved through drainage playback tests, and the method has important significance for quality guarantee of the cloud products.
At present, the mainstream drainage playback modes in the industry include a log-based request reconstruction and playback mode, a traffic replication (TcpCopy) -based network traffic replication and playback mode, and the like, which all have a general problem, that is, the data is not supported for automatic cleaning, so that the playback result success rate is low, and the like.
Disclosure of Invention
The disclosure provides a data stream guiding playback method, a data stream guiding playback device, an electronic device and a readable storage medium.
A data-drainage playback method, comprising:
acquiring original data to be processed, wherein the original data comprises N pieces of interface request data, and N is a positive integer greater than one;
analyzing the incidence relation between the interface request data to obtain cleaning instruction information;
and performing drainage playback according to the original data and the cleaning instruction information.
A data-draining playback device, comprising: the device comprises a data acquisition module, an instruction acquisition module and a playback module;
the data acquisition module is used for acquiring original data to be processed, wherein the original data comprises N pieces of interface request data, and N is a positive integer greater than one;
the instruction acquisition module is used for analyzing the incidence relation between the interface request data to obtain cleaning instruction information;
and the playback module is used for conducting drainage playback according to the original data and the cleaning instruction information.
An electronic device, comprising:
at least one processor; and
a memory communicatively coupled to the at least one processor; wherein the content of the first and second substances,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform a method as described above.
A non-transitory computer readable storage medium storing computer instructions for causing a computer to perform the method as described above.
A computer program product comprising a computer program which, when executed by a processor, implements a method as described above.
One embodiment in the above disclosure has the following advantages or benefits: the incidence relation between the interface request data in the original data can be analyzed to obtain the cleaning instruction information, and then drainage playback can be performed according to the original data and the cleaning instruction information, so that automatic cleaning of the data can be realized by using the cleaning instruction information, the success rate of playback results is improved, and the like.
It should be understood that the statements in this section do not necessarily identify key or critical features of the embodiments of the present disclosure, nor do they limit the scope of the present disclosure. Other features of the present disclosure will become apparent from the following description.
Drawings
The drawings are included to provide a better understanding of the present solution and are not to be construed as limiting the present disclosure. Wherein:
FIG. 1 is a flow chart of an embodiment of a data stream playback method according to the present disclosure;
FIG. 2 is a schematic diagram of an overall implementation process of the data stream playback method according to the present disclosure;
FIG. 3 is a schematic diagram illustrating a structure of an embodiment 300 of a data stream playback apparatus according to the present disclosure;
FIG. 4 shows a schematic block diagram of an example electronic device 400 that may be used to implement embodiments of the present disclosure.
Detailed Description
Exemplary embodiments of the present disclosure are described below with reference to the accompanying drawings, in which various details of the embodiments of the disclosure are included to assist understanding, and which are to be considered as merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the present disclosure. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.
In addition, it should be understood that the term "and/or" herein is merely one type of association relationship that describes an associated object, meaning that three relationships may exist, e.g., a and/or B may mean: a exists alone, A and B exist simultaneously, and B exists alone. In addition, the character "/" herein generally indicates that the former and latter related objects are in an "or" relationship.
Fig. 1 is a flowchart of an embodiment of a data stream playback method according to the present disclosure. As shown in fig. 1, the following detailed implementation is included.
In step 101, raw data to be processed is obtained, where the raw data includes N pieces of interface request data, and N is a positive integer greater than one.
In step 102, the correlation between the interface request data is analyzed to obtain the cleaning instruction information.
In step 103, stream playback is performed according to the original data and the washing instruction information.
In the scheme of the embodiment of the method, the cleaning instruction information can be obtained by analyzing the incidence relation between the interface request data in the original data, and then the drainage playback can be performed according to the original data and the cleaning instruction information, so that the automatic cleaning of the data can be realized by using the cleaning instruction information, and the success rate of the playback result is improved.
A series of interface request calls are generated in the process of carrying out integration test on the system, and a large amount of interface request data with an association relation are generated.
Accordingly, raw data may be obtained, where the raw data may include N pieces of interface request data, where N is a positive integer greater than one. Each interface request data may include request and response data, and the response data may also be referred to as return data or return result. The interface request data may be stored in a JSON (JavaScript Object notification) format, as shown in table one, JS is an abbreviation of JavaScript, and is a programming language.
Figure BDA0002924075040000031
Figure BDA0002924075040000041
Table-interface request data storage format
Corresponding request identifiers, namely, requestids, can be respectively set for each interface request data, for example, for N pieces of interface request data, the interface request data can be numbered in the order of 1-N according to the order of the acquisition time from first to last. Table one is a storage format of the interface request data with number 1 and an example of included data content.
The key for realizing the automatic cleaning of the data is to acquire the cleaning instruction information of the data. For services with complex interface logic and dependency relationship, the parameters used in the next request are likely to be a certain field in the return data of the previous request, and the association relationship between the request and the request is necessarily embodied on the parameters.
For the N pieces of interface request data of the present disclosure, the association relationship may include an association relationship between interface request data in the same service, and accordingly, the association relationship between interface request data in the same service may be analyzed based on an inverted index algorithm to obtain the cleaning instruction information.
The inverted index is a storage mode of word-document testification, and documents containing the word can be quickly found according to the word through the inverted index. In the disclosure, an inverted index algorithm is applied to the problem of association relation between processing requests, and an inverted index is established for a predetermined parameter in interface request data, that is, an inverted index of different parameters in the request is established. The predetermined parameters specifically include which parameters may be determined according to actual needs. For example, an inverted index of parameters such as request path (uri), request uri parameter, request header, response body, etc. may be established, where the request uri parameter may refer to the "parameter" following the "method" shown in table one.
The following description takes the establishment of the request uri and the inverted index of the request uri parameter as an example.
1) Establishing an inverted index for a request uri
According to the uri value, removing the foremost ^ character and the rearmost $ character of the uri regular expression, then segmenting according to the '/' character, taking the actual uri element value in the segmentation result, if not, returning an empty json list, otherwise, returning the inverted index result of the uri element value.
An inverted index of the request uri is built in the manner described above, and the resulting example and format may be as shown in table two.
Figure BDA0002924075040000051
Inverted index of table two request uri
As shown in Table two, where location specifies the location of the effect value, here "uri"; value is the position replaced in uri, for example, if uri value is/v 1/functions/replayest/aliases, the array divided by "/" character is: [ ", 'v 1', 'functions', 'replays', 'aliases' ], the order of the 'replays' field in the array of the segmentation result is 3, and thus the value is 3.
2) Establishing an inverted index of request uri parameters
Assuming that the uri parameter is "local-zh-cn & pageNo 1& pageSize 10", then the json format is resolved as:
Figure BDA0002924075040000052
the corresponding inverted index is:
Figure BDA0002924075040000061
as described above, the association relationship between the interface request data in the same service may be analyzed based on the inverted index algorithm to obtain the cleaning instruction information.
Specifically, for the original data, a Unique Identifier may be generated, for example, a Unique Identifier may be generated in a manner of a Universal Unique Identifier (UUID), and may be stored in a clear _ id field.
The clean _ id can be used as a key, a json memory is applied in the memory for storing the reverse index set file, if the data size is large, the memory can be transferred to a distributed file storage-based database (MongoDB) for storage, the clean _ id can be used as a key, and a json memory is additionally applied in the memory for storing the cleaning instruction set file and marked by an all _ rule.
On the basis, the N pieces of interface request data can be analyzed and searched in sequence according to the sequence of the acquisition time from first to last, and the following first processing can be executed for the first piece of searched interface request data meeting the preset requirement: adding the reverse index data corresponding to the first interface request data meeting the preset requirement into a reverse index set file, acquiring cleaning instruction information corresponding to the first interface request data meeting the preset requirement, and adding the cleaning instruction information into a cleaning instruction set file; the inverted index set file and the cleaning instruction set file are initially both empty.
Taking the next interface request data as the current data, taking the next interface request data as the interface request data acquired firstly in the unprocessed interface request data, and executing the following second processing: if the incidence relation between the current data and the interface request data acquired before is determined according to the inverted index set file and the inverted index data corresponding to the current data, taking the current data as the data to be processed, and executing the following third processing: acquiring cleaning instruction information corresponding to the data to be processed, adding the cleaning instruction information into a cleaning instruction set file, and adding inverted index data corresponding to the data to be processed into an inverted index set file when the data to be processed meets the preset requirement; otherwise, taking the next interface request data as the current data, and repeatedly executing the second processing; and when the interface request data are processed, using the cleaning instruction information in the cleaning instruction set file as the obtained cleaning instruction information.
In addition, if it is determined that the current data does not have an association relationship with the interface request data acquired before, but it is determined that the current data meets the predetermined requirement, the reverse index data corresponding to the current data may also be added to the reverse index set file, and the cleaning instruction information corresponding to the current data may be acquired and added to the cleaning instruction set file.
For any interface request data, meeting the predetermined requirements may include: the request method of the interface for requesting data is update (PUT) or create (POST).
The request method of the interface request data can include PUT, POST, find (GET), DELETE (DELETE), and the like, and a scenario with an association relationship between requests is commonly found in the PUT and POST methods, for example, after a previous interface creates a resource, a resource id is returned and provided for a subsequent interface to call.
For any interface request data, before adding the reverse index data corresponding to the interface request data into the reverse index set file, the reverse index data corresponding to the interface request data can be subjected to deduplication processing.
In addition, for any interface request data, the cleaning instruction information corresponding to the interface request data is acquired, and the manner of adding the cleaning instruction information into the cleaning instruction set file may include: if the instruction information corresponding to the interface request data exists in the information engine, the updated instruction information can be generated according to the corresponding instruction information and the interface request data, and the updated instruction information can be added into the cleaning instruction set file, otherwise, the instruction information can be set aiming at the interface request data, and the set instruction information can be respectively added into the cleaning instruction set file and the information engine. How to set instruction information for the interface request data is the prior art.
Further, when it is determined that the instruction information corresponding to the interface request data exists in the information engine, if it is determined that the reliability of the corresponding instruction information is greater than the predetermined threshold, the updated instruction information may be generated according to the corresponding instruction information and the interface request data, and the updated instruction information may be added to the cleaning instruction set file, otherwise, the instruction information may be set for the interface request data, and the set instruction information may be added to the cleaning instruction set file and the information engine, respectively.
Furthermore, relative delay instruction information corresponding to the interface request data can be obtained and added into the cleaning instruction set file. When the interface request data is first interface request data meeting a predetermined requirement, the relative delay instruction information corresponding to the interface request data may be set to 0, and when the interface request data is to-be-processed data or current data, the difference between the start time of the interface request data and the start time of the first interface request data meeting the predetermined requirement may be obtained and used as the relative delay instruction information corresponding to the interface request data.
The following further describes a processing manner of each interface request data with reference to a specific example.
1) Initial interface request data
Assuming that N pieces of interface request data are respectively numbered as interface request data 1-interface request data N according to the sequence of the acquisition time from first to last, it may be determined whether the request method of the interface request data 1 is PUT or POST, if so, the first processing may be performed on the interface request data 1, otherwise, it may be determined whether the request method of the interface request data 2 is PUT or POST, if so, the first processing may be performed on the interface request data 2, otherwise, it may be determined whether the request method of the interface request data 3 is PUT or POST, and so on. The interface request data performing the first process may be regarded as "initial interface request data".
Assuming that the request method of the interface request data 1 is POST, the first processing may be executed for the interface request data 1, that is, the reverse index data corresponding to the interface request data 1 may be added to the reverse index set file, and the cleaning instruction information corresponding to the interface request data 1 may be acquired and added to the cleaning instruction set file.
Before the reverse index data corresponding to the interface request data 1 is added to the reverse index set file, the reverse index data corresponding to the interface request data 1 may be deduplicated. For example, in the inverted index data corresponding to the interface request data 1, if the inverted index of the same data exists in the request and the response at the same time, the inverted index of the request parameter may be retained, and the inverted index of the response parameter may be removed. For example, if the request body has an inverted index with a value of replay test (replay), and the response body also has an inverted index with a value of replay, only the inverted index with a value of replay in the request body may be added, so as to save storage resources, reduce workload of subsequent processing, and improve processing efficiency.
And aiming at the interface request data 1, whether instruction information corresponding to the interface request data 1 exists in the information engine can be determined, wherein the instruction information is usually replacement instruction information, if so, the instruction information can be taken out, updated instruction information can be generated according to the instruction information and the interface request data 1, the updated instruction information can be added into a cleaning instruction set file, otherwise, the instruction information can be set aiming at the interface request data 1, and the set instruction information can be respectively added into the cleaning instruction set file and the information engine.
For example, an information engine has recorded an interface and set 1 piece of replacement instruction information, as follows:
Figure BDA0002924075040000091
through fields such as location, value, etc. in the instruction information, the value of target can be extracted from the interface request data 1 and constructed as updated instruction information.
In addition, when determining that the instruction information corresponding to the interface request data 1 exists in the information engine, it may also be determined whether the reliability of the corresponding instruction information is greater than a predetermined threshold, and a specific value of the predetermined threshold may be determined according to an actual need, and if so, updated instruction information may be generated according to the corresponding instruction information and the interface request data 1, and the updated instruction information may be added to the cleaning instruction set file, otherwise, the instruction information may be set for the interface request data 1, and the set instruction information may be added to the cleaning instruction set file and the information engine, respectively.
When any instruction information is added into the information engine, an initial credibility can be set for the instruction information, and the credibility of the instruction information can be flexibly adjusted according to the actual using condition along with the continuous use of the instruction information. For example, if playback fails due to an error in the instruction information, the reliability of the instruction information may be lowered.
Through the processing, the accuracy of the used instruction information is ensured, and the accuracy of the subsequent processing result is improved.
In addition, the relative delay instruction information corresponding to the interface request data 1 can be obtained and added into the cleaning instruction set file. Specifically, the relative delay instruction information corresponding to the interface request data 1 may be set to 0, that is, the field value of "relative delay" may be set to 0.
Further, the start time of the interface request data 1 may also be taken as the relative start point srcStartTime of the playback data.
In practical application, for the interface request data 1, a list corresponding to the interface request data 1 may be created in the cleaning instruction set file, and a corresponding key value may be added, so that the cleaning instruction information corresponding to the interface request data 1 may be added to the corresponding list.
2) Loop processing subsequent interface request data
Assuming that the initial interface request data is interface request data 1, the subsequent processing can be performed for interface request data 2-interface request data N, respectively.
Firstly, the interface request data 2 can be used as current data, and whether an association relationship exists between the current data and the interface request data acquired before can be determined according to the inverted index set file and the inverted index data corresponding to the current data, that is, whether an association relationship exists between the interface request data 2 and the interface request data 1 can be determined.
How to determine whether the association relationship exists between the current data and the previously acquired interface request data according to the inverted index set file and the inverted index data corresponding to the current data is not limited. For example, the reverse indexes of the parameters corresponding to the current data may be sequentially searched in the reverse index set file, and if a hit occurs, it indicates that there may be an association relationship with the previous interface request data, and for further determination, it may further be determined whether there is an association relationship in a certain manner, for example, if the corresponding values of the last-stage key of the location are the same, it may be considered that there is an association relationship between the current data and the previously acquired interface request data.
And further, when the data to be processed is determined to meet the preset requirement, the inverted index data corresponding to the data to be processed can be added into the inverted index set file.
And determining whether the instruction information corresponding to the data to be processed exists in the information engine or not according to the data to be processed, if so, taking out the instruction information, generating updated instruction information according to the instruction information and the data to be processed, and adding the updated instruction information into the cleaning instruction set file, otherwise, setting the instruction information according to the data to be processed, and respectively adding the set instruction information into the cleaning instruction set file and the information engine.
When the instruction information corresponding to the data to be processed exists in the information engine, whether the credibility of the corresponding instruction information is larger than a preset threshold value can be determined, if yes, updated instruction information can be generated according to the corresponding instruction information and the data to be processed, the updated instruction information can be added into the cleaning instruction set file, otherwise, the instruction information can be set aiming at the data to be processed, and the set instruction information can be respectively added into the cleaning instruction set file and the information engine.
In addition, relative delay instruction information corresponding to the data to be processed can be obtained and added into the cleaning instruction set file. Specifically, a difference between the start time of the to-be-processed data and the start time of the interface request data 1, that is, srcStartTime, may be obtained, and the difference is used as the relative delay instruction information corresponding to the to-be-processed data.
In practical application, for data to be processed, a list corresponding to the data to be processed can be created in the cleaning instruction set file, corresponding key values are added, and then cleaning instruction information corresponding to the data to be processed can be added into the corresponding list.
If the request method of the data to be processed is PUT or POST, the inverted index data corresponding to the data to be processed can be added into the inverted index set file, before the addition, the inverted index data corresponding to the data to be processed can be subjected to deduplication processing, and the deduplication mode can refer to the deduplication mode of the interface request data 1.
When the inverted index data corresponding to the data to be processed is added to the inverted index set file, the inverted index data corresponding to the data to be processed can be fused with the existing data in the inverted index set file. For example, if there is an inverted index of some data before, the inverted index corresponding to the data is in a list form, and the inverted index corresponding to the data to be processed may be added to the end.
Taking the case that there is an association between the current data, i.e., the interface request data 2, and the interface request data acquired before as an example, if it is determined that there is no association between the current data and the interface request data acquired before according to the inverted index data, it may be further determined whether the current data meets the predetermined requirement, and if so, the inverted index data corresponding to the current data may be added to the inverted index set file, and the cleaning instruction information corresponding to the current data may be acquired and added to the cleaning instruction set file.
Assuming that the request method of the current data, i.e., the interface request data 2, is PUT or POST, the inverted index data corresponding to the current data may be added to the inverted index set file, and before the addition, the inverted index data corresponding to the current data may be subjected to deduplication processing.
And aiming at the current data, whether instruction information corresponding to the current data exists in the information engine can be determined, if so, the instruction information can be taken out, updated instruction information can be generated according to the instruction information and the current data, the updated instruction information is added into the cleaning instruction set file, otherwise, the instruction information can be set aiming at the current data, and the set instruction information can be respectively added into the cleaning instruction set file and the information engine.
In addition, when the information engine is determined to have the instruction information corresponding to the current data, whether the reliability of the corresponding instruction information is greater than a preset threshold value can be determined, if yes, updated instruction information can be generated according to the corresponding instruction information and the current data, the updated instruction information can be added into the cleaning instruction set file, otherwise, the instruction information can be set according to the current data, and the set instruction information can be added into the cleaning instruction set file and the information engine respectively.
Furthermore, relative delay instruction information corresponding to the current data can be obtained and added into the cleaning instruction set file. Specifically, a difference between the start time of the current data and the start time of the interface request data 1, that is, srcStartTime, may be obtained, and the difference is used as the relative delay instruction information corresponding to the current data.
In practical application, for the current data, a list corresponding to the current data can be created in the cleaning instruction set file, and a corresponding key value is added, so that the cleaning instruction information corresponding to the current data can be added to the corresponding list.
Assuming that there is no association between the current data, i.e., the interface request data 2, and the interface request data acquired before, and the request method of the current data is also not PUT or POST, the next interface request data may be processed continuously. That is, the interface request data 3 can be processed in the manner of the interface request data 2.
And after all the N pieces of interface request data are processed, the cleaning instruction information in the cleaning instruction set file can be used as the obtained cleaning instruction information.
It can be seen that, after the processing mode is adopted, only the inverted index data corresponding to the interface request data meeting the requirements (such as the interface request data with association relation or PUT or POST as the request method) is added into the inverted index set file, so that the storage resources are saved, the invalid instruction information is reduced, the workload of subsequent processing is reduced, and the like, and the required cleaning instruction information can be accurately and efficiently acquired, so that a good foundation is laid for the subsequent processing, and the like.
The method mainly analyzes the incidence relation among the interface request data in the same service and obtains the corresponding cleaning instruction information.
In practical applications, the association relationship may further include: interfaces between different services request associations between data. For example, the N interface request data may correspond to at least two different services.
Correspondingly, the incidence relation between interface request data among different services can be obtained according to the established knowledge graph, and corresponding cleaning instruction information is obtained.
For example, when any interface request data is processed according to the above manner, whether external dependency exists in the interface request data may be determined by querying a knowledge graph, and if external dependency exists, instruction information corresponding to the external dependency may be added to the cleaning instruction set file. How the instruction information is generated is not limited, and for example, the instruction information may be generated manually or automatically.
The knowledge graph can be constructed in advance, for example, by processing interface documents of cloud products, extracting the dependency relationship among cloud product resources, and constructing a knowledge graph relation graph, which can include the forward dependency relationship and the backward dependency relationship among the cloud products. How to construct the knowledge graph is not limited, and for example, a manual construction mode can be adopted. The knowledge graph may provide an interface to the outside to obtain desired information by calling the interface, and the like. When certain information required by the knowledge map is absent, the improvement/supplement can be performed manually.
Through the processing, the obtained cleaning instruction information is further improved, so that the obtained cleaning instruction information is more comprehensive and accurate, and the like.
And then, performing drainage playback according to the original data and the cleaning instruction information, such as completing request playback, result verification and the like, so as to complete drainage playback testing, wherein the specific implementation is not limited, and the existing mode can be adopted. After the test is finished, the cleaning instruction set file and the inverted index set file in the memory and the MongoDB can be cleaned.
The method can realize the automatic data cleaning by utilizing cleaning instruction information, thereby improving the success rate of a playback result, effectively ensuring the business test quality with complex dependency relationship among services, having no requirement on the technical architecture of a cloud product and having wide applicability, and in addition, in a test scene with long request link and related to the calling of a plurality of interfaces, the method can realize integrated test at low cost, improve the test efficiency, support general drainage, data cleaning and playback test, realize the coverage of a real user scene, improve the test coverage rate and the like.
In summary, fig. 2 is a schematic diagram of an overall implementation process of the data drainage playback method according to the present disclosure, and please refer to the foregoing related description for specific implementation, which is not repeated.
It is noted that while for simplicity of explanation, the foregoing method embodiments are described as a series of acts, those skilled in the art will appreciate that the present disclosure is not limited by the order of acts, as some steps may, in accordance with the present disclosure, occur in other orders and concurrently. Further, those skilled in the art should also appreciate that the embodiments described in the specification are preferred embodiments and that the acts and modules referred to are not necessarily required for the disclosure.
The above is a description of embodiments of the method, and the embodiments of the apparatus are further described below.
Fig. 3 is a schematic structural diagram of a data stream playback apparatus 300 according to an embodiment of the present disclosure. As shown in fig. 3, includes: a data acquisition module 310, an instruction acquisition module 302, and a playback module 303.
The data obtaining module 301 is configured to obtain raw data to be processed, where the raw data includes N pieces of interface request data, and N is a positive integer greater than one.
The instruction obtaining module 302 is configured to analyze an association relationship between interface request data to obtain cleaning instruction information.
And the playback module 303 is configured to perform drainage playback according to the original data and the cleaning instruction information.
Wherein the association relationship may include: interfaces within the same service request associations between data. The instruction obtaining module 302 may analyze an association relationship between interface request data in the same service based on an inverted index algorithm to obtain cleaning instruction information.
Specifically, the instruction obtaining module 302 may sequentially analyze and search the N pieces of interface request data according to the sequence of obtaining time from first to last, and execute the following first processing for a first piece of searched interface request data meeting a predetermined requirement: adding the reverse index data corresponding to the first interface request data meeting the preset requirement into a reverse index set file, acquiring cleaning instruction information corresponding to the first interface request data meeting the preset requirement, and adding the cleaning instruction information into a cleaning instruction set file; the reverse index set file and the cleaning instruction set file are both empty initially; taking the next interface request data as the current data, taking the next interface request data as the interface request data acquired firstly in the unprocessed interface request data, and executing the following second processing: if the incidence relation between the current data and the interface request data acquired before is determined according to the inverted index set file and the inverted index data corresponding to the current data, taking the current data as the data to be processed, and executing the following third processing: acquiring cleaning instruction information corresponding to the data to be processed, adding the cleaning instruction information into a cleaning instruction set file, and adding inverted index data corresponding to the data to be processed into an inverted index set file when the data to be processed meets a preset requirement; otherwise, taking the next interface request data as the current data, and repeatedly executing the second processing; and when all the interface request data are processed, using the cleaning instruction information in the cleaning instruction set file as the obtained cleaning instruction information.
If the instruction obtaining module 302 determines that the current data does not have an association relationship with the interface request data obtained before, but determines that the current data meets the predetermined requirement, the reverse index data corresponding to the current data may also be added to the reverse index set file, and the cleaning instruction information corresponding to the current data is obtained and added to the cleaning instruction set file.
For any interface request data, meeting the predetermined requirements may include: the request method of the interface for requesting data is PUT or POST.
For any interface request data, the inverted index data corresponding to the interface request data may include: an inverted index is established for a predetermined parameter in the interface request data.
For any interface request data, the instruction obtaining module 302 may further perform deduplication processing on the reverse index data corresponding to the interface request data before adding the reverse index data corresponding to the interface request data into the reverse index set file.
In addition, for any interface request data, if it is determined that the information engine has instruction information corresponding to the interface request data, the instruction obtaining module 302 may generate updated instruction information according to the corresponding instruction information and the interface request data, and may add the updated instruction information to the cleaning instruction set file, otherwise, may set instruction information for the interface request data, and may add the set instruction information to the cleaning instruction set file and the information engine, respectively.
In addition, when determining that the information engine has instruction information corresponding to the interface request data, if determining that the reliability of the corresponding instruction information is greater than the predetermined threshold, the instruction obtaining module 302 may generate updated instruction information according to the corresponding instruction information and the interface request data, and may add the updated instruction information to the cleaning instruction set file, otherwise, may set instruction information for the interface request data, and may add the set instruction information to the cleaning instruction set file and the information engine, respectively.
The instruction obtaining module 302 may further obtain the relative delay instruction information corresponding to the interface request data, and add the relative delay instruction information to the cleaning instruction set file. When the interface request data is first interface request data meeting a predetermined requirement, the relative delay instruction information corresponding to the interface request data may be set to 0, and when the interface request data is to-be-processed data or current data, the difference between the start time of the interface request data and the start time of the first interface request data meeting the predetermined requirement may be obtained and used as the relative delay instruction information corresponding to the interface request data.
The association relationship may further include: interfaces between different services request associations between data. Accordingly, the instruction obtaining module 302 may obtain an association relationship between interface request data of different services according to the constructed knowledge graph, and obtain corresponding cleaning instruction information.
For a specific work flow of the apparatus embodiment shown in fig. 3, reference is made to the related description in the foregoing method embodiment, and details are not repeated.
In a word, according to the scheme of the embodiment of the disclosure, the cleaning instruction information can be obtained by analyzing the incidence relation between the interface request data in the original data, and then the drainage playback can be performed according to the original data and the cleaning instruction information, so that the automatic cleaning of the data can be realized by using the cleaning instruction information, and the success rate of the playback result is improved.
The scheme disclosed by the disclosure can be applied to the field of artificial intelligence, in particular to the fields of cloud computing, knowledge graph and the like. Artificial intelligence is a subject for studying a computer to simulate some thinking processes and intelligent behaviors (such as learning, reasoning, thinking, planning and the like) of a human, and has a hardware technology and a software technology, the artificial intelligence hardware technology generally comprises technologies such as a sensor, a special artificial intelligence chip, cloud computing, distributed storage, big data processing and the like, and the artificial intelligence software technology mainly comprises a computer vision technology, a voice recognition technology, a natural language processing technology, machine learning/deep learning, a big data processing technology, a knowledge graph technology and the like.
The present disclosure also provides an electronic device, a readable storage medium, and a computer program product according to embodiments of the present disclosure.
FIG. 4 shows a schematic block diagram of an example electronic device 400 that may be used to implement embodiments of the present disclosure. Electronic devices are intended to represent various forms of digital computers, such as laptops, desktops, workstations, servers, blade servers, mainframes, and other appropriate computers. The electronic device may also represent various forms of mobile devices, such as personal digital assistants, cellular telephones, smart phones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions, are meant to be examples only, and are not meant to limit implementations of the disclosure described and/or claimed herein.
As shown in fig. 4, the apparatus 400 includes a computing unit 401 that can perform various appropriate actions and processes according to a computer program stored in a Read Only Memory (ROM)402 or a computer program loaded from a storage unit 408 into a Random Access Memory (RAM) 403. In the RAM 403, various programs and data required for the operation of the device 400 can also be stored. The computing unit 401, ROM 402, and RAM 403 are connected to each other via a bus 404. An input/output (I/O) interface 405 is also connected to bus 404.
A number of components in device 400 are connected to I/O interface 405, including: an input unit 406 such as a keyboard, a mouse, or the like; an output unit 407 such as various types of displays, speakers, and the like; a storage unit 408 such as a magnetic disk, optical disk, or the like; and a communication unit 409 such as a network card, modem, wireless communication transceiver, etc. The communication unit 409 allows the device 400 to exchange information/data with other devices via a computer network, such as the internet, and/or various telecommunication networks.
Computing unit 401 may be a variety of general and/or special purpose processing components with processing and computing capabilities. Some examples of the computing unit 401 include, but are not limited to, a Central Processing Unit (CPU), a Graphics Processing Unit (GPU), various dedicated Artificial Intelligence (AI) computing chips, various computing units running machine learning model algorithms, a Digital Signal Processor (DSP), and any suitable processor, controller, microcontroller, and so forth. The computing unit 401 performs the various methods and processes described above, such as the methods described in this disclosure. For example, in some embodiments, the methods described in this disclosure may be implemented as a computer software program tangibly embodied in a machine-readable medium, such as storage unit 408. In some embodiments, part or all of the computer program may be loaded and/or installed onto the device 400 via the ROM 402 and/or the communication unit 409. When loaded into RAM 403 and executed by computing unit 401, may perform one or more steps of the methods described in the present disclosure. Alternatively, in other embodiments, the computing unit 401 may be configured by any other suitable means (e.g., by means of firmware) to perform the methods described by the present disclosure.
Various implementations of the systems and techniques described here above may be implemented in digital electronic circuitry, integrated circuitry, Field Programmable Gate Arrays (FPGAs), Application Specific Integrated Circuits (ASICs), Application Specific Standard Products (ASSPs), system on a chip (SOCs), load programmable logic devices (CPLDs), computer hardware, firmware, software, and/or combinations thereof. These various embodiments may include: implemented in one or more computer programs that are executable and/or interpretable on a programmable system including at least one programmable processor, which may be special or general purpose, receiving data and instructions from, and transmitting data and instructions to, a storage system, at least one input device, and at least one output device.
Program code for implementing the methods of the present disclosure may be written in any combination of one or more programming languages. These program codes may be provided to a processor or controller of a general purpose computer, special purpose computer, or other programmable data processing apparatus, such that the program codes, when executed by the processor or controller, cause the functions/operations specified in the flowchart and/or block diagram to be performed. The program code may execute entirely on the machine, partly on the machine, as a stand-alone software package partly on the machine and partly on a remote machine or entirely on the remote machine or server.
In the context of this disclosure, a machine-readable medium may be a tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. The machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
To provide for interaction with a user, the systems and techniques described here can be implemented on a computer having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to a user; and a keyboard and a pointing device (e.g., a mouse or a trackball) by which a user can provide input to the computer. Other kinds of devices may also be used to provide for interaction with a user; for example, feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form, including acoustic, speech, or tactile input.
The systems and techniques described here can be implemented in a computing system that includes a back-end component (e.g., as a data server), or that includes a middleware component (e.g., an application server), or that includes a front-end component (e.g., a user computer having a graphical user interface or a web browser through which a user can interact with an implementation of the systems and techniques described here), or any combination of such back-end, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: local Area Networks (LANs), Wide Area Networks (WANs), and the Internet.
The computer system may include clients and servers. A client and server are generally remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other. The server can be a cloud server, also called a cloud computing server or a cloud host, and is a host product in a cloud computing service system, so as to solve the defects of high management difficulty and weak service expansibility in the traditional physical host and Virtual Private Server (VPS). The server may also be a server of a distributed system, or a server incorporating a blockchain.
Cloud computing refers to accessing an elastically extensible shared physical or virtual resource pool through a network, resources can include servers, operating systems, networks, software, applications, storage devices and the like, a technical system for deploying and managing the resources in a self-service mode as required can be achieved, and efficient and powerful data processing capacity can be provided for technical applications and model training of artificial intelligence, block chains and the like through a cloud computing technology.
It should be understood that various forms of the flows shown above may be used, with steps reordered, added, or deleted. For example, the steps described in the present disclosure may be executed in parallel, sequentially, or in different orders, as long as the desired results of the technical solutions disclosed in the present disclosure can be achieved, and the present disclosure is not limited herein.
The above detailed description should not be construed as limiting the scope of the disclosure. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions may be made in accordance with design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present disclosure should be included in the scope of protection of the present disclosure.

Claims (23)

1. A data-drainage playback method, comprising:
acquiring original data to be processed, wherein the original data comprises N pieces of interface request data, and N is a positive integer greater than one;
analyzing the incidence relation between the interface request data to obtain cleaning instruction information;
and performing drainage playback according to the original data and the cleaning instruction information.
2. The method of claim 1, wherein,
the association relationship comprises: the interfaces in the same service request the association relationship between the data;
analyzing the association relationship between the interface request data to obtain the cleaning instruction information comprises: and analyzing the incidence relation among the interface request data in the same service based on an inverted index algorithm to obtain the cleaning instruction information.
3. The method of claim 2, wherein the analyzing the association relationship between the interface request data in the same service based on the inverted index algorithm to obtain the cleaning instruction information comprises:
sequentially analyzing and searching the N pieces of interface request data according to the sequence of the acquisition time from first to last, and executing the following first processing aiming at the first piece of searched interface request data which meets the preset requirement: adding the reverse index data corresponding to the first interface request data meeting the preset requirement into a reverse index set file, acquiring the cleaning instruction information corresponding to the first interface request data meeting the preset requirement, and adding the cleaning instruction information into a cleaning instruction set file; the reverse index set file and the cleaning instruction set file are both empty initially;
taking the next interface request data as the current data, wherein the next interface request data is the interface request data acquired firstly in the unprocessed interface request data, and executing the following second processing: if the incidence relation between the current data and the interface request data acquired before is determined according to the inverted index set file and the inverted index data corresponding to the current data, taking the current data as the data to be processed, and executing the following third processing: acquiring cleaning instruction information corresponding to the data to be processed, adding the cleaning instruction information into the cleaning instruction set file, and adding inverted index data corresponding to the data to be processed into the inverted index set file when the data to be processed meets the preset requirement; otherwise, taking the next interface request data as the current data, and repeatedly executing the second processing; and when all interface request data are processed, using the cleaning instruction information in the cleaning instruction set file as the obtained cleaning instruction information.
4. The method of claim 3, further comprising:
and if determining that the current data does not have an incidence relation with the interface request data acquired before but determining that the current data meets the preset requirement, adding the reverse index data corresponding to the current data into the reverse index set file, acquiring the cleaning instruction information corresponding to the current data, and adding the cleaning instruction information into the cleaning instruction set file.
5. The method of claim 4, wherein,
for any interface request data, the meeting of the predetermined requirement comprises: the request method of the interface for requesting data is to update PUT or create POST.
6. The method of claim 4, wherein,
for any interface request data, the inverted index data corresponding to the interface request data comprises: an inverted index established for a predetermined parameter in the interface request data;
the method further comprises the following steps: for any interface request data, before adding the inverted index data corresponding to the interface request data into the inverted index set file, carrying out deduplication processing on the inverted index data corresponding to the interface request data.
7. The method of claim 4, wherein,
for any interface request data, acquiring cleaning instruction information corresponding to the interface request data, and adding the cleaning instruction information into the cleaning instruction set file comprises the following steps:
and if determining that the instruction information corresponding to the interface request data exists in the information engine, generating updated instruction information according to the corresponding instruction information and the interface request data, and adding the updated instruction information into the cleaning instruction set file, otherwise, setting the instruction information aiming at the interface request data, and respectively adding the set instruction information into the cleaning instruction set file and the information engine.
8. The method of claim 7, further comprising:
when determining that the instruction information corresponding to the interface request data exists in the information engine, if determining that the reliability of the corresponding instruction information is greater than a predetermined threshold, generating updated instruction information according to the corresponding instruction information and the interface request data, and adding the updated instruction information into the cleaning instruction set file, otherwise, setting the instruction information for the interface request data, and respectively adding the set instruction information into the cleaning instruction set file and the information engine.
9. The method of claim 7, wherein,
the obtaining of the cleaning instruction information corresponding to the interface request data and adding to the cleaning instruction set file further includes:
acquiring relative delay instruction information corresponding to the interface request data, and adding the relative delay instruction information into the cleaning instruction set file;
when the interface request data is the first interface request data meeting the preset requirement, setting the relative delay instruction information corresponding to the interface request data to be 0;
and when the interface request data is the data to be processed or the current data, acquiring a difference value between the starting time of the interface request data and the starting time of the first interface request data meeting the preset requirement, and taking the difference value as relative delay instruction information corresponding to the interface request data.
10. The method of claim 2, wherein,
the association relationship further includes: the interface between different services requests the incidence relation between the data;
the method further comprises the following steps: and acquiring the incidence relation between interface request data among different services according to the constructed knowledge graph, and acquiring corresponding cleaning instruction information.
11. A data-draining playback device, comprising: the device comprises a data acquisition module, an instruction acquisition module and a playback module;
the data acquisition module is used for acquiring original data to be processed, wherein the original data comprises N pieces of interface request data, and N is a positive integer greater than one;
the instruction acquisition module is used for analyzing the incidence relation between the interface request data to obtain cleaning instruction information;
and the playback module is used for conducting drainage playback according to the original data and the cleaning instruction information.
12. The apparatus of claim 11, wherein,
the association relationship comprises: the interfaces in the same service request the association relationship between the data;
and the instruction acquisition module analyzes the incidence relation between the interface request data in the same service based on an inverted index algorithm to obtain the cleaning instruction information.
13. The apparatus of claim 12, wherein,
the instruction acquisition module analyzes and searches the N pieces of interface request data in sequence according to the sequence of the acquisition time from first to last, and executes the following first processing aiming at the first piece of searched interface request data which meets the preset requirement: adding the reverse index data corresponding to the first interface request data meeting the preset requirement into a reverse index set file, acquiring the cleaning instruction information corresponding to the first interface request data meeting the preset requirement, and adding the cleaning instruction information into a cleaning instruction set file; the reverse index set file and the cleaning instruction set file are both empty initially; taking the next interface request data as the current data, wherein the next interface request data is the interface request data acquired firstly in the unprocessed interface request data, and executing the following second processing: if the incidence relation between the current data and the interface request data acquired before is determined according to the inverted index set file and the inverted index data corresponding to the current data, taking the current data as the data to be processed, and executing the following third processing: acquiring cleaning instruction information corresponding to the data to be processed, adding the cleaning instruction information into the cleaning instruction set file, and adding inverted index data corresponding to the data to be processed into the inverted index set file when the data to be processed meets the preset requirement; otherwise, taking the next interface request data as the current data, and repeatedly executing the second processing; and when all interface request data are processed, using the cleaning instruction information in the cleaning instruction set file as the obtained cleaning instruction information.
14. The apparatus of claim 13, wherein,
the instruction obtaining module is further configured to, if it is determined that there is no association between the current data and interface request data obtained before, but it is determined that the current data meets the predetermined requirement, add inverted index data corresponding to the current data to the inverted index set file, and obtain cleaning instruction information corresponding to the current data to add the cleaning instruction information to the cleaning instruction set file.
15. The apparatus of claim 14, wherein,
for any interface request data, the meeting of the predetermined requirement comprises: the request method of the interface for requesting data is to update PUT or create POST.
16. The apparatus of claim 14, wherein,
for any interface request data, the inverted index data corresponding to the interface request data comprises: an inverted index established for a predetermined parameter in the interface request data;
the instruction acquisition module is further configured to, for any interface request data, perform deduplication processing on inverted index data corresponding to the interface request data before adding the inverted index data corresponding to the interface request data to the inverted index set file.
17. The apparatus of claim 14, wherein,
and the instruction acquisition module generates updated instruction information according to the corresponding instruction information and the interface request data and adds the updated instruction information into the cleaning instruction set file if determining that the instruction information corresponding to the interface request data exists in an information engine for any interface request data, otherwise, sets the instruction information aiming at the interface request data and respectively adds the set instruction information into the cleaning instruction set file and the information engine.
18. The apparatus of claim 17, wherein,
the instruction obtaining module is further configured to, when it is determined that instruction information corresponding to the interface request data exists in the information engine, generate updated instruction information according to the corresponding instruction information and the interface request data if it is determined that the reliability of the corresponding instruction information is greater than a predetermined threshold, and add the updated instruction information to the cleaning instruction set file, otherwise, set instruction information for the interface request data, and add the set instruction information to the cleaning instruction set file and the information engine, respectively.
19. The apparatus of claim 17, wherein,
the instruction acquisition module is further used for acquiring relative delay instruction information corresponding to the interface request data and adding the relative delay instruction information into the cleaning instruction set file;
when the interface request data is the first interface request data meeting the preset requirement, setting the relative delay instruction information corresponding to the interface request data to be 0;
and when the interface request data is the data to be processed or the current data, acquiring a difference value between the starting time of the interface request data and the starting time of the first interface request data meeting the preset requirement, and taking the difference value as relative delay instruction information corresponding to the interface request data.
20. The apparatus of claim 12, wherein,
the association relationship further includes: the interface between different services requests the incidence relation between the data;
the instruction acquisition module is further used for acquiring the incidence relation between interface request data of different services according to the constructed knowledge graph and acquiring corresponding cleaning instruction information.
21. An electronic device, comprising:
at least one processor; and
a memory communicatively coupled to the at least one processor; wherein the content of the first and second substances,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of any one of claims 1-10.
22. A non-transitory computer readable storage medium having stored thereon computer instructions for causing a computer to perform the method of any one of claims 1-10.
23. A computer program product comprising a computer program which, when executed by a processor, implements the method according to any one of claims 1-10.
CN202110126137.1A 2021-01-29 2021-01-29 Data stream guiding playback method and device, electronic equipment and readable storage medium Active CN112783507B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110126137.1A CN112783507B (en) 2021-01-29 2021-01-29 Data stream guiding playback method and device, electronic equipment and readable storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110126137.1A CN112783507B (en) 2021-01-29 2021-01-29 Data stream guiding playback method and device, electronic equipment and readable storage medium

Publications (2)

Publication Number Publication Date
CN112783507A true CN112783507A (en) 2021-05-11
CN112783507B CN112783507B (en) 2023-07-25

Family

ID=75759793

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110126137.1A Active CN112783507B (en) 2021-01-29 2021-01-29 Data stream guiding playback method and device, electronic equipment and readable storage medium

Country Status (1)

Country Link
CN (1) CN112783507B (en)

Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20120290107A1 (en) * 2011-05-12 2012-11-15 John Carlson Apparatus and method for displaying state data of an industrial plant
CN107122422A (en) * 2017-04-06 2017-09-01 山东建筑大学 Service-oriented wisdom settlement real-time dataBase system and its method of work
CN107480053A (en) * 2017-07-21 2017-12-15 杭州销冠网络科技有限公司 A kind of Software Test Data Generation Method and device
CN110618983A (en) * 2019-08-15 2019-12-27 复旦大学 JSON document structure-based industrial big data multidimensional analysis and visualization method
CN110888806A (en) * 2019-11-15 2020-03-17 天津联想协同科技有限公司 Interface testing method, electronic equipment and storage medium
CN111061645A (en) * 2019-12-26 2020-04-24 中科曙光国际信息产业有限公司 Automatic interface testing method and device for application program interface
CN111400323A (en) * 2020-04-13 2020-07-10 上海东普信息科技有限公司 Data retrieval method, system, device and storage medium
CN111435344A (en) * 2019-01-15 2020-07-21 中国石油集团川庆钻探工程有限公司长庆钻井总公司 Big data-based drilling acceleration influence factor analysis model
CN112100052A (en) * 2020-08-07 2020-12-18 北京奇艺世纪科技有限公司 Interface test scene playback method and device

Patent Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20120290107A1 (en) * 2011-05-12 2012-11-15 John Carlson Apparatus and method for displaying state data of an industrial plant
CN107122422A (en) * 2017-04-06 2017-09-01 山东建筑大学 Service-oriented wisdom settlement real-time dataBase system and its method of work
CN107480053A (en) * 2017-07-21 2017-12-15 杭州销冠网络科技有限公司 A kind of Software Test Data Generation Method and device
CN111435344A (en) * 2019-01-15 2020-07-21 中国石油集团川庆钻探工程有限公司长庆钻井总公司 Big data-based drilling acceleration influence factor analysis model
CN110618983A (en) * 2019-08-15 2019-12-27 复旦大学 JSON document structure-based industrial big data multidimensional analysis and visualization method
CN110888806A (en) * 2019-11-15 2020-03-17 天津联想协同科技有限公司 Interface testing method, electronic equipment and storage medium
CN111061645A (en) * 2019-12-26 2020-04-24 中科曙光国际信息产业有限公司 Automatic interface testing method and device for application program interface
CN111400323A (en) * 2020-04-13 2020-07-10 上海东普信息科技有限公司 Data retrieval method, system, device and storage medium
CN112100052A (en) * 2020-08-07 2020-12-18 北京奇艺世纪科技有限公司 Interface test scene playback method and device

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
于明鹤;聂铁铮;李国良;: "数据管护技术及应用", 大数据, no. 06 *

Also Published As

Publication number Publication date
CN112783507B (en) 2023-07-25

Similar Documents

Publication Publication Date Title
JP2018536920A (en) Text information processing method and device
CN113343803A (en) Model training method, device, equipment and storage medium
CN112528641A (en) Method and device for establishing information extraction model, electronic equipment and readable storage medium
CN115481227A (en) Man-machine interaction dialogue method, device and equipment
CN113378855A (en) Method for processing multitask, related device and computer program product
CN115186738B (en) Model training method, device and storage medium
CN116761020A (en) Video processing method, device, equipment and medium
CN113868254B (en) Method, device and storage medium for removing duplication of entity node in graph database
CN113590447B (en) Buried point processing method and device
CN113127357B (en) Unit test method, apparatus, device, storage medium, and program product
CN113691403B (en) Topology node configuration method, related device and computer program product
CN113704256B (en) Data identification method, device, electronic equipment and storage medium
CN114969444A (en) Data processing method and device, electronic equipment and storage medium
CN112860811B (en) Method and device for determining data blood relationship, electronic equipment and storage medium
CN115454971A (en) Data migration method and device, electronic equipment and storage medium
CN112887426B (en) Information stream pushing method and device, electronic equipment and storage medium
CN112783507B (en) Data stream guiding playback method and device, electronic equipment and readable storage medium
CN113868434A (en) Data processing method, device and storage medium for graph database
CN113657468A (en) Pre-training model generation method and device, electronic equipment and storage medium
CN114254650A (en) Information processing method, device, equipment and medium
CN113239054A (en) Information generation method, related device and computer program product
CN112989066A (en) Data processing method and device, electronic equipment and computer readable medium
CN113792117B (en) Method and device for determining data update context, electronic equipment and storage medium
CN116383454B (en) Data query method of graph database, electronic equipment and storage medium
CN117743688A (en) Service providing method and device for large model scene, electronic equipment and medium

Legal Events

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