Aggregating Dependent Object Keys via Parent-Child Storage Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Relational databases face challenges in efficiently aggregating keys of dependent objects, particularly in hierarchical structures, where existing methods struggle to effectively traverse and collect all related objects from primary objects.
Innovation Solution
The proposed solution involves a Native Stored Procedure (NSP) approach that uses dynamically generated SQL to query catalog tables, employing an object evaluation process that distinguishes between parent and child directions to identify and aggregate related objects by marking entries as visited or unvisited in temporary tables, ensuring all unique entries are processed.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional methods are used to traverse and aggregate related objects in hierarchical database structures, then the aggregation process becomes complex and inefficient, but using the NSP approach with dynamic SQL generation and visited/unvisited marking improves efficiency while requiring additional temporary storage structures
Solution Approach 1:
The patent segments the aggregation process into two distinct storage structures: parent keys storage for storing primary keys of parent objects, and child keys storage for storing primary keys of child objects. This segmentation allows independent processing of parent-child relationships in hierarchical databases, improving traversal efficiency while maintaining manageable storage complexity through structured organization.
Solution Approach 2:
The patent applies preliminary action by marking entries as 'visited' or 'unvisited' before the actual aggregation process begins. The primary key of the input object is pre-loaded into both parent keys storage and child keys storage with 'unvisited' status, enabling the iterative traversal process to systematically process all related objects without redundant operations, thus improving aggregation efficiency.
2Reliability
If comprehensive traversal of all related objects is performed to ensure complete aggregation, then all dependent objects are captured, but redundant processing occurs without efficient tracking mechanisms
Solution Approach 1:
The patent implements feedback mechanisms through the visited/unvisited marking system. After processing each object's related objects, the system updates the status markers to reflect which objects have been processed. This feedback loop ensures that the iterative traversal continues only until all objects are visited, guaranteeing complete aggregation while preventing redundant processing of already-handled objects, thus optimizing processing time.
Solution Approach 2:
The patent introduces intermediary structures (parent keys storage and child keys storage with visited/unvisited markers) that mediate between the input object and the final aggregated result. These intermediaries track the traversal state and coordinate the systematic exploration of hierarchical relationships, ensuring no object is missed while avoiding redundant processing cycles.
3Adaptability or versatility
If dynamic SQL generation is used to query catalog tables, then query flexibility and adaptability improve, but query complexity and potential for errors increase
Solution Approach 1:
The patent applies dynamics by generating SQL queries dynamically based on the actual data structure and relationships in the hierarchical database. Rather than using static, pre-defined queries, the system adapts query construction to the specific parent-child relationships and catalog table structures being traversed, enabling flexible adaptation to different database schemas and object types while systematically managing query complexity through the structured NSP approach.
Data Source
AI summary
Keys are obtained and aggregated by storing a primary object as an entry in a parent keys storage and a child keys storage, the entry identified as unvisited in each. An object evaluation process is then performed until all unique entries in the parent keys storage and all unique entries in the child keys storage have been visited and by committing the keys of at least one related object as an entry to the hierarchical database. The object evaluation process visits each unvisited object in the parent keys storage and child keys storage by selecting, for the unvisited object, objects in the parent direction that have not already been visited and objects in the child direction that have not already been visited and by inserting the keys of the selected related objects as entries in the parent keys storage or child keys storage.