CN111367775A - 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
- CN111367775A CN111367775A CN201811604345.2A CN201811604345A CN111367775A CN 111367775 A CN111367775 A CN 111367775A CN 201811604345 A CN201811604345 A CN 201811604345A CN 111367775 A CN111367775 A CN 111367775A
- Authority
- CN
- China
- Prior art keywords
- node
- data
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 72
- 238000003860 storage Methods 0.000 title claims abstract description 11
- 230000002159 abnormal effect Effects 0.000 claims abstract description 12
- 230000005856 abnormality Effects 0.000 claims abstract description 4
- 230000000694 effects Effects 0.000 claims description 61
- 230000008569 process Effects 0.000 claims description 22
- 230000005540 biological transmission Effects 0.000 claims description 19
- 238000004590 computer program Methods 0.000 claims description 16
- 230000004807 localization Effects 0.000 claims 1
- 238000001514 detection method Methods 0.000 abstract description 4
- 238000012360 testing method Methods 0.000 description 12
- 230000009286 beneficial effect Effects 0.000 description 7
- 238000010586 diagram Methods 0.000 description 5
- 230000002349 favourable effect Effects 0.000 description 4
- 238000010415 tidying Methods 0.000 description 4
- 230000008901 benefit Effects 0.000 description 3
- 230000002085 persistent effect Effects 0.000 description 3
- 238000004458 analytical method 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
- 238000006243 chemical reaction Methods 0.000 description 1
- 238000007405 data analysis 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
- 238000013500 data storage Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000014759 maintenance of location Effects 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 238000005192 partition Methods 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 238000013515 script Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
Images
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
Abstract
The invention provides a problem node positioning method, computer equipment and a computer storage medium, wherein the problem node positioning method comprises the following steps: acquiring a flow relation among a plurality of node modules and 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; and according to the flow relation corresponding to the problem data, the node module corresponding to the problem data reversely and sequentially determines the log data of each node module until the node module corresponding to the log data with the abnormality is determined to have the problem when the log data is judged to be abnormal. According to the technical scheme, each node module which possibly has problems is detected from the position where the problems are found in an upward tracing manner along the flow, branches irrelevant to the problems are avoided, omission and invalid detection are avoided, the problem nodes are found more quickly, the efficiency of positioning the problem nodes is improved, the positioning accuracy is high, and the problem scene can be reproduced.
Description
Technical Field
The invention relates to the technical field of testing, in particular to a problem node positioning method, computer equipment and a computer storage medium.
Background
In the automatic testing process, various problems often occur, in order to solve the problems, the problems need to be positioned firstly, and a conventional problem positioning method depends on experience of testing personnel, viewing of server-side logs or assertions in test scripts, so that the positioning efficiency of the methods is very low, the positioning accuracy is poor, problem scenes are difficult to reproduce, and positioning information of a comprehensive system cannot be provided.
Disclosure of Invention
The present invention is directed to solving at least one of the problems of the prior art or the related art.
In view of the above, an object of the present invention is to provide a problem node locating method.
It is an object of the present invention to provide a computer apparatus.
It is an object of the present invention to provide a computer storage medium.
In order to achieve the above object, a technical solution of the present invention provides a problem node positioning method, including: acquiring a flow relation among a plurality of node modules and 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; and according to the flow relation corresponding to the problem data, the node module corresponding to the problem data reversely and sequentially determines the log data of each node module until the node module corresponding to the log data with the abnormality is determined to have the problem when the log data is judged to be abnormal.
In the technical scheme, the log data of each node module is determined in sequence in a reverse mode, the problem occurrence position is convenient to follow, each node module which possibly has a problem is checked in a tracing mode along the flow, omission can be avoided, invalid checking is avoided, and for the method for searching and comparing in the forward direction of the flow, reverse searching is carried out from the node module corresponding to the problem data, branches irrelevant to the problem can be avoided, the problem node is found more quickly, the searching speed of the problem node is increased, and the working efficiency is improved.
Specifically, the method is beneficial to preliminarily tidying the relationship between the node modules and determining the searching direction of the problem node by acquiring the flow relationship among the plurality of node modules; determining log data corresponding to each node module, so that basic data ready for comparison and search can be conveniently searched for the problem node, and when the problem node is found, problem scene reproduction can be favorably carried out according to the corresponding log data; problem data with problems are obtained, and a flow relation corresponding to the problem data is determined, so that the searching range of the problem nodes is conveniently reduced, and the searching efficiency and the searching accuracy are improved; according to the flow relation corresponding to the problem data, the log data of each node module is determined in turn by the node module corresponding to the problem data in a reverse direction, namely, each node module which possibly has problems is detected from the position where the problems are found in an upward tracing manner along the flow, so that omission can be avoided, invalid detection 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 in a reverse direction, branches irrelevant to the problems can be avoided, the nodes with the problems can be found more quickly, and positioning is accurate; when the log data are judged to be abnormal, the node module corresponding to the abnormal log data is determined to have a problem, so that the problem node is positioned, the problem node is positioned without depending on the experience of testers in such a positioning mode, the problem node is determined according to the log data of each relevant node module, the positioning is accurate, the problem scene is convenient to reproduce, the problem node can be found quickly and accurately in a reverse searching mode, the working efficiency is improved, and the positioning information of a comprehensive system is provided.
In the above technical solution, the log data includes: real-time logs and historical data; after "determining 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 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 judgment 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 judgment result.
In the technical scheme, the log data comprises real-time logs and historical data, so that the specific situation when a problem occurs can be provided, the past scenes can be traced, and the problem scene can be better reproduced and the positioning information of a comprehensive system can be provided; determining a reasonable range corresponding to the real-time log according to historical data of the node module; therefore, a reliable judgment reference can be provided for the abnormal judgment of the log data; and judging whether the real-time log of each node module is in a reasonable range or not, generating a judgment result, and having a simple, convenient and reliable judgment mode.
It should be noted that the first preset effect is a predicted effect obtained based on historical data or big data analysis, and is equivalent to an effect corresponding to a scheme deduced according to the historical data; the second preset effect is an effect corresponding to a scheme actually set by a user; the beneficial degrees of the first preset effect and the second preset effect are favorably compared by the user through determining the first preset effect corresponding to the historical data and the second preset effect corresponding to the real-time log according to the judgment result, so that the user can conveniently 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 a first preset effect corresponding to the historical data and a second preset effect corresponding to the real-time log according to the determination result 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 the reasonable range, and 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 (namely the first preset effect) corresponding to the historical data and a strategy effect (namely the second preset effect) corresponding to the real-time log can be obtained, the indexing time is shortened, and the indexing efficiency is improved; in addition, through showing the first preset effect and the second preset effect, the method is favorable for more convenient understanding and comparison of the first preset effect and the second preset effect, is more favorable for the user to compare the beneficial degrees of the first preset effect and the second preset effect, and is convenient for the user to select and optimize the scheme.
The display of the first preset effect and the second preset effect can be displayed in a form of a chart, a video, an audio or the like, wherein the form of the chart, the video, the audio or the like can inform a user.
It should be noted that the preset indexing manner includes, but is not limited to, an elastic search index and a hive index.
In the above technical solution, the process relationship among the plurality of node modules specifically includes: 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 process relation among the plurality of node modules comprises that one node module transmits to the 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 process relation comprises many-to-one transmission, one-to-one transmission and one-to-many transmission.
In the above technical solution, according to the process relationship corresponding to the problem data, determining log data of each node module in reverse order by the node module corresponding to the problem data specifically includes: determining task information corresponding to the process relation; acquiring all node modules in the process relation and the data transmission direction of the process relation according to the task information; and determining a node module corresponding to the problem data in all the node modules, and determining the log data of each node module in the opposite direction of the data transmission direction by the node module corresponding to the problem data.
In the technical scheme, by determining the task information corresponding to the process relation, all node modules and data transmission directions in the process relation can be determined and obtained according to the task information, the range to be searched for positioning the problem node is narrowed, and the working efficiency is improved; determining a node module corresponding to the problem data in all node modules, namely, on the basis of the determined flow relation, directly determining all node modules corresponding to the problem data so as to further narrow the search range; the node module corresponding to the problem data determines the log data of each node module in the reverse direction of the data transmission direction, so that some branch processes which are not required to be searched are avoided, and the working efficiency is improved.
In any one 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 are historical data, transmitting the historical data which are stored in the database and correspond to the node modules to a second index memory through a data transmission tool.
In this technical scheme, through with real-time log data storage to first index memory in, with historical data transmission to the second index memory in, be about to real-time log data and historical data deposit respectively, distinguish two kinds of data on the one hand, avoid the data confusion, on the other hand calls from two different storages fast when using two kinds of data, promotes work efficiency.
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 the visual operation is convenient to realize, and the convenience in use and operation of a user is improved; and determining a query mode according to the query instruction, and determining a node module with a problem according to the query mode, so that the user operation steps are simplified, and the working efficiency is improved.
An aspect of the second aspect of the present invention 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 executes the computer program to implement the problem node locating method according to any one of the above-mentioned first aspects.
In this technical solution, a computer program that can execute the problem node location method according to any one of the above first aspect is stored in a memory, and when the processor executes the computer program, the problem node location method is implemented, so that a purpose of quickly and accurately locating a problem node is achieved, and work efficiency is improved.
An aspect of the third aspect of the present invention provides a computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the problem node locating method according to any one of the first aspect.
In this solution, the processor needs to implement the problem node locating method as described above by using a computer program, and such a computer program needs 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 invention will be set forth in part in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention.
Drawings
FIG. 1 is a flow diagram of a problem node location method according to one embodiment of the present invention;
FIG. 2 is a flow diagram of a problem node locating method according to one embodiment of the present invention;
FIG. 3 is a flow diagram of a problem node locating method according to one embodiment of the present invention;
FIG. 4 is an architectural diagram of a problem node location method according to one embodiment of the present invention;
FIG. 5 is a schematic block diagram of a computer device according to one embodiment of the present invention.
Wherein, the correspondence between the reference numbers and the names of the components in fig. 5 is:
1 computer device, 10 memory, 12 processor.
Detailed Description
So that the manner in which the above recited objects, features and advantages of the present invention can be understood in detail, a more particular description of the invention, briefly summarized above, may be had by reference to the embodiments thereof which are illustrated in the appended drawings. It should be noted that the embodiments and features of the embodiments of the present application may be combined with each other without conflict.
In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present invention, however, the present invention may be practiced in other ways than those specifically described herein, and therefore the scope of the present invention is not limited by the specific embodiments disclosed below.
Some embodiments according to the invention 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 invention includes:
step 100: acquiring a flow relation among a plurality of node modules and a plurality of node modules;
the method and the device are beneficial to preliminarily tidying the relationship between the node modules and determining the searching direction of the problem node by acquiring the flow relationship among the node modules.
For example, in some automatic admission test flows, a problem occurs in the issuing link of test driving, and according to the problem node positioning method, a data link can be established to determine the flow relation of each node in the test flow.
Step 102: determining log data corresponding to each node module;
by determining the log data corresponding to each node module, the problem node can be conveniently searched for the prepared and contrasted searched basic data, and when the problem node is found, the problem scene can be conveniently reproduced according to the corresponding log data.
Step 104: acquiring problem data with problems, and determining a flow relation corresponding to the problem data;
by acquiring the problem data with problems and determining the flow relation corresponding to the problem data, the searching range of the problem nodes is conveniently reduced, and the searching efficiency and the searching accuracy are improved.
Step 106: and according to the flow relation corresponding to the problem data, the node module corresponding to the problem data reversely and sequentially determines the log data of each node module until the node module corresponding to the log data with the abnormality is determined to have the problem when the log data is judged to be abnormal.
The log data of each node module is determined in turn by the node module corresponding to the problem data in a reverse direction, namely, each node module which possibly has a problem is detected from the position where the problem is found in an upward tracing manner along the process, 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 process, the node module corresponding to the problem data is searched in a reverse direction, so that 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 are judged to be abnormal, the node module corresponding to the abnormal log data is determined to have a problem, so that the problem node is positioned, the problem node is positioned without depending on the experience of testers in such a positioning mode, the problem node is determined according to the log data of each relevant node module, the positioning is accurate, the problem scene is convenient to reproduce, the problem node can be found quickly and accurately in a reverse searching mode, the working efficiency is improved, and the positioning information of a comprehensive system is provided.
For example, in the above automatic testing process, an error occurs in the order issuing step, and the reason for the abnormal order service is found by reverse search to invoke the policy service, and then the capacity service is found by the policy service to invoke the capacity service, and finally it is confirmed that the capacity service fails to correctly 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 invention includes:
step 200: acquiring a flow relation among a plurality of node modules and a plurality of node modules;
the method and the device are beneficial to preliminarily tidying the relationship between the node modules and determining the searching direction of the problem node by acquiring the flow relationship among the node modules.
Step 202: determining log data corresponding to each node module;
the log data of the node module comprises real-time logs and historical data; by determining the log data corresponding to each node module, the problem node can be conveniently searched for the prepared and contrasted searched basic data, and when the problem node is found, the problem scene reappearance can be favorably carried out according to the corresponding log data, particularly according to the corresponding real-time log, so that the more comprehensive positioning information can be provided.
Specifically, in the automatic admission test process, after a problem occurs, by establishing a data link, logs and persistent data or even cache data of each module serving under a fixed scene (such as issuing a bill) can be collected, each module is a node module, the logs of each module are real-time logs in the invention, the persistent data and the cache data are historical data in the invention, the problem scene can be conveniently reproduced through the data and the logs, and testers can address (position) information and data records of all related modules under the scene through task IDs or task time and obtain the call relation among the modules.
Step 204: determining a reasonable range corresponding to the real-time log according to historical data in the log data of the node module;
therefore, a reliable judgment reference can be provided for the abnormity judgment of the log data.
Step 206: judging whether the real-time log of each node module is in a reasonable range or not, and generating a judgment result;
the judgment 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, and a first preset effect corresponding to the historical data and a second preset effect corresponding to the real-time log are provided, the indexing is performed in a preset indexing mode, so that a strategy effect (namely the first preset effect) corresponding to the historical data and a strategy effect (namely the second preset effect) corresponding to the real-time log can be obtained, the indexing time is shortened, and the indexing efficiency is improved. .
For example, in the adjustment test of the order splitting strategy, the parameters of the order splitting model may be adjusted by a new version (real-time log) relative to an old version (i.e. historical data), and the area for distributing orders is affected; in the invention of the application, by using data of an order matching link and through ES space index (namely preset index) capability, changes of the order matching rate of the new version and the old version in each time range are provided, and professional analysis is provided, so that the result is probably that the matching rate of the new version within 2 kilometers is 60% (second preset effect), the matching rate of the old version within 2 kilometers is 40% (first preset effect), and compared with the old version, the matching rate of the new version within 2 kilometers is obviously increased by 20%; and in the new version, the high-grade driver matching rate is 45% (second preset effect), in the old version, the high-grade driver matching rate is 50% (first preset effect), and compared with the old version, the high-grade driver matching rate of the new version is slightly reduced by 5%, which shows that the new version is matched with the old version more in the distance advantage.
Step 210: and displaying the first preset effect and the second preset effect.
Through showing first effect and the second of predetermineeing and predetermineeing the effect, be favorable to more convenient understanding and the first effect of predetermineeing and the second of predetermineeing of comparison and predetermineeing the effect, more be favorable to the user to predetermineeing the beneficial degree of effect and the second of predetermineeing the effect and carry out the comparison, be convenient for the user to carry out selection and optimization to the scheme.
The display of the first preset effect and the second preset effect can be displayed in a form of a chart, a video, an audio or the like, wherein the form of the chart, the video, the audio or the like can inform a user.
It should be noted that the preset indexing manner includes, but is not limited to, an elastic search index and a hive index.
Example 3
As shown in fig. 3, the problem node positioning method according to an embodiment of the present invention includes:
step 300: acquiring a flow relation among a plurality of node modules and a plurality of node modules;
the method is beneficial to preliminarily tidying the relationship between the node modules and determining the searching direction of the problem node by acquiring the flow relationship among the plurality of node modules;
step 302: judging the type of the log data corresponding to each node module;
the log data of the node module comprises real-time logs and historical data, and different log data can be managed separately by judging the types of the log data, so that 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;
real-time logs corresponding to the node modules are collected through a 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 favorably improved; the real-time log is stored in the first index memory, and convenience and accuracy of data calling are improved.
Step 306: transmitting the historical data which is stored in the database and corresponds to the node module to a second index memory through a data transmission tool;
historical data stored in the database and corresponding to the node modules are transmitted to the second index memory through the data transmission tool, so that the corresponding historical data can be conveniently and rapidly stored independently, the reference range is reduced, and the data can be conveniently and rapidly called.
The index memory includes, but is not limited to, an elastic search and hive index memory.
Step 308: acquiring problem data with problems, and determining a flow relation corresponding to the problem data;
by acquiring the problem data with problems and determining the flow relation corresponding to the problem data, the searching range of the problem nodes is conveniently reduced, and the searching efficiency and the searching accuracy are improved.
Step 310: determining task information corresponding to the process relation;
by determining the task information corresponding to the flow relationship, all the node modules and the data transmission directions in the flow relationship can be determined and obtained according to the task information, the range to be searched for positioning the problem node is narrowed, and the working efficiency is improved.
Step 312: acquiring all node modules in the process relation and the data transmission direction of the process relation according to the task information;
step 314: determining a 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;
determining a node module corresponding to the problem data in all node modules, namely, on the basis of the determined flow relation, directly determining all node modules corresponding to the problem data so as to further reduce the search range, accelerate the positioning speed of the problem node and improve the working efficiency; the node module corresponding to the problem data determines the log data of each node module in the reverse direction of the data transmission direction, so that branches irrelevant to the problem can be avoided, the problem node can be found more quickly, the searching speed of the problem node is further improved, and the working efficiency is further improved.
Step 316: and when the log data are judged to be abnormal, determining that the 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. the data source is as follows: the method comprises the following steps of dividing the method into a service log and service data, wherein the service log refers to a service log (namely a real-time log) in a continuous integrated test environment, and the service data refers to persistent data (namely historical data) of each service module (namely a node module) in the test environment;
2. data collection: the service log is collected by a Logstash (namely a preset log collection tool) and then enters a data bus to be transmitted to an elastic search (namely a first index memory), and the service data is downloaded into a hive (a second index memory) at regular time through a sqoop (namely a data transfer tool);
3. a transmission bus: the data extraction and conversion processes are realized, and the cache of the storage queues kafka and redis is provided;
4. data indexing: the storage position, the partition mode, the index mode and the like of the defined data are defined, and the Elasticissearch (first index memory) and hive (second index memory) indexes are optimized to provide high-speed query performance;
5. and (3) query mode: the layer realizes the query mode of feedback, such as data link feedback, scene reduction query, spatial index aggregation, same-ring ratio analysis and the like;
6. the results show that: a web (web page) graph is provided as a query result.
Example 4
As shown in fig. 5, the computer device 1 according to an embodiment of the present invention includes a memory 10, a processor 12, and a computer program stored in the memory and running on the processor, and when the processor executes the computer program, the problem node locating method according to any of the embodiments described above is implemented.
By storing the computer program capable of executing the problem node positioning method of the above embodiment in the memory 10, the processor 12 realizes the problem node positioning method when executing the computer program, thereby achieving the purpose of quickly and accurately positioning the problem node and improving the working efficiency.
The technical scheme of the invention is explained in detail by combining the drawings, and by the technical scheme of the invention, each node module which possibly has a problem is detected from the position where the problem is found and along the flow path, the node module is traced and traced, branches irrelevant to the problem are avoided, omission and invalid detection are avoided, so that the problem node is found more quickly, the efficiency of positioning the problem node is improved, the positioning precision is high, and the problem scene can be reproduced.
In the present invention, the terms "first", "second", and "third" 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 limited otherwise. The terms "mounted," "connected," "fixed," and the like are to be construed broadly, and for example, "connected" may be a fixed connection, a removable connection, or an integral connection; "coupled" may be direct or indirect through an intermediary. The specific meanings of the above terms in the present invention can be understood by those skilled in the art according to specific situations.
In the description of the present invention, it is to be understood that the terms "upper", "lower", "left", "right", "front", "rear", and the like indicate orientations or positional relationships based on those shown in the drawings, and are only for convenience of description and simplification of description, but do not indicate or imply that the referred device or unit must have a specific direction, be constructed in a specific orientation, and be operated, and thus, should not be construed as limiting the present invention.
In the description herein, the description of the terms "one embodiment," "some embodiments," "specific embodiments," etc., means 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 invention. In this specification, the schematic representations of the terms used above 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 invention, and is not intended to limit the present invention, and various modifications and changes will occur to those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (9)
1. A problem node locating method, comprising:
acquiring a flow relation among a plurality of node modules and 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;
and according to the flow relation corresponding to the problem data, determining the log data of each node module in reverse order by the node module corresponding to the problem data until the node module corresponding to the log data with abnormality is determined to have a problem when the log data is judged to be abnormal.
2. The problem node locating method according to claim 1, wherein the log data comprises: real-time logs and historical 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 judgment 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 judgment result.
3. The method for positioning problem nodes according to claim 2, wherein the determining a first preset effect corresponding to the historical data and a second preset effect corresponding to the real-time log according to the determination result specifically includes:
if the judgment 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.
4. The problem node positioning method according to claim 3, wherein the flow relationship among the plurality of node modules specifically includes:
data is transmitted from one node module to a plurality of 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.
5. The method for positioning problem nodes according to claim 2, wherein the determining log data of each node module in reverse order by the node module corresponding to the problem data according to the process relationship corresponding to the problem data specifically includes:
determining task information corresponding to the flow relation;
acquiring all the node modules in the process relation and the data transmission direction of the process relation according to the task information;
and determining a node module corresponding to the problem data in all the node modules, and determining the log data of each node module in the opposite direction of the data transmission direction by the node module corresponding to the problem data.
6. The problem node positioning method according to any one of claims 2 to 5, 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 are historical data, transmitting the historical data which are stored in the database and correspond to the node modules to a second index memory through a data transmission tool.
7. The problem node locating method according to any one of claims 1 to 5, 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.
8. 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 7 when executing the computer program.
9. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the problem node locating method of any one of claims 1 to 7.
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 true CN111367775A (en) | 2020-07-03 |
| CN111367775B 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) |
Cited By (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 (5)
| 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 |
| US20180276266A1 (en) * | 2017-03-27 | 2018-09-27 | Ca, Inc. | Correlating end node log data with connectivity infrastructure performance data |
| CN108833184A (en) * | 2018-06-29 | 2018-11-16 | 腾讯科技（深圳）有限公司 | Service fault localization method, device, computer equipment and storage medium |
-
2018
- 2018-12-26 CN CN201811604345.2A patent/CN111367775B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104281672A (en) * | 2014-09-28 | 2015-01-14 | 网神信息技术（北京）股份有限公司 | Log data processing method and device |
| US20180276266A1 (en) * | 2017-03-27 | 2018-09-27 | Ca, Inc. | Correlating end node log data with connectivity infrastructure performance data |
| 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 |
Cited By (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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111367775B (en) | 2023-11-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Flocchini et al. | Distributed computing by mobile entities | |
| US5899986A (en) | Methods for collecting query workload based statistics on column groups identified by RDBMS optimizer | |
| US7860858B2 (en) | Closed-loop predicate analysis | |
| CN103927331B (en) | Data querying method, data querying device and data querying system | |
| EP3051715A1 (en) | Optical power data processing method, device and computer storage medium | |
| CN110096419A (en) | Acquisition methods, interface log management server and the service server of interface log | |
| CN111367775A (en) | Problem node positioning method, computer device and computer-readable storage medium | |
| CN113572656A (en) | Method and device for flexibly combining inspection items of network equipment | |
| CN113608969A (en) | Service system operation monitoring system and method | |
| CN106569054A (en) | Multi-satellite asynchronous intelligent test system | |
| CN112486780A (en) | Database performance real-time monitoring and diagnosing method and system based on message middleware | |
| CN108920523B (en) | Method, device, equipment, system and medium for querying data on block chain | |
| CN106682206A (en) | Method and system for big data processing | |
| CN115757603A (en) | Visual data modeling system and method | |
| CN108809716A (en) | A kind of method and apparatus of gathered data audit | |
| CN100462936C (en) | Universal serial bus host controller rapid testing system and method thereof | |
| CN109283899A (en) | Workpiece quality detecting method and its device, medium, digital control system and quality inspection system | |
| CN111427736A (en) | Log monitoring method, device, equipment and computer readable storage medium | |
| CN115660610A (en) | Decentralized cooperative office system and method | |
| CN110519303B (en) | Communication method and system across isolation devices | |
| CN111522681B (en) | Fault positioning method and device for WEB production system and storage medium | |
| JP2713965B2 (en) | Information collection device | |
| KR101116878B1 (en) | Information changing system of ECU | |
| JP2017111692A (en) | Sequence data management system and apparatus | |
| CN111782483A (en) | Cloud computing monitoring platform capable of elastically stretching |
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 |