Graph Database Merge and Unmerge for Object Data Recovery
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing merging techniques fail to effectively unmerge data in a way that recovers all characteristics of the data prior to merging, particularly in object databases, as they only recover deleted data but not other attributes.
Innovation Solution
A method is introduced that uses a graph database to represent objects and their relationships, allowing for merge and unmerge operations by performing these operations on the graph database instead of the object database, utilizing a dimension-based approach to merge and unmerge records while maintaining an audit file for tracking changes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of substance
If existing merging techniques are used on object databases, then data redundancy is reduced, but the ability to recover all characteristics and relationships of merged data is lost
Solution Approach 1:
The patent introduces an audit file as an intermediary structure that captures metadata about merge operations including the dimension used for merging and relationships affected. This audit file serves as a mediator that preserves information about merged objects without requiring the actual objects to remain intact, enabling later unmerge operations to restore both data and relationships.
Solution Approach 2:
The patent performs preliminary actions by creating a graph database representation of the object database before merging occurs. This graph database captures the relationships and structure of objects in advance, allowing the system to track how objects are connected and enabling recovery of relationships during unmerge operations, even though the actual merge reduces redundancy in the object database.
2Productivity
If merge operations are performed directly on object database, then data consolidation is achieved, but unmerge capability is limited
Solution Approach 1:
The audit file acts as an intermediary that records all merge operations with their parameters (dimension, objects merged, relationships affected). This intermediary structure enables unmerge operations by providing the necessary information to reverse merges, making unmerge as easy as merge while maintaining consolidation benefits.
Solution Approach 2:
The patent creates a copy of the object database structure in graph database format, which stores relationship information. This copy enables unmerge operations by preserving the structural information needed to restore relationships, while the actual object database remains consolidated for efficiency.
3Volume of stationary object
If traditional merging techniques are used, then storage space is optimized, but relationship information is lost
Solution Approach 1:
The patent segments the database system into two parts: the object database for storing actual data objects with optimized storage, and the graph database for storing relationship information. This segmentation allows storage optimization in the object database while preserving relationship characteristics in the graph database structure.
Solution Approach 2:
The audit file serves as an intermediary that captures relationship information about merge operations. It stores metadata including which objects were merged, along which dimension, and what relationships were affected, preserving relationship information without requiring additional storage in the object database itself.
Data Source
AI summary
Some embodiments of the present invention include a method for merging records associated with objects in an object database and include generating, by a database system, a graph database corresponding to an object database, wherein objects in the object database are represented as nodes of graphs in the graph database, and wherein relationships among the objects in the object database are represented as edges of the graphs in the graph database; receiving, by the database system, information about a first object and information about a dimension based on a first relationship associated with the first object; and performing, by the database system, a merge operation using the information about the first object and the information about the dimension on the graph database instead of on the object database.