公开(公告)号：US10114866B2

公开(公告)日：2018-10-30

申请号：US15040501

申请日：2016-02-10

Applicant: SAP SE

Inventor： Ingo Mueller ,  Arnaud Lacurie

IPC: G06F17/30 ,  G06F12/0895 ,  G06F12/0864 ,  G06F12/02 ,  G06F12/1018

Abstract: Disclosed herein are system, method, and computer program product embodiments for constraining the amount of memory used during data aggregation. An embodiment operates by separating input data into a plurality of partitions. The embodiment then inserts portions of the input data into blocks from a free list at a given level of a pipeline. The embodiment then inserts the blocks into buffers for processing at a subsequent level of the pipeline. The embodiment processes the inserted blocks at the subsequent level of the pipeline and concatenates the intermediate results into a final aggregate result.

公开(公告)号：US10055480B2

公开(公告)日：2018-08-21

申请号：US14726251

申请日：2015-05-29

Applicant: SAP SE

Inventor： Gordon Gaumnitz ,  Arnaud Lacurie ,  Ingo Mueller ,  Jonathan Dees

IPC: G06F17/30

CPC classification number: G06F16/285 ,  G06F16/2255 ,  G06F16/2282 ,  G06F16/2379 ,  G06F16/2453 ,  G06F16/24556 ,  G06F16/278

Abstract: Aggregating input into hashtables using just-in-time compilation of compilable code in response to a database query. Compilable code can be generated that is configured to cause a programmable processor to produce one or more hashmaps based on the input database. The one or more hashmaps can correspond to each individual thread from the input. The compilable code can be configured to cause the one or more processors to insert the hashmaps into a scheduler. Compilable code can be generated that is configured to: aggregate elements from the one or more hashmaps into buckets of elements having the same partition identity; rehash the buckets of elements having the same partition identity to reduce the number of groups within the bucket; facilitate the merger of all non-empty elements from each target-partition into a merged-partition.

公开(公告)号：US20190155788A1

公开(公告)日：2019-05-23

申请号：US16255622

申请日：2019-01-23

Applicant: SAP SE

Inventor： Ingo Mueller ,  Cornelius Ratsch ,  Peter Sanders ,  Franz Faerber

IPC: G06F16/17 ,  G06F16/22

CPC classification number: G06F16/17 ,  G06F16/221

Abstract: Innovations for adaptive compression and decompression for dictionaries of a column-store database can reduce the amount of memory used for columns of the database, allowing a system to keep column data in memory for more columns, while delays for access operations remain acceptable. For example, dictionary compression variants use different compression techniques and implementation options, Some dictionary compression variants provide more aggressive compression (reduced memory consumption) but result in slower run-time performance. Other dictionary compression variants provide less aggressive compression (higher memory consumption) but support faster run-time performance. As another example, a compression manager can automatically select a dictionary compression variant for a given column in a column-store database. For different dictionary compression variants, the compression manager predicts run-time performance and compressed dictionary size, given the values of the column, and selects one of the dictionary compression variants.

公开(公告)号：US20160350394A1

公开(公告)日：2016-12-01

申请号：US14726251

申请日：2015-05-29

Applicant: SAP SE

Inventor： Gordon Gaumnitz ,  Arnaud Lacurie ,  Ingo Mueller ,  Jonathan Dees

IPC: G06F17/30

CPC classification number: G06F17/30598 ,  G06F17/3033 ,  G06F17/30339 ,  G06F17/30377 ,  G06F17/30442 ,  G06F17/30489 ,  G06F17/30584

Abstract: Aggregating input into hashtables using just-in-time compilation of compilable code in response to a database query. Compilable code can be generated that is configured to cause a programmable processor to produce one or more hashmaps based on the input database. The one or more hashmaps can correspond to each individual thread from the input. The compilable code can be configured to cause the one or more processors to insert the hashmaps into a scheduler. Compilable code can be generated that is configured to: aggregate elements from the one or more hashmaps into buckets of elements having the same partition identity; rehash the buckets of elements having the same partition identity to reduce the number of groups within the bucket; facilitate the merger of all non-empty elements from each target-partition into a merged-partition.

Abstract translation: 使用即时汇编可编译代码来响应数据库查询将输入汇总到散列表中。 可以生成可编译代码，该代码被配置为使可编程处理器基于输入数据库产生一个或多个哈希图。 一个或多个hashmaps可以对应于来自输入的每个单独的线程。 可编译代码可以配置为使一个或多个处理器将hashmaps插入调度程序。 可以生成可编译代码，其被配置为：将元素从一个或多个hashmaps聚合到具有相同分区标识的元素的桶中; 重新分配具有相同分区身份的元素桶以减少桶内的组数; 便于将所有非空元素从每个目标分区合并成合并分区。

公开(公告)号：US10824596B2

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

申请号：US16255622

申请日：2019-01-23

Applicant: SAP SE

Inventor： Ingo Mueller ,  Cornelius Ratsch ,  Peter Sanders ,  Franz Faerber

IPC: G06F16/17 ,  G06F16/22

Abstract: Innovations for adaptive compression and decompression for dictionaries of a column-store database can reduce the amount of memory used for columns of the database, allowing a system to keep column data in memory for more columns, while delays for access operations remain acceptable. For example, dictionary compression variants use different compression techniques and implementation options, Some dictionary compression variants provide more aggressive compression (reduced memory consumption) but result in slower run-time performance. Other dictionary compression variants provide less aggressive compression (higher memory consumption) but support faster run-time performance. As another example, a compression manager can automatically select a dictionary compression variant for a given column in a column-store database. For different dictionary compression variants, the compression manager predicts run-time performance and compressed dictionary size, given the values of the column, and selects one of the dictionary compression variants.

公开(公告)号：US10127281B2

公开(公告)日：2018-11-13

申请号：US15016978

申请日：2016-02-05

Applicant: SAP SE

Inventor： Ingo Mueller ,  Arnaud Lacurie

IPC: G06F17/30 ,  G06F12/0895 ,  G06F12/0864 ,  G06F12/02 ,  G06F12/1018

Abstract: Disclosed herein are system, method, and computer program product embodiments for database aggregation optimization. An embodiment operates by receiving data from a main memory. Within a cache, a first hash table comprising an aggregate hash of a first portion of the data is generated. A second portion of data is partitioned into one or more of partitions. Within the cache, one or more intermediate hash tables are generated. A first hash table is aggregated based on the one or more intermediate hash tables. At least a portion of the data of the final hash table is provided responsive to a query.

公开(公告)号：US20170228373A1

公开(公告)日：2017-08-10

申请号：US15016978

申请日：2016-02-05

Applicant: SAP SE

Inventor： Ingo Mueller ,  Arnaud Lacurie

IPC: G06F17/30 ,  G06F12/08

CPC classification number: G06F17/3048 ,  G06F12/023 ,  G06F12/0864 ,  G06F12/0895 ,  G06F12/1018 ,  G06F17/3033 ,  G06F17/30528 ,  G06F17/30554 ,  G06F17/30584 ,  G06F2212/604

Abstract: Disclosed herein are system, method, and computer program product embodiments for database aggregation optimization. An embodiment operates by receiving data from a main memory. Within a cache, a first hash table comprising an aggregate hash of a first portion of the data is generated. A second portion of data is partitioned into one or more of partitions. Within the cache, one or more intermediate hash tables are generated. A first hash table is aggregated based on the one or more intermediate hash tables. At least a portion of the data of the final hash table is provided responsive to a query.