Recursive Filter Algorithms for Hierarchical Data Models
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Hierarchical data models require efficient filtering mechanisms to retrieve data without imposing significant computational burdens, as traversing entire trees can be time-consuming and compute-intensive, especially when user preferences need to be met.
Innovation Solution
The implementation provides filtering mechanisms, including AND-filter, OR-filter, and level-filter algorithms, which use predicate functions to selectively retrieve nodes in a hierarchical data model, allowing for efficient data retrieval and user interface generation based on user preferences.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If the entire tree is traversed to retrieve data from a hierarchical database, then complete data retrieval is achieved, but the process becomes compute intensive and time consuming
Solution Approach 1:
The patent segments the hierarchical data model into multiple levels and introduces filtering mechanisms that operate at specific levels rather than traversing the entire tree. The system divides the data retrieval process into targeted segments based on user preferences and predicate functions, eliminating the need to process unrelated portions of the hierarchy.
Solution Approach 2:
The patent implements partial action by retrieving only the necessary portion of the hierarchical data required to satisfy the query. Instead of performing excessive action (traversing the entire tree), the system uses filtering mechanisms to stop traversal when relevant data is found or when further traversal would not yield useful results, significantly reducing computational effort.
2Productivity
If filtering mechanisms are applied to reduce computational load, then data access efficiency is improved, but the complexity of the system increases
Solution Approach 1:
The patent applies preliminary action by pre-defining predicate functions and filtering criteria that are prepared in advance. These filtering mechanisms are established before data retrieval operations occur, allowing the system to efficiently evaluate and filter nodes without requiring complex runtime decision-making. The filtering logic is prepared beforehand, simplifying the actual data access process.
3Loss of energy
If recursive filter algorithms are used to selectively retrieve nodes, then computational load is reduced, but the complexity of the retrieval logic increases
Solution Approach 1:
The patent employs nesting by implementing recursive filter algorithms that operate within the hierarchical structure of the data model. Each filtering operation is nested within the hierarchical levels, allowing the system to apply complex filtering logic in a structured, organized manner. The recursion enables the same filtering logic to be applied at multiple levels without requiring separate complex procedures for each level.
Data Source
AI summary
A system, a method, and a computer program product for filtering data stored in a hierarchical data model for use by an attribute value derivation are provided. At least one filtering mechanism to filter at least one instruction containing at least one target attribute value corresponding to at least one source attribute value combination stored in a hierarchical data model is provided. The instruction is filtered using the filtering mechanism. A user interface for displaying the hierarchical data model containing the filtered instruction is generated.