Data Visualization Engine Relationship Encoding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current data visualization tools struggle to effectively represent complex data relationships, especially as data volumes increase, often requiring manual construction and lacking support for visualizing intricate connections like manager structures, social networks, or product hierarchies.
Innovation Solution
A data visualization engine that retrieves and displays data fields and their relationships using connectors or visual cues, allowing users to encode relationships in mark positions, connector properties, and aggregation, enabling flexible and efficient creation of data visualizations.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Manufacturing precision
If manual construction of data visualizations is used, then customization and precision are improved, but time consumption and effort increase significantly
Solution Approach 1:
The system enables self-service automated visualization generation by allowing users to define relationships between data fields once, and then automatically generating appropriate visualizations without manual construction. The system serves itself by automatically selecting visualization types, configuring marks, and establishing connectors based on the defined relationships.
Solution Approach 2:
Users perform preliminary action by defining relationships between data fields in advance. Once these relationships are established, the system can automatically generate visualizations without requiring manual construction each time, thus reducing time consumption while maintaining precision.
2Ease of manufacture
If simple node-link diagrams are used, then ease of creation is improved, but ability to present complex data relationships deteriorates
Solution Approach 1:
The system provides universal relationship definition mechanisms that work across multiple visualization types. Users define relationships once, and the system adapts them to various visualization contexts including node-link diagrams, matrix visualizations, and other relationship-appropriate displays, thus maintaining ease of creation while improving adaptability.
Solution Approach 2:
The system dynamically adapts the visualization approach based on the complexity and type of relationships defined. Simple relationships use straightforward node-link diagrams, while complex relationships automatically trigger more sophisticated visualization strategies, maintaining ease of use across different complexity levels.
3Device complexity
If data visualization applications are designed for simple relationships, then device complexity is reduced, but ability to visualize complex relationships deteriorates
Solution Approach 1:
The system segments the visualization task into distinct components: relationship definition, data field selection, and automatic visualization generation. This segmentation allows the application to maintain simplicity in each component while achieving complex relationship visualization through their integration.
Solution Approach 2:
The relationship definition mechanism serves as an intermediary layer between simple data structures and complex visualizations. By defining relationships as first-class citizens, the system mediates between simple data input and complex relationship output, maintaining application simplicity while enabling sophisticated visualizations.
4Loss of information
If relationships are encoded in multiple ways (position, connector, property), then information conveyance is improved, but system complexity increases
Solution Approach 1:
The system merges multiple encoding approaches (position-based, connector-based, and property-based encoding) into a unified relationship definition framework. This consolidation allows the system to convey comprehensive relationship information while managing complexity through a single coherent mechanism rather than separate systems.
Data Source
AI summary
A method sorts data in data visualizations. The method is performed at a computing device having one or more processors and memory. The method retrieves a set of tuples from a database according to user selection. Each tuple includes a same set of fields. The method identifies a relation between tuples. The relation is a non-empty set of ordered pairs of tuples from the set of tuples. The method receives user selection of the relation to specify a dimensional position of visual marks corresponding to the tuples. The dimensional position is either the x-position of the y-position. The method generates and displays a data visualization with each tuple represented by a visible mark. The dimensional position of each displayed visual mark is based on a network traversal of the tuples using the relation.