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

A graph data access method and device based on group association table

An access method and associated table technology, applied in the field of data processing, can solve problems such as the expansion of graph data storage scale, affecting the query efficiency of graph database, etc.

Active Publication Date: 2020-10-30
四川蜀天梦图数据科技有限公司 +1
View PDF9 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, since graph databases generally store attribute graphs with attributes on vertices and edges, if the attribute data and topology data are aggregated and stored, the storage scale of graph data will expand, thus putting forward higher requirements for graph division. requirements; moreover, if the attribute data of the graph are divided together, a unified inverted index cannot be established on the attribute data, which will also affect the query efficiency of the graph database

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 graph data access method and device based on group association table
  • A graph data access method and device based on group association table
  • A graph data access method and device based on group association table

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0042]The embodiment of the present invention provides a graph data access method based on the group association table, such as figure 1 , including the following steps:

[0043] Step 201, using the attribute table to store the attribute data of the graph, and using the group association table to store the topology data of the graph; wherein, the topology data includes adjacent vertices and associated edge information of each vertex in the graph.

[0044] Graph data can be divided into attribute data and topological data. The attribute data and the topological data are stored separately using different data storage structures. Among them, the attribute data of points and edges in the graph are stored in the attribute table, which can be stored through the Key - Value can be stored in the form of a link or linked list. The topology data of the graph is stored in the group association table, which can also be realized in the form of Key-Value. The group association table can st...

Embodiment 2

[0072] After Embodiment 1 provides a method for accessing graph data based on a group association table, an embodiment of the present invention also provides a device for accessing graph data based on a group association table by using the above method, such as Figure 6 Shown is a schematic diagram of the structure of the graph data access device based on the group association table according to the embodiment of the present invention. The graph data access device includes one or more processors 21 and a memory 22 . in, Figure 6 A processor 21 is taken as an example.

[0073] Processor 21 and memory 22 can be connected by bus or other means, Figure 6 Take connection via bus as an example.

[0074] The memory 22, as a non-volatile computer-readable storage medium, can be used to store non-volatile software programs, non-volatile computer-executable programs and modules, such as the graph data storage based on the group association table in Embodiment 1. fetch method and ...

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 relates to the field of data processing, in particular to a method and a device for accessing graph data based on a grouping association table, wherein, the method comprises the following steps: adopting an attribute table to store attribute data of a graph; adopting a grouping association table to store topological data of the graph; the topological data including information of adjacent vertices and associated edges of each vertex; setting different memory scheduling priorities for topology data and attribute data respectively, and the memory scheduling priority of topology data being higher than that of attribute data, according to different query requirements, and selecting the corresponding data storage structure to read the graph data information. The invention can completely store the adjacency point and the associated edge information of the point only through the data storage structure of the grouping association table. When the attribute information is not used,the invention only accesses the grouping association table to complete the traversal inquiry of the graph, thereby improving the traversal inquiry efficiency; At the same time, attribute data and topology data are stored separately, and different memory scheduling priorities are set according to weights, which further improves the performance of traversal query.

Description

【Technical field】 [0001] The invention relates to the field of data processing, in particular to a method and device for accessing graph data based on a group association table. 【Background technique】 [0002] A graph is a commonly used data structure in computer science, and it is a more complex data structure than linear lists and trees. In a graph, there can be a connection between any two vertices. If there is at most one edge between two vertices, such a graph is called a simple graph; if there is more than one edge between two vertices, such a graph is called a multigraph. [0003] The most common data structures for storing graph data are: adjacency list and association matrix. The feature of the adjacency list is to use a linear table to store the set of adjacent vertices of each vertex; the association matrix is ​​to use a matrix to store the associated edges of each vertex. We can also use a linear table to save the set of associated edges of each vertex, which ...

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 Patents(China)
IPC IPC(8): G06F16/901G06F16/903
Inventor 李海波李专吕伟李鹏吕继云
Owner 四川蜀天梦图数据科技有限公司
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