中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

13 records (took 0.035 seconds)

    Faster Main Memory Scans in Unsorted Dictionary-Encoded Vectors
    2.
    发明申请
    Faster Main Memory Scans in Unsorted Dictionary-Encoded Vectors 审中-公开

    公开(公告)号：US20170139994A1

    公开(公告)日：2017-05-18

    申请号：US14944087

    申请日：2015-11-17

    Applicant: SAP SE

    Inventor： Peter Steinemann ,  Thomas Legler

    IPC: G06F17/30

    CPC classification number: G06F17/30339 ,  G06F17/30952

    Abstract: A ValueID corresponding to a value to be searched for in a database column can be determined by finding a match in a dictionary for the database column. A row of an index vector for the database column at which to begin a scan for the ValueID can be identified by reading a ValueID lookup table that maps each unique ValueID to a starting position in the index vector for the database column. The ValueID can not occur in the index vector prior to the starting position. The index vector can be scanned beginning at the starting position to find at least one occurrence of the ValueID corresponding to the value being searched, and a result that includes one or more row locations in the database column corresponding to the at least one occurrence in the index vector of the ValueID corresponding to the value being searched can be returned.

    DATABASE VALUE IDENTIFIER HASH MAP
    4.
    发明申请
    DATABASE VALUE IDENTIFIER HASH MAP 有权
    数据库数据标识符HASH映射

    公开(公告)号：US20160378750A1

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

    申请号：US14748036

    申请日：2015-06-23

    Applicant: SAP SE

    Inventor： Thomas Legler ,  Peter Steinemann

    IPC: G06F17/30

    CPC classification number: G06F17/3033

    Abstract: The subject matter disclosed herein provides methods for inserting and retrieving value identifiers from a dictionary encoded database using hash maps. A first value identifier and a first value can be accessed from a dictionary storing one or more value identifiers and one or more values. Each value identifier can correspond to a different value. The hash map and the first value can be used to determine a first index in a bucket list for inserting the first value identifier. The bucket list can have one or more indices. Each index can store at least one value identifier. The hash map can include a vector of one or more pointers. Each pointer can refer to at least one of the indices. Based on the determining, the first value identifier can be inserted at the first index without inserting the first value. Related apparatus, systems, techniques, and articles are also described.

    Abstract translation: 本文公开的主题提供了使用散列图从字典编码的数据库中插入和检索值标识符的方法。 可以从存储一个或多个值标识符和一个或多个值的字典中访问第一值标识符和第一值。 每个值标识符可以对应于不同的值。 散列图和第一值可用于确定用于插入第一值标识符的桶列表中的第一索引。 桶列表可以有一个或多个索引。 每个索引可以存储至少一个值标识符。 哈希映射可以包括一个或多个指针的向量。 每个指针可以指代至少一个索引。 基于该确定，可以在第一个索引处插入第一个值标识符而不插入第一个值。 还描述了相关装置，系统，技术和制品。

    Test continuous log replay
    5.
    发明授权
    Test continuous log replay 有权

    公开(公告)号：US11176004B2

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

    申请号：US16371889

    申请日：2019-04-01

    Applicant: SAP SE

    Inventor： Stephan Kottler ,  Martin Heidel ,  Peter Steinemann ,  Thorsten Glebe ,  Johannes Haeussler

    IPC: G06F16/00 ,  G06F11/00 ,  G06F11/14 ,  G06F16/23 ,  G06F16/20 ,  G06F16/22

    Abstract: A method, a system, and a computer program product for performing testing of continuous log replays in a database system. A redo log generated for a data record in a database is received. The redo log is indicative of a change in persistency of the data record in the database. Based on the change in persistency recorded in the redo log, a redo handler in the plurality of handlers is selected for execution of a replay of the received redo log. Using the selected redo log, replay of the redo log is executed to generate a state of the data record prior to the change in persistency recoded in the redo log.

    TEST CONTINUOUS LOG REPLAY
    6.
    发明申请
    TEST CONTINUOUS LOG REPLAY 审中-公开

    公开(公告)号：US20200310925A1

    公开(公告)日：2020-10-01

    申请号：US16371889

    申请日：2019-04-01

    Applicant: SAP SE

    Inventor： Stephan Kottler ,  Martin Heidel ,  Peter Steinemann ,  Thorsten Glebe ,  Johannes Haeussler

    IPC: G06F11/14 ,  G06F16/23

    Abstract: A method, a system, and a computer program product for performing testing of continuous log replays in a database system. A redo log generated for a data record in a database is received. The redo log is indicative of a change in persistency of the data record in the database. Based on the change in persistency recorded in the redo log, a redo handler in the plurality of handlers is selected for execution of a replay of the received redo log. Using the selected redo log, replay of the redo log is executed to generate a state of the data record prior to the change in persistency recoded in the redo log.

    Faster main memory scans in unsorted dictionary-encoded vectors
    7.
    发明授权
    Faster main memory scans in unsorted dictionary-encoded vectors 有权

    公开(公告)号：US10275399B2

    公开(公告)日：2019-04-30

    申请号：US14944087

    申请日：2015-11-17

    Applicant: SAP SE

    Inventor： Peter Steinemann ,  Thomas Legler

    IPC: G06F17/30 ,  G06F16/22 ,  G06F16/2455 ,  G06F16/901

    Abstract: A ValueID corresponding to a value to be searched for in a database column can be determined by finding a match in a dictionary for the database column. A row of an index vector for the database column at which to begin a scan for the ValueID can be identified by reading a ValueID lookup table that maps each unique ValueID to a starting position in the index vector for the database column. The ValueID can not occur in the index vector prior to the starting position. The index vector can be scanned beginning at the starting position to find at least one occurrence of the ValueID corresponding to the value being searched, and a result that includes one or more row locations in the database column corresponding to the at least one occurrence in the index vector of the ValueID corresponding to the value being searched can be returned.

    Bucket skiplists
    10.
    发明授权
    Bucket skiplists 有权

    公开(公告)号：US10235420B2

    公开(公告)日：2019-03-19

    申请号：US15634243

    申请日：2017-06-27

    Applicant: SAP SE

    Inventor： Peter Steinemann ,  Thomas Legler

    IPC: G06F17/30

    Abstract: The present disclosure involves systems, software, and computer implemented methods for providing a bucket skiplist. In one example, a method comprises identifying a value to be searched for within a skiplist comprising a data structure for referencing a plurality of ordered nodes, the data structure having a plurality of linked lists, each node representing at least one memory block, wherein each node is associated with a bucket including a set of ordered values, where the first value in each bucket of each node is the relatively lowest value in the bucket, comparing the value to the first values in each bucket to identify a particular node in which the first value may be located, and, in response to determining that the first value of the particular node is not the same as the value to be searched, comparing the value to be searched with the ordered values in the bucket.

Patent Agency Ranking