Hierarchical Graph Layout for Object-Centric Data Models
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In object-centric data models, managing and visualizing large numbers of objects and their relationships within process data is challenging, making it difficult for users to maintain an overview and evaluate relationships effectively.
Innovation Solution
A computer-implemented method generates a graph layout for object-centric data models by querying object types and their relationships, arranging nodes hierarchically to minimize edge and node overlaps, allowing for efficient visualization and interaction, including filtering and search capabilities.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If a large number of objects and relationships are included in the data model to represent complex process landscapes, then the completeness and accuracy of process representation is improved, but the complexity of visualization and difficulty of maintaining overview deteriorates
Solution Approach 1:
The patent divides the complete process landscape into multiple hierarchical levels (e.g., process level, event level, object level) and organizes objects into categories or groups. This segmentation allows users to navigate complex data models by focusing on specific levels or categories, reducing visualization complexity while maintaining access to complete process representation when needed.
Solution Approach 2:
The patent introduces hierarchical dimensions to organize objects and relationships, transforming a flat complex graph into a multi-level structure. Users can drill down from high-level process views to detailed object-level interactions, adding a temporal or hierarchical dimension that simplifies navigation while preserving completeness.
2Reliability
If the data model includes all objects and relationships to maintain coherence across parts, then the completeness of process representation is improved, but the ease of operation and user interaction deteriorates
Solution Approach 1:
The patent segments the complete process landscape into manageable hierarchical levels and categories, allowing users to interact with specific portions without overwhelming complexity. Users can navigate from high-level coherent process views to detailed object interactions, maintaining coherence while improving ease of operation through structured access patterns.
Solution Approach 2:
The patent implements dynamic navigation capabilities where the data model presentation adapts to user needs. Users can drill down into specific objects or categories, and the system dynamically adjusts the visible scope while maintaining coherence through hierarchical relationships, making interaction easier without sacrificing completeness.
3Measurement precision
If the graph layout is generated dynamically to reflect current data model structure, then the accuracy of relationship representation is improved, but the processing time and computational resources required deteriorates
Solution Approach 1:
The patent pre-establishes hierarchical levels and category structures during data model definition, so that graph generation follows a predetermined organizational framework. This preliminary structuring reduces computational complexity during visualization generation while maintaining accurate relationship representation through the pre-defined hierarchical relationships.
Solution Approach 2:
The patent segments the graph generation process into hierarchical levels, generating and optimizing layouts for each level separately rather than treating the entire complex graph at once. This segmentation reduces computational requirements while preserving relationship accuracy through the hierarchical organization that guides edge routing and node placement.
Data Source
Figure 1
Figure 2a
Figure 2b
AI summary
Provided is a method to generate a graph layout for an object-centric data model, wherein each object type of the data model is represented as a node and each object-to-object relationship is represented as an edge. The method comprises generating a hierarchy with a predefined number of levels and several node positions for each level. Each node is assigned to a node position of a level of the hierarchy according to an order of nodes that is determined based on how nodes connected to the respective node are assigned. The nodes are arranged according to the order of nodes in each level of the hierarchy, by minimizing crossings of edges with other edges or nodes.