WO2020015114A1

WO2020015114A1 - Method for querying operating state of application, and terminal device

Info

Publication number: WO2020015114A1
Application number: PCT/CN2018/105550
Authority: WO
Inventors: 李�浩; 徐海涛
Original assignee: 平安科技（深圳）有限公司
Priority date: 2018-07-18
Filing date: 2018-09-13
Publication date: 2020-01-23
Also published as: CN109240893B; CN109240893A

Abstract

The present application relates to the technical field of computers, and provides a computer readable storage medium and a terminal device. A method comprises: obtaining a state query instruction comprising a query time and input by a user; searching a state database for state information of each component of an application corresponding to the query time; obtaining a component topology diagram of the application; and mapping the found state information of each component to the component topology diagram, generating a state topology diagram, and displaying the state topology diagram. According to the present application, the state information of each component of an application is displayed to a user in the form of a state topology diagram, and the operating state of each component can be clearly displayed to the user due to the intuitiveness and integrity of the topology diagram, thereby making it convenient for the user to know the health condition of the application as a whole.

Description

Application running state query method and terminal equipment

This application claims the priority of a Chinese patent application filed on April 9, 2018 with the application number 201810788629.5 and the name "Application Operation Status Query Method and Terminal Equipment". The entire content of the Chinese patent application is incorporated herein by reference. Applying.

Technical field

The present application relates to the field of computer technology, and in particular, to a method and a terminal device for querying an application running state.

Background technique

In the process of running an application by a smart device, the running status of various aspects of the application is usually recorded and summarized into a database. The monitoring personnel can obtain the health status of the application by querying the data in the database and the health indicators of various aspects of the application. At present, the monitoring staff can input the health indicators and time points that they want to query, and query the database for the application running status data related to the health indicators at that time point, but this query method can only query the operation of a certain aspect of the application. Status, query results cannot represent the overall health of the application.

technical problem

In view of this, the embodiments of the present application provide an application running status query method and a terminal device, so as to solve the problem that the current application running status query method can only query the running status of an application, and the query result cannot represent the overall health status of the application.

Technical solutions

A first aspect of the embodiments of the present application provides an application running status query method, including:

Obtaining a status query instruction including a query time input by a user;

Searching the state database for the state information of each component of the application corresponding to the query time;

Get the component topology diagram of the application;

Map the found status information of each component to the component topology map, generate a status topology map, and display the status topology map.

A second aspect of the embodiments of the present application provides a computer-readable storage medium, where the computer-readable storage medium stores computer-readable instructions that, when executed by a processor, implement an application running state in the first aspect Query method.

A third aspect of the embodiments of the present application provides a terminal device, including a memory, a processor, and computer-readable instructions stored in the memory and executable on the processor, where the processor executes the computer-readable Implement the following steps when instructing:

Obtaining a status query instruction including a query time input by a user;

Get the component topology diagram of the application;

Beneficial effect

Compared with the prior art, the embodiment of the present application has the beneficial effect that the state information of each component of the application corresponding to the query time is searched in the state database, and the state information of each component is mapped to the component topology diagram of the application to generate the state. The topology map shows the status information of each component of the application to the user in the form of a status topology map. Using the intuitiveness and integrity of the topology map, the operating status of each component can be clearly displayed to the user, so that the user can know the health of the application as a whole. situation.

BRIEF DESCRIPTION OF THE DRAWINGS

In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings used in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings in the following description are only for the present application. For some embodiments, for those of ordinary skill in the art, other drawings can be obtained according to these drawings without paying creative labor.

FIG. 1 is an implementation flowchart of an application running status query method according to an embodiment of the present application;

2 is an implementation flowchart of adding a state topology diagram to a first database in an application running status query method according to an embodiment of the present application;

3 is an implementation flowchart of updating a first database in an application running status query method according to an embodiment of the present application;

4 is an implementation flowchart of predicting a user's query time in the method for querying an application running state provided by an embodiment of the present application;

FIG. 5 is a schematic diagram of an application running status query device according to an embodiment of the present application; FIG.

FIG. 6 is a schematic diagram of a terminal device according to an embodiment of the present application.

Embodiments of the invention

In order to make the purpose, technical solution, and advantages of the present application clearer, the present application is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the application, and are not used to limit the application.

The embodiment of the present application obtains related data through buried point data to analyze the related data to obtain user behavior and software running status during a certain period of time during an operation, which solves the problem of obtaining data from a single buried point. The obtained operation information alone analyzes user data at a certain point, and cannot comprehensively monitor the entire use process, which causes the limitation of data analysis.

Example 1

FIG. 1 is an implementation flowchart of an application running status query method according to an embodiment of the present application, which is detailed as follows:

In S101, a status query instruction including a query time input by a user is acquired.

In this embodiment, the user can input a time before the current time to query the running status of the application at that time, and the time is the query time. For example, the query time entered by the user is 8:00 on March 8, which means that the user needs to query the running status of the application at 8:00 on March 8.

Optionally, each time corresponds to a health status value applied at that time. Establish and display the timeline, and display the health status value corresponding to each time on the timeline. The health value is used to characterize the overall health of the application. The display of the time axis and the health status value can facilitate the user to determine the time of interest for querying based on the health status value applied at each time.

In S102, state information of each component of the application corresponding to the query time is searched in a state database.

In this embodiment, the state database is used to store the collected state information of each component of the application. The status information may include the status value and alarm status of the component. The status value is the data representing the operating status of the component, which is obtained by comparing the operating parameters of the component with preset operating indicators. The alarm status can be normal, primary alarm, secondary alarm, etc., and is used to indicate the alarm level of the component's operating status.

In S103, a component topology diagram of the application is obtained.

In this embodiment, the component topology diagram is a topology diagram constructed according to a relationship between application components. The types of application components can be divided into data layer components, business logic layer components, and presentation layer components. All the components of the application can be established in advance according to the relationship between the components of different architecture layers and the mutual relationship between the components of the same architecture layer, and the component topology map can be saved. When the component topology diagram needs to be called, the pre-built component topology diagram is directly obtained.

In S104, the state information of the found components is mapped to the component topology map, a status topology map is generated, and the status topology map is displayed.

In this embodiment, the query time, the found state information of each component, and the state topology map are one-to-one correspondences. The status information of each component of the application corresponding to the query time is mapped to the component topology map, and a status topology map corresponding to the query time is generated. The state topology diagram can represent the relationship between the components of the application and the running status of each component when querying time.

In the embodiment of the present application, the status information of each component of the application corresponding to the query time is searched in the status database, and the status information of each component is mapped on the component topology map of the application to generate a status topology map, and the status information of each component of the application is represented by the status. The topology diagram is displayed to the user. Using the intuitiveness and integrity of the topology diagram, the operating status of each component can be clearly displayed to the user, so that the user can know the health status of the application as a whole.

Example 2

In S201, the state topology map and the query time are added to a first database.

In this embodiment, the first database is used to store the generated state topology map. The state topology map corresponding to the query time that the user has queried may be saved to the first database. The users can be users of the same account or users of different accounts.

In S202, if a status query instruction including the query time is obtained again, a status topology map corresponding to the query time is retrieved from the first database.

In this embodiment, the first database stores a state topology diagram that has been generated by the user and has been queried. If the user performs a state query again on the time previously queried, the state topology map corresponding to the time can be obtained from the first database.

Optionally, after obtaining the status query instruction including the query time input by the user, it is found whether there is a state topology map corresponding to the query time in the first database, and if it exists, the query time correspondence is retrieved from the first database. And displays the status topology map of the application; if it does not exist, look up the status information of the application components corresponding to the query time in the status database, obtain the component topology map of the application, and map the status information of the found components to the components On the topology map, a status topology map corresponding to the query time is generated and displayed.

In this embodiment, the saved state topology map is retrieved from the first database, which can prevent users from querying the same time point multiple times, and the process of generating the state topology map every time, thereby reducing the amount of data and processing steps in the query process. To improve query speed. The first database can be used by multiple users who do not have an account. For example, for the time point that the first user has queried, when the second user queries the time point, the corresponding saved time point can be retrieved directly from the first database. State topology map, so that the state topology map in the first database can be used by users of different accounts, increasing the utilization rate of the state topology map in the first database, and further improving the query speed.

Example 3

As an embodiment of the present application, as shown in FIG. 3, the foregoing method may further include:

In S301, the adding time and the number of retrieval times of each state topology graph in the first database are recorded.

In this embodiment, the adding time is the time when the state topology map is added to the first database. The number of retrievals is the number of times the state topology graph has been retrieved after being added to the first database. After each state topology diagram is retrieved, the number of retrievals corresponding to the state topology diagram is updated. The number of calls is an integer greater than or equal to zero. When the number of retrievals is zero, it indicates that the corresponding state topology graph has not been retrieved after being added to the first database.

In S302, the deletion time of each state topology graph is calculated according to the addition time and the number of times of retrieval of each state topology graph; the deletion time is the time point when the state topology graph is deleted from the first database.

In this embodiment, after the state topology map is added to the first database, a deletion time corresponding to the state topology map may be calculated. The deletion time of the state topology graph is the time point when the state topology graph is deleted from the first database. By setting the deletion time, the state topology map stored in the first database can be organized, the state topology map that has not been retrieved for a long time in the first database can be deleted, and the storage space is released to save the newly generated state topology map. After a state topology diagram is retrieved, the number of times the state topology diagram is retrieved is updated, and the deletion time of the state topology diagram is recalculated according to the addition time of the state topology diagram and the updated retrieval times, and the deletion time is updated. .

Optionally, each state topology map in the first database is provided with corresponding update parameters, where the update parameters may include, but are not limited to, the time of adding, recalling, and deleting the state topology map. After a state topology diagram is retrieved, the number of retrievals and the deletion time in the update parameters of the state topology diagram are updated.

Optionally, the calculating the deletion time of each state topological graph according to the adding time and the number of times of retrieval of each state topological graph includes:

t _s = t _t + a + n * b (1)

Among them, t _s is the deletion time, t _t is the addition time, n is the number of calls, a is the initial retention time, and b is the preset time parameter. The initial retention time is the retention time of the state topology graph with zero recall times in the first database. The initial retention time is used to represent the minimum retention time of a state topology graph in the first database. The preset time parameter is used to represent the influence degree of the state topology graph once retrieved on the deletion time. The initial retention time and preset time parameters can be set in advance according to actual needs, and are not limited here.

For example, a is set to 60 days and b is set to 20 days. When the state topology map A is saved to the first database at 8:00 on March 8, the record addition time is 8:00 on March 8, and the number of reads is 0. According to formula (1), the deletion time is 8:00 on May 7. If the state topology diagram A is retrieved at 11:00 on April 23, the number of retrieval calls is 1, and the deletion time is updated to 8:00 on May 27 according to the calculation result of formula (1). If the state topology graph A is not retrieved between 11:00 on April 23 and 8:00 on May 27, the state topology graph A is deleted from the first database at 8:00 on May 27.

In S303, the current time is acquired, and the state topology map with the deletion time before the current time is deleted from the first database.

In this embodiment, the deletion time of each state topology map in the first database may be compared with the current time, the first state topology map may be deleted from the first database, and the deletion time of the first state topology may exceed the current time.

Optionally, read the deletion time of each state topology map every preset time interval (such as 5 minutes), compare the current time with each deletion time, and compare the state topology of the first database with the deletion time before the current time Figure to delete.

In this embodiment, by automatically updating the deletion time of each state topology map according to the number of times each state topology map is called, and then deleting the state topology map that has not been called for a long time in the first database according to the deletion time, the first database can be guaranteed. In the case of improving the query speed, the state topology map that is not repeatedly queried is deleted in a timely manner, thereby deleting invalid data in the first database, and freeing up storage space of the first database to store the state topology map generated later.

Example 4

In S401, historical query data within a preset statistical time period is acquired.

In this embodiment, the preset statistical time period is a time period selected in advance from the time before the current time. The historical query data is related data queried by the user within a preset statistical time period. The historical query data may include, but is not limited to, the query time and the number of queries corresponding to the query time. The query count is the number of times the user has performed a status query on the query time within a preset statistical period.

In S402, a user's query time is predicted according to a preset prediction rule and the historical query data to obtain a prediction time.

In this embodiment, the predicted time is the time when the predicted user may query the status later. According to preset prediction rules and historical query data, the query time can be predicted to obtain the prediction time.

In one embodiment, the preset prediction rule may include:

Find the time point with the highest number of queries within the preset statistical time period;

Within a preset time period centered on the time point with the most number of queries, a plurality of time points are uniformly selected as the prediction time.

In this embodiment, the query times corresponding to each query time point in a preset statistical time period may be compared to select the query time point with the highest number of queries. The preset time period is determined with the query time point as the center, and multiple time points are uniformly selected as the prediction time within the preset time period. For example, if the duration of the preset time period is set to 2 days and the time point with the most queries is 11:00 on April 23, then the preset time period determined is from 11:00 on April 22 to April 24 At 11:00, a preset number of time points can be uniformly selected within a preset time period, and the time points of the preset number are all used as prediction times.

If a user queries the application running status at the same point multiple times, it indicates that the application running status at that point in time may be abnormal or the point in time is a time point that the user is interested in. Then, the user at the time point near the point in time may also later Make a query. In this embodiment, a plurality of time points are uniformly selected as the prediction time in a preset time period centered on the time point with the most query times, and the time point near the time point with the most query times is used as the prediction time point, which can improve The validity of the forecast.

In another embodiment, the preset prediction rule may include:

Dividing the preset statistical time period into a plurality of time periods;

Calculate the total number of queries in each time period;

Multiple time points are uniformly selected as a prediction time in a time period in which the total query times are the most.

In this embodiment, the total number of queries in a time period is the sum of the number of queries at each query time point in the time period. The time period with the most total query times is the time period that the user is interested in. The user may query the time point in the time period later. Therefore, multiple time points can be evenly selected in the time period with the most total query times as a prediction. time. In this embodiment, by selecting a time point within a time period in which the total number of queries is the most as a prediction time point, the effectiveness of the prediction can be improved.

In S403, a state topology map corresponding to the predicted time is generated, and the state topology map corresponding to the predicted time is saved to a second database.

In S404, if a state query instruction including the query time input by the user and the predicted time is obtained, the state topology map corresponding to the predicted time is retrieved from the second database.

In this embodiment, after the prediction time is predicted, the state topology map corresponding to the prediction time may be generated according to the state topology map generating methods in S102 to S103, and the state topology map corresponding to the prediction time may be saved to the second database. In this way, when the user query time is the predicted time, the state topology map corresponding to the predicted time can be directly retrieved from the second database.

In this embodiment, the prediction time is predicted according to historical query data and preset prediction rules, and a state topology map of the predicted time is generated and saved in a second database in advance. The state topology map can be generated in advance in a predictive manner to a certain extent. This avoids the generation process of the state topology map in the user query process, thereby reducing the amount of data and processing steps in the query process and improving the query speed. Through each time point in the historical query data, the number of queries, and preset prediction rules, the accuracy of the prediction time point can be improved and the prediction success rate can be improved.

Optionally, the state topology map of the predicted time that has been retrieved in the second database is deleted; and / or the state topology map of the second database that has not been retrieved for more than a preset period of time is deleted.

In this embodiment, by deleting the state topology map that has not been retrieved for a long time in the second database, the storage space of the second database can be released so as to store the state topology map corresponding to the predicted time that is predicted later.

In the embodiment of the present application, the status information of each component of the application corresponding to the query time is searched in the status database, and the status information of each component is mapped on the component topology map of the application to generate a status topology map, and the status information of each component of the application is expressed as The topology diagram is displayed to the user. Using the intuitiveness and integrity of the topology diagram, the operating status of each component can be clearly displayed to the user, so that the user can know the health status of the application as a whole.

It should be understood that the size of the sequence numbers of the steps in the above embodiments does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present application.

Example 5

Corresponding to the application running status query method described in the above embodiment, FIG. 5 shows a schematic diagram of an application running status query device provided by an embodiment of the present application. For convenience of explanation, only the parts related to this embodiment are shown.

Referring to FIG. 5, the device includes a first acquisition module 51, a search module 52, a second acquisition module 53, and a generation module 54.

The first obtaining module 51 is configured to obtain a status query instruction including a query time input by a user.

The searching module 52 is configured to search the state database for the state information of each component of the application corresponding to the query time.

The second obtaining module 53 is configured to obtain a component topology diagram of the application.

A generating module 54 is configured to map the found status information of each component to the component topology map, generate a status topology map, and display the status topology map.

Optionally, the apparatus further includes a processing module, the processing module is configured to:

Adding the state topology map and the query time to a first database;

If a status query instruction including the query time is obtained again, a status topology map corresponding to the query time is retrieved from the first database.

Optionally, the processing module is further configured to:

Record the adding time and calling times of each state topology graph in the first database;

Calculate the deletion time of each state topology map according to the addition time and the number of retrieval times of each state topology map; the deletion time is the time point when the state topology map is deleted from the first database;

Obtain the current time, and delete the state topology map with the deletion time before the current time from the first database.

Optionally, the processing module is further configured to:

Calculate t _s = t _t + a + n * b, where t _s is the deletion time, t _t is the addition time, n is the number of calls, a is the initial retention time, and b is the preset time parameter; the initial retention The time is the retention time of the state topology graph with zero recall times in the first database.

Optionally, the processing module is further configured to:

Obtain historical query data within a preset statistical time period;

Predicting a user's query time according to a preset prediction rule and the historical query data to obtain a prediction time;

Generating a state topology map corresponding to the predicted time, and saving the state topology map corresponding to the predicted time to a second database;

If the state query instruction including the query time input by the user is the predicted time, a state topology map corresponding to the predicted time is retrieved from the second database.

Optionally, the preset prediction rule includes:

Dividing the preset statistical time period into a plurality of time periods;

Calculate the total number of queries in each time period;

Example 6

FIG. 6 is a schematic diagram of a terminal device according to an embodiment of the present application. As shown in FIG. 6, the terminal device 6 of this embodiment includes a processor 60, a memory 61, and computer-readable instructions 62, such as a program, stored in the memory 61 and executable on the processor 60. When the processor 60 executes the computer-readable instructions 62, the steps in the foregoing method embodiments are implemented, for example, steps 101 to 104 shown in FIG. 1. Alternatively, when the processor 60 executes the computer-readable instructions 62, the functions of each module / unit in the foregoing device embodiments are implemented, for example, the functions of modules 51 to 53 shown in FIG. 5.

Exemplarily, the computer-readable instructions 62 may be divided into one or more modules / units, the one or more modules / units are stored in the memory 61 and executed by the processor 60, To complete this application. The one or more modules / units may be a series of computer-readable instruction instruction segments capable of performing specific functions, and the instruction segments are used to describe the execution process of the computer-readable instructions 62 in the terminal device 6.

The terminal device 6 may be a computing device such as a desktop computer, a notebook, a palmtop computer, and a cloud server. The terminal device may include, but is not limited to, a processor 60 and a memory 61. Those skilled in the art can understand that FIG. 6 is only an example of the terminal device 6 and does not constitute a limitation on the terminal device 6. It may include more or fewer components than shown in the figure, or combine some components or different components. For example, the terminal device may further include an input / output device, a network access device, a bus, a display, and the like.

The processor 60 may be a central processing unit (Central Processing Unit (CPU), or other general-purpose processors, digital signal processors (DSPs), and application-specific integrated circuits (Applications) Specific Integrated Circuit (ASIC), off-the-shelf Programmable Gate Array (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. A general-purpose processor may be a microprocessor or the processor may be any conventional processor or the like.

The memory 61 may be an internal storage unit of the terminal device 6, such as a hard disk or a memory of the terminal device 6. The memory 61 may also be an external storage device of the terminal device 6, such as a plug-in hard disk, a smart media card (SMC), and a secure digital (SD) provided on the terminal device 6. Card, flash card, etc. Further, the memory 61 may further include both an internal storage unit of the terminal device 6 and an external storage device. The memory 61 is configured to store the computer-readable instructions and other programs and data required by the terminal device. The memory 61 may also be used to temporarily store data that has been output or is to be output.

Those skilled in the art can clearly understand that, for the convenience and brevity of the description, only the above-mentioned division of functional units and modules is used as an example. In practical applications, the above functions can be allocated by different functional units according to needs. Module completion, that is, dividing the internal structure of the device into different functional units or modules to complete all or part of the functions described above. Each functional unit and module in the embodiment may be integrated into one processing unit, or each unit may exist separately physically, or two or more units may be integrated into one unit. The integrated unit may be hardware. It can be implemented in the form of software functional units. In addition, the specific names of the functional units and modules are only for the convenience of distinguishing from each other, and are not used to limit the protection scope of the present application. For specific working processes of the units and modules in the foregoing system, reference may be made to corresponding processes in the foregoing method embodiments, and details are not described herein again.

In the above embodiments, the description of each embodiment has its own emphasis. For a part that is not detailed or recorded in an embodiment, reference may be made to related descriptions of other embodiments.

Those of ordinary skill in the art may realize that the units and algorithm steps of each example described in connection with the embodiments disclosed herein can be implemented by electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional technicians can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application.

In the embodiments provided in this application, it should be understood that the disclosed apparatus / terminal device and method may be implemented in other ways. For example, the device / terminal device embodiments described above are only schematic. For example, the division of the modules or units is only a logical function division. In actual implementation, there may be another division manner, such as multiple units. Or components can be combined or integrated into another system, or some features can be ignored or not implemented. In addition, the displayed or discussed mutual coupling or direct coupling or communication connection may be indirect coupling or communication connection through some interfaces, devices or units, which may be electrical, mechanical or other forms.

The units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, may be located in one place, or may be distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the objective of the solution of this embodiment.

In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each of the units may exist separately physically, or two or more units may be integrated into one unit. The above integrated unit may be implemented in the form of hardware or in the form of software functional unit.

When the integrated module / unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, this application implements all or part of the processes in the methods of the above embodiments, and can also be completed by computer-readable instructions instructing related hardware. The computer-readable instructions can be stored in a computer-readable storage medium In the computer-readable instructions, when executed by a processor, the steps of the foregoing method embodiments can be implemented. The computer-readable instructions include computer-readable instruction codes, and the computer-readable instruction codes may be in a source code form, an object code form, an executable file, or some intermediate form. The computer-readable medium may include: any entity or device capable of carrying the computer-readable instruction code, a recording medium, a U disk, a mobile hard disk, a magnetic disk, an optical disk, a computer memory, a read-only memory (Read-Only Memory, ROM), Random Access Memory Memory (RAM), electrical carrier signals, telecommunication signals, and software distribution media. It should be noted that the content contained in the computer-readable medium can be appropriately increased or decreased according to the requirements of legislation and patent practice in the jurisdictions. For example, in some jurisdictions, the computer-readable medium Excludes electric carrier signals and telecommunication signals.

The above-mentioned embodiments are only used to describe the technical solution of the present application, but are not limited thereto. Although the present application has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that they can still implement the foregoing implementations. The technical solutions described in the examples are modified, or some of the technical features are equivalently replaced; and these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the application, and should be included in Within the scope of this application.

Claims

An application running status query method is characterized in that it includes:

Obtaining a status query instruction including a query time input by a user;

Searching the state database for the state information of each component of the application corresponding to the query time;

Get the component topology diagram of the application;

Map the found status information of each component to the component topology map, generate a status topology map, and display the status topology map.
The method for querying the running status of an application according to claim 1, further comprising:

Adding the state topology map and the query time to a first database;

If a status query instruction including the query time is obtained again, a status topology map corresponding to the query time is retrieved from the first database.
The method for querying the running status of an application according to claim 2, further comprising:

Record the adding time and calling times of each state topology graph in the first database;

Calculating the deletion time of each state topology map according to the addition time and the number of retrieval times of each state topology map; the deletion time is the time point when the state topology map is deleted from the first database;

Obtain the current time, and delete the state topology map with the deletion time before the current time from the first database.
The method for querying the running status of an application according to claim 3, wherein the calculating the deletion time of each state topology graph according to the addition time and the number of times of retrieval of each state topology graph comprises:

Calculate t s = t t + a + n * b, where t s is the deletion time, t t is the addition time, n is the number of calls, a is the initial retention time, and b is the preset time parameter; the initial retention The time is the retention time of the state topology graph with zero recall times in the first database.
The method for querying an application running status according to any one of claims 2 to 4, further comprising:

Obtain historical query data within a preset statistical time period;

Predicting a user's query time according to a preset prediction rule and the historical query data to obtain a prediction time;

Generating a state topology map corresponding to the predicted time, and saving the state topology map corresponding to the predicted time to a second database;

If the state query instruction including the query time input by the user is the predicted time, a state topology map corresponding to the predicted time is retrieved from the second database.
The method for querying the running status of an application according to claim 5, wherein the preset prediction rule comprises:

Find the time point with the highest number of queries within the preset statistical time period;

Within a preset time period centered on the time point with the most number of queries, a plurality of time points are uniformly selected as the prediction time.
The method for querying the running status of an application according to claim 5, wherein the preset prediction rule comprises:

Dividing the preset statistical time period into a plurality of time periods;

Calculate the total number of queries in each time period;

Multiple time points are uniformly selected as a prediction time in a time period in which the total query times are the most.
A terminal device includes a memory, a processor, and computer-readable instructions stored in the memory and executable on the processor, and is characterized in that the processor implements the computer-readable instructions as follows: step:

Obtaining a status query instruction including a query time input by a user;

Searching the state database for the state information of each component of the application corresponding to the query time;

Get the component topology diagram of the application;

Map the found status information of each component to the component topology map, generate a status topology map, and display the status topology map.
The terminal device according to claim 8, after the generating the state topology map, further comprising:

Adding the state topology map and the query time to a first database;

If a status query instruction including the query time is obtained again, a status topology map corresponding to the query time is retrieved from the first database.
The terminal device according to claim 9, further comprising:

Record the adding time and calling times of each state topology graph in the first database;

Calculating the deletion time of each state topology map according to the addition time and the number of retrieval times of each state topology map; the deletion time is the time point when the state topology map is deleted from the first database;

Obtain the current time, and delete the state topology map with the deletion time before the current time from the first database.
The terminal device according to claim 10, wherein the calculating the deletion time of each state topology graph according to the addition time and the number of times of retrieval of each state topology graph comprises:

Calculate t s = t t + a + n * b, where t s is the deletion time, t t is the addition time, n is the number of calls, a is the initial retention time, and b is the preset time parameter; the initial retention The time is the retention time of the state topology graph with zero recall times in the first database.
The terminal device according to any one of claims 9 to 11, further comprising:

Obtain historical query data within a preset statistical time period;

Predicting a user's query time according to a preset prediction rule and the historical query data to obtain a prediction time;

Generating a state topology map corresponding to the predicted time, and saving the state topology map corresponding to the predicted time to a second database;

If the state query instruction including the query time input by the user is the predicted time, a state topology map corresponding to the predicted time is retrieved from the second database.
The terminal device according to claim 12, wherein the preset prediction rule comprises:

Find the time point with the highest number of queries within the preset statistical time period;

Within a preset time period centered on the time point with the most number of queries, a plurality of time points are uniformly selected as the prediction time.
The terminal device according to claim 12, wherein the preset prediction rule comprises:

Dividing the preset statistical time period into a plurality of time periods;

Calculate the total number of queries in each time period;

Multiple time points are uniformly selected as a prediction time in a time period in which the total query times are the most.
A computer-readable storage medium storing computer-readable instructions, wherein the computer-readable instructions are implemented when a processor executes:

Obtaining a status query instruction including a query time input by a user;

Searching the state database for the state information of each component of the application corresponding to the query time;

Get the component topology diagram of the application;

Map the found status information of each component to the component topology map, generate a status topology map, and display the status topology map.
The computer-readable storage medium according to claim 15, after the generating the state topology map, further comprising:

Adding the state topology map and the query time to a first database;

If a status query instruction including the query time is obtained again, a status topology map corresponding to the query time is retrieved from the first database.
The computer-readable storage medium of claim 16, further comprising:

Record the adding time and calling times of each state topology graph in the first database;

Calculating the deletion time of each state topology map according to the addition time and the number of retrieval times of each state topology map; the deletion time is the time point when the state topology map is deleted from the first database;

Obtain the current time, and delete the state topology map with the deletion time before the current time from the first database.
The computer-readable storage medium of claim 17, wherein the calculating the deletion time of each state topology graph according to the adding time and the number of times of recalling each state topology graph comprises:

Calculate t s = t t + a + n * b, where t s is the deletion time, t t is the addition time, n is the number of calls, a is the initial retention time, and b is the preset time parameter; the initial retention The time is the retention time of the state topology graph with zero recall times in the first database.
The computer-readable storage medium according to any one of claims 15 to 18, further comprising:

Obtain historical query data within a preset statistical time period;

Predicting a user's query time according to a preset prediction rule and the historical query data to obtain a prediction time;

Generating a state topology map corresponding to the predicted time, and saving the state topology map corresponding to the predicted time to a second database;

If the state query instruction including the query time input by the user is the predicted time, a state topology map corresponding to the predicted time is retrieved from the second database.
A server includes a memory, a processor, and computer-readable instructions stored in the memory and executable on the processor, and is characterized in that, when the processor executes the computer-readable instructions, the following steps are implemented: :

Obtaining a status query instruction including a query time input by a user;

Searching the state database for the state information of each component of the application corresponding to the query time;

Get the component topology diagram of the application;

Map the found status information of each component to the component topology map, generate a status topology map, and display the status topology map.