公开(公告)号：US20180260287A1

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

申请号：US15452391

申请日：2017-03-07

Applicant: SAP SE

Inventor： Sarika Iyer ,  Vivek Kandiyanallur ,  Martin Heidel ,  Rolando Blanco ,  Stephan Kottler ,  Carsten Thiel ,  Peter Steinemann ,  Jörn Schmidt ,  Colin Florendo ,  Michael Muehle ,  Chaitanya Gottipati

IPC: G06F11/14 ,  G06F17/30

Abstract: Objects across multiple database manipulation language (DML) redo log records are cached, during continuous replay of redo log records on a secondary system, for the same table partition to enable reuse of such cached objects. Later, these cached objects can be reused as they are accessed during the sequential processing of DML redo records for a specific table partition.

公开(公告)号：US10013442B2

公开(公告)日：2018-07-03

申请号：US14748036

申请日：2015-06-23

Applicant: SAP SE

Inventor： Thomas Legler ,  Peter Steinemann

IPC: G06F17/30

CPC classification number: G06F16/2255

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.

公开(公告)号：US20170293661A1

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

申请号：US15634243

申请日：2017-06-27

Applicant: SAP SE

Inventor： Peter Steinemann ,  Thomas Legler

IPC: G06F17/30

CPC classification number: G06F17/30528 ,  G06F17/30321 ,  G06F17/30501

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.