公开(公告)号：US20230334059A1

公开(公告)日：2023-10-19

申请号：US17723949

申请日：2022-04-19

Applicant: SAP SE

Inventor： Alexander Gellner ,  Paul Willems

IPC: G06F16/248 ,  G06F16/23

CPC classification number: G06F16/248 ,  G06F16/23

Abstract: A method for performing a parallelized heapsort operation may include updating, by a first worker thread, a first buffer while a second worker thread updates a second buffer in parallel. The first worker thread may update the first buffer by adding, to the first buffer, elements from a first partition of a dataset. The second worker thread may update the second buffer by adding, to the second buffer, elements from a second partition of the dataset. Upon the first buffer reaching a threshold size, the first worker thread may acquire a lock for the first worker thread to update a heap based on the first buffer while the second worker thread is prevented from updating the heap based on the second buffer. A result of a top k query comprising a k quantity of smallest elements from the dataset may be generated based on the heap.

公开(公告)号：US20230394055A1

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

申请号：US18453605

申请日：2023-08-22

Applicant: SAP SE

Inventor： Alexander Gellner ,  Paul Willems

IPC: G06F16/248 ,  G06F16/23

CPC classification number: G06F16/248 ,  G06F16/23

Abstract: A method for performing a parallelized heapsort operation may include updating, by a first worker thread, a first buffer while a second worker thread updates a second buffer in parallel. The first worker thread may update the first buffer by adding, to the first buffer, elements from a first partition of a dataset. The second worker thread may update the second buffer by adding, to the second buffer, elements from a second partition of the dataset. Upon the first buffer reaching a threshold size, the first worker thread may acquire a lock for the first worker thread to update a heap based on the first buffer while the second worker thread is prevented from updating the heap based on the second buffer. A result of a top k query comprising a k quantity of smallest elements from the dataset may be generated based on the heap.

公开(公告)号：US12197453B2

公开(公告)日：2025-01-14

申请号：US18453605

申请日：2023-08-22

Applicant: SAP SE

Inventor： Alexander Gellner ,  Paul Willems

IPC: G06F16/248 ,  G06F16/23

Abstract: A method for performing a parallelized heapsort operation may include updating, by a first worker thread, a first buffer while a second worker thread updates a second buffer in parallel. The first worker thread may update the first buffer by adding, to the first buffer, elements from a first partition of a dataset. The second worker thread may update the second buffer by adding, to the second buffer, elements from a second partition of the dataset. Upon the first buffer reaching a threshold size, the first worker thread may acquire a lock for the first worker thread to update a heap based on the first buffer while the second worker thread is prevented from updating the heap based on the second buffer. A result of a top k query comprising a k quantity of smallest elements from the dataset may be generated based on the heap.

公开(公告)号：US11775543B1

公开(公告)日：2023-10-03

申请号：US17723949

申请日：2022-04-19

Applicant: SAP SE

Inventor： Alexander Gellner ,  Paul Willems

IPC: G06F16/248 ,  G06F16/23

CPC classification number: G06F16/248 ,  G06F16/23

Abstract: A method for performing a parallelized heapsort operation may include updating, by a first worker thread, a first buffer while a second worker thread updates a second buffer in parallel. The first worker thread may update the first buffer by adding, to the first buffer, elements from a first partition of a dataset. The second worker thread may update the second buffer by adding, to the second buffer, elements from a second partition of the dataset. Upon the first buffer reaching a threshold size, the first worker thread may acquire a lock for the first worker thread to update a heap based on the first buffer while the second worker thread is prevented from updating the heap based on the second buffer. A result of a top k query comprising a k quantity of smallest elements from the dataset may be generated based on the heap.