CN113051446A - Topological relation query method, device, electronic equipment and medium - Google Patents
Topological relation query method, device, electronic equipment and medium Download PDFInfo
- Publication number
- CN113051446A CN113051446A CN201911366612.1A CN201911366612A CN113051446A CN 113051446 A CN113051446 A CN 113051446A CN 201911366612 A CN201911366612 A CN 201911366612A CN 113051446 A CN113051446 A CN 113051446A
- Authority
- CN
- China
- Prior art keywords
- micro service
- service node
- information
- query
- topological
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 61
- 235000019580 granularity Nutrition 0.000 claims description 35
- 230000015654 memory Effects 0.000 claims description 19
- 238000000547 structure data Methods 0.000 claims description 14
- 238000010276 construction Methods 0.000 claims description 13
- 230000001419 dependent effect Effects 0.000 claims description 6
- 239000000126 substance Substances 0.000 claims description 2
- 238000012545 processing Methods 0.000 abstract description 18
- 230000000694 effects Effects 0.000 abstract description 9
- 238000011144 upstream manufacturing Methods 0.000 abstract description 8
- 238000010586 diagram Methods 0.000 description 20
- 230000008901 benefit Effects 0.000 description 16
- 230000006870 function Effects 0.000 description 5
- 238000004891 communication Methods 0.000 description 4
- 238000004590 computer program Methods 0.000 description 4
- 230000008569 process Effects 0.000 description 4
- 230000002776 aggregation Effects 0.000 description 3
- 238000004220 aggregation Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000003993 interaction Effects 0.000 description 2
- 239000004973 liquid crystal related substance Substances 0.000 description 2
- 238000012546 transfer Methods 0.000 description 2
- 230000004931 aggregating effect Effects 0.000 description 1
- 230000001413 cellular effect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000001151 other effect Effects 0.000 description 1
- 230000001953 sensory effect Effects 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 238000006467 substitution reaction 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
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/903—Querying
- G06F16/9038—Presentation of query results
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Computational Linguistics (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The application discloses a topological relation query method, a topological relation query device, electronic equipment and a medium, and relates to the technical field of computers. The specific implementation scheme is as follows: when receiving a topology query request, reading at least one piece of information of the micro service node pairs from a pre-stored set of the micro service node pairs according to a query condition in the topology query request; the micro service node pair information comprises information of two micro service nodes with calling relation; generating topological graph expression data according to the read micro service node pair information; and drawing and displaying the topological relation graph according to the topological graph expression data. According to the method and the device, the micro service node pair information is read from the pre-stored micro service node pair set, so that the topological graph expression data is generated, and the topological relation is drawn according to the topological graph expression data, so that the node information and the upstream and downstream relations do not need to be summarized in real time, the query performance is improved, the data real-time processing cluster does not need to be established, and the effect of resource overhead is reduced.
Description
Technical Field
The present application relates to the field of computer technologies, and in particular, to an information retrieval technology, and in particular, to a method and an apparatus for querying a topological relation, an electronic device, and a medium.
Background
At present, many service applications are realized on complex and large-scale distributed clusters. The business application is constructed on different JAVA microservice modules, and the modules have different architectures, large application number, large module request amount and complicated and variable calling chains. In actual service, a user needs to query the topology calling relationship of the micro service modules to analyze the traffic source and the performance bottleneck.
The existing topology calling relationship query method mainly comprises two types: (1) and drawing a topological relation by summarizing the node information and the upstream and downstream relations in real time. (2) And establishing a data real-time processing cluster for creating a tree structure among nodes aiming at the data records of the generated call chain in real time and storing the tree structure in a database. And summarizing a plurality of call chains in real time during query so as to draw a topological relation.
The first method has extremely low query performance, and is difficult to return query results in a minute level, while the second method has high resource overhead and slow speed of summarizing call chains, so that the query performance is not ideal.
Disclosure of Invention
The application provides a topological relation query method, a device, electronic equipment and a medium, which are used for improving the performance of querying the topological relation and reducing the resource overhead of querying the topological relation.
In a first aspect, an embodiment of the present application provides a topological relation query method, where the method includes:
when a topology query request is received, reading at least one piece of information of the micro service node pairs from a pre-stored set of the micro service node pairs according to a query condition in the topology query request; the micro service node pair information comprises information of two micro service nodes with calling relation;
generating topological graph expression data according to the read micro service node pair information;
and drawing and displaying a topological relation graph according to the topological graph expression data.
One embodiment in the above application has the following advantages or benefits: the micro service node pair information is read from the pre-stored micro service node pair set, so that the topological graph expression data is generated, and the topological relation is drawn according to the topological graph expression data, so that the node information and the upstream and downstream relation are not required to be summarized in real time, the query performance is improved, the data real-time processing cluster is not required to be established, and the effect of resource overhead is reduced.
Optionally, the query condition includes at least one of time condition information, a base node, and topology depth information.
One embodiment in the above application has the following advantages or benefits: by taking at least one of the time condition information, the basic node and the topology depth information as the query condition, it is ensured that at least one piece of information of the micro service node pairs can be read from a pre-stored set of the micro service node pairs according to the query condition.
Optionally, reading at least one piece of information of the micro service node pairs from a pre-stored set of micro service node pairs according to a query condition in the topology query request, where the information includes:
determining query time granularity and a query time range according to the time condition information, and reading at least one database table corresponding to the query time granularity and the query time range from a database;
and inquiring the information of each micro service node pair associated with the basic node from each read database table according to the basic node and the topology depth information.
One embodiment in the above application has the following advantages or benefits: the corresponding at least one database table is read according to the query time granularity and the query time range contained in the time condition information, and the micro service node pair information is obtained by querying from the read database table according to the basic node and the topology depth information, so that a data base is laid for generating topology map expression data according to the micro service node pair information in the follow-up process.
Optionally, generating topology graph expression data according to the read micro service node pair information includes:
constructing a left topological data structure and a right topological data structure which take the basic nodes as the center based on the read micro service node pair information and the topological construction dimension information contained in the topological query request;
constructing an external dependency data structure of the base node, the external dependency data structure including data of an external service invoked by the base node;
generating topological graph representation data based on the left topological data structure, the right topological data structure and the external dependency data structure.
One embodiment in the above application has the following advantages or benefits: the method comprises the steps of constructing a left topological data structure and a right topological data structure which take a basic node as a center, constructing an external dependency data structure of the basic node, and finally generating topological graph expression data based on the left topological data structure, the right topological data structure and the external dependency data structure, so that necessary data required for drawing a topological relation graph are generated, and a data base is laid for drawing and displaying the topological relation graph according to the topological graph expression data.
Optionally, the method further includes:
when an index data query request is received, reading at least one piece of information of the micro service node pairs from a pre-stored set of the micro service node pairs according to a query condition in the index data query request;
inquiring the information of each micro service node pair which is associated with the basic node in the index data inquiry request and the index data of which meets the index condition in the index data inquiry request from the read information of at least one micro service node pair;
and summarizing the index data of the information of each inquired micro service node, and generating an inquiry result according to the summarized result.
One embodiment in the above application has the following advantages or benefits: according to the query condition in the index data query request, the micro service node pair information is read from the pre-stored micro service node pair set, the micro service node pair information which is associated with the basic node and the index data of which meets the index condition is queried from the micro service node pair information, and finally the queried index data of each micro service node pair is summarized to obtain the index data query result, so that the query effect of the index data of the micro service node pair associated with the basic node is realized, and the requirement of a user for analyzing the index data is met.
Optionally, the metric data includes at least one of HTTP traffic, RPC traffic, and DB dependent traffic.
One embodiment in the above application has the following advantages or benefits: and at least one of the HTTP traffic, the RPC traffic and the DB dependent traffic is used as index data, so that at least one of the HTTP traffic, the RPC traffic and the DB dependent traffic of each micro-service node pair associated with the base node can be queried subsequently.
Optionally, the method further includes:
acquiring original acquisition data generated in a current period according to a preset period, wherein the original acquisition data comprises node structure data of each micro service node in each calling chain generated in the current period;
and acquiring micro service node pair information generated in the current period by performing index summarization on the same nodes in the acquired original acquired data, and storing the micro service node pair information into a set of micro service node pairs.
One embodiment in the above application has the following advantages or benefits: the method comprises the steps of acquiring original acquisition data according to a preset period, performing index summarization on the same nodes in the original acquisition data, acquiring micro service node pair information, finally storing the acquired micro service node pair information into a set of micro service node pairs, and storing the micro service node pair information, so that when a topology query request is subsequently received, the micro service node pair information can be directly read from the stored set of micro service node pairs, query of a topology relationship is further realized, the node information and upstream and downstream relationships do not need to be summarized in real time, the query performance is improved, a data real-time processing cluster does not need to be established, and the effect of resource overhead is reduced.
Optionally, storing the micro service node pair information into a set of micro service node pairs, including:
and creating database tables corresponding to different time granularities based on the micro service node pair information, wherein each database table stores the micro service node pair information corresponding to the time granularities.
One embodiment in the above application has the following advantages or benefits: by creating database tables corresponding to different time granularities, a data base is laid for reading the database tables corresponding to the time granularities according to the query time granularities in the topology query process.
In a second aspect, an embodiment of the present application further discloses a device for querying a topological relation, where the device includes:
the micro service node pair information reading module is used for reading at least one piece of micro service node pair information from a pre-stored set of micro service node pairs according to the query condition in the topology query request when receiving the topology query request; the micro service node pair information comprises information of two micro service nodes with calling relation;
the topological graph expression data generation module is used for generating topological graph expression data according to the read micro service node pair information;
and the topological relation graph drawing module is used for drawing and displaying a topological relation graph according to the topological relation graph expression data.
In a third aspect, an embodiment of the present application further discloses an electronic device, including:
at least one processor; and
a memory communicatively coupled to the at least one processor; wherein the content of the first and second substances,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the topological relation query method of any of the embodiments of the present application.
In a fourth aspect, the present application further discloses a non-transitory computer-readable storage medium storing computer instructions for causing a computer to execute the topological relation query method according to any embodiment of the present application.
Other effects of the above-described alternative will be described below with reference to specific embodiments.
Drawings
The drawings are included to provide a better understanding of the present solution and are not intended to limit the present application. Wherein:
FIG. 1A is a schematic diagram of a tree structure according to a first embodiment of the present application;
FIG. 1B is a schematic diagram of a topological relationship diagram in accordance with a first embodiment of the present application;
FIG. 1C is a schematic illustration of a topological relationship statistic in accordance with a first embodiment of the present application;
fig. 1D is a schematic flowchart of a topological relation query method according to a first embodiment of the present application;
FIG. 1E is a schematic diagram of a call chain according to a first embodiment of the present application;
fig. 2A is a schematic flowchart of a topological relation query method according to a second embodiment of the present application;
FIG. 2B is a schematic diagram of a topological relationship diagram in accordance with a second embodiment of the present application;
fig. 3 is a schematic structural diagram of a topological relation query apparatus according to a third embodiment of the present application;
fig. 4 is a block diagram of an electronic device for implementing a topological relation query method according to an embodiment of the present application.
Detailed Description
The following description of the exemplary embodiments of the present application, taken in conjunction with the accompanying drawings, includes various details of the embodiments of the application for the understanding of the same, which are to be considered exemplary only. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the present application. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.
Two existing topological relation query methods include:
(1) after receiving a query request, reading node structure data within a certain time range from a database according to query conditions in the query request, creating a tree structure among nodes according to the read node structure data, as shown in fig. 1A, the tree structure is a schematic diagram of a tree structure, then aggregating values of called times, average consumed time and the like of the same node in each tree structure, and finally drawing a corresponding topology calling relationship of a base point based on an aggregation result for display, as shown in fig. 1B, the topology calling relationship is a schematic diagram of a topology relationship diagram. When the user clicks one of the arrows, more specific statistical data is shown, for example, fig. 1C is a schematic diagram of the topological relation statistical data. The topological relation query method is extremely low in query performance, and the query result is difficult to return to a minute level for a large-scale call chain.
(2) And adding a data processing cluster for creating a tree structure among nodes aiming at the node structure data of the generated call chain in real time and storing the tree structure in a database. And after receiving the query request, performing aggregation processing on the tree structures within a certain time range according to the query conditions, and drawing a corresponding topology calling relationship based on an aggregation result for displaying. The performance of the scheme is improved compared with the scheme (1), but a data processing cluster is needed to be arranged in front, in order to return a processing result in real time, the scale of the data processing cluster is in direct proportion to the scale of the call chain, the resource overhead is high, and in addition, the performance of summarizing ten thousand-level call chains in real time is also low.
Example one
Fig. 1D is a schematic flowchart of a topological relation query method according to an embodiment of the present application. The embodiment is suitable for the condition of querying the topology invoking relationship of the microservice node, and can be executed by the topology relationship querying device provided by the embodiment of the application, and the device can be implemented in a software and/or hardware manner. As shown in fig. 1, the method may include:
s101, when a topology query request is received, reading at least one piece of information of the micro service node pairs from a pre-stored set of the micro service node pairs according to a query condition in the topology query request; the information of the micro service node pair comprises information of two micro service nodes with calling relation.
The micro service node represents a method for realizing a certain technical effect, such as music playing, route navigation, transfer remittance or text input, belonging to the micro service node, and the micro service node is configured in an application, the application comprises a software application or a system application, and the like, for example, an entertainment application A is configured with a micro service node 'music playing'; the map application B is configured with a micro-service node 'route navigation'; the financial application C is configured with a micro service node 'transfer remittance'; social application D is configured with a microservice node "text entry". There may be a call relationship between micro service nodes configured in different applications or between micro service nodes configured in the same application, for example, a "route navigation" micro service node of application a needs to call a "GPS (Global Positioning System)" micro service node of application B; for another example, the "pay" micro service node of application C needs to call the "authentication" micro service node of application C to realize the "pay" micro service node. The microservice node pair information includes information of two microservice nodes having a calling relationship, for example, the microservice node pair a includes information that the microservice node a calls the microservice node B. Topology query essentially queries the calling topology relations between the microserver nodes.
Specifically, after receiving a topology query request carrying a query condition, reading at least one piece of information of the micro service node pair from a pre-stored set of the micro service node pairs according to the query condition.
Optionally, the query condition includes at least one of time condition information, a base node, and topology depth information. The time condition information comprises query time granularity and a query time range; the basic node represents a target micro service node of a topology query request for querying a topology relation, for example, if the basic node in the query condition is a micro service node A, the basic node indicates that the topology query request needs to query a calling topology relation between the micro service node A and other micro service nodes; the topology depth information indicates the number of layers of the topology relation to be queried by the topology query request, for example, if the topology depth information is "1", the number of layers of the topology relation to be queried by the topology query request is 1, for example, "micro service node a" calls "micro service node B" or "micro service node C" calls "micro service node a", both of which indicate the 1-layer topology relation; for example, if the topology depth information is "2", it indicates that the number of layers of the topology relation to be queried by the topology query request is 2, for example, "micro service node a" calls "micro service node B", and "micro service node B" calls "micro service node C", which indicates a 2-layer topology relation.
According to the query condition in the topology query request, at least one piece of micro service node pair information is read from the pre-stored set of micro service node pairs, and a data base is laid for subsequently generating topology map expression data according to the micro service node pair information.
And S102, generating topological graph expression data according to the read micro service node pair information.
The topological graph expression data embodies a description data structure of each micro service node, a description data structure between each micro service node pair and a calling topological data structure between each micro service node.
Specifically, according to the information of each micro service node pair read in S101, a calling topology data structure between each micro service node and a description data structure of each micro service node and each micro service node pair are constructed; and generating topological graph expression data according to the calling topological data structure and the description data structure. Wherein, the micro service node pair information includes: the method comprises the steps of source micro service node identification, target micro service node identification, source application identification, target application identification, source micro service node name, target micro service node name, index data, calling times, calling error times and calling time consumption. Correspondingly, the description data of each micro service node optionally includes: the identification of the micro service node, the name of the micro service node and index data; the description data of each micro-service node pair optionally includes: source node identification, destination node identification, index data, calling times, calling error times and calling time consumption. The micro service node pair information may be stored in the form of fields in the following table:
| field(s) | Type (B) | Means of | Examples of such applications are |
| source_method_id | Int | Source microservice node identification | 123 |
| dest_method_id | Int | Destination micro-service node identification | 123 |
| source_app_id | Int | Source application identification | |
| dest_app_id | Int | Destination application identification | |
| source_method_name | Int | Source microservice node name | |
| dest_method_name | Int | Destination microservice node name | |
| type | Int | Index data | rpc、http |
| pv | Int | Number of calls | |
| errorpv | Int | Number of calls made | |
| cost | time_date | Calling is time consuming |
The embodiment also provides a code expression form of the topological graph expression data, which is as follows:
the topological graph expression data are generated according to the read micro service node pair information, and a data foundation is laid for drawing and displaying a topological relation graph according to the topological graph expression data in the follow-up process.
S103, drawing and displaying a topological relation graph according to the topological graph expression data.
Specifically, calling topology data and description data in the topology graph expression data are visualized, a topology relation graph of each micro service node is drawn, and the topology relation graph is displayed for a user sending a topology query request to check.
The topological relation graph is drawn and displayed according to the topological graph expression data, so that a user sending the topological query request can more intuitively and clearly check the topological relation graph of each micro-service node, and the topological query operation is completed.
According to the technical scheme provided by the embodiment of the application, the micro service node pair information is read from the pre-stored micro service node pair set, so that the topological graph expression data is generated, and the topological relation is drawn according to the topological graph expression data, so that the node information and the upstream and downstream relation are not required to be summarized in real time, the query performance is improved, a data real-time processing cluster is not required to be established, and the effect of resource overhead is reduced.
On the basis of the above embodiment, the method further includes:
A. and acquiring original acquisition data generated in the current period according to a preset period, wherein the original acquisition data comprises node structure data of each micro service node in each calling chain generated in the current period.
Wherein, the call chain refers to a complete processing path of a service request passing through a plurality of processing links of the distributed system, each path includes at least one processing node, namely a microservice node, fig. 1E is a schematic diagram of a call chain, wherein 100, 101, 102 and 103 represent four different microservice nodes, 104 and 105 represent two different applications, as shown in fig. 1E, 100 calls 101,101 calls 102 and 103, 100 and 101 belong to applications 104,102 and 103 and belong to application 105, respectively. Each micro service node records the node structure data associated with the call after generating the call relation. The node structure data is stored in a KV non-relational database.
The node structure data of the micro service node comprises node structure data acquisition time, micro service node identification, father micro service node identification, affiliated application identification, calling time consumption, calling result information and whether the node structure data are the entry nodes of the affiliated applications.
The node structure data may be stored in the form of fields in the following table:
optionally, the node structure data of each micro service node in the current period is acquired according to a preset period, for example, one hour or one day.
B. And acquiring micro service node pair information generated in the current period by performing index summarization on the same nodes in the acquired original acquired data, and storing the micro service node pair information into a set of micro service node pairs.
Specifically, according to any micro service node identifier in the original collected data and a parent micro service node identifier of the micro service node, index collection is carried out on the same node, micro service node pair information generated in the current period is obtained, and the micro service node pair information is stored in a set of micro service node pairs.
Optionally, storing the micro-service node pair information into the set of micro-service node pairs includes: and creating database tables corresponding to different time granularities based on the micro service node pair information, wherein each database table stores the micro service node pair information corresponding to the time granularities. Wherein the time granularity comprises at least one of minutes, hours, days.
For example, assuming that the current period is from 0 point to 24 points and the time granularity is hour, the micro service node pair information of each hour is respectively stored in 24 database tables from 0 point to 24 points; assuming that the current period is from 0 point to 3 points, and the time granularity is minutes and hours, from 0 point to 3 points, the micro service node pair information of each minute is respectively stored in 180 database tables, and the micro service node pair information of each hour is respectively stored in 3 database tables.
The method comprises the steps of acquiring original acquisition data according to a preset period, performing index summarization on the same nodes in the original acquisition data, acquiring micro service node pair information, finally storing the acquired micro service node pair information into a set of micro service node pairs, and storing the micro service node pair information, so that when a topology query request is subsequently received, the micro service node pair information can be directly read from the stored set of micro service node pairs, query of a topology relationship is further realized, the node information and upstream and downstream relationships do not need to be summarized in real time, the query performance is improved, a data real-time processing cluster does not need to be established, and the effect of resource overhead is reduced.
On the basis of the above embodiment, the method further includes:
A. when an index data query request is received, reading at least one piece of information of the micro service node pairs from a pre-stored set of the micro service node pairs according to a query condition in the index data query request.
The query condition in the index data query request comprises query time granularity. The query time granularity includes at least one of minutes, hours, and days.
Illustratively, assuming that the query time granularity of the query condition is "hour", at least one database table corresponding to the time granularity "hour" is read from the database, and at least one micro service node pair information is obtained by querying the obtained database table.
B. And inquiring the information of each micro service node pair which is associated with the basic node in the index data inquiry request and the index data of which meets the index condition in the index data inquiry request from the read information of at least one micro service node pair.
The index condition in the index data query request may optionally include that the index data is greater than or equal to an index data threshold value, or the index data is smaller than the index data threshold value, and the index condition may also be a limitation on the source application identifier or the destination application identifier, for example, the limitation "destination application identifier is 111", and the "source application identifier" is equal to the "destination application identifier"; another example is that "destination application id" is 111 ", and the target data after the" destination application id "is inverted and equal to the" source application id "includes at least one of HTTP traffic, RPC traffic, and DB-dependent traffic.
For example, assuming that the base node is "micro service node a", the index data is "HTTP traffic", and the index condition is that the index data is greater than or equal to 100GB, the micro service node pair information associated with "micro service node a" and "HTTP traffic" greater than or equal to 100GB is queried from the read at least one piece of micro service node pair information.
C. And summarizing the index data of the information of each inquired micro service node, and generating an inquiry result according to the summarized result.
Specifically, the inquired micro service nodes collect the index data of the information, the collected result is visualized, an index data table is generated, and the index data table is returned to the user sending the index data inquiry request for viewing.
According to the query condition in the index data query request, the micro service node pair information is read from the pre-stored micro service node pair set, the micro service node pair information which is associated with the basic node and the index data of which meets the index condition is queried from the micro service node pair information, and finally the queried index data of each micro service node pair is summarized to obtain the index data query result, so that the query effect of the index data of the micro service node pair associated with the basic node is realized, and the requirement of a user for analyzing the index data is met.
Example two
Fig. 2A is a schematic flowchart of a topological relation query method according to a second embodiment of the present application. The embodiment provides a specific implementation manner for the above embodiment, and as shown in fig. 2, the method may include:
s201, when a topology query request is received, determining query time granularity and a query time range according to time condition information in query conditions, and reading at least one database table corresponding to the query time granularity and the query time range from a database.
In the database, each database table is created according to different time granularities, and correspondingly, each database table stores micro service node pair information corresponding to the time granularities.
Specifically, at least one database table matching the query time granularity and the query time range is read from the database.
For example, assuming that the query time granularity is "hour" and the query time range is "0 point to 5 points", the database tables with the time of "0 point to 1 point", "1 point to 2 points", "2 point to 3 points", "3 point to 4 points", and "4 point to 5 points" are read from the database.
S202, inquiring the information of each micro service node pair associated with the basic node from each read database table according to the basic node and the topology depth information in the inquiry condition.
For example, assuming that the base node is "micro service node a" and the topology depth information is "1", querying each piece of micro service node pair information directly associated with the base node from each read database table, for example, regarding "source micro service node identifier" and "destination micro service node identifier" as micro service node pair information of "micro service node a" and "micro service node B", respectively, as a query result; for example, the micro service node pair information of which the "source micro service node identifier" and the "destination micro service node identifier" are the "micro service node C" and the "micro service node a" respectively is used as a query result.
Illustratively, assuming that the base node is "micro service node a" and the topology depth information is "2", the read database tables are queried for micro service node pair information directly and indirectly associated with the base node, such as micro service node pair information in which "source micro service node identifier" and "destination micro service node identifier" are "micro service node a" and "micro service node B", respectively, and micro service node pair information in which "source micro service node identifier" and "destination micro service node identifier" are "micro service node B" and "micro service node C", respectively, as a result of one-time query.
Illustratively, assuming that the base node is "micro service node a" and the topology depth information is "3", the read database tables are queried for micro service node pair information directly and indirectly associated with the base node, such as micro service node pair information that "source micro service node identifier" and "destination micro service node identifier" are "micro service node a" and "micro service node B", respectively, and micro service node pair information that "source micro service node identifier" and "destination micro service node identifier" are "micro service node B" and "micro service node C", respectively, and micro service node pair information that "source micro service node identifier" and "destination micro service node identifier" are "micro service node C" and "micro service node D", respectively, as a one-time query result.
S203, constructing dimension information based on the read micro service node pair information and the topology included in the topology query request, and constructing a left topology data structure and a right topology data structure which take the basic node as the center.
The topology construction dimension information optionally comprises a micro service node dimension, an application dimension and a micro service node and application dimension. If the topology construction dimension information is 'micro service node dimension', only micro service nodes with calling relation with the basic nodes are included in the left topology data structure and the right topology data structure; if the topology construction dimension information is 'application dimension', only the applications having calling relations with the base nodes are included in the left topology data structure and the right topology data structure; if the topology construction dimension information is 'micro service node and application dimension', the left topology data structure and the right topology data structure comprise the micro service nodes with calling relation with the base nodes and the application with calling relation with the base nodes.
Specifically, based on the read "source micro service node identifier", "destination micro service node identifier", "source application identifier", and "destination application identifier" in each micro service node pair information, a left topology data structure and a right topology data structure centered on the base node are constructed according to the topology construction dimension information included in the topology query request, where the left topology data structure includes the "micro service node" and/or "application" that called the base node, and the right topology data structure includes the "micro service node" and/or "application" that is called by the base node.
Exemplarily, assuming that the topology construction dimension information is a "micro service node and an application dimension", the base node is a "micro service node a", and the "source micro service node identifier" and the "destination micro service node identifier" in the read at least one piece of micro service node pair information are respectively a "micro service node B" and a "micro service node a"; and if the source application identifier and the destination application identifier are respectively application B and application A, the micro service node B and the application B are used as a left topological data structure taking the micro service node A as the center.
Exemplarily, assuming that the topology construction dimension information is a "micro service node and an application dimension", the base node is a "micro service node a", and the "source micro service node identifier" and the "destination micro service node identifier" in the read at least one piece of micro service node pair information are respectively a "micro service node a" and a "micro service node C"; and if the source application identifier and the destination application identifier are respectively application A and application C, taking the micro service node C and the application C as a right topological data structure taking the micro service node A as the center.
S204, constructing an external dependency data structure of the basic node, wherein the external dependency data structure comprises data of external services called by the basic node.
The data of the external service called by the base node represents an external interface called by the base node or an external function.
Specifically, data of an external service called by a base node is obtained from a calling chain, and an external dependency data structure of the base node is constructed according to the data of the external service.
S205, generating topological graph expression data based on the left topological data structure, the right topological data structure and the external dependency data structure.
Specifically, a left topological data structure and a right topological data structure which take a basic node as a center and an external dependency data structure of the basic node are summarized and topological graph expression data are generated.
And S206, drawing and displaying a topological relation graph according to the topological graph expression data.
FIG. 2B is a schematic diagram of a topological relational diagram, wherein 200 represents a base node, 201, 202 and 203 represent three microservice nodes invoking the base node 200, 204 represents an application invoking the base node 200, and 201, 202, 203 and 204 form a left topological data structure 205 of the base node 200; 206. 207 and 208 represent three microservice nodes invoked by the base node 200, 209 represents applications invoked by the base node 200, 206, 207, 208 and 209 constitute a right topology data structure 210 of the base node 200, 211 represents data of external services invoked by the base node 200, i.e. an external dependency data structure.
According to the technical scheme provided by the embodiment of the application, by reading at least one corresponding database table from the database according to the query time granularity and the query time range, and inquiring the information of each micro service node pair associated with the basic node according to the basic node and the topology depth information, further, based on the information of each micro service node pair and the topological construction dimension information, a left topological data structure and a right topological data structure which are centered on the basic node are constructed, and constructing an external dependency data structure of the base node, finally generating topological graph expression data based on the left topological data structure, the right topological data structure and the external dependency data structure, and a topological relation graph is drawn for showing, so that the node information and the upstream and downstream relation are not required to be summarized in real time, the query performance is improved, a data real-time processing cluster is not required to be established, and the resource overhead is reduced.
EXAMPLE III
Fig. 3 is a schematic structural diagram of a topological relation query device 30 according to a third embodiment of the present application, which is capable of executing a topological relation query method according to any embodiment of the present application, and has functional modules and beneficial effects corresponding to the execution method. As shown in fig. 3, the apparatus may include:
the micro service node pair information reading module 31 is configured to, when receiving a topology query request, read at least one piece of micro service node pair information from a pre-stored set of micro service node pairs according to a query condition in the topology query request; the micro service node pair information comprises information of two micro service nodes with calling relation;
the topological graph expression data generation module 32 is used for generating topological graph expression data according to the read information of the microservice node pairs;
and the topological relation diagram drawing module 33 is configured to draw and display a topological relation diagram according to the topological relation diagram expression data.
On the basis of the above embodiment, the query condition includes at least one of time condition information, a base node, and topology depth information.
On the basis of the foregoing embodiment, the micro service node pair information reading module 31 is specifically configured to:
determining query time granularity and a query time range according to the time condition information, and reading at least one database table corresponding to the query time granularity and the query time range from a database;
and inquiring the information of each micro service node pair associated with the basic node from each read database table according to the basic node and the topology depth information.
On the basis of the foregoing embodiment, the topology map expression data generation module 32 is specifically configured to:
constructing a left topological data structure and a right topological data structure which take the basic nodes as the center based on the read micro service node pair information and the topological construction dimension information contained in the topological query request;
constructing an external dependency data structure of the base node, the external dependency data structure including data of an external service invoked by the base node;
generating topological graph representation data based on the left topological data structure, the right topological data structure and the external dependency data structure.
On the basis of the above embodiment, the apparatus further includes an index data query module, specifically configured to:
when an index data query request is received, reading at least one piece of information of the micro service node pairs from a pre-stored set of the micro service node pairs according to a query condition in the index data query request;
inquiring the information of each micro service node pair which is associated with the basic node in the index data inquiry request and the index data of which meets the index condition in the index data inquiry request from the read information of at least one micro service node pair;
and summarizing the index data of the information of each inquired micro service node, and generating an inquiry result according to the summarized result.
On the basis of the above embodiment, the index data includes at least one of HTTP traffic, RPC traffic, and DB-dependent traffic.
On the basis of the above embodiment, the apparatus further includes a micro service node pair information storage module, which is specifically configured to:
acquiring original acquisition data generated in a current period according to a preset period, wherein the original acquisition data comprises node structure data of each micro service node in each calling chain generated in the current period;
and acquiring micro service node pair information generated in the current period by performing index summarization on the same nodes in the acquired original acquired data, and storing the micro service node pair information into a set of micro service node pairs.
On the basis of the foregoing embodiment, the micro service node pair information storage module is further specifically configured to:
and creating database tables corresponding to different time granularities based on the micro service node pair information, wherein each database table stores the micro service node pair information corresponding to the time granularities.
The topological relation query device 30 provided in the embodiment of the present application can execute a topological relation query method provided in any embodiment of the present application, and has functional modules and beneficial effects corresponding to the execution method. For details of the topology relationship query method provided in any embodiment of the present application, reference may be made to the technical details not described in detail in this embodiment.
According to an embodiment of the present application, an electronic device and a readable storage medium are also provided.
Fig. 4 is a block diagram of an electronic device according to a topological relation query method in an embodiment of the present application. Electronic devices are intended to represent various forms of digital computers, such as laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframes, and other appropriate computers. The electronic device may also represent various forms of mobile devices, such as personal digital processing, cellular phones, smart phones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions, are meant to be examples only, and are not meant to limit implementations of the present application that are described and/or claimed herein.
As shown in fig. 4, the electronic apparatus includes: one or more processors 401, memory 402, and interfaces for connecting the various components, including high-speed interfaces and low-speed interfaces. The various components are interconnected using different buses and may be mounted on a common motherboard or in other manners as desired. The processor may process instructions for execution within the electronic device, including instructions stored in or on the memory to display graphical information of a GUI on an external input/output apparatus (such as a display device coupled to the interface). In other embodiments, multiple processors and/or multiple buses may be used, along with multiple memories and multiple memories, as desired. Also, multiple electronic devices may be connected, with each device providing portions of the necessary operations (e.g., as a server array, a group of blade servers, or a multi-processor system). In fig. 4, one processor 401 is taken as an example.
The memory 402, which is a non-transitory computer readable storage medium, may be used to store non-transitory software programs, non-transitory computer executable programs, and modules, such as program instructions/modules corresponding to the topology relation query method in the embodiment of the present application (for example, the micro service node pair information reading module 31, the topology map expression data generation module 32, and the topology relation map drawing module 33 shown in fig. 3). The processor 401 executes various functional applications of the server and data processing by running non-transitory software programs, instructions and modules stored in the memory 402, that is, implements the topological relation query method in the above method embodiment.
The memory 402 may include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function; the storage data area may store data created by querying for use of the electronic device according to the topological relation, and the like. Further, the memory 402 may include high speed random access memory, and may also include non-transitory memory, such as at least one magnetic disk storage device, flash memory device, or other non-transitory solid state storage device. In some embodiments, the memory 402 may optionally include memory located remotely from the processor 401, and these remote memories may be connected to the electronic device for topological relations query via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The electronic device of the topological relation query method may further include: an input device 403 and an output device 404. The processor 401, the memory 402, the input device 403 and the output device 404 may be connected by a bus or other means, and fig. 4 illustrates an example of a connection by a bus.
The input device 403 may receive input numeric or character information and generate key signal inputs related to user settings and function control of the electronic device for topological relation query, such as an input device such as a touch screen, a keypad, a mouse, a track pad, a touch pad, a pointing stick, one or more mouse buttons, a track ball, a joystick, etc. The output devices 404 may include a display device, auxiliary lighting devices (e.g., LEDs), and haptic feedback devices (e.g., vibrating motors), among others. The display device may include, but is not limited to, a Liquid Crystal Display (LCD), a Light Emitting Diode (LED) display, and a plasma display. In some implementations, the display device can be a touch screen.
Various implementations of the systems and techniques described here can be realized in digital electronic circuitry, integrated circuitry, application specific ASICs (application specific integrated circuits), computer hardware, firmware, software, and/or combinations thereof. These various embodiments may include: implemented in one or more computer programs that are executable and/or interpretable on a programmable system including at least one programmable processor, which may be special or general purpose, receiving data and instructions from, and transmitting data and instructions to, a storage system, at least one input device, and at least one output device.
These computer programs (also known as programs, software applications, or code) include machine instructions for a programmable processor, and may be implemented using high-level procedural and/or object-oriented programming languages, and/or assembly/machine languages. As used herein, the terms "machine-readable medium" and "computer-readable medium" refer to any computer program product, apparatus, and/or device (e.g., magnetic discs, optical disks, memory, Programmable Logic Devices (PLDs)) used to provide machine instructions and/or data to a programmable processor, including a machine-readable medium that receives machine instructions as a machine-readable signal. The term "machine-readable signal" refers to any signal used to provide machine instructions and/or data to a programmable processor.
To provide for interaction with a user, the systems and techniques described here can be implemented on a computer having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to a user; and a keyboard and a pointing device (e.g., a mouse or a trackball) by which a user can provide input to the computer. Other kinds of devices may also be used to provide for interaction with a user; for example, feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form, including acoustic, speech, or tactile input.
The systems and techniques described here can be implemented in a computing system that includes a back-end component (e.g., as a data server), or that includes a middleware component (e.g., an application server), or that includes a front-end component (e.g., a user computer having a graphical user interface or a web browser through which a user can interact with an implementation of the systems and techniques described here), or any combination of such back-end, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: local Area Networks (LANs), Wide Area Networks (WANs), the internet, and blockchain networks.
The computer system may include clients and servers. A client and server are generally remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other.
According to the technical scheme of the embodiment of the application, the micro service node pair information is read from the pre-stored micro service node pair set, so that the topological graph expression data is generated, and the topological relation is drawn according to the topological graph expression data, so that the node information and the upstream and downstream relation are not required to be summarized in real time, the query performance is improved, a data real-time processing cluster is not required to be established, and the effect of resource overhead is reduced.
It should be understood that various forms of the flows shown above may be used, with steps reordered, added, or deleted. For example, the steps described in the present application may be executed in parallel, sequentially, or in different orders, and the present invention is not limited thereto as long as the desired results of the technical solutions disclosed in the present application can be achieved.
The above-described embodiments should not be construed as limiting the scope of the present application. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions may be made in accordance with design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present application shall be included in the protection scope of the present application.
Claims (15)
1. A topological relation query method is characterized by comprising the following steps:
when a topology query request is received, reading at least one piece of information of the micro service node pairs from a pre-stored set of the micro service node pairs according to a query condition in the topology query request; the micro service node pair information comprises information of two micro service nodes with calling relation;
generating topological graph expression data according to the read micro service node pair information;
and drawing and displaying a topological relation graph according to the topological graph expression data.
2. The method of claim 1, wherein the query condition comprises at least one of time condition information, a base node, and topology depth information.
3. The method of claim 2, wherein reading at least one micro service node pair information from a pre-stored set of micro service node pairs according to a query condition in the topology query request comprises:
determining query time granularity and a query time range according to the time condition information, and reading at least one database table corresponding to the query time granularity and the query time range from a database;
and inquiring the information of each micro service node pair associated with the basic node from each read database table according to the basic node and the topology depth information.
4. The method of claim 2, wherein generating topology graph representation data according to the read micro service node pair information comprises:
constructing a left topological data structure and a right topological data structure which take the basic nodes as the center based on the read micro service node pair information and the topological construction dimension information contained in the topological query request;
constructing an external dependency data structure of the base node, the external dependency data structure including data of an external service invoked by the base node;
generating topological graph representation data based on the left topological data structure, the right topological data structure and the external dependency data structure.
5. The method of claim 1, further comprising:
when an index data query request is received, reading at least one piece of information of the micro service node pairs from a pre-stored set of the micro service node pairs according to a query condition in the index data query request;
inquiring the information of each micro service node pair which is associated with the basic node in the index data inquiry request and the index data of which meets the index condition in the index data inquiry request from the read information of at least one micro service node pair;
and summarizing the index data of the information of each inquired micro service node, and generating an inquiry result according to the summarized result.
6. The method of claim 5, wherein the metric data comprises at least one of HTTP traffic, RPC traffic, and DB-dependent traffic.
7. The method according to any one of claims 1-6, further comprising:
acquiring original acquisition data generated in a current period according to a preset period, wherein the original acquisition data comprises node structure data of each micro service node in each calling chain generated in the current period;
and acquiring micro service node pair information generated in the current period by performing index summarization on the same nodes in the acquired original acquired data, and storing the micro service node pair information into a set of micro service node pairs.
8. The method of claim 7, wherein storing the micro service node pair information in a set of micro service node pairs comprises:
and creating database tables corresponding to different time granularities based on the micro service node pair information, wherein each database table stores the micro service node pair information corresponding to the time granularities.
9. A topological relation query apparatus, comprising:
the micro service node pair information reading module is used for reading at least one piece of micro service node pair information from a pre-stored set of micro service node pairs according to the query condition in the topology query request when receiving the topology query request; the micro service node pair information comprises information of two micro service nodes with calling relation;
the topological graph expression data generation module is used for generating topological graph expression data according to the read micro service node pair information;
and the topological relation graph drawing module is used for drawing and displaying a topological relation graph according to the topological relation graph expression data.
10. The apparatus of claim 9, wherein the query condition comprises at least one of time condition information, a base node, and topology depth information.
11. The apparatus of claim 9, wherein the micro service node pair information reading module is specifically configured to:
determining query time granularity and a query time range according to the time condition information, and reading at least one database table corresponding to the query time granularity and the query time range from a database;
and inquiring the information of each micro service node pair associated with the basic node from each read database table according to the basic node and the topology depth information.
12. The apparatus of claim 10, wherein the topology graph representation data generation module is specifically configured to:
constructing a left topological data structure and a right topological data structure which take the basic nodes as the center based on the read micro service node pair information and the topological construction dimension information contained in the topological query request;
constructing an external dependency data structure of the base node, the external dependency data structure including data of an external service invoked by the base node;
generating topological graph representation data based on the left topological data structure, the right topological data structure and the external dependency data structure.
13. The apparatus according to claim 9, further comprising an index data query module, specifically configured to:
when an index data query request is received, reading at least one piece of information of the micro service node pairs from a pre-stored set of the micro service node pairs according to a query condition in the index data query request;
inquiring the information of each micro service node pair which is associated with the basic node in the index data inquiry request and the index data of which meets the index condition in the index data inquiry request from the read information of at least one micro service node pair;
and summarizing the index data of the information of each inquired micro service node, and generating an inquiry result according to the summarized result.
14. An electronic device, comprising:
at least one processor; and
a memory communicatively coupled to the at least one processor; wherein the content of the first and second substances,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the topological relationship query method of any one of claims 1-8.
15. A non-transitory computer readable storage medium storing computer instructions for causing a computer to perform the topological relation query method of any one of claims 1 to 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911366612.1A CN113051446A (en) | 2019-12-26 | 2019-12-26 | Topological relation query method, device, electronic equipment and medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911366612.1A CN113051446A (en) | 2019-12-26 | 2019-12-26 | Topological relation query method, device, electronic equipment and medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113051446A true CN113051446A (en) | 2021-06-29 |
Family
ID=76505446
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911366612.1A Pending CN113051446A (en) | 2019-12-26 | 2019-12-26 | Topological relation query method, device, electronic equipment and medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113051446A (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113918775A (en) * | 2021-12-09 | 2022-01-11 | 浙江中控技术股份有限公司 | Data query method and device and electronic equipment |
| CN114553709A (en) * | 2022-04-28 | 2022-05-27 | 恒生电子股份有限公司 | Topological relation display method and related equipment |
| CN114629768A (en) * | 2022-02-17 | 2022-06-14 | 亚信科技（南京）有限公司 | Application topology processing method and device, electronic equipment, storage medium and product |
| CN114745281A (en) * | 2022-04-11 | 2022-07-12 | 京东科技信息技术有限公司 | Data processing method and device |
| CN114817264A (en) * | 2022-04-28 | 2022-07-29 | 电子科技大学 | Topology query structure, query method, electronic device and medium for graph computing |
| CN114896278A (en) * | 2022-05-06 | 2022-08-12 | 北京偶数科技有限公司 | Data query method, device and storage medium |
| CN114978933A (en) * | 2022-05-25 | 2022-08-30 | 安天科技集团股份有限公司 | Display method and device for display elements of three-dimensional topology |
| CN117112680A (en) * | 2023-10-24 | 2023-11-24 | 北京睿企信息科技有限公司 | Data association system based on multi-level micro-service |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2007317070A (en) * | 2006-05-29 | 2007-12-06 | Itochu Techno-Solutions Corp | Topology graph display system and computer program |
| US20130103739A1 (en) * | 2011-10-21 | 2013-04-25 | Cisco Technology, Inc. | Obtaining Dynamic Connected-Network Topology Via any Node in Network |
| CN103365960A (en) * | 2013-06-18 | 2013-10-23 | 国家电网公司 | Off-line searching method of structured data of electric power multistage dispatching management |
| CN103414595A (en) * | 2013-08-26 | 2013-11-27 | 国家电网公司 | Power scheduling data network link monitoring system topological graph generation method |
| CN105681200A (en) * | 2016-01-13 | 2016-06-15 | 国网新疆电力公司电力科学研究院 | Method for topologically querying geographical location of intelligent ammeter by routing function of concentrator |
| CN105809314A (en) * | 2014-12-31 | 2016-07-27 | 中兴通讯股份有限公司 | Method and system for asset management |
| US20160277252A1 (en) * | 2015-03-20 | 2016-09-22 | International Business Machines Corporation | High performance topology resolution for non-instrumented nodes |
| CN108234168A (en) * | 2016-12-15 | 2018-06-29 | 腾讯科技（深圳）有限公司 | A kind of method for exhibiting data and system based on service topology |
| CN108322351A (en) * | 2018-03-05 | 2018-07-24 | 北京奇艺世纪科技有限公司 | Generate method and apparatus, fault determination method and the device of topological diagram |
| CN109240893A (en) * | 2018-07-18 | 2019-01-18 | 平安科技（深圳）有限公司 | Using operating status querying method and terminal device |
-
2019
- 2019-12-26 CN CN201911366612.1A patent/CN113051446A/en active Pending
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2007317070A (en) * | 2006-05-29 | 2007-12-06 | Itochu Techno-Solutions Corp | Topology graph display system and computer program |
| US20130103739A1 (en) * | 2011-10-21 | 2013-04-25 | Cisco Technology, Inc. | Obtaining Dynamic Connected-Network Topology Via any Node in Network |
| CN103365960A (en) * | 2013-06-18 | 2013-10-23 | 国家电网公司 | Off-line searching method of structured data of electric power multistage dispatching management |
| CN103414595A (en) * | 2013-08-26 | 2013-11-27 | 国家电网公司 | Power scheduling data network link monitoring system topological graph generation method |
| CN105809314A (en) * | 2014-12-31 | 2016-07-27 | 中兴通讯股份有限公司 | Method and system for asset management |
| US20160277252A1 (en) * | 2015-03-20 | 2016-09-22 | International Business Machines Corporation | High performance topology resolution for non-instrumented nodes |
| CN105681200A (en) * | 2016-01-13 | 2016-06-15 | 国网新疆电力公司电力科学研究院 | Method for topologically querying geographical location of intelligent ammeter by routing function of concentrator |
| CN108234168A (en) * | 2016-12-15 | 2018-06-29 | 腾讯科技（深圳）有限公司 | A kind of method for exhibiting data and system based on service topology |
| CN108322351A (en) * | 2018-03-05 | 2018-07-24 | 北京奇艺世纪科技有限公司 | Generate method and apparatus, fault determination method and the device of topological diagram |
| CN109240893A (en) * | 2018-07-18 | 2019-01-18 | 平安科技（深圳）有限公司 | Using operating status querying method and terminal device |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113918775A (en) * | 2021-12-09 | 2022-01-11 | 浙江中控技术股份有限公司 | Data query method and device and electronic equipment |
| CN114629768A (en) * | 2022-02-17 | 2022-06-14 | 亚信科技（南京）有限公司 | Application topology processing method and device, electronic equipment, storage medium and product |
| CN114745281A (en) * | 2022-04-11 | 2022-07-12 | 京东科技信息技术有限公司 | Data processing method and device |
| CN114745281B (en) * | 2022-04-11 | 2023-12-05 | 京东科技信息技术有限公司 | Data processing method and device |
| CN114553709A (en) * | 2022-04-28 | 2022-05-27 | 恒生电子股份有限公司 | Topological relation display method and related equipment |
| CN114817264A (en) * | 2022-04-28 | 2022-07-29 | 电子科技大学 | Topology query structure, query method, electronic device and medium for graph computing |
| CN114553709B (en) * | 2022-04-28 | 2022-08-23 | 恒生电子股份有限公司 | Topological relation display method and related equipment |
| CN114896278A (en) * | 2022-05-06 | 2022-08-12 | 北京偶数科技有限公司 | Data query method, device and storage medium |
| CN114978933A (en) * | 2022-05-25 | 2022-08-30 | 安天科技集团股份有限公司 | Display method and device for display elements of three-dimensional topology |
| CN114978933B (en) * | 2022-05-25 | 2024-04-30 | 安天科技集团股份有限公司 | Display method and device for display elements of three-dimensional topology |
| CN117112680A (en) * | 2023-10-24 | 2023-11-24 | 北京睿企信息科技有限公司 | Data association system based on multi-level micro-service |
| CN117112680B (en) * | 2023-10-24 | 2023-12-29 | 北京睿企信息科技有限公司 | Data association system based on multi-level micro-service |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113051446A (en) | Topological relation query method, device, electronic equipment and medium | |
| US10122788B2 (en) | Managed function execution for processing data streams in real time | |
| CN110334091A (en) | A kind of data fragmentation distributed approach, system, medium and electronic equipment | |
| CN103186834A (en) | Method and device of business process configuration | |
| US10877971B2 (en) | Logical queries in a distributed stream processing system | |
| CN110619002A (en) | Data processing method, device and storage medium | |
| CN112561332B (en) | Model management method, device, electronic equipment, storage medium and program product | |
| CN111291082B (en) | Data aggregation processing method, device, equipment and storage medium | |
| CN111966677A (en) | Data report processing method and device, electronic equipment and storage medium | |
| CN112491617B (en) | Link tracking method, device, electronic equipment and medium | |
| CN111881385A (en) | Push content generation method, device, equipment and readable storage medium | |
| CN110852780A (en) | Data analysis method, device, equipment and computer storage medium | |
| CN111563198B (en) | Material recall method, device, equipment and storage medium | |
| CN111259090A (en) | Graph generation method and device of relational data, electronic equipment and storage medium | |
| CN112446574B (en) | Product evaluation method, device, electronic equipment and storage medium | |
| CN111698326A (en) | Method and apparatus for determining cost attribution of cloud service resources | |
| CN110517079B (en) | Data processing method and device, electronic equipment and storage medium | |
| CN112328658A (en) | User profile data processing method, device, equipment and storage medium | |
| US11755725B2 (en) | Machine learning anomaly detection mechanism | |
| CN111966767A (en) | Track thermodynamic diagram generation method and device, electronic equipment and storage medium | |
| CN111865683B (en) | Virtual gateway version gray level publishing method, device, equipment and storage medium | |
| CN111581049B (en) | Distributed system running state monitoring method, device, equipment and storage medium | |
| CN112084203A (en) | Method, apparatus, device and storage medium for outputting information | |
| CN111523000A (en) | Method, device, equipment and storage medium for importing data | |
| CN105630896A (en) | Method for quickly importing mass data |
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 |