公开(公告)号：US12013855B2

公开(公告)日：2024-06-18

申请号：US18313753

申请日：2023-05-08

Applicant: AMPERITY, INC.

Inventor： Yan Yan ,  Aria Haghighi ,  Joseph Christianson

IPC: G06F16/2453 ,  G06F16/2457 ,  G06F16/28

CPC classification number: G06F16/24542 ,  G06F16/24578 ,  G06F16/285

Abstract: Disclosed are techniques for trimming large clusters of related records. In one embodiment, a method is disclosed comprising receiving a set of clusters, each cluster in the clusters including a plurality of records. The method extracts an oversized cluster in the set of clusters and performs a breadth-first search (BFS) on the oversized cluster to generate a list of visited records. The method terminates the BFS upon determining that the size of the list of visited records exceeds a maximum size and generates a new cluster from the list of visited records and adding the new cluster to the set of clusters. By recursively performing BFS traverse over the oversized cluster and extracting smaller new clusters from it, the oversized cluster is eventually partitioned into a set of sub-clusters with the size smaller than the predefined threshold.

公开(公告)号：US11704315B1

公开(公告)日：2023-07-18

申请号：US16938233

申请日：2020-07-24

Applicant: Amperity, Inc.

Inventor： Yan Yan ,  Aria Haghighi ,  Joseph Christianson

IPC: G06F16/2453 ,  G06F16/28 ,  G06F16/2457

CPC classification number: G06F16/24542 ,  G06F16/285 ,  G06F16/24578

Abstract: Disclosed are techniques for trimming large clusters of related records. In one embodiment, a method is disclosed comprising receiving a set of clusters, each cluster in the clusters including a plurality of records. The method extracts an oversized cluster in the set of clusters and performs a breadth-first search (BFS) on the oversized cluster to generate a list of visited records. The method terminates the BFS upon determining that the size of the list of visited records exceeds a maximum size and generates a new cluster from the list of visited records and adding the new cluster to the set of clusters. By recursively performing BFS traverse over the oversized cluster and extracting smaller new clusters from it, the oversized cluster is eventually partitioned into a set of sub-clusters with the size smaller than the predefined threshold.