Directed Property Graph Search with Value Indexing and Encryption

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Conventional database management systems face inefficiencies in executing data searches and lack robust security measures, particularly in graph-based databases, leading to time-consuming and vulnerable data retrieval processes.

Innovation Solution

A directed property graph approach is used to store and manage data, where data values are stored as value vertices with associated edges, enabling efficient data searches through a value index table and vertex index table, and employing encryption techniques to enhance security.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Loss of time

If conventional database management systems are used for data storage and retrieval, then data can be stored and accessed, but search time is excessive and security is vulnerable

Engineering Contradiction:
Improvesearch timeVSAvoidsecurity vulnerability
Core Design Contradiction:
Loss of timeVSReliability

Solution Approach 1:

The patent segments the database into a directed property graph structure with distinct value vertices, entity vertices, and edges. This segmentation enables efficient traversal by organizing data relationships spatially, reducing search time while maintaining security through structured access paths.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent introduces encryption as an intermediary layer between data storage and retrieval operations. Encryption protects sensitive information in the graph database, addressing security vulnerabilities while allowing controlled access through decryption mechanisms.

Inventive Principle:
Principle #24Intermediary (Mediator)

2Adaptability or versatility

If conventional database systems execute information searches with context, then context-specific records are retrieved, but data searches without context are not feasible

Engineering Contradiction:
Improvesearch flexibilityVSAvoidsearch efficiency
Core Design Contradiction:
Adaptability or versatilityVSProductivity

Solution Approach 1:

The directed property graph structure provides universal functionality for both context-specific information searches and context-independent data searches. The graph's flexible traversal capabilities enable the same system to handle multiple search types efficiently, improving both adaptability and productivity.

Inventive Principle:
Principle #6Universality (Multi-functionality)

Data Source

PatentUS20250322020A1System and method for executing searches using directed property graphs
Publication Date: 2025.10.16 INFOSYS LTD
  • US20250322020A1 patent drawing
  • US20250322020A1 patent drawing
  • US20250322020A1 patent drawing

AI summary

A system for executing a search in a dataset is provided. The system includes a storage element that stores a directed property graph derived from the dataset. The directed property graph includes entity vertices corresponding to entities of the dataset, edges corresponding to properties of the entities, and value vertices corresponding to data values of the properties. Each edge couples an entity vertex to a value vertex and includes a label indicating an association therebetween. The system further includes processing circuitry that receives a search query including a reference value. The processing circuitry identifies a value vertex having a data value that is associated with the reference value and generates a response to the search query based on labels of edges coupled to the value vertex, and entities of the dataset represented by entity vertices coupled to the value vertex by way of the edges.