Graph Data Storage via Unified Point and Edge Tables
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current storage and management systems for graph data face challenges in efficiently storing and querying massive and complex graph data, leading to low read/write efficiency and high costs for device operation and maintenance.
Innovation Solution
A storage method and system for graph data that organizes node and edge information in aligned point and edge tables within a data block, reducing the frequency of read/write operations and enabling efficient query processing.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If graph data is stored in separate tables for nodes and edges, then data organization is simplified, but query efficiency deteriorates due to multiple read/write operations
Solution Approach 1:
The patent combines node information and edge information into a single unified data block structure. The point table stores node identifiers, while the edge table stores edge information including source node identifiers and target node identifiers, all within the same data block. This merging eliminates the need for separate read/write operations on multiple tables, thereby improving query efficiency while maintaining organized data structure.
2Quantity of substance
If graph data is stored in distributed systems, then storage capacity increases, but system complexity and operation maintenance costs increase
Solution Approach 1:
The patent segments graph data into fixed-size data blocks, where each block contains a point table and an edge table. This segmentation allows the system to manage large volumes of graph data by processing and storing them in manageable units. The segmented block structure enables efficient local processing and reduces the need for complex distributed system operations, thereby increasing storage capacity while controlling system complexity.
3Ease of operation
If multiple read/write operations are performed for graph queries, then data access flexibility increases, but operation time increases
Solution Approach 1:
The patent performs preliminary organization of graph data by pre-structuring it into unified data blocks with point tables and edge tables in a specific format. This preliminary action allows query operations to directly access the organized data without requiring multiple sequential read/write operations. The pre-organized structure enables flexible data access while significantly reducing operation time by eliminating redundant operations.
Data Source
AI summary
This specification relates to storage methods, systems, and apparatuses for graph data. The graph data includes a node and an edge. The storage method includes: storing, in a point table of a data block, node information of several nodes in the graph data, where the node information includes a node identifier; storing edge information of edges of the several nodes in an edge table of the data block, where the edge information includes node identifiers of target nodes connected to the edges; storing attribute information of the several nodes in a point attribute table of the data block; and storing attribute information of the edges of the several nodes in an edge attribute table of the data block.