中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

19 records (took 0.018 seconds)

    AGGREGATING DATABASE ENTRIES BY HASHING
    2.
    发明申请
    AGGREGATING DATABASE ENTRIES BY HASHING 审中-公开
    通过洗涤聚合数据库入口

    公开(公告)号：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聚合到具有相同分区标识的元素的桶中; 重新分配具有相同分区身份的元素桶以减少桶内的组数; 便于将所有非空元素从每个目标分区合并成合并分区。

    Optimizing database queries
    3.
    发明授权
    Optimizing database queries 有权

    公开(公告)号：US11475004B2

    公开(公告)日：2022-10-18

    申请号：US15702004

    申请日：2017-09-12

    Applicant: SAP SE

    Inventor： Maik Goergens ,  Jonathan Dees

    IPC: G06F16/2453 ,  G06F16/2452

    Abstract: Various examples are directed to systems and methods optimizing database queries. A database management system may receive a first query comprising a plurality of query expressions. The database management system may determine that a first expression of the first query is nullable and that the first expression is null preserving. The database management system may generate optimized query code for the first query. The optimized query code may comprise a first code segment and a conditional jump instruction. The first code segment that, when executed by a processor, may cause the processor to perform operations comprising determining a value of the first expression. The conditional jump instruction may, when executed by the processor, cause the processor to perform operations comprising: skipping execution of at least a portion of the first code segment and returning null for the first expression.

    Aggregating database entries by hashing
    5.
    发明授权
    Aggregating database entries by hashing 有权

    公开(公告)号：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.

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

    公开(公告)号：US09424313B2

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

    申请号：US14566953

    申请日：2014-12-11

    Applicant: SAP SE

    Inventor： Jonathan Dees ,  Peter Sanders ,  Franz Faerber ,  Jochen Seidel

    IPC: G06F17/30

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

    PARTITION-LOCAL PARTITION VALUE IDENTIFIER GROUPING
    7.
    发明公开
    PARTITION-LOCAL PARTITION VALUE IDENTIFIER GROUPING 审中-公开

    公开(公告)号：US20230367791A1

    公开(公告)日：2023-11-16

    申请号：US17745741

    申请日：2022-05-16

    Applicant: SAP SE

    Inventor： Andreas Amler ,  Jonathan Dees ,  Till Merker

    IPC: G06F16/28 ,  G06F16/27

    CPC classification number: G06F16/285 ,  G06F16/278

    Abstract: A method for executing a query may include generating a partition value identifier for a partitioned table. The partitioned table may include a main fragment including a main dictionary storing a first value and a main value identifier corresponding to the first value and a delta fragment including a delta dictionary storing a second value and a delta value identifier corresponding to the second value. The partition value identifier may be set based at least in part on the first value and the second value. The generated partition value identifier and a corresponding one of the main value identifier and the delta value identified may be maintained as part of a mapping. A query to group data stored in the partitioned table may be received. The query may be executed by at least using the mapping.

    MANY-CORE ALGORITHMS FOR IN-MEMORY COLUMN STORE DATABASES
    9.
    发明申请
    MANY-CORE ALGORITHMS FOR IN-MEMORY COLUMN STORE DATABASES 审中-公开

    公开(公告)号：US20160357816A1

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

    申请号：US15240432

    申请日：2016-08-18

    Applicant: SAP SE

    Inventor： Jonathan Dees ,  Peter Sanders ,  Franz Faerber ,  Jochen Seidel

    IPC: G06F17/30

    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