CN111752943A - Map relation path positioning method and system - Google Patents
Map relation path positioning method and system Download PDFInfo
- Publication number
- CN111752943A CN111752943A CN202010426630.0A CN202010426630A CN111752943A CN 111752943 A CN111752943 A CN 111752943A CN 202010426630 A CN202010426630 A CN 202010426630A CN 111752943 A CN111752943 A CN 111752943A
- Authority
- CN
- China
- Prior art keywords
- node
- data
- relational data
- edges
- relationship
- 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 42
- 238000012545 processing Methods 0.000 claims abstract description 26
- 230000000007 visual effect Effects 0.000 claims abstract description 14
- 238000009877 rendering Methods 0.000 claims abstract description 13
- 238000006243 chemical reaction Methods 0.000 claims description 4
- 230000006870 function Effects 0.000 description 7
- 230000008569 process Effects 0.000 description 6
- 238000010586 diagram Methods 0.000 description 4
- 238000004891 communication Methods 0.000 description 3
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000004458 analytical method Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000000750 progressive effect Effects 0.000 description 2
- 238000012800 visualization Methods 0.000 description 2
- 108010001267 Protein Subunits Proteins 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 230000001149 cognitive effect Effects 0.000 description 1
- 238000007405 data analysis Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000005055 memory storage Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 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/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
- G06F16/2237—Vectors, bitmaps or matrices
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/248—Presentation of query results
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/28—Databases characterised by their database models, e.g. relational or object models
- G06F16/284—Relational databases
Abstract
The embodiment of the application discloses a method, a system, equipment and a computer readable storage medium for map relation path positioning, wherein the method comprises the following steps: performing ID processing on the relational data, and determining the ID corresponding to each piece of relational data; the relational data are data containing relations among nodes; converting the relational data into node relational data according to a preset map model; rendering a visual graph forming nodes and edges using the node relationship data; judging whether the graph element is a node or an edge: highlighting one-time connection information of a node or an edge, and acquiring ID information contained in all edges connected with the node or the edge; searching other sides containing the same ID information in the whole graph, and highlighting the first-degree connection information of the searched other sides. The problem that the relation path cannot be accurately positioned can be effectively solved, and accurate relation path prompt is provided for a user.
Description
Technical Field
The embodiment of the application relates to the technical field of computer processing, in particular to a method, a system and equipment for positioning a map relation path and a computer readable storage medium.
Background
Knowledge maps (knowledgegraphs) describe concepts, nodes and their relationships in the objective world in a structured form, expressing information in a form closer to the human cognitive world, providing a capability to better organize, manage and understand vast amounts of information. At present, the knowledge graph is widely applied to the industries of public security, finance and the like, and a visual analysis method is provided for data analysis.
However, in the conventional map visualization scheme in some scenes, there is a problem that a map relationship path cannot be accurately positioned, and the problem is specifically described as follows:
the following table is relational data that records the information of what tools the source IP uses to attack the target IP, wherein 36.227.12.1 used sqlmap to attack 172.16.22.34, and 54.47.12.101 used both sqlmap and scantools to attack 172.16.17.42.
This data map is visualized as in figure 1. When a source IP finds a used tool sqlmap according to a connection line, the source IP cannot judge which source IP uses the sqlmap to attack which target IP, and the problem generated in the situation is that a map relation path cannot be accurately positioned, and the map has a defect in the accuracy of information display, so that great trouble is brought to analysis.
Disclosure of Invention
Therefore, the embodiment of the application provides a method, a system, a device and a computer readable storage medium for map relation path positioning, which can effectively solve the problem that the relation path cannot be accurately positioned, and provide accurate relation path prompt for a user.
According to a first aspect of the embodiments of the present application, there is provided a map relation path positioning method, including:
performing ID processing on the relational data, and determining the ID corresponding to each piece of relational data; the relational data are data containing relations among nodes;
converting the relational data into node relational data according to a preset map model; wherein the relationship attribute in the node relationship data contains ID information;
rendering a visual graph forming nodes and edges using the node relationship data;
judging whether the graph element is a node or an edge: if the node is the first-degree connection information, highlighting the first-degree connection information of the node, and acquiring ID information contained in all edges connected with the node; if yes, highlighting one-time connection information of the edges, and acquiring all ID information contained in the edges;
searching other sides containing the same ID information in the whole graph, and highlighting the first-degree connection information of the searched other sides.
Optionally, the performing ID processing on the relational data to determine an ID corresponding to each piece of relational data includes:
generating an ID for each piece of relational data and attaching the ID to the relational data; the ID is generated by a Hash algorithm or formed by combining multiple fields.
Optionally, the relationship attribute in the node relationship data is that a relationship type data ID between two nodes is added to the relationship of the two nodes.
Optionally, the first-degree connection information of the node includes the node and all edges directly connected to the node; the one-time connection information of the edge includes the edge and two nodes directly connected to the edge.
According to a second aspect of embodiments of the present application, there is provided an atlas relationship path locating system, the system comprising:
the ID processing module is used for carrying out ID processing on the relational data and determining the ID corresponding to each piece of relational data; the relational data are data containing relations among nodes;
the data conversion module is used for converting the relational data into node relational data according to a preset map model; wherein the relationship attribute in the node relationship data contains ID information;
a rendering module for rendering a visual graph of the nodes and edges using the node relationship data;
a graph element judgment module, configured to judge whether a graph element is a node or an edge: if the node is the first-degree connection information, highlighting the first-degree connection information of the node, and acquiring ID information contained in all edges connected with the node; if yes, highlighting one-time connection information of the edges, and acquiring all ID information contained in the edges;
and the prompting module is used for searching other edges containing the same ID information in the whole graph and highlighting the once connection information of the searched other edges.
Optionally, the ID processing module is specifically configured to:
generating an ID for each piece of relational data and attaching the ID to the relational data; the ID is generated by a Hash algorithm or formed by combining multiple fields.
Optionally, the relationship attribute in the node relationship data is that a relationship type data ID between two nodes is added to the relationship of the two nodes.
Optionally, the first-degree connection information of the node includes the node and all edges directly connected to the node; the one-time connection information of the edge includes the edge and two nodes directly connected to the edge.
According to a third aspect of embodiments herein, there is provided an apparatus comprising: the device comprises a data acquisition device, a processor and a memory; the data acquisition device is used for acquiring data; the memory is to store one or more program instructions; the processor is configured to execute one or more program instructions to perform the method according to any of the first aspect.
According to a fourth aspect of embodiments herein, there is provided a computer-readable storage medium having one or more program instructions embodied therein for performing the method of any of the first aspects.
To sum up, the embodiment of the present application provides a method, a system, a device, and a computer-readable storage medium for map relationship path positioning, where an ID corresponding to each piece of relationship data is determined by performing ID processing on the relationship data; the relational data are data containing relations among nodes; converting the relational data into node relational data according to a preset map model; wherein the relationship attribute in the node relationship data contains ID information; rendering a visual graph forming nodes and edges using the node relationship data; judging whether the graph element is a node or an edge: if the node is the first-degree connection information, highlighting the first-degree connection information of the node, and acquiring ID information contained in all edges connected with the node; if yes, highlighting one-time connection information of the edges, and acquiring all ID information contained in the edges; searching other sides containing the same ID information in the whole graph, and highlighting the first-degree connection information of the searched other sides. The problem that the relation path cannot be accurately positioned can be effectively solved, and accurate relation path prompt is provided for a user.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below. It should be apparent that the drawings in the following description are merely exemplary, and that other embodiments can be derived from the drawings provided by those of ordinary skill in the art without inventive effort.
The structures, ratios, sizes, and the like shown in the present specification are only used for matching with the contents disclosed in the specification, so that those skilled in the art can understand and read the present invention, and do not limit the conditions for implementing the present invention, so that the present invention has no technical significance, and any structural modifications, changes in the ratio relationship, or adjustments of the sizes, without affecting the functions and purposes of the present invention, should still fall within the scope of the present invention.
FIG. 1 is a schematic diagram illustrating a data atlas visualization in the prior art provided by an embodiment of the present application;
fig. 2 is a schematic flowchart of a map relation path positioning method according to an embodiment of the present disclosure;
FIG. 3 is a process diagram of relational data processing provided by an embodiment of the present application;
FIG. 4 is a process for accurately locating a graph relationship path according to an embodiment of the present disclosure;
FIG. 5 is a graph node-edge visual graph provided by an embodiment of the present application;
fig. 6 is a graph node edge visual graph indicating edge numbers and attribute ID information according to the embodiment of the present application;
FIG. 7 is a diagram illustrating a graph relationship path highlighting after selecting an edge element according to an embodiment of the present application;
fig. 8 is a graph relationship path highlighting graph after a node element is selected, according to an embodiment of the present application;
fig. 9 is a block diagram of a map relation path positioning system according to an embodiment of the present application.
Detailed Description
The present invention is described in terms of particular embodiments, other advantages and features of the invention will become apparent to those skilled in the art from the following disclosure, and it is to be understood that the described embodiments are merely exemplary of the invention and that it is not intended to limit the invention to the particular embodiments disclosed. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Fig. 2 shows a map relationship path positioning flowchart provided in an embodiment of the present application, and as shown in fig. 2, the method includes:
step 201: performing ID processing on the relational data, and determining the ID corresponding to each piece of relational data; the relational data is data containing relationships between nodes.
Step 202: converting the relational data into node relational data according to a preset map model; wherein the relationship attributes in the node relationship data contain ID information.
Step 203: rendering forms a visual graph of nodes and edges using the node relationship data.
Step 204: judging whether the graph element is a node or an edge: if the node is the first-degree connection information, highlighting the first-degree connection information of the node, and acquiring ID information contained in all edges connected with the node; if yes, highlighting the first-degree connection information of the edges, and acquiring all ID information contained in the edges.
Step 205: searching other sides containing the same ID information in the whole graph, and highlighting the first-degree connection information of the searched other sides.
In one possible embodiment, in step 201, an ID is generated for each piece of relational data and attached to the relational data; the ID is generated by a Hash algorithm or formed by combining multiple fields.
In one possible embodiment, the relationship attribute in the node relationship data is that a relationship type data ID between two nodes is added to the relationship of the two nodes.
In one possible embodiment, the first-degree connection information of the node includes the node and all edges directly connected to the node; the one-time connection information of the edge includes the edge and two nodes directly connected to the edge.
Fig. 3 shows a processing procedure of the relational data, and as shown in fig. 3, the ID processing of the relational data in S101 is to perform ID processing on the relational data so that each piece of the relational data has a unique ID; wherein, the relational data refers to data containing relationships between nodes, as shown in table 1 below:
TABLE 1
There are three relational data records in the above table, which record what tool is used by the source IP to attack the target IP, where the source IP 36.227.12.1 uses the tool sql map to attack the target IP 172.16.22.34, the source IP 36.227.12.1 uses the tool sql map to attack the target IP 172.16.22.34, the source IP 36.227.12.1 uses the tool sql map to attack the target IP 172.16.22.34, performing ID processing on the above relational data means that a unique ID is generated for each piece of relational data and is attached to the relational data, and the processed data is as shown in table 2 below:
TABLE 2
As shown in Table 2, a unique ID is generated for each piece of raw relational data.
In a possible implementation manner, the generation of the unique ID may be generated by using a hash algorithm, or may use a multi-field union as the unique ID.
Further, S102 converts into node relation data according to the graph model, the relation attribute includes ID information, the data conversion is performed using a preset graph model, and then S103 renders using this data to form a node-edge visual graph as shown in fig. 5.
More specifically, the relationship attribute including ID information means: a relational data ID that records the relationship between two nodes is added to the relationship of the two nodes.
It should be further noted that after the node-edge visual graph is formed by rendering the node relationship data, the ID information in the original relationship attribute is correspondingly added to the edge attribute, and for the purpose of the following more convenient description, as shown in fig. 6, the edges are numbered and labeled, and the attribute ID information in each edge is displayed one by one. Fig. 4 is a process of accurately positioning the map relation path.
In S201 of fig. 4, a graph element is selected, and then S202 determines whether the graph element is a node or an edge, and displays the graph element according to the following two graph relationship path positioning logics:
(1) if it is a node, S205 highlights the first-degree connection information of the node, where the first-degree connection information of the node includes the node and all edges directly connected to the node, and it is assumed that the selected graph element is node 54.47.12.101, whose first-degree connection information includes: node 54.47.12.101, edges 1 and 3, then S206 obtains ID information contained in all edges connected to the node, the attribute ID sets of edge 1 and edge 3 are n1e36653a and m3nn2154b, then S207 searches other edges containing the same ID information in the whole graph, searches other edges containing n1e36653a or m3nn2154b in the whole graph, searches edge 2 and edge 4, finally S208 highlights first-degree connection information of the searched other edges, highlights first-degree connection information of edge 2 and edge 4, the first-degree connection information of the edge includes the edge and two nodes directly connected by the edge, so the first-degree connection information of edge 2 and edge 4 includes: edge 2, edge 4, node sqlmap, node scantool, node 172.16.17.42, so far, all accurate attack relationship paths of node 54.47.12.101 are highlighted as fig. 8.
(2) If it is an edge, S203 highlights the one-time connection information of the edge, also referred to in fig. 6, assuming that the selected graph element is edge 3, which one-time connection information includes: edge 3, node 54.47.12.101, and node sqlmap, then S204 obtains all ID information contained in this edge, the ID information contained in edge 3 is only m3nn2154b, and then S207 searches the whole graph for other edges containing the same ID information, searches the whole graph for other edges containing m3nn2154b, searches for edge 4, and finally S208 highlights first-degree connection information of the other searched edges, and highlights first-degree connection information of edge 4: edge 4, node sqlmap, node 172.16.17.42, so far, as in fig. 7, the exact attack relationship path associated with edge 3 is highlighted.
To sum up, the embodiment of the present application provides a map relation path positioning method, which determines an ID corresponding to each piece of relational data by performing ID processing on the relational data; the relational data are data containing relations among nodes; converting the relational data into node relational data according to a preset map model; wherein the relationship attribute in the node relationship data contains ID information; rendering a visual graph forming nodes and edges using the node relationship data; judging whether the graph element is a node or an edge: if the node is the first-degree connection information, highlighting the first-degree connection information of the node, and acquiring ID information contained in all edges connected with the node; if yes, highlighting one-time connection information of the edges, and acquiring all ID information contained in the edges; searching other sides containing the same ID information in the whole graph, and highlighting the first-degree connection information of the searched other sides. The problem that the relation path cannot be accurately positioned can be effectively solved, and accurate relation path prompt is provided for a user.
Based on the same technical concept, an embodiment of the present application further provides an atlas relationship path positioning system, as shown in fig. 9, the system includes:
an ID processing module 901, configured to perform ID processing on the relational data, and determine an ID corresponding to each piece of relational data; the relational data is data containing relationships between nodes.
The data conversion module 902 is configured to convert the relational data into node relational data according to a preset graph model; wherein the relationship attributes in the node relationship data contain ID information.
A rendering module 903 for rendering a visual graph forming nodes and edges using the node relationship data.
A primitive determining module 904, configured to determine whether a graph element is a node or an edge: if the node is the first-degree connection information, highlighting the first-degree connection information of the node, and acquiring ID information contained in all edges connected with the node; if yes, highlighting the first-degree connection information of the edges, and acquiring all ID information contained in the edges.
And the prompting module 905 is used for searching other edges containing the same ID information in the whole graph and highlighting the once connection information of the searched other edges.
In a possible implementation manner, the ID processing module 901 is specifically configured to: generating an ID for each piece of relational data and attaching the ID to the relational data; the ID is generated by a Hash algorithm or formed by combining multiple fields.
In one possible embodiment, the relationship attribute in the node relationship data is that a relationship type data ID between two nodes is added to the relationship of the two nodes.
In one possible embodiment, the first-degree connection information of the node includes the node and all edges directly connected to the node; the one-time connection information of the edge includes the edge and two nodes directly connected to the edge.
Based on the same technical concept, an embodiment of the present application further provides an apparatus, including: the device comprises a data acquisition device, a processor and a memory; the data acquisition device is used for acquiring data; the memory is to store one or more program instructions; the processor is configured to execute one or more program instructions to perform the method according to any of the above methods.
Based on the same technical concept, the embodiment of the present application further provides a computer-readable storage medium, wherein the computer-readable storage medium contains one or more program instructions, and the one or more program instructions are used for executing the method according to any one of the above methods.
In the present specification, each embodiment of the method is described in a progressive manner, and the same and similar parts among the embodiments are referred to each other, and each embodiment focuses on the differences from the other embodiments. Reference is made to the description of the method embodiments.
It is noted that while the operations of the methods of the present invention are depicted in the drawings in a particular order, this is not a requirement or suggestion that the operations must be performed in this particular order or that all of the illustrated operations must be performed to achieve desirable results. Additionally or alternatively, certain steps may be omitted, multiple steps combined into one step execution, and/or one step broken down into multiple step executions.
Although the present application provides method steps as in embodiments or flowcharts, additional or fewer steps may be included based on conventional or non-inventive approaches. The order of steps recited in the embodiments is merely one manner of performing the steps in a multitude of orders and does not represent the only order of execution. When an apparatus or client product in practice executes, it may execute sequentially or in parallel (e.g., in a parallel processor or multithreaded processing environment, or even in a distributed data processing environment) according to the embodiments or methods shown in the figures. The terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, the presence of additional identical or equivalent elements in a process, method, article, or apparatus that comprises the recited elements is not excluded.
The units, devices, modules, etc. set forth in the above embodiments may be implemented by a computer chip or an entity, or by a product with certain functions. For convenience of description, the above devices are described as being divided into various modules by functions, and are described separately. Of course, in implementing the present application, the functions of each module may be implemented in one or more software and/or hardware, or a module implementing the same function may be implemented by a combination of a plurality of sub-modules or sub-units, and the like. The above-described embodiments of the apparatus are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
Those skilled in the art will also appreciate that, in addition to implementing the controller as pure computer readable program code, the same functionality can be implemented by logically programming method steps such that the controller is in the form of logic gates, switches, application specific integrated circuits, programmable logic controllers, embedded microcontrollers and the like. Such a controller may therefore be considered as a hardware component, and the means included therein for performing the various functions may also be considered as a structure within the hardware component. Or even means for performing the functions may be regarded as being both a software module for performing the method and a structure within a hardware component.
The application may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, classes, etc. that perform particular tasks or implement particular abstract data types. The application may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote computer storage media including memory storage devices.
From the above description of the embodiments, it is clear to those skilled in the art that the present application can be implemented by software plus necessary general hardware platform. Based on such understanding, the technical solutions of the present application may be embodied in the form of a software product, which may be stored in a storage medium, such as a ROM/RAM, a magnetic disk, an optical disk, or the like, and includes several instructions for enabling a computer device (which may be a personal computer, a mobile terminal, a server, or a network device) to execute the method according to the embodiments or some parts of the embodiments of the present application.
The embodiments in the present specification are described in a progressive manner, and the same or similar parts among the embodiments are referred to each other, and each embodiment focuses on the differences from the other embodiments. The application is operational with numerous general purpose or special purpose computing system environments or configurations. For example: personal computers, server computers, hand-held or portable devices, tablet-type devices, multiprocessor systems, microprocessor-based systems, set top boxes, programmable electronic devices, network PCs, minicomputers, mainframe computers, distributed computing environments that include any of the above systems or devices, and the like.
The above-mentioned embodiments are further described in detail for the purpose of illustrating the invention, and it should be understood that the above-mentioned embodiments are only illustrative of the present invention and are not intended to limit the scope of the present invention, and any modifications, equivalent substitutions, improvements, etc. made within the spirit and principle of the present invention should be included in the scope of the present invention.
Claims (10)
1. A method for map relationship path location, the method comprising:
performing ID processing on the relational data, and determining the ID corresponding to each piece of relational data; the relational data are data containing relations among nodes;
converting the relational data into node relational data according to a preset map model; wherein the relationship attribute in the node relationship data contains ID information;
rendering a visual graph forming nodes and edges using the node relationship data;
judging whether the graph element is a node or an edge: if the node is the first-degree connection information, highlighting the first-degree connection information of the node, and acquiring ID information contained in all edges connected with the node; if yes, highlighting one-time connection information of the edges, and acquiring all ID information contained in the edges;
searching other sides containing the same ID information in the whole graph, and highlighting the first-degree connection information of the searched other sides.
2. The method of claim 1, wherein the ID processing the relational data to determine the ID corresponding to each piece of relational data comprises:
generating an ID for each piece of relational data and attaching the ID to the relational data; the ID is generated by a Hash algorithm or formed by combining multiple fields.
3. The method of claim 1, wherein a relationship attribute in the node relationship data is that a relational data ID between two nodes is added to the relationship of the two nodes.
4. The method of claim 1, wherein the one-degree-connection information of the node includes a node and all edges directly connected to the node; the one-time connection information of the edge includes the edge and two nodes directly connected to the edge.
5. An atlas relationship path locating system, the system comprising:
the ID processing module is used for carrying out ID processing on the relational data and determining the ID corresponding to each piece of relational data; the relational data are data containing relations among nodes;
the data conversion module is used for converting the relational data into node relational data according to a preset map model; wherein the relationship attribute in the node relationship data contains ID information;
a rendering module for rendering a visual graph of the nodes and edges using the node relationship data;
a graph element judgment module, configured to judge whether a graph element is a node or an edge: if the node is the first-degree connection information, highlighting the first-degree connection information of the node, and acquiring ID information contained in all edges connected with the node; if yes, highlighting one-time connection information of the edges, and acquiring all ID information contained in the edges;
and the prompting module is used for searching other edges containing the same ID information in the whole graph and highlighting the once connection information of the searched other edges.
6. The system of claim 5, wherein the ID processing module is specifically configured to:
generating an ID for each piece of relational data and attaching the ID to the relational data; the ID is generated by a Hash algorithm or formed by combining multiple fields.
7. The system of claim 5, wherein a relationship attribute in the node relationship data is that a relational data ID between two nodes is added to the relationship of the two nodes.
8. The system of claim 5, wherein the one-degree-of-connection information of the node includes a node and all edges directly connected to the node; the one-time connection information of the edge includes the edge and two nodes directly connected to the edge.
9. An apparatus, characterized in that the apparatus comprises: the device comprises a data acquisition device, a processor and a memory;
the data acquisition device is used for acquiring data; the memory is to store one or more program instructions; the processor, configured to execute one or more program instructions to perform the method of any of claims 1-4.
10. A computer-readable storage medium having one or more program instructions embodied therein for performing the method of any of claims 1-4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010426630.0A CN111752943A (en) | 2020-05-19 | 2020-05-19 | Map relation path positioning method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010426630.0A CN111752943A (en) | 2020-05-19 | 2020-05-19 | Map relation path positioning method and system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111752943A true CN111752943A (en) | 2020-10-09 |
Family
ID=72673463
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010426630.0A Pending CN111752943A (en) | 2020-05-19 | 2020-05-19 | Map relation path positioning method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111752943A (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150120775A1 (en) * | 2013-10-24 | 2015-04-30 | Microsoft Corporation | Answering relational database queries using graph exploration |
| CN109740026A (en) * | 2019-01-11 | 2019-05-10 | 深圳市中电数通智慧安全科技股份有限公司 | Smart city edge calculations platform and its management method, server and storage medium |
| CN109885692A (en) * | 2019-01-11 | 2019-06-14 | 平安科技（深圳）有限公司 | Knowledge data storage method, device, computer equipment and storage medium |
| CN110543586A (en) * | 2019-09-04 | 2019-12-06 | 北京百度网讯科技有限公司 | Multi-user identity fusion method, device, equipment and storage medium |
| CN110941664A (en) * | 2019-12-11 | 2020-03-31 | 北京百度网讯科技有限公司 | Knowledge graph construction method, detection method, device, equipment and storage medium |
| CN111061859A (en) * | 2019-12-02 | 2020-04-24 | 深圳追一科技有限公司 | Data processing method and device based on knowledge graph and computer equipment |
-
2020
- 2020-05-19 CN CN202010426630.0A patent/CN111752943A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150120775A1 (en) * | 2013-10-24 | 2015-04-30 | Microsoft Corporation | Answering relational database queries using graph exploration |
| CN109740026A (en) * | 2019-01-11 | 2019-05-10 | 深圳市中电数通智慧安全科技股份有限公司 | Smart city edge calculations platform and its management method, server and storage medium |
| CN109885692A (en) * | 2019-01-11 | 2019-06-14 | 平安科技（深圳）有限公司 | Knowledge data storage method, device, computer equipment and storage medium |
| CN110543586A (en) * | 2019-09-04 | 2019-12-06 | 北京百度网讯科技有限公司 | Multi-user identity fusion method, device, equipment and storage medium |
| CN111061859A (en) * | 2019-12-02 | 2020-04-24 | 深圳追一科技有限公司 | Data processing method and device based on knowledge graph and computer equipment |
| CN110941664A (en) * | 2019-12-11 | 2020-03-31 | 北京百度网讯科技有限公司 | Knowledge graph construction method, detection method, device, equipment and storage medium |
Non-Patent Citations (1)
| Title |
|---|
| 杨荣;翟社平;王志文;: "基于知识图谱的信息查询系统设计与实现", 计算机与数字工程, no. 04, 20 April 2020 (2020-04-20) * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112035667A (en) | Knowledge graph display method and device and terminal equipment | |
| US10095698B2 (en) | Managing changes to one or more files via linked mapping records | |
| US8069412B2 (en) | Methods, systems, and products for mapping facilities data | |
| CN109508352B (en) | Report data output method, device, equipment and storage medium | |
| JP5587989B2 (en) | Providing patent maps by viewpoint | |
| CN107644286A (en) | Workflow processing method and device | |
| CN105447030B (en) | A kind of index process method and apparatus | |
| WO2016141685A1 (en) | Telecommunications engineering drawing generation method and drawing design client | |
| CN110674358A (en) | Enterprise information comparison analysis method and device, computer equipment and storage medium | |
| CN111159177B (en) | Heterogeneous data-based data fusion method, device, equipment and medium | |
| CN108334513A (en) | A kind of identification processing method of Similar Text, apparatus and system | |
| CN103873318A (en) | Website automated testing method and automated testing system | |
| CN114116065A (en) | Method and device for acquiring topological graph data object and electronic equipment | |
| CN112115153A (en) | Data processing method, device, equipment and storage medium | |
| CN114021156A (en) | Method, device and equipment for organizing vulnerability automatic aggregation and storage medium | |
| WO2021072383A1 (en) | Document tracking through version hash linked graphs | |
| CN107341221B (en) | Index structure establishing and associated retrieving method, device, equipment and storage medium | |
| JP5096850B2 (en) | Search result display method, search result display program, and search result display device | |
| CN111752943A (en) | Map relation path positioning method and system | |
| CN111930875A (en) | Environment data query method, device, equipment and medium | |
| CN111338966B (en) | Big data processing detection method and device of data source table | |
| CN105843826A (en) | Search method and device | |
| CN111694995B (en) | Optimization method, device and processing equipment of relational network | |
| CN111143356B (en) | Report retrieval method and device | |
| CN113918728A (en) | Industrial Internet post-service knowledge map analysis platform |
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 |