Sap Se

Sybase, Inc.

Nandan Marathe

Anant Agarwal

Blaine French

Shailesh Kamalakar Mungikar

Steven A Kirk

Simhachala Sasikanth Gottapu

Kaushal Mittal

Dipesh Pandit

Yahong Wang

Sagar Ranadive

Ivan T Bowman

John Smirnios

Muhammed Sharique

Gunes Aluc

Mohammed Abouzour

Mahendra Chavan

Fang-Ying Yen

Hemant Kumar Shukla

Tanay Jayant Kayastha

Xi Deng

Siddharth Kumar

Disclosed herein are system, method, and computer program product embodiments for non-blocking backup for tertiary initialization in a log replay only node. An embodiment operates by performing a standard log replay on a secondary server and briefly suspending the standard log replay in response to tertiary initialization. Further, the secondary server may determine backup block information and perform a page-aligned backup process from the secondary server to a tertiary server. Additionally, the secondary server may determine log replay block information, and perform a modified log replay concurrently with the backup process based on the backup block information.

Non-blocking backup in a log replay node for tertiary initialization

Disclosed herein are various embodiments a code simplification system. An embodiment operates by determining that a software version of a coordinator node is different from a software version of one or more worker nodes, Commits by the one or more worker nodes to a database are disabled based on the determination that the software versions differ. An update is performed on each of the one or more worker nodes. An acknowledgement that the update on each of the one or more worker nodes has completed is received, and the commits to the database by the one or more worker nodes is enabled.

Computing node upgrading system

Systems and methods include determination of a first logical page number of a first database page to be persisted, identification of a first blockmap page associated with the first logical page number, determination, from the first blockmap page, of a block number associated with the first logical page number, determination that the block number is an object key, determination, in response to the determination, that the block number is an object key, determination of a first object key to associate with the first logical page number, and writing of the first database page to the object store using the first object key.

Cloud-native object storage for page-based relational database

Disclosed herein are system, method, and computer program product embodiments for replication of database. In one embodiment, one or more data pages generated from a transaction are obtained at a first node. The one or more data pages are compressed. The compressed data pages are added into a first queue in a memory of the first node. The first queue includes a plurality of blocks. A first block of the compressed data pages in the first queue is transmitted to a second node when the first block of the compressed data pages becomes available for replication. The first block of the compressed data pages is stored in a persistent storage of the first node.

Physical replication of database

Disclosed herein are methods for retrieving data from a database. An embodiment operates searching for a key in a first index. The method determines that the searching will require a storage access request and issues the storage access request. The method continues searching for the key in a second index.

Query access optimizations for tiered index architecture

Synchronized backup and recovery of heterogeneous DBMSs is described herein. An embodiment operates by receiving, by at least one processor, a request for a data backup process at a first server; creating, by at least one processor, a pipe between processes of the first sever and the data backup process; performing, by at least one processor, the data backup process according to an execution command sent from a second server; and sending, by at least one processor, a result of the data backup process from the second server to the first server when the data backup process has terminated.

Synchronized backup and recovery of heterogeneous DBMSs using third party backup tool

Tiered index management

Disclosed herein are system, method, and computer program product embodiments for providing point in time recovery on a database. An embodiment operates by determining that one or more values were written to one of a plurality of database nodes of a database as part of a write transaction. The one or more data pages to which the one or more values were written are copied to a storage location of a backup corresponding to the write transaction. The storage location of the one or more data pages in the backup are written to a location in a transaction log corresponding to the write transaction.

Point in time recovery on a database

Existing algorithms to build balanced tree structures ('b-trees') compare a data element (e.g., a key) to be inserted with the data elements that have already been inserted to find the correct position to insert the data element. Additionally, the algorithms balance and/or rebalance the b-tree when any individual node gets over-filled. As part of this balancing, data elements stored in the various nodes are moved to other nodes. These operations can incur both time and resource costs. We propose an algorithm to build a b-tree in a bottom up manner and a technique to modify trees built using the aforementioned algorithm so that they are balanced. We also propose a method to allow for adding more data into the thus-built b-tree as long as it follows a certain set of pre-conditions.

Append-only b-tree cursor

Disclosed herein are system, method, and computer program product embodiments for storing data in a database using a tiered index architecture, An embodiment operates by creating a first tier and assigning a first threshold size to the first tier. When the first tier exceed the first threshold size, the system pushes data from the first tier into a second tier.

Growing community of inventors

Pune, India

Nandan Marathe