Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

A network graph index method based on adjacent node trees

A technology of adjacent nodes and network diagrams, applied in special data processing applications, instruments, electrical digital data processing, etc., can solve problems such as complex operations and easy loss of node structure information, and achieve the effect of effective filtering and fast query

Inactive Publication Date: 2012-09-12
ZHEJIANG UNIV
View PDF5 Cites 29 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] Aiming at the current problem of complex operations in subgraph query and easy loss of structural information around nodes, the present invention proposes a method that can use more complex structural information between nodes to index and improve the efficiency of subgraph query

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • A network graph index method based on adjacent node trees
  • A network graph index method based on adjacent node trees
  • A network graph index method based on adjacent node trees

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0034] The specific implementation process of the present invention will be described in detail below in conjunction with the accompanying drawings.

[0035] by figure 1 As a large network graph, figure 2 Taking the query graph as an example, the implementation steps of the present invention are specifically described, wherein A, B, C, and D are node labels, and u is a node of a large network graph, figure 1 Medium and large network graph nodes include u 0 to u 13 A total of 14 nodes, v is the query graph node, figure 2 The query graph includes v 0 to v 3 There are 4 nodes in total.

[0036] Such as image 3 As shown, a kind of network graph indexing method based on adjacent node tree provided by the present invention comprises steps:

[0037] S1. Establish an adjacency node tree index of the network graph according to the adjacency relationship between the nodes of the network graph, and decompose the query graph according to the adjacency relationship between the n...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a subgraph query method in a large scale network graph based on adjacent node trees. The invention uses the adjacent relation of nodes to form index trees, and uses the adjacent node trees as an index characteristic of the large scale network graph to realize the query process of the subgraph. First, a graphic label list, a layer by layer tag list, and an edge list are established according to the adjacent relation of the graph nodes, and adjacent node tree index is constructed based on the lists; secondly, the nodes matching candidate set are obtained through decomposing the query graph to the adjacent node tree sets and tailoring the candidate nodes by utilizing the established adjacent node tree index; and finally, by employing the strategy of covering the query graph with the adjacent node tree sets, a subgraph query result is obtained based on the node matching method. The method uses the adjacent relation to realize effective filtering of the candidate nodes and rapid covering of the query graph, and is capable of supporting rapid query of the subgraph in the large scale network graph.

Description

technical field [0001] The invention belongs to the technical field of information retrieval and its database structure, and in particular relates to a subgraph query method based on an adjacent node tree in a large network graph. Background technique [0002] Graphs are important data structures in computer science. With the continuous development of information technology, more and more data are logically expressed in graphs, such as biological networks, chemical molecular structures, social networks, and protein networks. The amount of data contained in these graph data is also constantly increasing, for example, 4,000 new chemical structures are added to the SCF Finder database every day. In particular, the number of nodes in the current social network graph has reached hundreds of millions. Therefore, how to effectively manage and mine massive graph data is the core issue of graph database research. Specifically include: 1) How to establish an effective storage mecha...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): G06F17/30
Inventor 贝毅君徐俊干红华刘二腾
Owner ZHEJIANG UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com