Many-core algorithms for in-memory column store databases
    1.
    发明授权
    Many-core algorithms for in-memory column store databases 有权
    内存列存储数据库的多核算法

    公开(公告)号:US09424313B2

    公开(公告)日:2016-08-23

    申请号:US14566953

    申请日:2014-12-11

    Applicant: SAP SE

    CPC classification number: G06F17/30466 G06F17/30463

    Abstract: A pattern can be identified in at least part of a query whose definition is received in a query request. The identified pattern can be matched with a set of pre-defined patterns, each of which has associated therewith at least one pre-compiled query execution sub-component of a plurality of pre-compiled query execution sub-components retained in a library. A plan for executing the query can be generated, for example by incorporating the pre-compiled query execution sub-component associated with the matched pattern into the plan based on a pseudo code representation of the plan derived from the definition.

    Abstract translation: 可以在查询的至少一部分中识别模式,该查询的定义在查询请求中被接收。 所识别的模式可以与一组预先定义的模式相匹配,每一模式都与保存在库中的多个预编译查询执行子组件的至少一个预编译查询执行子组件相关联。 可以生成用于执行查询的计划,例如通过基于从定义导出的计划的伪代码表示将与匹配模式相关联的预编译查询执行子组件合并到计划中。

    Adaptive dictionary compression/decompression for column-store databases

    公开(公告)号:US10824596B2

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

    申请号:US16255622

    申请日:2019-01-23

    Applicant: SAP SE

    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.

    ADAPTIVE DICTIONARY COMPRESSION/DECOMPRESSION FOR COLUMN-STORE DATABASES

    公开(公告)号:US20190155788A1

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

    申请号:US16255622

    申请日:2019-01-23

    Applicant: SAP SE

    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.

    MANY-CORE ALGORITHMS FOR IN-MEMORY COLUMN STORE DATABASES

    公开(公告)号:US20160357816A1

    公开(公告)日:2016-12-08

    申请号:US15240432

    申请日:2016-08-18

    Applicant: SAP SE

    CPC classification number: G06F16/24544 G06F16/24542

    Abstract: A pattern can be identified in at least part of a query whose definition is received in a query request. The identified pattern can be matched with a set of pre-defined patterns, each of which has associated therewith at least one pre-compiled query execution sub-component of a plurality of pre-compiled query execution sub-components retained in a library. A plan for executing the query can be generated, for example by incorporating the pre-compiled query execution sub-component associated with the matched pattern into the plan based on a pseudo code representation of the plan derived from the definition.

Patent Agency Ranking