Federation Node Graph Database Cross-Domain Query Privacy

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current systems face challenges in performing efficient cross-domain queries while ensuring data privacy, which is crucial for discovering risks in cross-domain services, as entities may not have direct access to sensitive information from other objects due to confidentiality constraints.

Innovation Solution

A method involving determining a first information to be queried, querying associated information from a graph database, and sending a second query request to designated federation nodes to obtain query results, allowing for efficient cross-domain querying while maintaining data privacy by leveraging a federation system with graph databases managed independently by each node.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If direct access to other objects' sensitive information is allowed, then query efficiency is improved, but data privacy is compromised

Engineering Contradiction:
Improvequery efficiencyVSAvoiddata privacy risk
Core Design Contradiction:
ProductivityVSObject-affected harmful factors

Solution Approach 1:

The patent introduces a federation node as an intermediary between the current node and remote graph databases. The federation node receives queries from the current node, formulates appropriate query requests, and obtains results from remote databases without exposing private data structures. This mediator enables efficient cross-domain queries while maintaining data privacy through controlled information access.

Inventive Principle:
Principle #24Intermediary (Mediator)

Solution Approach 2:

The system segments the graph database into multiple independent graph databases managed by different federation nodes. Each node maintains its own private data while participating in a federation that allows coordinated queries. This segmentation enables parallel query processing across multiple databases while preserving data isolation and privacy for each individual node.

Inventive Principle:
Principle #1Segmentation

2Object-affected harmful factors

If multiple graph databases are queried independently, then data privacy is maintained, but query complexity increases

Engineering Contradiction:
Improvedata privacy protectionVSAvoidquery processing complexity
Core Design Contradiction:
Object-affected harmful factorsVSDevice complexity

Solution Approach 1:

The federation node serves multiple functions: it acts as a query router, data translator, and result aggregator. By making the federation node multi-functional, the patent simplifies the overall system architecture and reduces query processing complexity while maintaining the ability to query multiple independent graph databases privately.

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

3Adaptability or versatility

If cross-domain queries are enabled, then information discovery capability is improved, but system complexity increases

Engineering Contradiction:
Improvecross-domain query capabilityVSAvoidsystem architecture complexity
Core Design Contradiction:
Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The federation node serves as an intermediary layer that handles all cross-domain query operations. It receives queries from the current node, determines which remote graph databases need to be queried, formulates appropriate query requests, and aggregates results. This mediator approach enables cross-domain query capability while keeping the current node's architecture simple and unchanged.

Inventive Principle:
Principle #24Intermediary (Mediator)

Data Source

PatentUS12189639B2Method of processing information, electronic device, and storage medium
Publication Date: 2025.01.07 BEIJING BAIDU NETCOM SCI & TECH CO LTD
  • US12189639B2 patent drawing
  • US12189639B2 patent drawing
  • US12189639B2 patent drawing

AI summary

A method of processing an information, an electronic device, and a storage medium are provided, which relate to a field of an artificial intelligence technology, in particular to a field of a knowledge graph technology. An implementation includes: determining a first information, in response to receiving a first query request; querying an information associated with the first information from a current graph database, so as to obtain a first query result; determining at least one federation node, according to at least one of the first query result and the first information; and sending a second query request to the at least one federation node, so that the at least one federation node queries an information associated with a second information in the second query request from a graph database corresponding to the at least one federation node, so as to obtain at least one second query result.