Relational Graph Database Synthesizing Partial Graphs
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current relational graph database systems lack efficient methods for generating and managing graph data, particularly in connecting node data across various operations and locations, and extracting relevant information from this data.
Innovation Solution
A relational graph database system that includes a node generation unit, partial graph generation unit, and graph generation unit to synthesize node data into graph data, with link management and extraction capabilities, allowing for the connection of node data across operations and locations, and extracting data based on centricity and path length from reference nodes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of information
If graph data is generated by connecting node data from multiple operations and locations, then the comprehensiveness and detail of the graph data is improved, but the complexity of data management and processing increases
Solution Approach 1:
The system segments the graph data generation process into distinct functional units: a node generation unit that creates individual node data from operations and locations, a partial graph generation unit that connects nodes into local graph structures, and a graph generation unit that synthesizes multiple partial graphs into comprehensive graph data. This segmentation allows each unit to handle specific tasks independently, reducing overall system complexity while maintaining data completeness.
Solution Approach 2:
The partial graph data serves as an intermediary structure between individual node data and the final comprehensive graph data. The partial graph generation unit creates intermediate graph structures that connect node data from the same terminal device, and the graph generation unit then synthesizes these partial graphs. This intermediary approach simplifies the synthesis process by working with smaller, manageable graph structures rather than directly managing all node data simultaneously.
2Adaptability or versatility
If multiple types of node data are connected through links regardless of type, then the versatility and applicability of the graph data is improved, but the difficulty of detecting and measuring relationships increases
Solution Approach 1:
The system applies local quality by allowing different types of node data to be connected through links based on their specific characteristics and relationships. The partial graph generation unit connects node data from the same terminal device regardless of type, creating locally meaningful connections. The graph generation unit then synthesizes these partial graphs while preserving the local relationship structures, enabling versatile graph data that maintains the specific qualities of different node types and their relationships.
3Productivity
If graph synthesis is conducted on partial graph data containing common node data, then the efficiency of graph generation is improved, but the precision of maintaining links between common node data pairs may be compromised
Solution Approach 1:
The graph generation unit conducts graph synthesis by identifying common node data between partial graphs and maintaining the links between these common node data pairs. The system uses feedback mechanisms to track and preserve the relationships established in partial graphs during the synthesis process, ensuring that links between common nodes are maintained with precision while still achieving efficient graph generation through the partial graph approach.
Data Source
Figure 1
Figure 2
Figure 3(a)~3(c)
AI summary
There is provided a novel method that generates relational graph data. A relational graph database system 1 manages a database containing graph data including node data connected through links. The relational graph database system 1 includes a node generation unit 212 that generates node data corresponding to an operation of a terminal device 6, a partial graph generation unit 214 that generates partial graph data including a plurality of node data connected through links, and a graph generation unit 215 that synthesizes a plurality of partial graphs to generate graph data. In the partial graph generation unit 214, when a plurality of operations conducted in an identical terminal device have a prescribed relationship, a plurality of node data corresponding to the plurality of operations are connected through links to generate partial graph data.