System and methods for providing a data store having linked differential data structures

    公开(公告)号:US10970275B2

    公开(公告)日:2021-04-06

    申请号:US16009779

    申请日:2018-06-15

    Applicant: SAP SE

    Abstract: A data storage and retrieval system for a computer memory configured according to a document store adapted to contain documents. The document store includes a document data structure containing a header and a document having one or more members. The document store further includes a chain of one or more differential data structures, each having a header and at least one updated member. The updated member has a value which is updated relative to a value in a corresponding member having a same identifier in the document data structure or in a preceding differential data structure in the chain. A header of each of the differential data structures includes a pointer to the document data structure or the preceding differential data structure in the chain, and a flag indicating that each of the differential data structures contains less than all of the members of the document data structure.

    Transaction commit protocol with recoverable commit identifier

    公开(公告)号:US10761946B2

    公开(公告)日:2020-09-01

    申请号:US15430091

    申请日:2017-02-10

    Applicant: SAP SE

    Abstract: Technologies are described for facilitating database system recovery in a distributed database environment having a master node and at least one slave node. The master node maintains an in-memory reference that includes transaction identifiers and their corresponding commit identifiers. When a slave node requests that a commit identifier be assigned to a transaction, the transaction and commit identifiers for the transaction are added to the in-memory reference. The commit identifier is sent by the master node to the slave node. The slave node writes a log entry to a commit log that includes the transaction identifier and the assigned commit identifier. If the database system is interrupted before the slave node writes the commit log entry, the slave node can request the commit identifier for the transaction from the master node, which retrieves the identifier from the in-memory reference.

    QUERY PLAN SHARING
    33.
    发明申请
    QUERY PLAN SHARING 审中-公开

    公开(公告)号:US20200175008A1

    公开(公告)日:2020-06-04

    申请号:US16209651

    申请日:2018-12-04

    Applicant: SAP SE

    Abstract: A method, a system and a computer program product for execution of queries. A first query is executed using a first query execution plan to generate a first result data by applying a first query operator to a first data stored in a first storage location. The first result data is provided to a second query execution plan for execution of a second query. The second query is executed on a second data stored in a second storage location in accordance with the second query execution plan. The second query execution plan includes a second query operator. Based on the execution of the second query, a second result data is generated in accordance with the second query execution plan by at least applying the second query operator to at least the provided first result data.

    Synchronized updates across multiple database partitions

    公开(公告)号:US10534797B2

    公开(公告)日:2020-01-14

    申请号:US15365693

    申请日:2016-11-30

    Applicant: SAP SE

    Abstract: A first store and a second store can be configured to store a first partition of a table of a database and a second partition of the table of the database, respectively. A database management system can be configured to at least update at least a first portion of the first partition where the update includes an update to a first primary key column in the first partition and verify that the first primary key column is unique across the first partition and the second partition. A first row having a first primary key value of the first primary key column from the first partition can be deleted, when the first primary key value in the first partition conflicts with a second primary key value of a second primary key column in the second partition.

    TABLE PLACEMENT IN DISTRIBUTED DATABASES
    35.
    发明申请

    公开(公告)号:US20190146972A1

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

    申请号:US16245520

    申请日:2019-01-11

    Applicant: SAP SE

    Abstract: A node type of a plurality of distributed nodes to which a table to be added to a distributed database should be assigned can be identified by applying a set of placement rules defined for the table. The set of placement rules can also be applied to determine whether the table should be partitioned into more than one partition. A table group name associated with the table can be obtained and used in conjunction with the node type and determination of whether to partition the table to store the table in the distributed database on at least one node of the plurality of nodes as one or more partitions.

    Using statistics for database partition pruning on correlated columns

    公开(公告)号:US10282351B2

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

    申请号:US14827407

    申请日:2015-08-17

    Applicant: SAP SE

    Abstract: A system includes a database having one or more tables having multiple partitions. The database includes memory modules to store the multiple partitions, a query processor, a data manipulation language (DML) processor configured to process operations to manipulate data in one or more of the partitions and a statistics module. For each partition, the statistics module maintains a partition profile and stores the partition profile in a statistics cache. The partition profile includes at least a first interval of data range values per column for one or more columns. The statistics module updates at least the first interval of a partition profile for a partition with new data range values responsive to the DML processor processing an operation to manipulate data in the partition. The database includes a partition pruning module that is configured to include partitions responsive to a received query based on the partition profile.

    Hash Collision Tables For Relational Operations

    公开(公告)号:US20180336263A1

    公开(公告)日:2018-11-22

    申请号:US15601983

    申请日:2017-05-22

    Applicant: SAP SE

    Abstract: A system for hash collision tables for relational operations is provided. In some implementations, the system performs operations comprising generating a plurality of hash values for at least a portion of one or more database tables based on a database query, and generating a hash table for at least a portion of the plurality of hash values. The operations can further include generating first results based on execution of a first operation in the database query using the hash table. Additionally, the operations can further include generating second results based on the first results and execution of a second operation in the database query using the hash table. Related systems, methods, and articles of manufacture are also described.

    ASYNCHRONOUS GARBAGE COLLECTION IN PARALLEL TRANSACTION SYSTEM WITHOUT LOCKING

    公开(公告)号:US20180276122A1

    公开(公告)日:2018-09-27

    申请号:US15469818

    申请日:2017-03-27

    Applicant: SAP SE

    Abstract: Methods, systems, and computer-readable storage media for determining that a transaction of a plurality of transactions performed in at least a portion of a system includes a delete operation, the plurality of transactions being managed by a secondary transaction manager and including a subset of all transactions performed in the system, in response to the delete operation, inserting a clean-up entry in the secondary transaction manager, attaching the clean-up entry to a subsequent transaction in order to determine and assign a time to the cleanup-entry that is used to subsequently trigger garbage collection, and selectively comparing the time to a most-recently-reported minimum read timestamp that is periodically reported to the secondary transaction manager from a primary transaction manager of the system, wherein the clean-up entry is executed in response to determining that the time is less than the most-recently-reported minimum read timestamp.

    SYNCHRONIZED UPDATES ACROSS MULTIPLE DATABASE PARTITIONS

    公开(公告)号:US20180150544A1

    公开(公告)日:2018-05-31

    申请号:US15365693

    申请日:2016-11-30

    Applicant: SAP SE

    CPC classification number: G06F16/278 G06F16/2365 G06F16/2379

    Abstract: A first store and a second store can be configured to store a first partition of a table of a database and a second partition of the table of the database, respectively. A database management system can be configured to at least update at least a first portion of the first partition where the update includes an update to a first primary key column in the first partition and verify that the first primary key column is unique across the first partition and the second partition. A first row having a first primary key value of the first primary key column from the first partition can be deleted, when the first primary key value in the first partition conflicts with a second primary key value of a second primary key column in the second partition.

Patent Agency Ranking