Distributed Graph Database Query Optimization

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Conventional relational databases are inefficient in managing unstructured data with complex inter-relationships, requiring intensive computational and memory resources and making real-time decision-making difficult due to exponential query time and the need for time-consuming Extract Transform Load (ETL) processes.

Innovation Solution

A distributed graph system that loads graph structures into distributed memory, optimizes data placement using graph topology and daemons for load balancing, and provides a visualization dashboard for interactive graph analytics, allowing multiple query methods and supporting snapshot isolation to track graph evolution over time.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If relational databases are used to manage unstructured data with complex inter-relationships, then data storage is achieved, but query time increases exponentially and intensive computational and memory resources are required

Engineering Contradiction:
Improvedata storage capabilityVSAvoidquery time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The patent segments the graph database into multiple partitions distributed across different nodes in a cluster. Each partition contains a subset of vertices and edges, allowing queries to be processed in parallel across multiple nodes rather than sequentially on a single node, thereby reducing query time for complex inter-relationship data

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent introduces a distributed in-memory computation layer as an intermediary between the storage layer and query interface. This layer caches frequently accessed graph data in memory and handles query processing, reducing the need for repeated disk I/O operations and intensive computational resources during queries

Inventive Principle:
Principle #24Intermediary (Mediator)

2Loss of information

If relational databases perform multi-table joins to infer data relationships, then data relationships can be established, but intensive computational and memory resources are consumed

Engineering Contradiction:
Improvedata relationship representationVSAvoidcomputational and memory resources
Core Design Contradiction:
Loss of informationVSUse of energy by moving object

Solution Approach 1:

Instead of using relational databases that infer relationships through multi-table joins, the patent inverts the approach by natively storing data in graph structure with explicit relationships represented as edges between vertices. This eliminates the need for computationally intensive join operations while preserving complete data relationship information

Inventive Principle:
Principle #13The other way round (Inversion)

Solution Approach 2:

The patent changes the fundamental data model parameter from relational tables to graph structures. By representing entities as vertices and relationships as edges with associated properties, the system transforms the way data relationships are stored and queried, reducing computational resource requirements for relationship inference

Inventive Principle:
Principle #35Parameter changes

3Quantity of substance

If graph data is distributed across multiple nodes, then storage capacity and processing power are increased, but data placement optimization becomes more complex

Engineering Contradiction:
Improvestorage capacity and processing powerVSAvoiddata placement optimization
Core Design Contradiction:
Quantity of substanceVSDevice complexity

Solution Approach 1:

The patent implements self-service mechanisms where each node in the distributed cluster autonomously manages its own data placement and caching decisions. Nodes independently determine which graph partitions to store locally based on query patterns and data locality requirements, eliminating the need for complex centralized data placement optimization algorithms

Inventive Principle:
Principle #25Self-service

4Reliability

If ETL processes are used in relational databases to prepare data, then data can be loaded into the database, but time-consuming extraction, transformation, and loading operations are required

Engineering Contradiction:
Improvedata loading capabilityVSAvoidETL process time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The patent implements preliminary action by pre-computing and caching frequently accessed graph data in the distributed in-memory computation layer before queries are executed. Data is transformed and organized into graph structure in advance during the loading phase, eliminating the need for time-consuming ETL transformations during query operations

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS10409782B2Platform, system, process for distributed graph databases and computing
Publication Date: 2019.09.10 ZHEJIANG CHUANGLIN TECH CO LTD
  • US10409782B2 patent drawing
  • US10409782B2 patent drawing
  • US10409782B2 patent drawing

AI summary

Systems for distributed graph data management that use graph structures to model data and respond to different types of queries. Systems that provide analytic tools and machine learning based on graph structures. Systems for distributed graph data management that provide packaged solutions for different application areas.