Object Reference Mapping for Accurate Database Data Purging
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Identifying the correct and exhaustive scope of data objects for purging in large or complex databases is challenging, leading to errors and inconsistencies, such as orphaned data records, which hinders efficient storage space utilization and compliance with data regulations.
Innovation Solution
An object reference structure is generated through recursive queries and automatic analysis of data object attributes to identify and visualize relationships, allowing for accurate and efficient data purging by presenting a graphical representation of data objects and their interdependencies.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If manual identification of data objects for purging is performed in large or complex databases, then the purging process can be executed, but errors and inconsistencies such as orphaned data records occur due to incomplete identification of relevant data objects
Solution Approach 1:
The patent introduces an intermediary component (data object identification system) that mediates between the purging request and the actual data purging operation. This intermediary automatically traces and identifies all relevant data objects including parent-child relationships, foreign key constraints, and cascading delete rules, thereby eliminating manual identification errors while maintaining system reliability.
Solution Approach 2:
The system enables self-service by allowing the database management system to automatically identify and traverse all related data objects through programmed queries and relationship mappings. The system autonomously determines the complete scope of data to be purged without requiring manual intervention, thus improving accuracy while managing complexity through automation.
2Reliability
If exhaustive identification of all relevant data objects is performed to prevent orphaned records, then data consistency is improved, but the time and computational resources required for the purging process increase
Solution Approach 1:
The patent implements preliminary action by pre-compiling and storing metadata about data object relationships, including foreign key constraints, parent-child relationships, and cascading rules. This metadata is prepared in advance so that during the actual purging operation, the system can quickly traverse pre-defined relationship paths rather than performing exhaustive real-time analysis, thus maintaining data consistency while reducing purging time.
Solution Approach 2:
The identification process is segmented into distinct phases: first identifying direct child objects, then recursively identifying grandchild objects, and continuing through multiple levels of relationships. This segmentation allows the system to process data objects in manageable batches rather than attempting to identify all objects simultaneously, reducing computational overhead while ensuring completeness.
3Quantity of substance
If recursive queries are executed to identify data objects at multiple levels of relationships, then complete purging scope is achieved, but the computational resources and processing time required increase
Solution Approach 1:
The patent applies partial action by allowing users to specify the depth of recursive traversal (e.g., one level, two levels, or all levels). This enables the system to perform exhaustive identification when necessary while allowing for more limited identification in cases where complete exhaustion is not required, thus balancing computational resource usage with identification completeness based on specific purging requirements.
Data Source
AI summary
Systems and methods described herein relate to the automated generation of object reference structures for data purging processes. A primary query is executed in a database to identify first data objects with reference relationships to a root data object. Secondary queries are executed in the database to identify additional data objects with reference relationships to the first data objects or to other additional data objects identified in a previous one of the secondary queries. An object reference structure is generated based on the reference relationships among the root data object, the first data objects, and the additional data objects. The graphical representation is presented via a user interface. A purge instruction can be received with respect to at least part of the object reference structure. Execution of a data purge is triggered to purge data from the database according to the purge instruction.