Sparse Mapping of Hierarchical Data Subset
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In large data hierarchies, users face difficulties in identifying relevant data subsets due to the inclusion of irrelevant data, leading to time-intensive processing and lag in data display.
Innovation Solution
The method involves creating a sparse mapping of a hierarchical subset of data, where a minimum tree is generated to display only the necessary elements, distinguishing between relevant and irrelevant data using visual characteristics, and associating display data with a uniform resource identifier to conserve computing resources.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of information
If the entire data hierarchy is processed and displayed, then complete data coverage is achieved, but processing time increases and display performance degrades
Solution Approach 1:
The system extracts only the minimum necessary subset of data elements required to represent the hierarchical relationship, excluding all unnecessary elements. This is achieved by identifying and displaying only the path from root to leaf nodes that contains the target element, thereby reducing processing time while maintaining essential information coverage.
Solution Approach 2:
The data hierarchy is segmented into essential and non-essential portions. The system divides the complete hierarchy into discrete path segments that are necessary for representation, allowing selective processing and display of only those segments that contribute to the hierarchical structure, thus reducing overall processing time.
2Loss of information
If the entire data hierarchy is displayed, then all data elements are visible, but display space is wasted and user focus is diluted
Solution Approach 1:
The system extracts and displays only the essential path elements required to represent the hierarchical relationship, removing all extraneous data elements from the display. This ensures that display space is utilized efficiently while maintaining visibility of the critical hierarchical structure.
Solution Approach 2:
The display applies local quality by differentiating between essential and non-essential elements through visual characteristics. Identified elements (those on the critical path) are displayed with distinct visual properties, allowing users to quickly distinguish relevant information from optional information without wasting display space.
3Measurement precision
If all data elements are processed to identify relevant subsets, then comprehensive analysis is achieved, but processing becomes time-intensive and display lags
Solution Approach 1:
The system extracts only the critical path elements necessary for accurate hierarchical representation, eliminating the need to process and analyze all data elements. This maintains measurement precision for identifying relevant subsets while dramatically improving processing efficiency by focusing computational resources only on essential elements.
Solution Approach 2:
The system performs partial action by processing only the minimum necessary subset of elements required to establish the hierarchical relationship, rather than processing the entire data hierarchy. This approach achieves sufficient accuracy for data identification while significantly reducing processing time and improving overall productivity.
4Area of stationary object
If the minimum tree is scaled to fit the viewport, then efficient use of display space is achieved, but the entire tree may not be visible
Solution Approach 1:
The system extracts and displays only the essential path elements that form the minimum tree, which by definition contains only the necessary nodes and edges to represent the hierarchical relationship. This extracted subset is then scaled to fit the viewport, ensuring efficient display space utilization while maintaining complete representation of the hierarchical structure.
Data Source
AI summary
Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for generating a sparse mapping of a data hierarchy. In one aspect, a method includes accessing a data hierarchy of elements, receiving a list of identifiers that each identify an element in the data hierarchy; determining, from the data hierarchy and the list of identifiers, a minimum tree that includes each of the identified elements identified by the list of identifiers additional elements that are not identified by the list of identifiers, where the identified elements and the additional elements define a set of a minimum number of elements necessary to form a path in the data hierarchy that connects all of the identified elements identified by the list of identifiers, and where the elements that belong to the minimum tree are a proper subset of elements of the data hierarchy.