Joining Hierarchical Data in DAG Knowledge Bases
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Performing data joins on hierarchical databases is challenging due to the lack of well-defined operations, making it difficult to visualize and aggregate results effectively, especially when dealing with interrelationships like sibling, ancestor, and descendant fields.
Innovation Solution
A method and apparatus for receiving search results from hierarchical databases, identifying matching fields, and joining them based on rules for sibling, neighbor, ancestor, and descendant fields, generating combined search results while avoiding cycles and visualizing interrelationships consistently.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If data joins are performed on hierarchical databases using traditional relational algebra methods, then the joining operation can be executed, but the results cannot be properly visualized and aggregated due to the hierarchical structure
Solution Approach 1:
The patent introduces an intermediary processing layer that receives search results from hierarchical databases, identifies matching fields, and transforms them into a standardized format suitable for visualization. This intermediary layer handles the conversion of hierarchical data structures into a form that can be properly aggregated and displayed, resolving the contradiction between maintaining hierarchical database compatibility and achieving effective result visualization.
2Productivity
If search results from multiple hierarchical databases are aggregated without defined joining rules, then data from different sources can be combined, but the aggregated results become difficult or confusing to visualize
Solution Approach 1:
The patent changes the parameters of data representation by establishing standardized field matching rules and hierarchical relationship handling mechanisms. By defining how fields should be matched, compared, and merged across different hierarchical structures, the system transforms heterogeneous search results into a unified format that maintains aggregation productivity while ensuring visualization clarity.
3Device complexity
If traditional joining operations are applied to hierarchical databases, then joining can be performed, but handling of related fields (sibling, ancestor, descendant) becomes complex and undefined
Solution Approach 1:
The patent segments the complex task of joining hierarchical data into distinct components: identifying matching fields, determining hierarchical relationships (sibling, ancestor, descendant), and applying appropriate merging rules. By breaking down the joining operation into these manageable segments with defined rules for each relationship type, the system reduces operational complexity while maintaining full adaptability to hierarchical structures.
Data Source
AI summary
A method, apparatus, and non-transitory computer readable medium for performing joins on data from hierarchical databases are described. The method, apparatus, and non-transitory computer readable medium may provide for receiving one or more search results from each of a plurality of hierarchical databases, identifying one or more matching fields from each of the search results, joining the search results according to a set of rules for processing related fields to the matching fields, wherein the related fields comprise sibling fields, neighbor fields, ancestor fields, descendant fields, or any combination thereof, and generating one or more combined search results based on the joining.