Partial Merge
    53.
    发明申请
    Partial Merge 审中-公开
    部分合并

    公开(公告)号:US20170004158A1

    公开(公告)日:2017-01-05

    申请号:US15261188

    申请日:2016-09-09

    Applicant: SAP SE

    Abstract: A multi-level storage architecture and method of performing a partial merge are disclosed. A main store is partitioned into a passive main part and an active main part, the active main part being empty at a start of the partial merge, the passive main part storing encoded data records of the main store that are not subject to the partial merge. A values index corresponding to a sorted dictionary of the passive main part is set to a cardinality of n. The the data records of a second level storage structure is merged into the active main part, the active main part having a dictionary that starts with a value of n+1, such that the merging into the active main part continues an encoding scheme according to the values index of the passive main part.

    Abstract translation: 公开了一种执行部分合并的多级存储架构和方法。 主店分为被动主体和活动主体,主动部分在部分合并开始时为空,被动主体部分存储不存在部分合并的主店铺的编码数据记录 。 将被动主体的排序词典对应的值索引设为n的基数。 第二级存储结构的数据记录被合并到活动主要部分中,活动主要部分具有以n + 1的值开始的字典,使得合并到活动主体部分继续根据 被动主体的价值指数。

    MULTI-SOURCE ASYNCHRONOUS TABLE REPLICATION
    55.
    发明申请
    MULTI-SOURCE ASYNCHRONOUS TABLE REPLICATION 审中-公开
    多源非线性表复制

    公开(公告)号:US20160371358A1

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

    申请号:US14871717

    申请日:2015-09-30

    Applicant: SAP SE

    Abstract: Technologies are described for performing replication within a database environment. Where database operations are carried out at multiple source nodes, the operations can be ordered by the source node on which they were executable prior to being replayed at a replica node. In addition, the operations can be precommitted, so that the operations can be reviewed by a replayer at the replica node before the transaction containing the operations has been fully committed.

    Abstract translation: 描述了在数据库环境中执行复制的技术。 在多个源节点执行数据库操作的地方,可以在复制节点重播之前由其可执行的源节点对操作进行排序。 此外,可以预先提交操作,以便在包含操作的事务完全提交之前,操作可由复制节点上的重播者进行审核。

    SYNCHRONIZATION ON REACTIVATION OF ASYNCHRONOUS TABLE REPLICATION
    56.
    发明申请
    SYNCHRONIZATION ON REACTIVATION OF ASYNCHRONOUS TABLE REPLICATION 审中-公开
    异步表复制反应同步化

    公开(公告)号:US20160371319A1

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

    申请号:US14871765

    申请日:2015-09-30

    Applicant: SAP SE

    Abstract: Technologies are described for performing synchronization within a database environment. A source host stores multiple database tables and a replica host stores copies of the multiple database tables. During synchronization, replication log replay is blocked at the replica node, and a multithreaded process locks the multiple database tables of the source hosts, reactivates replication log generation for each of the multiple database tables, and then unlocks the database tables. A synchronization timestamp is acquired and used to synchronize the multiple database tables with the copies of the multiple database tables. After synchronization, replication log replay is reactivated at the replica host for the copies of the multiple database tables.

    Abstract translation: 描述了在数据库环境中执行同步的技术。 源主机存储多个数据库表,副本主机存储多个数据库表的副本。 在同步期间,复制日志重播在副本节点被阻止,多线程进程锁定源主机的多个数据库表,重新启动每个多个数据库表的复制日志生成,然后解锁数据库表。 获取同步时间戳并用于将多个数据库表与多个数据库表的副本同步。 同步之后,复制日志重放在副本主机上重新激活,以获取多个数据库表的副本。

    Virtual database tables with updatable logical table pointers

    公开(公告)号:US11934407B2

    公开(公告)日:2024-03-19

    申请号:US17830935

    申请日:2022-06-02

    Applicant: SAP SE

    CPC classification number: G06F16/24562 G06F16/2379 G06F16/24552

    Abstract: Techniques and solutions are described for implementing virtual table schemas. A virtual table schema includes a logical pointer that is used to target a table that includes data and is defined according to the virtual table schema. Values assigned to the logical pointer can be used to target tables at different locations, such as in-memory storage or in dynamic storage of a database management system. The dynamic storage includes an in-memory buffer cache and persistent storage. The logical pointer can be updated to point to the in-memory storage or the dynamic storage, including based on use statistics. Similarly, a table having data for the virtual table can be transitioned between the in-memory buffer cache and the persistent storage, including based on use statistics for the virtual table. A value for the logical pointer can be updated when the table is transferred between the in-memory buffer cache and the dynamic storage.

    Distributed transaction management with tokens

    公开(公告)号:US11921760B2

    公开(公告)日:2024-03-05

    申请号:US17507094

    申请日:2021-10-21

    Applicant: SAP SE

    Abstract: A system, method and computer product for managing distributed transactions of a database. A transaction manager is provided for each of a plurality of transactions of the database. Each transaction manager is configured to perform functions that include generating a transaction token that specifies data to be visible for a transaction on the database. The database contains both row and column storage engines, and the transaction token includes a transaction identifier (TID) for identifying committed transactions and uncommitted transactions. A last computed transaction is designated with a computed identifier (CID), record-level locking of records of the database is performed using the TID and CID to execute the transaction, and the plurality of transactions of the database are executed with each transaction manager.

    ADAPTIVE QUERY ROUTING IN A REPLICATED DATABASE ENVIRONMENT

    公开(公告)号:US20230129099A1

    公开(公告)日:2023-04-27

    申请号:US18087712

    申请日:2022-12-22

    Applicant: SAP SE

    Abstract: Technologies are described providing adaptive query routing in a replicated database environment. The technologies can be used with a variety of replication protocols. Prepared statements, such as for queries, from a database client can be routed to a source node, or a source node and available replica nodes, when a replica node becomes unavailable. When a replica node becomes available again, a prepared statement can be updated to indicate that the updated prepared statement can be executed at nodes including the replica node that is available again. Prepared statement routing can also be used when a portion of replicated data becomes unavailable at a replica node, but a portion of replicated data remains available.

Patent Agency Ranking