Sub-Query Result Reuse in Multi-Representation Graph Databases

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Traditional data storage methods in computing systems are inefficient in handling multiple representations of data items, leading to ambiguity and increased query traversal times, as they lack mechanisms to effectively evaluate queries across diverse representations stored in data graphs.

Innovation Solution

The method involves determining and evaluating sub-queries for each representation of a data item in a data graph, reusing evaluation results to avoid duplicate traversal and select the appropriate representation for query fulfillment without duplicating graph traversals.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If traditional data storage methods are used to handle multiple representations of data items, then data can be stored in a data graph, but query traversal times increase and efficiency decreases due to redundant traversal

Engineering Contradiction:

Improvequery retrieval efficiencyVSAvoidquery traversal time

Core Design Contradiction:

ProductivityVSLoss of time

Solution Approach 1:

The query evaluation process is segmented into multiple independent sub-queries, each targeting a specific representation of the data item. By dividing the overall query into smaller sub-queries that can be evaluated separately and in parallel, the system avoids redundant traversal of the same graph paths multiple times, thereby improving retrieval efficiency and reducing traversal time.

Inventive Principle:

Principle #1Segmentation

Solution Approach 2:

The system performs preliminary actions by evaluating multiple sub-queries in advance and caching their results. When a query requires data items with multiple representations, the previously evaluated sub-query results are reused, eliminating the need to re-traverse the data graph and significantly reducing query traversal time.

Inventive Principle:

Principle #10Preliminary action

2Adaptability or versatility

If multiple representations of data items are stored in the data graph, then the system can handle diverse data contexts, but ambiguity increases and makes it difficult to determine the appropriate representation

Engineering Contradiction:

Improveability to handle multiple data representationsVSAvoiddifficulty in selecting appropriate representation

Core Design Contradiction:

Adaptability or versatilityVSDifficulty of detecting and measuring

Solution Approach 1:

The system changes the parameter of representation selection by evaluating multiple sub-queries, each associated with a specific representation. By systematically evaluating sub-queries and comparing their results against the original query requirements, the system objectively determines the most appropriate representation, eliminating ambiguity and making the selection process measurable and deterministic.

Inventive Principle:

Principle #35Parameter changes

3Measurement precision

If sub-queries are evaluated for each representation of a data item, then the appropriate representation can be determined, but duplicate traversal of the data graph occurs leading to increased processing overhead

Engineering Contradiction:

Improveaccuracy in selecting appropriate representationVSAvoidprocessing overhead from duplicate traversal

Core Design Contradiction:

Measurement precisionVSDevice complexity

Solution Approach 1:

The system merges the evaluation results of multiple sub-queries by identifying and reusing common traversal paths and intermediate results. By combining the evaluation processes and sharing computational work across sub-queries, the system maintains precise representation selection while significantly reducing processing overhead and avoiding duplicate graph traversals.

Inventive Principle:

Principle #5Merging (Combining)

Data Source

PatentUS11194803B2Reusing sub-query evaluation results in evaluating query for data item having multiple representations in graph

Publication Date: 2021.12.07 INTERNATIONAL BUSINESS MACHINE CORPORATION

AI summary

Sub-queries for a query are determined. The query is for retrieving a data item of a data graph. The data graph stores representations of the data item. Each representation of the data item stores knowledge represented by the data item in a different way or manner. Each sub-query corresponds to a different representation by which the data graph stores the data item. The sub-queries are evaluated to determine an appropriate representation of the data item in fulfillment of the query without duplicatively traversing the data graph, such as by reusing evaluation results of the sub-queries that overlap one another.