公开(公告)号：US20220374455A1

公开(公告)日：2022-11-24

申请号：US17817147

申请日：2022-08-03

Applicant: Google LLC

Inventor： Hua Zhang ,  Pavan Edara ,  Nhan Nguyen

IPC: G06F16/28 ,  G06F21/64

Abstract: A method for shuffle-less reclustering of clustered tables includes receiving a first and second group of clustered data blocks sorted by a clustering key value. A range of clustering key values of one or more the data blocks in the second group overlaps with the range of clustering key values of a data block in the first group. The method also includes generating split points for partitioning the first and second groups of clustered data blocks into a third group. The method also includes partitioning using the split points, the first and second groups into the third group. Each data block in the third group includes a range of clustering key values that do not overlap with any other data block in the third group. Each split point defines an upper limit or lower limit for the range of clustering key values a data block in the third group.

公开(公告)号：US11860907B2

公开(公告)日：2024-01-02

申请号：US17817147

申请日：2022-08-03

Applicant: Google LLC

Inventor： Hua Zhang ,  Pavan Edara ,  Nhan Nguyen

IPC: G06F16/00 ,  G06F16/28 ,  G06F21/64

CPC classification number: G06F16/285 ,  G06F21/64

Abstract: A method for shuffle-less reclustering of clustered tables includes receiving a first and second group of clustered data blocks sorted by a clustering key value. A range of clustering key values of one or more the data blocks in the second group overlaps with the range of clustering key values of a data block in the first group. The method also includes generating split points for partitioning the first and second groups of clustered data blocks into a third group. The method also includes partitioning using the split points, the first and second groups into the third group. Each data block in the third group includes a range of clustering key values that do not overlap with any other data block in the third group. Each split point defines an upper limit or lower limit for the range of clustering key values a data block in the third group.

公开(公告)号：US20210319044A1

公开(公告)日：2021-10-14

申请号：US16848810

申请日：2020-04-14

Applicant: Google LLC

Inventor： Hua Zhang ,  Pavan Edara ,  Nhan Nguyen

IPC: G06F16/28 ,  G06F21/64

Abstract: A method for shuffle-less reclustering of clustered tables includes receiving a first and second group of clustered data blocks sorted by a clustering key value. A range of clustering key values of one or more the data blocks in the second group overlaps with the range of clustering key values of a data block in the first group. The method also includes generating split points for partitioning the first and second groups of clustered data blocks into a third group. The method also includes partitioning using the split points, the first and second groups into the third group. Each data block in the third group includes a range of clustering key values that do not overlap with any other data block in the third group. Each split point defines an upper limit or lower limit for the range of clustering key values a data block in the third group.

公开(公告)号：US11436261B2

公开(公告)日：2022-09-06

申请号：US16848810

申请日：2020-04-14

Applicant: Google LLC

Inventor： Hua Zhang ,  Pavan Edara ,  Nhan Nguyen

IPC: G06F16/00 ,  G06F16/28 ,  G06F21/64

Abstract: A method for shuffle-less reclustering of clustered tables includes receiving a first and second group of clustered data blocks sorted by a clustering key value. A range of clustering key values of one or more the data blocks in the second group overlaps with the range of clustering key values of a data block in the first group. The method also includes generating split points for partitioning the first and second groups of clustered data blocks into a third group. The method also includes partitioning using the split points, the first and second groups into the third group. Each data block in the third group includes a range of clustering key values that do not overlap with any other data block in the third group. Each split point defines an upper limit or lower limit for the range of clustering key values a data block in the third group.