Graph Database Visualization for Code-Free Relationship Exploration

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing data manipulation and visualization technologies, particularly in graph databases, struggle to effectively explore and manipulate relationships within data without requiring complex queries or code, making it difficult for users to locate relevant information and encode new associations.

Innovation Solution

Graph database manipulation systems that generate visual representations of graph databases from a source node perspective, allowing recursive location and manipulation of related nodes and edges based on edge metadata, with capabilities for permission management and integration with external data sources.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If complex queries or code are used to explore and manipulate graph database relationships, then data manipulation capability is improved, but ease of operation deteriorates

Engineering Contradiction:
Improvedata manipulation capabilityVSAvoidease of operation
Core Design Contradiction:
Adaptability or versatilityVSEase of operation

Solution Approach 1:

The patent introduces a visual interface as an intermediary between the user and the graph database manipulation operations. This interface allows users to explore and manipulate relationships through graphical representations and visual interactions rather than requiring complex queries or programming code, thus maintaining data manipulation capability while significantly improving ease of operation

Inventive Principle:
Principle #24Intermediary (Mediator)

Solution Approach 2:

The patent replaces the mechanical system of text-based queries and code with a visual interaction system. Users can explore graph relationships, locate nodes, and manipulate data structures through visual elements and graphical operations, substituting the traditional code-based approach with an intuitive visual interface that maintains functionality while improving accessibility

Inventive Principle:
Principle #28Mechanics substitution (Replace mechanical system)

2Ease of operation

If visual representations are generated from source node perspective with recursive location of related nodes, then ease of operation is improved, but device complexity increases

Engineering Contradiction:
Improveease of operationVSAvoidsystem complexity
Core Design Contradiction:
Ease of operationVSDevice complexity

Solution Approach 1:

The patent segments the graph database visualization into hierarchical levels based on the source node perspective. Related nodes are organized in recursive generations (directly connected nodes, nodes connected to those nodes, and so on), allowing the complex graph to be divided into manageable visual segments that can be explored incrementally, thus improving ease of operation while managing system complexity through structured organization

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent implements a nested structure where the visualization of related nodes is recursively embedded within the source node perspective. Each level of related nodes contains further nested levels, creating a hierarchical nesting pattern that allows complex graph relationships to be visualized in an organized manner, improving user interaction while systematically managing the complexity through recursive nesting

Inventive Principle:
Principle #7Nested doll (Nesting)

Data Source

PatentUS20250308106A1Systems and Methods for Visualizing and Manipulating Graph Databases
Publication Date: 2025.10.02 DRISK INC
  • US20250308106A1 patent drawing
  • US20250308106A1 patent drawing
  • US20250308106A1 patent drawing

AI summary

Systems and methods for visualizing and manipulating graph databases in accordance embodiments of the invention are disclosed. In one embodiment of the invention, a graph database manipulation device including a processor and a memory configured to store a graph database manipulation application, wherein the graph database manipulation application configures the processor to obtain a graph database, wherein the graph database includes a set of nodes and a set of edges, identify a region of interest within a graph described by the graph database, construct a feature space from the region of interest, and extract explanatory variables from the feature space.