CN111931001A - Graph data query method and device and storage medium - Google Patents
Graph data query method and device and storage medium Download PDFInfo
- Publication number
- CN111931001A CN111931001A CN202010579437.0A CN202010579437A CN111931001A CN 111931001 A CN111931001 A CN 111931001A CN 202010579437 A CN202010579437 A CN 202010579437A CN 111931001 A CN111931001 A CN 111931001A
- Authority
- CN
- China
- Prior art keywords
- query
- graph
- node
- components
- displaying
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 61
- 238000003860 storage Methods 0.000 title claims abstract description 15
- 230000000007 visual effect Effects 0.000 claims abstract description 20
- 238000004458 analytical method Methods 0.000 claims abstract description 18
- 238000010276 construction Methods 0.000 claims description 5
- 230000008569 process Effects 0.000 description 13
- 230000004044 response Effects 0.000 description 10
- 238000010586 diagram Methods 0.000 description 6
- 238000001914 filtration Methods 0.000 description 4
- 238000003384 imaging method Methods 0.000 description 4
- 238000012800 visualization Methods 0.000 description 4
- 230000002776 aggregation Effects 0.000 description 3
- 238000004220 aggregation Methods 0.000 description 3
- 230000008901 benefit Effects 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
- 230000000694 effects Effects 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 239000000796 flavoring agent Substances 0.000 description 2
- 235000019634 flavors Nutrition 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 238000006467 substitution reaction Methods 0.000 description 2
- 230000001960 triggered effect Effects 0.000 description 2
- 102100038367 Gremlin-1 Human genes 0.000 description 1
- 101001032872 Homo sapiens Gremlin-1 Proteins 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000006116 polymerization reaction Methods 0.000 description 1
- 230000011218 segmentation 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/901—Indexing; Data structures therefor; Storage structures
- G06F16/9024—Graphs; Linked lists
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computational Linguistics (AREA)
- Software Systems (AREA)
- User Interface Of Digital Computer (AREA)
Abstract
The invention discloses a method and a device for inquiring graph data and a computer readable storage medium, firstly, an inquiry graph is constructed based on an operation instruction of a visual image, wherein the inquiry graph at least comprises a node component for representing a data object and an edge component for representing the logic relationship between the node components; analyzing the query condition of the query graph, and executing a graph query task according to the analysis; and then graphically displaying the query result on the display interface.
Description
Technical Field
The present invention relates to the field of image processing technologies, and in particular, to a method and an apparatus for querying image data, and a computer-readable storage medium.
Background
At present, knowledge maps are widely applied to the fields of finance, business, life, manufacturing industry and the like by retrieving knowledge from knowledge bases and finding new knowledge through map query, and various intelligent applications are supported by retrieving knowledge from knowledge bases and finding new knowledge through map query.
In the prior art, the query task of graph data is mainly described by a graph query language. There are currently three main types of graph query languages: cypher, SPARQL standard W3C, Tinkerpop/Gremlin standard Apache. However, the grammars of the graph query languages are complex, and the use threshold is high; meanwhile, when in use, a user is required to have clear understanding on the structure and the attribute of the data.
Disclosure of Invention
In order to solve the above problems of the conventional graph data query, embodiments of the present invention creatively provide a graph data query method, device and computer-readable storage medium.
According to a first aspect of the present invention, there is provided a method for querying graph data, the method including: constructing a query graph based on an operation instruction of a visual image, wherein the query graph at least comprises node components for representing data objects and edge components for representing logical relations among the node components; analyzing the query condition of the query map, and executing a map query task according to the analysis; and graphically displaying the query result on the display interface.
According to an embodiment of the invention, the constructing of the query graph based on the operation instruction of the visual image comprises the following steps: displaying the node component on a graph query task interface based on a trigger operation instruction of the node component; based on the setting of the logical relationship among the node components, displaying an edge component for representing the logical relationship among the nodes on the graph query task interface; configuring the properties of the node component or edge component based on property option settings.
According to an embodiment of the invention, the node components include physical nodes or concept nodes; the edge assembly includes a fixed edge or an indefinite edge.
According to an embodiment of the present invention, the constructing a query graph further includes: the first query graph is nested as a subgraph based on operational instructions to the constructed first query graph at a graph query task interface.
According to an embodiment of the present invention, the displaying of the query result in the display interface in an imaging manner includes: displaying the query result on a display interface in a graphical manner in real time; or, displaying the query result in a display interface in an imaging mode based on the triggering of the query instruction.
According to the second aspect of the present invention, there is also provided an apparatus for querying graph data, the apparatus including: the query task graph at least comprises node components used for representing data objects and edge components used for representing the logical relationship among the node components; the execution module is used for analyzing the query condition of the query map and executing a graph query task according to the analysis; and the display module is used for displaying the query result in a graphical mode on the display interface.
According to an embodiment of the present invention, the building module is specifically configured to display the node component on a graph query task interface based on a trigger operation instruction for the node component; based on the setting of the logical relationship among the node components, displaying edge components for representing the logical relationship among the node components on the graph query task interface; configuring the properties of the node component or edge component based on property option settings.
According to an embodiment of the present invention, the building module is further configured to, based on an operation instruction on the built first query graph at the graph query task interface, nest and configure the first query graph as a sub graph.
According to an embodiment of the present invention, the display module is specifically configured to graphically display the query result on a display interface in real time; or, after the query instruction is submitted, the query result is graphically displayed on the display interface.
According to a third aspect of the present invention, there is provided a computer-readable storage medium comprising a set of computer-executable instructions, which when executed, perform a method of querying data of any of the above-mentioned figures.
The embodiment of the invention discloses a query method, a query device and a computer readable storage medium of graph data, firstly, a query graph is constructed based on an operation instruction of a visual image, wherein the query graph at least comprises node components for representing data objects and edge components for representing logical relations among the node components; analyzing the query condition of the query graph, and executing a graph query task according to the analysis; and then graphically displaying the query result on the display interface. Therefore, the visual graph query task description is carried out in a mode of constructing the query graph through the operation instruction of the visual image, so that a user can describe the query task of a complex graph structure completely through graphical simple operation; meanwhile, the query result can be visually and visually displayed, the use threshold of a user is low, convenience and convenience are realized, and the user experience degree is high.
It is to be understood that the teachings of the present invention need not achieve all of the above-described benefits, but rather that specific embodiments may achieve specific technical results, and that other embodiments of the present invention may achieve benefits not mentioned above.
Drawings
The above and other objects, features and advantages of exemplary embodiments of the present invention will become readily apparent from the following detailed description read in conjunction with the accompanying drawings. Several embodiments of the invention are illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings and in which:
in the drawings, the same or corresponding reference numerals indicate the same or corresponding parts.
FIG. 1 is a first flowchart illustrating an implementation of a method for querying graph data according to an embodiment of the present invention;
FIG. 2 is a diagram illustrating an example query task interface;
FIG. 3 is a flow chart illustrating a specific implementation of a method for querying graph data according to an embodiment of the present invention;
FIG. 4 is a graphical display effect diagram of query results of an application example of the present invention;
FIG. 5 is a flowchart illustrating a second implementation of the method for querying data according to the embodiment of the present invention;
FIG. 6 is a flow chart illustrating a third implementation of the query method of graph data according to the embodiment of the present invention;
FIG. 7 is a flowchart illustrating a fourth implementation flow of the query method of graph data according to the embodiment of the present invention;
fig. 8 is a schematic diagram showing a component structure of the query device for graph data according to the embodiment of the present invention.
Detailed Description
The principles and spirit of the present invention will be described with reference to a number of exemplary embodiments. It is understood that these embodiments are given only to enable those skilled in the art to better understand and to implement the present invention, and do not limit the scope of the present invention in any way. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the invention to those skilled in the art.
The technical solution of the present invention is further elaborated below with reference to the drawings and the specific embodiments.
FIG. 1 is a first flowchart illustrating an implementation of a method for querying graph data according to an embodiment of the present invention; FIG. 2 is a diagram illustrating an example query task interface; FIG. 3 is a flow chart illustrating a specific implementation of a method for querying graph data according to an embodiment of the present invention; FIG. 4 is a graphical display effect diagram of query results of an application example of the present invention.
Referring to fig. 1, an embodiment of the present invention provides a graph data query method, where the method includes: operation 101, constructing a query graph based on an operation instruction of a visual image; operation 102, parsing the query conditions of the query graph, and executing a graph query task according to the parsing; and operation 103, displaying the query result graphically on the display interface.
Wherein the query graph includes at least node components for characterizing the data objects and edge components for characterizing logical relationships between the node components. In practical applications, query graphs also exist that include only one or more node components for characterizing data objects.
Here, a node component may generally include both physical and conceptual nodes. An entity node is a node having an identification ID number indicating a data object; the concept node requires the user to specify one or more types in the node configuration panel, and when the user specifies some types, the attributes of the types appear in the drop-down list of the configuration panel, and the user is allowed to set the condition range of the attributes. For example, when the user designates a type of a concept node as a dish, attribute 0 flavor and attribute 1 dish of the dish type appear in the pull-down list of the configuration panel, so that the user can set a condition range corresponding to the attribute. It should be reminded that each node component needs to be indicated and needs to be returned as a query result, i.e., whether it needs to be graphically displayed as a query result is indicated by the setting of the output configuration in the drop-down list of the configuration panel.
Edge components typically include both fixed edges and undefined edges (i.e., multi-hop edges). The fixed edge represents a relationship, the user is required to specify one or more types in the edge configuration panel, and after the user specifies some types, the attributes of the types can be displayed in a drop-down list of the configuration panel, and the user is allowed to set the condition range of the attributes. The indefinite edge represents a path with indefinite step size, and besides the user can set the possible types and various attribute limiting conditions of each edge on the path, the user also needs to set the range of the step size. It should be noted that the types of edge components that can be determined based on the direction include a directed single edge, an undirected single edge, a directed multi-hop edge, and an undirected multi-hop edge.
Specifically, in operation 101, the user terminal displays the node component on the graph query task interface based on a trigger operation instruction for the node component; based on the setting of the logical relationship among the node components, displaying edge components for representing the logical relationship among the node components on a graph query task interface; configuring properties of the node components or edge components based on the property option settings.
Therefore, the query use threshold of the graph data is low, and a user does not need to learn and master the grammar of the complex graph query language and can directly complete the construction of the graph query task by dragging the icon.
In an application example, referring to the graph query task interface shown in FIG. 2, a user creates a query graph by way of a visualization or command line. Specifically, in response to a trigger operation instruction of a user on the node 1 and the node 2, displaying two node components of the node 1 and the node 2 on a graph query task interface; further, in response to the logical relationship 1 between the node 1 and the node 2, a directed single side for characterizing the logical relationship 1 between the node 1 and the node 2 is displayed on the graph query task interface.
In yet another application example, a user creates a query graph by way of a visualization or command line. Specifically, in response to a trigger operation instruction of a user for the two nodes 1 and 2, displaying two node components of the two nodes 1 and 2 on a graph query task interface; further, in response to the logical relationship 1 between the node 1 and the node 2, displaying a directed single side for representing the logical relationship 1 between the node 1 and the node 2 on a graph query task interface; meanwhile, in response to the logical relationship 2 between the two nodes 1, displaying an undirected indefinite edge for representing the logical relationship 2 between the two nodes 1 on the graph query task interface, and performing attribute configuration, such as step length, on the undirected indefinite edge in a pull-down list of a configuration panel.
It should be added that, in the process of specifically constructing the query graph, in addition to setting the attribute of each node component or edge component, the attribute of the whole graph may also be set, which mainly includes processing modes such as clustering and filtering the query result. Polymerization processes include two broad categories: and performing automatic aggregation or rule aggregation on all nodes of a certain category. When automatic aggregation is set, all nodes of the specified type are divided into groups of the specified number by a clustering algorithm; when the set rule is aggregated, the attribute of the node of the type, the segmentation mode and the division number need to be manually set. The filtering process mainly refers to whether the user can set the attribute values of each type of node within a certain range, and the attribute values need to be excluded or reserved.
In operation 102, referring to fig. 3, after the user terminal completes the construction of the query graph, the user terminal may trigger the submission of the query graph to the server, so that the server may analyze the query condition of the query graph, and execute a graph query task according to the analysis.
Specifically, the server analyzes the query conditions of the query graph through analysis rules corresponding to different database languages to obtain analysis results meeting different databases; further, graph query tasks are executed according to the analysis results meeting different database languages. Thus, through operations 101-102, a user can completely realize cross-database graph query processing through graphical simple operation and query tasks describing complex graph structures and analysis execution of a server.
In operation 103, after the server completes the graph query task, the query result is returned to the user terminal, so that the query result is graphically displayed on the display interface of the user terminal.
Specifically, referring to fig. 3, the display of the query result can be divided into the following two display modes based on the timing:
the method comprises the steps that after the user terminal receives a query result returned by the server, the user terminal can graphically display the query result on a display interface in real time;
in one example, after a query process based on a query graph is completed between a user terminal and a server through operations 101-103 and a query result is obtained, a display interface of the user terminal can graphically display the query result in real time; further, after the user switches the attribute of the query result on the display interface, the display interface updates and displays the corresponding switched query result in real time.
In the second mode, the user terminal firstly stores the query result returned by the server after receiving the query result; after a user initiates a query instruction, a query result is graphically displayed on a display interface based on the trigger of the query instruction.
In an example, after a query process based on a query graph is completed between a user terminal and a server through operations 101-103 and a query result is obtained, the user terminal caches the query result; further, after the user terminal receives the query instruction triggered by the user, the query result is selectively and graphically displayed on the display interface based on the attribute of the query result corresponding to the query instruction triggered by the user.
It should be noted that, the user may set the attribute of the query result in advance or in real time in a visual manner, specifically including returning the query result display corresponding to which node components and edge components, what kind of processing is performed on the query result, the presentation form of the query result, and the like.
In an application example, referring to the graphical display effect graph shown in fig. 4, based on the set attribute of the query result, that is, returning 36 edge components for representing selling relationships to 72 entity nodes (examples) for representing restaurants, and performing shape display of the clustered query result.
In an embodiment, the operation 101 may further include: the first query graph is nested as a subgraph based on operational instructions to the constructed first query graph at a graph query task interface. Namely, one query graph can contain a plurality of subgraphs and can be nested in multiple ways; the setting process of each sub-graph is the same as the operation details of the operation 101 for constructing the query graph, and the result of one sub-graph can be input into another sub-graph.
For example, in the first query graph m1, sub graph m11 and sub graph m12 are nested, wherein sub graph m11 is nested with sub graphs m111, m112 and m 113. The query results obtained by the operations 101-103 of the sub-graphs m111, m112 and m113 are all used as the input of the sub-graph m 11; correspondingly, the query results obtained by the operations 101 to 103 of the sub-graph m11 and the sub-graph m12 are used as the input of the first query graph m 1. Therefore, the invention can construct complex query tasks and complete complex subgraph structure matching, thereby obtaining rich query results and further grouping, filtering and other processing the results.
Fig. 5 is a schematic diagram illustrating an implementation flow of the graph data query method according to the embodiment of the present invention.
Referring to fig. 5, the method for querying graph data according to the embodiment of the present invention includes: operation 501, displaying the node component on a graph query task interface based on a trigger operation instruction of the node component; operation 502, based on the setting of the logical relationship between the node components, displaying an edge component for representing the logical relationship between the nodes on the graph query task interface; operation 503, configuring the attributes of the node components or the edge components based on the attribute option settings to construct a query graph; operation 504, parsing the query conditions of the query graph, and executing a graph query task according to the parsing; in operation 505, the query results are graphically displayed on a display interface.
At operations 501-503, a query graph includes at least node components for characterizing data objects and edge components for characterizing logical relationships between the node components. In practical applications, query graphs also exist that include only one or more node components for characterizing data objects.
Here, a node component may generally include both physical and conceptual nodes. An entity node is a node having an identification ID number indicating a data object; the concept node requires the user to specify one or more types in the node configuration panel, and when the user specifies some types, the attributes of the types appear in the drop-down list of the configuration panel, and the user is allowed to set the condition range of the attributes. For example, when the user designates a type of a concept node as a dish, attribute 0 flavor and attribute 1 dish of the dish type appear in the pull-down list of the configuration panel, so that the user can set a condition range corresponding to the attribute. It should be reminded that each node component needs to be indicated and needs to be returned as a query result, i.e., whether it needs to be graphically displayed as a query result is indicated by the setting of the output configuration in the drop-down list of the configuration panel.
Edge components typically include both fixed edges and undefined edges (i.e., multi-hop edges). The fixed edge represents a relationship, the user is required to specify one or more types in the edge configuration panel, and after the user specifies some types, the attributes of the types can be displayed in a drop-down list of the configuration panel, and the user is allowed to set the condition range of the attributes. The indefinite edge represents a path with indefinite step size, and besides the user can set the possible types and various attribute limiting conditions of each edge on the path, the user also needs to set the range of the step size. It should be noted that the types of edge components that can be determined based on the direction include a directed single edge, an undirected single edge, a directed multi-hop edge, and an undirected multi-hop edge.
Therefore, the query use threshold of the graph data is low, and a user does not need to learn and master the grammar of the complex graph query language and can directly complete the construction of the graph query task by dragging the icon.
In an application example, referring to the graph query task interface shown in FIG. 2, a user creates a query graph by way of a visualization or command line. Specifically, in response to a trigger operation instruction of a user on the node 1 and the node 2, displaying two node components of the node 1 and the node 2 on a graph query task interface; further, in response to the logical relationship 1 between the node 1 and the node 2, a directed single side for characterizing the logical relationship 1 between the node 1 and the node 2 is displayed on the graph query task interface.
In yet another application example, a user creates a query graph by way of a visualization or command line. Specifically, in response to a trigger operation instruction of a user for the two nodes 1 and 2, displaying two node components of the two nodes 1 and 2 on a graph query task interface; further, in response to the logical relationship 1 between the node 1 and the node 2, displaying a directed single side for representing the logical relationship 1 between the node 1 and the node 2 on a graph query task interface; meanwhile, in response to the logical relationship 2 between the two nodes 1, displaying an undirected indefinite edge for representing the logical relationship 2 between the two nodes 1 on the graph query task interface, and performing attribute configuration, such as step length, on the undirected indefinite edge in a pull-down list of a configuration panel.
In an implementation manner, after operations 501 to 503, the embodiment of the present invention may further include: the first query graph is nested as a subgraph based on operational instructions to the constructed first query graph at a graph query task interface. Namely, one query graph can contain a plurality of subgraphs and can be nested in multiple ways; the setting process of each sub-graph is the same as the operation details of constructing the query graph through the operations 501-503, and the result of one sub-graph can be input into the other sub-graph. Therefore, the invention can construct complex query tasks and complete complex subgraph structure matching, thereby obtaining rich query results and further grouping, filtering and other processing the results.
In operation 504, referring to fig. 3, after the user terminal completes the construction of the query graph, the user terminal may trigger the submission of the query graph to the server, so that the server may analyze the query condition of the query graph, and execute a graph query task according to the analysis.
Specifically, the server analyzes the query conditions of the query graph through analysis rules corresponding to different database languages to obtain analysis results meeting different databases; further, graph query tasks are executed according to the analysis results meeting different database languages. Thus, through operations 501-504, a user can completely realize cross-database graph query processing through graphical simple operations and query tasks describing complex graph structures, and through analysis and execution of a server.
In operation 505, referring to fig. 3, after the server completes the graph query task, the query result is returned to the user terminal, so that the query result is graphically displayed on the display interface of the user terminal. Specifically, the display of the query result can be divided into the following two display modes based on the time: the method comprises the steps that after the user terminal receives a query result returned by the server, the user terminal can graphically display the query result on a display interface in real time; in the second mode, the user terminal firstly stores the query result returned by the server after receiving the query result; and after the user initiates a query instruction, displaying a query result in an imaging manner on a display interface based on the triggering of the query instruction.
It should be noted that, the user may set the attribute of the query result in advance or in real time in a visual manner, specifically including returning the query result display corresponding to which node components and edge components, what kind of processing is performed on the query result, the presentation form of the query result, and the like.
Fig. 6 is a schematic flow chart showing an implementation flow of the graph data query method according to the embodiment of the present invention.
Referring to fig. 6, an embodiment of the present invention provides a graph data query method, where the method includes: operation 601, constructing a query graph based on an operation instruction of the visual image; operation 602, parsing the query condition of the query graph, and executing a graph query task according to the parsing; and operation 603, displaying the query result on the display interface in a graphical mode in real time.
The specific implementation process of operations 601 and 602 is similar to the specific implementation process of operations 101 and 102 in the embodiment shown in fig. 1, and is not described here again.
Referring to fig. 3, in operation 603, after the user terminal receives the query result returned by the server, the user terminal may graphically display the query result on the display interface in real time. It should be noted that, the user may set the attribute of the query result in advance or in real time in a visual manner, specifically including returning the query result display corresponding to which node components and edge components, what kind of processing is performed on the query result, the presentation form of the query result, and the like.
Fig. 7 is a schematic flow chart illustrating an implementation flow of the graph data query method according to the embodiment of the present invention.
Referring to fig. 7, an embodiment of the present invention provides a graph data query method, where the method includes: operation 701, constructing a query graph based on an operation instruction of a visual image; operation 702, parsing the query conditions of the query graph, and executing a graph query task according to the parsing; in operation 703, the query result is graphically displayed on the display interface after the query instruction is submitted.
The specific implementation processes of operations 701 and 702 are similar to the specific implementation processes of operations 101 and 102 in the embodiment shown in fig. 1, and are not described here again.
Referring to fig. 3, in operation 703, the query result returned by the server is saved after the user terminal receives the query result; and after the user initiates a query instruction, displaying a query result in an imaging manner on a display interface based on the triggering of the query instruction. It should be noted that, the user may set the attribute of the query result in advance or in real time in a visual manner, specifically including returning the query result display corresponding to which node components and edge components, what kind of processing is performed on the query result, the presentation form of the query result, and the like.
In this way, the query method of graph data according to the embodiment of the present invention first constructs a query graph based on an operation instruction of a visual image, wherein the query graph at least includes node components for representing data objects and edge components for representing logical relationships between the node components; analyzing the query condition of the query graph, and executing a graph query task according to the analysis; and then graphically displaying the query result on the display interface. Therefore, the visual graph query task description is carried out in a mode of constructing the query graph through the operation instruction of the visual image, so that a user can describe the query task of a complex graph structure completely through graphical simple operation; meanwhile, the query result can be visually and visually displayed, the use threshold of a user is low, convenience and convenience are realized, and the user experience degree is high.
Similarly, based on the graph data query method described above, an embodiment of the present invention further provides a computer-readable storage medium, where a program is stored, and when the program is executed by a processor, the processor is caused to perform at least the following operation steps: operation 101, constructing a query graph based on an operation instruction of a visual image; operation 102, parsing the query conditions of the query graph, and executing a graph query task according to the parsing; and operation 103, displaying the query result graphically on the display interface.
Further, based on the graph data query method described above, an embodiment of the present invention further provides a graph data query apparatus, as shown in fig. 8, where the apparatus 80 at least includes: a building module 801, configured to build a query graph based on an operation instruction of a visual graph, where the query task graph includes at least a node component for representing a data object and an edge component for representing a logical relationship between node components; an execution module 802, configured to analyze the query condition of the query graph, and execute a graph query task according to the analysis; and the display module 803 is used for displaying the query result in a graphical manner on the display interface.
According to an embodiment of the present invention, the building module 801 is specifically configured to display a node component on a graph query task interface based on a trigger operation instruction for the node component; based on the setting of the logical relationship among the node components, displaying edge components for representing the logical relationship among the node components on the graph query task interface; configuring the properties of the node component or edge component based on property option settings.
According to an embodiment of the present invention, the building module 801 is further configured to nest the first query graph as a sub graph based on an operation instruction on the built first query graph at the graph query task interface.
According to an embodiment of the present invention, the display module 803 is specifically configured to graphically display the query result on a display interface in real time; or, after the query instruction is submitted, the query result is graphically displayed on the display interface.
Here, it should be noted that: the above description of the embodiment of the apparatus for querying graph data is similar to the description of the method embodiments shown in fig. 1 to 7, and has similar beneficial effects to the method embodiments shown in fig. 1 to 7, and therefore, the description thereof is omitted. For technical details not disclosed in the embodiment of the apparatus for querying graph data of the present invention, please refer to the description of the method embodiments shown in fig. 1 to 7 of the present invention for understanding, and therefore, for brevity, will not be described again.
It should be noted that, in this document, 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, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
In the several embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other ways. The above-described device embodiments are merely illustrative, for example, the division of the unit is only a logical functional division, and there may be other division ways in actual implementation, such as: multiple units or components may be combined, or may be integrated into another system, or some features may be omitted, or not implemented. In addition, the coupling, direct coupling or communication connection between the components shown or discussed may be through some interfaces, and the indirect coupling or communication connection between the devices or units may be electrical, mechanical or other forms.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units; can be located in one place or distributed on a plurality of network units; some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, all the functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may be separately regarded as one unit, or two or more units may be integrated into one unit; the integrated unit can be realized in a form of hardware, or in a form of hardware plus a software functional unit.
Those of ordinary skill in the art will understand that: all or part of the steps for realizing the method embodiments can be completed by hardware related to program instructions, the program can be stored in a computer readable storage medium, and the program executes the steps comprising the method embodiments when executed; and the aforementioned storage medium includes: various media that can store program codes, such as a removable Memory device, a Read Only Memory (ROM), a magnetic disk, or an optical disk.
Alternatively, the integrated unit of the present invention may be stored in a computer-readable storage medium if it is implemented in the form of a software functional module and sold or used as a separate product. Based on such understanding, the technical solutions of the embodiments of the present invention may be essentially implemented or a part contributing to the prior art may be embodied in the form of a software product, which is stored in a storage medium and includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the methods described in the embodiments of the present invention. And the aforementioned storage medium includes: a removable storage device, a ROM, a magnetic or optical disk, or other various media that can store program code.
The above description is only for the specific embodiments of the present invention, but the scope of the present invention is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present invention, and all the changes or substitutions should be covered within the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the appended claims.
Claims (10)
1. A method for querying graph data, the method comprising:
constructing a query graph based on an operation instruction of a visual graph, wherein the query graph at least comprises node components for representing data objects and edge components for representing logical relations among the node components;
analyzing the query condition of the query map, and executing a map query task according to the analysis;
and graphically displaying the query result on the display interface.
2. The method of claim 1, wherein constructing a query graph based on the operation instructions of the visual graph comprises:
displaying the node component on a graph query task interface based on a trigger operation instruction of the node component;
based on the setting of the logical relationship among the node components, displaying edge components for representing the logical relationship among the node components on the graph query task interface;
configuring the properties of the node component or edge component based on property option settings.
3. The method of claim 1, wherein the node components comprise physical nodes or concept nodes; the edge assembly includes a fixed edge or an indefinite edge.
4. The method of claim 1, wherein constructing a query graph further comprises:
the first query graph is nested as a subgraph based on operational instructions to the constructed first query graph at a graph query task interface.
5. The method of any one of claims 1 to 4, wherein graphically displaying the query results on the display interface comprises:
displaying the query result on a display interface in a graphical manner in real time;
or, graphically displaying the query result on the display interface based on the trigger of the query instruction.
6. An apparatus for querying graph data, the apparatus comprising:
the query task graph at least comprises node components used for representing data objects and edge components used for representing the logical relationship among the node components;
the execution module is used for analyzing the query condition of the query map and executing a graph query task according to the analysis;
and the display module is used for displaying the query result in a graphical mode on the display interface.
7. The apparatus of claim 6,
the construction module is specifically used for displaying the node assembly on a graph query task interface based on a trigger operation instruction of the node assembly; based on the setting of the logical relationship among the node components, displaying edge components for representing the logical relationship among the node components on the graph query task interface; configuring the properties of the node component or edge component based on property option settings.
8. The apparatus of claim 6,
the building module is further used for nesting and configuring the first query map as a sub-map based on an operation instruction of the built first query map at the map query task interface.
9. The apparatus according to any one of claims 6 to 8,
the display module is specifically used for displaying the query result on a display interface in a graphical manner in real time; or, after the query instruction is submitted, the query result is graphically displayed on the display interface.
10. A computer-readable storage medium comprising a set of computer-executable instructions which, when executed, perform a method of querying graph data according to any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010579437.0A CN111931001B (en) | 2020-06-23 | 2020-06-23 | Query method and device for graph data and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010579437.0A CN111931001B (en) | 2020-06-23 | 2020-06-23 | Query method and device for graph data and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111931001A true CN111931001A (en) | 2020-11-13 |
| CN111931001B CN111931001B (en) | 2024-08-23 |
Family
ID=73316647
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010579437.0A Active CN111931001B (en) | 2020-06-23 | 2020-06-23 | Query method and device for graph data and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111931001B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114925241A (en) * | 2022-04-24 | 2022-08-19 | 杭州悦数科技有限公司 | Method, system, electronic device and storage medium for processing graph data |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101980213A (en) * | 2010-11-23 | 2011-02-23 | 中国科学院软件研究所 | J2EE-based data persistence method and system |
| US20170286555A1 (en) * | 2013-05-03 | 2017-10-05 | Facebook, Inc. | Search Query Interactions |
| CN108874907A (en) * | 2018-05-25 | 2018-11-23 | 北京明略软件系统有限公司 | A kind of data query method and apparatus, computer readable storage medium |
| CN110019560A (en) * | 2017-12-28 | 2019-07-16 | 中国移动通信集团上海有限公司 | A kind of querying method and device of knowledge based map |
| CN111008212A (en) * | 2019-12-09 | 2020-04-14 | 国家电网有限公司客户服务中心 | Retrieval path analysis and visualization system and method based on data association relation |
| CN111177342A (en) * | 2019-12-13 | 2020-05-19 | 天津大学 | Knowledge graph interactive visual query language based on bidirectional conversion |
-
2020
- 2020-06-23 CN CN202010579437.0A patent/CN111931001B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101980213A (en) * | 2010-11-23 | 2011-02-23 | 中国科学院软件研究所 | J2EE-based data persistence method and system |
| US20170286555A1 (en) * | 2013-05-03 | 2017-10-05 | Facebook, Inc. | Search Query Interactions |
| CN110019560A (en) * | 2017-12-28 | 2019-07-16 | 中国移动通信集团上海有限公司 | A kind of querying method and device of knowledge based map |
| CN108874907A (en) * | 2018-05-25 | 2018-11-23 | 北京明略软件系统有限公司 | A kind of data query method and apparatus, computer readable storage medium |
| CN111008212A (en) * | 2019-12-09 | 2020-04-14 | 国家电网有限公司客户服务中心 | Retrieval path analysis and visualization system and method based on data association relation |
| CN111177342A (en) * | 2019-12-13 | 2020-05-19 | 天津大学 | Knowledge graph interactive visual query language based on bidirectional conversion |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114925241A (en) * | 2022-04-24 | 2022-08-19 | 杭州悦数科技有限公司 | Method, system, electronic device and storage medium for processing graph data |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111931001B (en) | 2024-08-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11386156B1 (en) | Threshold establishment for key performance indicators derived from machine data | |
| US11645471B1 (en) | Determining a relationship recommendation for a natural language request | |
| CN106933889B (en) | Configuration method, display method and client for screened rules | |
| US10936620B2 (en) | Systems and methods for management of multi-perspective customer segments | |
| CN112000763A (en) | Method, device, equipment and medium for determining competition relationship of interest points | |
| CN111931001A (en) | Graph data query method and device and storage medium | |
| CN109816410A (en) | The analysis method and device of advertisement major product audience | |
| CN108694242B (en) | Node searching method, equipment, storage medium and device based on DOM | |
| EP3690675A1 (en) | Method, apparatus, and storage medium for providing visual representation of set of objects | |
| CN114279457B (en) | Path planning method, device, equipment and readable storage medium | |
| US10365808B2 (en) | Metadata-based navigation in semantic zoom environment | |
| CN112988986B (en) | Man-machine interaction method, device and equipment | |
| JP5845818B2 (en) | Region search method, region search program, and information processing apparatus | |
| CN113064911B (en) | Query method, device and storage medium | |
| US20240111778A1 (en) | Visualization methods and apparatuses for query result of graph database | |
| CN111433768B (en) | System and method for intelligently guiding shopping | |
| US20220076048A1 (en) | Graph-based configuration of user interface for selection of features in visualization applications | |
| CN117149890A (en) | Management method of data asset map and related equipment | |
| CN116931901A (en) | Layout method, device, equipment and storage medium of user interface | |
| CN117909734A (en) | Label generating apparatus, label generating method, electronic device, and computer-readable storage medium | |
| CN117196846A (en) | Risk identification method, risk identification device, computer equipment and storage medium | |
| CN116843913A (en) | Commodity feature processing method and device, computer equipment and storage medium | |
| CN113934721A (en) | Data cleaning method and computer readable storage medium | |
| CN114302343A (en) | Electronic price tag image pushing method and related equipment | |
| CN114417071A (en) | Node state determination method, device, equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |