公开(公告)号：US11422984B2

公开(公告)日：2022-08-23

申请号：US16399363

申请日：2019-04-30

Applicant: SAP SE

Inventor： Jan Portisch ,  Sandra Bracholdt ,  Björn Pantel ,  Volker Saggau

IPC: G06F16/21 ,  G06F16/28 ,  G06F16/907

Abstract: A method for data model clustering is provided herein. A first representation of a data model may be received. Edge betweenness values may be determined for respective nodes in the first representation. At least one node in the first representation may be identified as a linking node based on the respective edge betweenness values. One or more linking nodes may be removed from the first representation, thereby forming at least a first cluster and a second cluster. Degrees for the respective remaining nodes may be calculated. Respective hub nodes may be identified for the respective clusters based on the respective degrees in the clusters. Respective descriptions may be generated for the respective clusters based on the respective hub nodes. A clustered representation of the first representation may be stored with the clusters and their respective descriptions.

公开(公告)号：US20200349128A1

公开(公告)日：2020-11-05

申请号：US16399363

申请日：2019-04-30

Applicant: SAP SE

Inventor： Jan Portisch ,  Sandra Bracholdt ,  Björn Pantel ,  Volker Saggau

IPC: G06F16/21 ,  G06F16/28 ,  G06F16/907

Abstract: A method for data model clustering is provided herein. A first representation of a data model may be received. Edge betweenness values may be determined for respective nodes in the first representation. At least one node in the first representation may be identified as a linking node based on the respective edge betweenness values. One or more linking nodes may be removed from the first representation, thereby forming at least a first cluster and a second cluster. Degrees for the respective remaining nodes may be calculated. Respective hub nodes may be identified for the respective clusters based on the respective degrees in the clusters. Respective descriptions may be generated for the respective clusters based on the respective hub nodes. A clustered representation of the first representation may be stored with the clusters and their respective descriptions.