CN111367775B - Problem node positioning method, computer device, and computer-readable storage medium - Google Patents
Problem node positioning method, computer device, and computer-readable storage medium Download PDFInfo
- Publication number
- CN111367775B CN111367775B CN201811604345.2A CN201811604345A CN111367775B CN 111367775 B CN111367775 B CN 111367775B CN 201811604345 A CN201811604345 A CN 201811604345A CN 111367775 B CN111367775 B CN 111367775B
- Authority
- CN
- China
- Prior art keywords
- data
- node
- log
- determining
- node module
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 50
- 230000002159 abnormal effect Effects 0.000 claims abstract description 17
- 230000000694 effects Effects 0.000 claims description 65
- 230000015654 memory Effects 0.000 claims description 26
- 230000005540 biological transmission Effects 0.000 claims description 20
- 238000004590 computer program Methods 0.000 claims description 15
- 230000004807 localization Effects 0.000 claims description 7
- 238000007405 data analysis Methods 0.000 claims description 2
- 238000001514 detection method Methods 0.000 abstract description 2
- 238000012360 testing method Methods 0.000 description 10
- 230000009286 beneficial effect Effects 0.000 description 9
- 238000010586 diagram Methods 0.000 description 5
- 230000002349 favourable effect Effects 0.000 description 4
- 230000002085 persistent effect Effects 0.000 description 3
- 230000008569 process Effects 0.000 description 3
- 238000004458 analytical method Methods 0.000 description 2
- 230000006872 improvement Effects 0.000 description 2
- 238000007689 inspection Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000002776 aggregation Effects 0.000 description 1
- 238000004220 aggregation Methods 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 238000013480 data collection Methods 0.000 description 1
- 238000013075 data extraction Methods 0.000 description 1
- 238000013523 data management Methods 0.000 description 1
- 238000009792 diffusion process Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000005192 partition Methods 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 238000010998 test method Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/30—Monitoring
- G06F11/34—Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation ; Recording or statistical evaluation of user activity, e.g. usability assessment
- G06F11/3466—Performance evaluation by tracing or monitoring
- G06F11/3476—Data logging
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/30—Monitoring
- G06F11/34—Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation ; Recording or statistical evaluation of user activity, e.g. usability assessment
- G06F11/3466—Performance evaluation by tracing or monitoring
- G06F11/3471—Address tracing
Landscapes
- Engineering & Computer Science (AREA)
- General Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Computer Hardware Design (AREA)
- Quality & Reliability (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Debugging And Monitoring (AREA)
Abstract
The application provides a problem node positioning method, computer equipment and a computer storage medium, wherein the problem node positioning method comprises the following steps: acquiring flow relationships among a plurality of node modules; determining log data corresponding to each node module; acquiring problem data with problems, and determining a flow relation corresponding to the problem data; according to the flow relation corresponding to the problem data, the log data of each node module is reversely and sequentially determined by the node module corresponding to the problem data until the node module corresponding to the abnormal log data is determined to have a problem when the log data is judged to be abnormal. According to the technical scheme, each node module which is possibly problematic is traced back and forth along the flow from the position where the problem is found, branches irrelevant to the problem are avoided, omission and invalid detection are avoided, so that the problem node is found more quickly, the problem node positioning efficiency is improved, the positioning precision is high, and the problem scene can be reproduced.
Description
Technical Field
The present application relates to the field of testing technologies, and in particular, to a method for locating a problem node, a computer device, and a computer storage medium.
Background
In the automatic test process, various problems often occur, in order to solve the problems, firstly, the problems need to be positioned, a conventional problem positioning method is needed, or the experience of a tester is relied on, or the log at a server end is relied on to check, or the assertion in a test script is relied on, the positioning efficiency of the methods is very low, the positioning precision is poor, the problem scene is difficult to reproduce, and the positioning information of a comprehensive system cannot be provided.
Disclosure of Invention
The present application aims to solve at least one of the technical problems existing in the prior art or related art.
It is therefore an objective of the present application to provide a method for locating a problem node.
It is an object of the present application to provide a computer device.
An object of the present application is to provide a computer storage medium.
In order to achieve the above object, the present application provides a method for locating a problem node, including: acquiring flow relationships among a plurality of node modules; determining log data corresponding to each node module; acquiring problem data with problems, and determining a flow relation corresponding to the problem data; according to the flow relation corresponding to the problem data, the log data of each node module is reversely and sequentially determined by the node module corresponding to the problem data until the node module corresponding to the abnormal log data is determined to have a problem when the log data is judged to be abnormal.
According to the technical scheme, log data of each node module are determined in reverse sequence, so that each node module which is likely to be problematic is conveniently and retrospectively checked upwards along the flow from the position where the problem occurs, omission can be avoided, invalid checking is avoided, and compared with a method for searching and comparing according to the forward direction of the flow, the node module corresponding to the problem data is searched reversely, branches irrelevant to the problem can be avoided, and therefore problem nodes can be found more quickly, the searching speed of the problem nodes is improved, and further the working efficiency is improved.
Specifically, by acquiring a plurality of node modules and flow relationships among the plurality of node modules, the method is beneficial to preliminarily straightening the relationships among the node modules and determining the searching direction of the problem node; determining the corresponding log data of each node module, facilitating searching the basic data ready for comparison searching for the problem node, and facilitating problem scene reproduction according to the corresponding log data when the problem node is found; acquiring problem data with problems, determining a flow relation corresponding to the problem data, and facilitating reduction of the searching range of the problem nodes and improvement of searching efficiency and searching accuracy; according to the flow relation corresponding to the problem data, the log data of each node module is reversely and sequentially determined by the node module corresponding to the problem data, namely, starting from the position where the problem is found, each node module which is possibly problematic is searched for tracing the source upwards along the flow, so that omission can be avoided, invalid detection can be avoided, and compared with a method for searching and comparing according to the forward direction of the flow, the node module corresponding to the problem data is reversely searched for, branches irrelevant to the problem can be avoided, the problem node can be found out more quickly, and the positioning is accurate; when the log data is abnormal, the problem of the node module corresponding to the abnormal log data is determined, so that the problem node is positioned, the problem node positioning is determined according to the log data of each related node module without depending on experience of testers, the positioning is accurate, the problem scene is convenient to reproduce, and the reverse searching mode is more beneficial to quickly and accurately finding out the problem node, improving the working efficiency and providing positioning information of a comprehensive system.
In the above technical solution, the log data includes: real-time log and history data; after "determining the log data corresponding to each node module", the problem node positioning method further includes: determining a reasonable range corresponding to the real-time log according to the historical data of the node module; judging whether the real-time log of each node module is in a reasonable range or not, and generating a judging result; and determining a first preset effect corresponding to the historical data and a second preset effect corresponding to the real-time log according to the judging result.
In the technical scheme, the log data comprises real-time logs and historical data, so that specific situations when problems occur can be provided, the past scenes can be traced, and the realization of the reproduction of the problem scenes and the provision of positioning information of a comprehensive system are facilitated; determining a reasonable range corresponding to the real-time log according to the historical data of the node module; thus, a reliable judgment standard can be provided for abnormal judgment of log data; judging whether the real-time log of each node module is in a reasonable range, generating a judging result, and judging the real-time log in a simple, convenient and reliable mode.
It should be noted that the first preset effect is a predicted effect obtained based on historical data or based on big data analysis, and is equivalent to an effect corresponding to a scheme calculated according to the historical data; the second preset effect is an effect corresponding to a scheme actually set by the user; the first preset effect corresponding to the historical data and the second preset effect corresponding to the real-time log are determined according to the judging result, so that the user is facilitated to compare the beneficial degrees of the first preset effect and the second preset effect, the user is facilitated to select and optimize the scheme, and the accuracy and the positioning efficiency of the problem node positioning are improved.
In the above technical solution, determining, according to the determination result, a first preset effect corresponding to the historical data and a second preset effect corresponding to the real-time log specifically includes: if the real-time log is not in the reasonable range, providing a first preset effect corresponding to the historical data and a second preset effect corresponding to the real-time log in a preset index mode; and displaying the first preset effect and the second preset effect.
In the technical scheme, when the judgment result is that the real-time log is not in a reasonable range, and when a first preset effect corresponding to the historical data and a second preset effect corresponding to the real-time log are provided, indexing is performed in a preset indexing mode, so that a strategy effect corresponding to the historical data (namely the first preset effect) and a strategy effect corresponding to the real-time log (namely the second preset effect) can be obtained in a targeted manner, the indexing time is shortened, and the indexing efficiency is improved; in addition, through the first effect of predetermineeing of show and second predetermineeing the effect, be favorable to more convenient understanding and compare first effect and the second of predetermineeing the effect, be favorable to the user to the beneficial degree of first effect and second of predetermineeing the effect compare, the user of being convenient for selects and optimizes the scheme.
The first preset effect and the second preset effect can be displayed in a form of a chart, a video, an audio or other modes capable of informing a user.
It should be noted that, the preset index manner includes, but is not limited to, an elastic search index and a hive index.
In the above technical solution, the flow relationships between the plurality of node modules specifically include: the data is transmitted to a plurality of node modules by one node module; data is transmitted from one node module to another node module; data is transferred from a plurality of node modules to one node module.
In the technical scheme, the flow relation among the plurality of node modules comprises that one node module transmits to a plurality of node modules, or one node module transmits to another node module, or a plurality of node modules transmit to one node module, in short, the flow relation comprises many-to-one transmission, one-to-one transmission and one-to-many transmission, so that the flow relation has high data transmission efficiency and wide transmission range, is beneficial to rapid diffusion and collection of data, and improves the working efficiency.
In the above technical solution, determining, by the node modules corresponding to the problem data, log data of each node module in reverse order according to a flow relationship corresponding to the problem data, specifically includes: determining task information corresponding to the flow relation; acquiring all node modules in the flow relation and the data transmission direction of the flow relation according to the task information; and determining the node module corresponding to the problem data in all the node modules, and determining the log data of each node module by the node module corresponding to the problem data in the opposite direction of the data transmission direction.
In the technical scheme, task information corresponding to the flow relation is determined, so that all node modules and data transmission directions in the flow relation can be determined and acquired according to the task information, the range of searching for problem node positioning is narrowed, and the working efficiency is improved; determining node modules corresponding to the problem data in all node modules, namely directly determining all node modules corresponding to the problem data on the basis of the determined flow relation so as to further reduce the searching range; the log data of each node module is determined by the node module corresponding to the problem data in the opposite direction of the data transmission direction, so that a plurality of branch processes which are unnecessary to search can be avoided, and the working efficiency is improved.
In any of the above technical solutions, determining log data corresponding to each node module specifically includes: if the log data is a real-time log, collecting the real-time log corresponding to the node module through a preset log collecting tool, and storing the real-time log into a first index memory; and if the log data is the historical data, transmitting the historical data corresponding to the node module stored in the database to a second index memory through a data transmission tool.
In the technical scheme, the real-time log data are stored in the first index memory, the history data are transmitted to the second index memory, namely the real-time log data and the history data are respectively stored, so that on one hand, the two data are distinguished, the data confusion is avoided, on the other hand, the two data are quickly fetched from two different memories when being used, and the working efficiency is improved.
In any of the above technical solutions, the problem node positioning method further includes: displaying a query page and receiving a query instruction in the query page; and determining a query mode according to the query instruction, and determining a node module with a problem according to the query mode.
In the technical scheme, the query page is displayed and the query instruction in the query page is received, so that visual operation is convenient to realize, and convenience of use and operation of a user is improved; the query mode is determined according to the query instruction, and the node module with the problem is determined according to the query mode, so that the operation steps of a user are simplified, and the working efficiency is improved.
A second aspect of the present application provides a computer device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, where the processor implements the problem node positioning method according to any one of the first aspect of the present application when executing the computer program.
In this technical solution, by storing a computer program capable of executing the problem node positioning method according to any one of the first aspect on a memory, when the processor executes the computer program, the problem node positioning method is implemented, so that the purpose of quickly and accurately positioning the problem node can be achieved, and the working efficiency is improved.
A third aspect of the present application provides a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the problem node localization method of any one of the above-mentioned first aspects.
In this solution, the processor is required to implement the problem node localization method as described above by means of a computer program, which is required to be stored in a computer readable medium. The computer readable storage medium ensures that the computer program can be executed by the processor, thereby realizing the purpose of quickly and accurately positioning the problem node by the problem node positioning method and improving the working efficiency.
Additional aspects and advantages of the application will be set forth in part in the description which follows, or may be learned by practice of the application.
Drawings
FIG. 1 is a flow diagram of a method of problem node localization in accordance with one embodiment of the present application;
FIG. 2 is a flow diagram of a method of problem node localization in accordance with one embodiment of the present application;
FIG. 3 is a flow diagram of a method of problem node localization in accordance with one embodiment of the present application;
FIG. 4 is a block diagram of a problem node location method according to one embodiment of the present application;
FIG. 5 is a schematic block diagram of a computer device in accordance with one embodiment of the application.
The correspondence between the reference numerals and the component names in fig. 5 is:
1 computer equipment, 10 memory, 12 processor.
Detailed Description
In order that the above-recited objects, features and advantages of the present application will be more clearly understood, a more particular description of the application will be rendered by reference to the appended drawings and appended detailed description. It should be noted that, without conflict, the embodiments of the present application and features in the embodiments may be combined with each other.
In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present application, however, the present application may be practiced in other ways than those described herein, and therefore the scope of the present application is not limited to the specific embodiments disclosed below.
Some embodiments according to the present application are described below with reference to fig. 1 to 5.
Example 1
As shown in fig. 1, a problem node positioning method according to an embodiment of the present application includes:
step 100: acquiring flow relationships among a plurality of node modules;
the method is beneficial to preliminarily straightening the relation between the node modules and the node modules by acquiring the plurality of node modules and the flow relation among the plurality of node modules, and determining the searching direction of the problem node.
For example, in some automated admission test flows, problems occur in the single node of the test drive, and according to the problem node positioning method of the present application, a data link may be established to determine the flow relationship of each node in the test flow.
Step 102: determining log data corresponding to each node module;
by determining the corresponding log data of each node module, the basic data which is ready for comparison and searching is conveniently searched for the problem node, and when the problem node is found, the problem scene reproduction is facilitated according to the corresponding log data.
Step 104: acquiring problem data with problems, and determining a flow relation corresponding to the problem data;
the problem data with problems are obtained, the flow relation corresponding to the problem data is determined, the searching range of the problem nodes is conveniently narrowed, and the searching efficiency and the searching accuracy are improved.
Step 106: according to the flow relation corresponding to the problem data, the log data of each node module is reversely and sequentially determined by the node module corresponding to the problem data until the node module corresponding to the abnormal log data is determined to have a problem when the log data is judged to be abnormal.
The log data of each node module is reversely and sequentially determined by the node module corresponding to the problem data, namely, starting from the position where the problem is found, each node module which is possibly problematic is traced back and forth along the flow, so that omission can be avoided, invalid inspection can be avoided, and compared with a method for searching and comparing according to the forward direction of the flow, the node module corresponding to the problem data is reversely searched, branches irrelevant to the problem can be avoided, the problem node can be found more quickly, and the positioning is accurate; when the log data is abnormal, the problem of the node module corresponding to the abnormal log data is determined, so that the problem node is positioned, the problem node positioning is determined according to the log data of each related node module without depending on experience of testers, the positioning is accurate, the problem scene is convenient to reproduce, and the reverse searching mode is more beneficial to quickly and accurately finding out the problem node, improving the working efficiency and providing positioning information of a comprehensive system.
For example, in the above-mentioned automated test procedure, a single link is sent to make an error, and by reverse lookup, it is found that the reason for the abnormal order service is that the policy service is invoked, and then the policy service is found that the capacity service is invoked, and finally it is confirmed that the capacity service fails to properly allocate capacity.
Example 2
On the basis of embodiment 1, as shown in fig. 2, a problem node positioning method according to an embodiment of the present application includes:
step 200: acquiring flow relationships among a plurality of node modules;
the method is beneficial to preliminarily straightening the relation between the node modules and the node modules by acquiring the plurality of node modules and the flow relation among the plurality of node modules, and determining the searching direction of the problem node.
Step 202: determining log data corresponding to each node module;
log data of the node module comprises real-time log and historical data; by determining the corresponding log data of each node module, the base materials which are ready for comparison and searching are conveniently searched for the problem node, and when the problem node is found, the problem scene reproduction is facilitated according to the corresponding log data, particularly according to the corresponding real-time log, so that the positioning information of a more comprehensive system is provided.
Specifically, after a problem occurs in an automatic admission test flow, by establishing a data link, logs and persistent data, even cache data, of each module serving each module in a fixed scene (such as a bill), each module is a node module, the logs of each module are real-time logs in the application, the persistent data and the cache data are historical data in the application, the problem scene reproduction is facilitated through the data and the logs, and a tester can address (position) information and data records of all relevant modules in the scene through task IDs or task time, and obtain calling relations among the modules.
Step 204: determining a reasonable range corresponding to the real-time log according to historical data in log data of the node module;
thus, a reliable judgment reference can be provided for abnormal judgment of log data.
Step 206: judging whether the real-time log of each node module is in a reasonable range or not, and generating a judging result;
the judging mode is simple, convenient and reliable.
Step 208: if the real-time log is not in the reasonable range, providing a first preset effect corresponding to the historical data and a second preset effect corresponding to the real-time log in a preset index mode;
when the judgment result is that the real-time log is not in the reasonable range, the index is performed in the preset index mode when the first preset effect corresponding to the historical data and the second preset effect corresponding to the real-time log are provided, so that the strategy effect corresponding to the historical data (namely the first preset effect) and the strategy effect corresponding to the real-time log (namely the second preset effect) can be obtained in a targeted manner, the index time is shortened, and the index efficiency is improved. .
For example, in order policy adjustment testing, the new version (real-time log) may adjust parameters of the order model relative to the old version (i.e., historical data), affecting the area where the order is allocated; in the application, by utilizing the data of the matching order link, the change of the matching rate of the new version and the old version of orders in various time ranges is provided through the ES space index (namely the preset index) capability, and professional analysis is provided, wherein the result is that the matching rate within 2 kilometers of the new version is 60 percent (the second preset effect) and the matching rate within 2 kilometers of the old version is 40 percent (the first preset effect), and compared with the old version, the matching rate within 2 kilometers of the new version is obviously increased by 20 percent; in the new version, the high-scoring driver matching rate is 45% (second preset effect), in the old version, the high-scoring driver matching rate is 50% (first preset effect), compared with the old version, the high-scoring driver matching rate of the new version is slightly reduced by 5%, and therefore the new version and the old version are more prone to matching in terms of distance.
Step 210: and displaying the first preset effect and the second preset effect.
Through the first effect of predetermineeing of show and the second effect of predetermineeing, be favorable to more convenient understanding and compare first effect of predetermineeing and the second effect of predetermineeing, be favorable to the user to compare the beneficial degree of first effect of predetermineeing and second effect of predetermineeing, the user of being convenient for selects and optimizes the scheme.
The first preset effect and the second preset effect can be displayed in a form of a chart, a video, an audio or other modes capable of informing a user.
It should be noted that, the preset index manner includes, but is not limited to, an elastic search index and a hive index.
Example 3
As shown in fig. 3, a problem node positioning method according to an embodiment of the present application includes:
step 300: acquiring flow relationships among a plurality of node modules;
the method has the advantages that the flow relationships among the plurality of node modules are obtained, so that the relationships among the node modules are straightened preliminarily, and the searching direction of the problem node is determined;
step 302: judging the type of log data corresponding to each node module;
the log data of the node module comprises real-time log data and historical data, different log data can be managed separately by judging the types of the log data, data confusion is avoided, the accuracy of data management is improved, and the working efficiency is improved when the data is called.
Step 304: collecting real-time logs corresponding to the node modules through a preset log collecting tool, and storing the real-time logs into a first index memory;
the real-time logs corresponding to the node modules are collected through the preset log collecting tool, the collecting method is simple, the collecting range is small, the efficiency is high, and the problem node positioning speed is improved; and the real-time log is stored in the first index memory, so that the convenience and accuracy of data retrieval are improved.
Step 306: transmitting the historical data corresponding to the node module stored in the database to a second index memory through a data transmission tool;
the data transmission tool is used for transmitting the historical data corresponding to the node module stored in the database to the second index memory, so that the corresponding historical data can be conveniently and rapidly stored independently, the consulting range is reduced, and the data retrieval is convenient and rapid.
Among them, the index memories include, but are not limited to, the elastic search and the hive index memories.
Step 308: acquiring problem data with problems, and determining a flow relation corresponding to the problem data;
the problem data with problems are obtained, the flow relation corresponding to the problem data is determined, the searching range of the problem nodes is conveniently narrowed, and the searching efficiency and the searching accuracy are improved.
Step 310: determining task information corresponding to the flow relation;
by determining the task information corresponding to the flow relation, all the node modules and the data transmission directions in the flow relation are determined and acquired according to the task information, the range of searching for the problem node positioning is reduced, and the working efficiency is improved.
Step 312: acquiring all node modules in the flow relation and the data transmission direction of the flow relation according to the task information;
step 314: determining node modules corresponding to the problem data in all the node modules, and determining log data of each node module by the node modules corresponding to the problem data in the opposite direction of the data transmission direction;
determining node modules corresponding to the problem data in all node modules, namely directly determining all node modules corresponding to the problem data on the basis of the determined flow relation, so as to further reduce the consulting range, quicken the positioning speed of the problem node and improve the working efficiency; the log data of each node module is determined by the node module corresponding to the problem data in the opposite direction of the data transmission direction, and branches irrelevant to the problem can be avoided, so that the problem node can be found more quickly, the problem node searching speed is further improved, and the working efficiency is further improved.
Step 316: when the log data is judged to be abnormal, determining that a node module corresponding to the abnormal log data has a problem.
As shown in fig. 4, fig. 4 shows a specific architecture of the problem node positioning method according to the present embodiment, and the architecture of the present embodiment is explained as follows:
1. data sources: the method comprises the steps of dividing service logs and service data, wherein the service logs refer to service logs (namely real-time logs) in a continuous integrated test environment, and the service data refer to persistent data (namely historical data) of each service module (namely node module) in the test environment;
2. and (3) data collection: the business logs are collected through the Logstar (namely a preset log collecting tool) and then enter a data bus to be transmitted to an elastic search (namely a first index memory), and business data are downloaded into hive (a second index memory) through the sqoop (namely a data transfer tool) at regular time;
3. transmission bus: the data extraction and conversion process is realized, and the cache of the storage queues kafka and redis is provided;
4. data index: storage locations, partition modes, index modes, etc. of the defined data, and optimizes the elastic search (first index memory) and hive (second index memory) indexes to provide high-speed query performance;
5. query mode: the layer realizes feedback query modes such as data link feedback, scene restoration query, spatial index aggregation, same-ring ratio analysis and the like;
6. the results show that: query results in the form of web charts are provided.
Example 4
As shown in fig. 5, a computer device 1 according to an embodiment of the present application includes a memory 10, a processor 12, and a computer program stored on the memory and executable on the processor, the processor implementing the problem node location method of any of the above embodiments when executing the computer program.
By storing a computer program capable of executing the problem node positioning method of the above embodiment on the memory 10, when the processor 12 executes the computer program, the problem node positioning method can be implemented, so that the purpose of quickly and accurately positioning the problem node can be achieved, and the working efficiency is improved.
The technical scheme of the application is described in detail by combining the drawings, and each node module which possibly has problems is traced back and forth along the flow from the found position of the problems, so that branches irrelevant to the problems are avoided, missing and invalid inspection are avoided, the problem nodes are found more quickly, the problem node positioning efficiency is improved, the positioning precision is high, and the problem scene can be reproduced.
In the present application, the terms "first," "second," "third," and the like are used for descriptive purposes only and are not to be construed as indicating or implying relative importance; the term "plurality" means two or more, unless expressly defined otherwise. The terms "mounted," "connected," "secured," and the like are to be construed broadly, and may be, for example, fixedly connected, detachably connected, or integrally connected; "coupled" may be directly coupled or indirectly coupled through intermediaries. The specific meaning of the above terms in the present application can be understood by those of ordinary skill in the art according to the specific circumstances.
In the description of the present application, it should be understood that the directions or positional relationships indicated by the terms "upper", "lower", "left", "right", "front", "rear", etc. are based on the directions or positional relationships shown in the drawings, are merely for convenience of describing the present application and simplifying the description, and do not indicate or imply that the devices or units referred to must have a specific direction, be constructed and operated in a specific direction, and thus should not be construed as limiting the present application.
In the description of the present specification, the terms "one embodiment," "some embodiments," "particular embodiments," and the like, mean that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the present application. In this specification, schematic representations of the above terms do not necessarily refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples.
The above is only a preferred embodiment of the present application, and is not intended to limit the present application, but various modifications and variations can be made to the present application by those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in the protection scope of the present application.
Claims (8)
1. A method for locating a problem node, comprising:
acquiring flow relationships among a plurality of node modules;
determining log data corresponding to each node module;
acquiring problem data of a problem, and determining a flow relation corresponding to the problem data;
according to the flow relation corresponding to the problem data, determining the log data of each node module reversely and sequentially by the node module corresponding to the problem data until determining that the node module corresponding to the abnormal log data has a problem when judging that the log data is abnormal;
the log data includes: real-time log and history data;
after "determining the log data corresponding to each node module", the problem node positioning method further includes:
determining a reasonable range corresponding to the real-time log according to the historical data of the node module;
judging whether the real-time log of each node module is in the reasonable range or not, and generating a judging result;
determining a first preset effect corresponding to the historical data and a second preset effect corresponding to the real-time log according to the judging result;
the first preset effect is a predicted effect obtained based on the historical data or based on big data analysis, and the second preset effect is an effect corresponding to a scheme actually set by a user.
2. The method for locating a problem node according to claim 1, wherein the determining, according to the determination result, a first preset effect corresponding to the historical data and a second preset effect corresponding to the real-time log specifically includes:
if the judging result is that the real-time log is not in the reasonable range, providing a first preset effect corresponding to the historical data and a second preset effect corresponding to the real-time log in a preset index mode;
and displaying the first preset effect and the second preset effect.
3. The method for locating a problem node according to claim 2, wherein the flow relationships between the plurality of node modules specifically include:
data is transmitted to a plurality of the node modules by one of the node modules;
data is transferred from one node module to another node module;
data is transferred from a plurality of said node modules to one of said node modules.
4. The method for locating a problem node according to claim 1, wherein determining log data of each node module reversely and sequentially from the node module corresponding to the problem data according to the flow relation corresponding to the problem data specifically comprises:
determining task information corresponding to the flow relation;
acquiring all the node modules in the flow relation and the data transmission directions of the flow relation according to the task information;
and determining the node module corresponding to the problem data in all the node modules, and determining the log data of each node module by the node module corresponding to the problem data in the opposite direction of the data transmission direction.
5. The method for locating a problem node according to any one of claims 1 to 4, wherein the determining log data corresponding to each node module specifically includes:
if the log data is a real-time log, collecting the real-time log corresponding to the node module through a preset log collecting tool, and storing the real-time log into a first index memory;
and if the log data is the historical data, transmitting the historical data corresponding to the node module stored in a database to a second index memory through a data transmission tool.
6. The problem node positioning method according to any one of claims 1 to 4, characterized by further comprising:
displaying a query page and receiving a query instruction in the query page;
and determining a query mode according to the query instruction, and determining the node module with the problem according to the query mode.
7. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the problem node localization method of any one of claims 1 to 6 when the computer program is executed by the processor.
8. A computer readable storage medium having stored thereon a computer program, wherein the computer program when executed by a processor implements the problem node localization method of any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811604345.2A CN111367775B (en) | 2018-12-26 | 2018-12-26 | Problem node positioning method, computer device, and computer-readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811604345.2A CN111367775B (en) | 2018-12-26 | 2018-12-26 | Problem node positioning method, computer device, and computer-readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111367775A CN111367775A (en) | 2020-07-03 |
| CN111367775B true CN111367775B (en) | 2023-11-14 |
Family
ID=71209913
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811604345.2A Active CN111367775B (en) | 2018-12-26 | 2018-12-26 | Problem node positioning method, computer device, and computer-readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111367775B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116737511A (en) * | 2023-08-10 | 2023-09-12 | 山景智能(北京)科技有限公司 | Graph-based scheduling job monitoring method and device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104281672A (en) * | 2014-09-28 | 2015-01-14 | 网神信息技术（北京）股份有限公司 | Log data processing method and device |
| CN107643956A (en) * | 2017-08-22 | 2018-01-30 | 北京京东尚科信息技术有限公司 | The method and apparatus for positioning the abnormal origin of abnormal data |
| CN108521339A (en) * | 2018-03-13 | 2018-09-11 | 广州西麦科技股份有限公司 | A kind of reaction type node failure processing method and system based on cluster daily record |
| CN108833184A (en) * | 2018-06-29 | 2018-11-16 | 腾讯科技（深圳）有限公司 | Service fault localization method, device, computer equipment and storage medium |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20180276266A1 (en) * | 2017-03-27 | 2018-09-27 | Ca, Inc. | Correlating end node log data with connectivity infrastructure performance data |
-
2018
- 2018-12-26 CN CN201811604345.2A patent/CN111367775B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104281672A (en) * | 2014-09-28 | 2015-01-14 | 网神信息技术（北京）股份有限公司 | Log data processing method and device |
| CN107643956A (en) * | 2017-08-22 | 2018-01-30 | 北京京东尚科信息技术有限公司 | The method and apparatus for positioning the abnormal origin of abnormal data |
| CN108521339A (en) * | 2018-03-13 | 2018-09-11 | 广州西麦科技股份有限公司 | A kind of reaction type node failure processing method and system based on cluster daily record |
| CN108833184A (en) * | 2018-06-29 | 2018-11-16 | 腾讯科技（深圳）有限公司 | Service fault localization method, device, computer equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111367775A (en) | 2020-07-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US5899986A (en) | Methods for collecting query workload based statistics on column groups identified by RDBMS optimizer | |
| US11550646B2 (en) | Method of verifying access of multi-core interconnect to level-2 cache | |
| CN110688538B (en) | Cross-domain service whole-course routing penetration method and device based on big data | |
| CN106874187A (en) | code coverage collection method and device | |
| CN109491913B (en) | Battery management system testing method and system based on Internet of things | |
| CN109254907A (en) | A kind of interface testing report-generating method and system based on Java | |
| CN111181800B (en) | Test data processing method and device, electronic equipment and storage medium | |
| CN105809942A (en) | Data processing method and device for electricity information collection system | |
| CN111563014A (en) | Interface service performance test method, device, equipment and storage medium | |
| CN110096419A (en) | Acquisition methods, interface log management server and the service server of interface log | |
| CN106850316B (en) | Optical fiber terminating graphical management method and system | |
| CN111367775B (en) | Problem node positioning method, computer device, and computer-readable storage medium | |
| CN102075368A (en) | Method, device and system for diagnosing service failure | |
| CN113572656A (en) | Method and device for flexibly combining inspection items of network equipment | |
| CN113608969A (en) | Service system operation monitoring system and method | |
| CN112486780A (en) | Database performance real-time monitoring and diagnosing method and system based on message middleware | |
| CN102546235B (en) | Performance diagnosis method and system of web-oriented application under cloud computing environment | |
| CN110689246A (en) | Medical equipment maintenance management method and device, computer equipment and storage medium | |
| CN105260400A (en) | Method for processing remote monitoring data of new energy vehicle | |
| CN102855297B (en) | A kind of method of control data transmission and connector | |
| CN105373446B (en) | It is a kind of based on the system self-repairing method drilled automatically and device | |
| CN111427736A (en) | Log monitoring method, device, equipment and computer readable storage medium | |
| CN104392101A (en) | Data sharing method and data sharing device | |
| CN106921505A (en) | A kind of data handling system and method | |
| CN113239074B (en) | Physical port positioning method, physical port positioning device, electronic equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |