Graph Database for Organizational Information Access

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Relational databases are cumbersome and resource-intensive when searching for information in organizations, especially as the number of search parameters increases, leading to inefficiencies in generating organizational charts and identifying employees with specific skills within a selected distance.

Innovation Solution

A graph database system with nodes and relationships is introduced, allowing for efficient information retrieval and synchronization with legacy databases, enabling faster access and visualization of organizational information while reducing processing resources needed.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If relational databases are used to store organization information, then data can be stored in structured tables, but searching and generating organizational charts becomes cumbersome and resource-intensive

Engineering Contradiction:

Improvesearch efficiencyVSAvoiddatabase complexity

Core Design Contradiction:

ProductivityVSDevice complexity

Solution Approach 1:

The patent creates a graph database that copies and transforms organization information from the relational database into a graph structure. This copy operates independently with nodes representing entities and edges representing relationships, enabling efficient graph-based queries without modifying the original relational database structure.

Inventive Principle:

Principle #26Copying

Solution Approach 2:

The patent changes the fundamental data structure parameter from tabular relations to graph topology. By transforming the organization data into nodes and edges, the system enables direct traversal and relationship-based queries that are exponentially faster for organizational chart generation and employee search operations.

Inventive Principle:

Principle #35Parameter changes

2Adaptability or versatility

If multiple search parameters are added to relational databases, then more comprehensive searches can be performed, but the complexity and resources needed increase significantly

Engineering Contradiction:

Improvesearch capabilityVSAvoidprocessing resources

Core Design Contradiction:

Adaptability or versatilityVSUse of energy by moving object

Solution Approach 1:

The patent segments the search functionality by separating the graph database (optimized for relationship and hierarchy queries) from the relational database (optimized for transactional data). This segmentation allows each database type to handle queries most efficiently, with the graph database managing organizational structure searches independently of complex relational joins.

Inventive Principle:

Principle #1Segmentation

Solution Approach 2:

The graph database acts as an intermediary layer between the user and the relational database. It pre-processes and stores organizational relationships in an optimized format, serving as a mediator that handles complex relationship queries without requiring the relational database to perform resource-intensive joins and aggregations.

Inventive Principle:

Principle #24Intermediary (Mediator)

3Loss of time

If relational databases store organization information, then data can be managed using standard table structures, but generating organizational charts and searching for employees becomes time-consuming

Engineering Contradiction:

Improveaccess timeVSAvoidoperational simplicity

Core Design Contradiction:

Loss of timeVSEase of operation

Solution Approach 1:

The patent performs preliminary action by pre-computing and storing organizational relationships in the graph database during data ingestion. Organizational charts, employee hierarchies, and relationship paths are pre-established in the graph structure, enabling instant retrieval without performing complex queries at access time.

Inventive Principle:

Principle #10Preliminary action

Solution Approach 2:

The patent substitutes the mechanical system of relational database joins and aggregations with graph theory-based traversal. Instead of using SQL joins to navigate relationships, the system uses efficient graph algorithms that traverse nodes and edges directly, dramatically reducing computation time for organizational queries.

Inventive Principle:

Principle #28Mechanics substitution (Replace mechanical system)

Data Source

PatentUS10783213B2Flexible graph system for accessing organization information

Publication Date: 2020.09.22 ADP INC

AI summary

A method and apparatus for accessing a graph database having nodes and relationships describing an organization. An interface in a computer system receives a request from a client to access information about the organization. Further, the interface in the computer system retrieves the information from the graph database having nodes and relationships describing the organization. Still further, the interface in the computer system sends a portion of the information to the client based on how much of the information is displayable by the client.