Abstract: A global transaction system receives a transaction request for a plurality of database services of microservices. The global transaction system receives a plurality of local commit decisions of local commit requests from local transaction managers of the database services of the microservices. The local commit request corresponds to the transaction request for each database. The global transaction system generates a physical commit request to each of the local transaction managers based on the local commit decisions and a global commit decision. Each local transaction manager submits the physical commit request to each database server of the database services corresponding to the transaction request.

Abstract: System and method embodiments are provided for using different storage formats for a primary database and its replicas in a database managed replication (DMR) system. As such, the advantages of both formats can be combined with suitable design complexity and implementation. In an embodiment, data is arranged in a sequence of rows and stored in a first storage format at the primary database. The data arranged in the sequence of rows is also stored in a second storage format at the replica database. The sequence of rows is determined according to the first storage format or the second storage format. The first storage format is a row store (RS) and the second storage format is a column store (CS), or vice versa. In an embodiment, the sequence of rows is determined to improve compression efficiency at the CS.

Abstract: System and method embodiments are provided for using different storage formats for a primary database and its replicas in a database managed replication (DMR) system. As such, the advantages of both formats can be combined with suitable design complexity and implementation. In an embodiment, data is arranged in a sequence of rows and stored in a first storage format at the primary database. The data arranged in the sequence of rows is also stored in a second storage format at the replica database. The sequence of rows is determined according to the first storage format or the second storage format. The first storage format is a row store (RS) and the second storage format is a column store (CS), or vice versa. In an embodiment, the sequence of rows is determined to improve compression efficiency at the CS.

Abstract: An apparatus and method are provided for utilizing different data storage types to store primary and replicated database directories. Included is a first data storage of a first data storage type including a direct-access storage type. The first data storage is configured to store a primary database directory. Also included is a second data storage of a second data storage type including a share type. The second data storage is configured to store a replicated database directory that replicates at least a portion of the primary database directory.

Abstract: A replicated key-value store is implemented using a “last-write-wins” consensus protocol. To improve throughput and latency in cross-data-center configurations, a system deploys a cross-cluster, learner-only member to a cluster of nodes (e.g., a data center). The cross-cluster, learner-only member submits key-values received at local leader members to remote clusters. Conflicts between the key-values and initial values at the remote clusters are resolved using a “last-write-wins” consensus protocol.

Abstract: A disaster recovery switchover system, the disaster recovery switchover system includes a production node, a redundancy node, and a recording node, the production node currently runs a first production service, and the method includes: receiving, by the recording node, first restoration information sent by the production node, where the first restoration information is information required for restoring the first production service to a latest running status of the first production service; and sending, by the recording node when determining that the first production service needs to be restored on the redundancy node, second restoration information to the redundancy node, where the second restoration information is information that is obtained according to the first restoration information and that is required to restore the first production service on the redundancy node, so that the redundancy node switches the first production service to the redundancy node according to the second restoration information.

Abstract: A computer-implemented method and system are provided, including executing an application programming interface (API) in a network switch to define at least one of one or more database functions, performing, using one or more processors, the one or more database functions on at least a portion of data contained in a data message received at the switch, to generate result data, and routing the result data to one or more destination nodes. A database function-defined network switch includes a network switch and one or more processors to perform a pre-defined database function on query data contained in data messages received at the switch, to produce result data, wherein the pre-defined database function is performed on the query data in a first mode of operation to a state of full completion, generating complete result data and no skipped query data, or to a state of partial completion, generating partially completed result data and skipped query data.

Abstract: A global transaction system receives a transaction request for a plurality of database services of microservices. The global transaction system receives a plurality of local commit decisions of local commit requests from local transaction managers of the database services of the microservices. The local commit request corresponds to the transaction request for each database. The global transaction system generates a physical commit request to each of the local transaction managers based on the local commit decisions and a global commit decision. Each local transaction manager submits the physical commit request to each database server of the database services corresponding to the transaction request.

Abstract: System and method embodiments are provided for multi-version support in indexes in a database. The embodiments enable substantially optimized multi-version support in index and avoid backfill of commit log sequence number (LSN) for a transaction identifier (TxID). In an embodiment, a method in a data processing system for managing a database includes determining with the data processing system whether a record is deleted according to a delete indicator in an index leaf page record corresponding to the record; and determining with the data processing system, when the record is not deleted, whether the record is visible according to a new record indicator in the index leaf page record and according to a comparison of a system commit TxID at the transaction start with a record commit TxID obtained from the index leaf page record.

Abstract: A replicated key-value store is implemented using a “last-write-wins” consensus protocol. To improve throughput and latency in cross-data-center configurations, a system deploys a cross-cluster, learner-only member to a cluster of nodes (e.g., a data center). The cross-cluster, learner-only member submits key-values received at local leader members to remote clusters. Conflicts between the key-values and initial values at the remote clusters are resolved using a “last-write-wins” consensus protocol.

Abstract: Data messages having different priorities may be stored in different communication buffers of a network node. The data messages may then be forwarded from the communication buffers to working buffers as space becomes available in the working buffers. After being forwarded to the working buffers, the data messages may be available to be processed by upper-layer operations of the network node. Priorities may be assigned to the data messages based on a priority level of a query associated with the data messages, a priority level of an upper-layer operation assigned to process the data messages, or combinations thereof.

Abstract: A disaster recovery switchover system, the disaster recovery switchover system includes a production node, a redundancy node, and a recording node, the production node currently runs a first production service, and the method includes: receiving, by the recording node, first restoration information sent by the production node, where the first restoration information is information required for restoring the first production service to a latest running status of the first production service; and sending, by the recording node when determining that the first production service needs to be restored on the redundancy node, second restoration information to the redundancy node, where the second restoration information is information that is obtained according to the first restoration information and that is required to restore the first production service on the redundancy node, so that the redundancy node switches the first production service to the redundancy node according to the second restoration information.

Abstract: A method includes dividing a dataset into partitions by hashing a specified key, selecting a set of distributed file system nodes as a primary node group for storage of the partitions, and causing a primary copy of the partitions to be stored on the primary node group by a distributed storage system file server such that the location of each partition is known by hashing of the specified key.

Abstract: A method includes receiving, by a database system, a query statement and forming a runtime plan tree in accordance with the query statement. The method also includes traversing the runtime plan tree including determining whether a function node of the runtime plan tree is qualified for just-in-time (JIT) compilation. Additionally, the method includes, upon determining that the function node is a qualified for JIT compilation producing a string key in accordance with a function of the function node and determining whether a compiled object corresponding to the string key is stored in a compiled object cache.

Abstract: A computer-implemented method and system are provided, including executing an application programming interface (API) in a network switch to define at least one of one or more database functions, performing, using one or more processors, the one or more database functions on at least a portion of data contained in a data message received at the switch, to generate result data, and routing the result data to one or more destination nodes. A database function-defined network switch includes a network switch and one or more processors to perform a pre-defined database function on query data contained in data messages received at the switch, to produce result data, wherein the pre-defined database function is performed on the query data in a first mode of operation to a state of full completion, generating complete result data and no skipped query data, or to a state of partial completion, generating partially completed result data and skipped query data.

Abstract: The present technology relates to managing data caching in processing nodes of a massively parallel processing (MPP) database system. A directory is maintained that includes a list and a storage location of the data pages in the MPP database system. Memory usage is monitored in processing nodes by exchanging memory usage information with each other. Each of the processing nodes manages a list and a corresponding amount of available memory in each of the processing nodes based on the memory usage information. Data pages are read from a memory of the processing nodes in response to receiving a request to fetch the data pages, and a remote memory manager is queried for available memory in each of the processing nodes in response to receiving the request. The data pages are distributed to the memory of the processing nodes having sufficient space available for storage during data processing.

Abstract: In one embodiment, a method of performing point-in-time recovery (PITR) in a massively parallel processing (MPP) database includes receiving, by a data node from a coordinator, a PITR recovery request and reading a log record of the MPP database. The method also includes determining a type of the log record and updating a transaction table when the type of the log record is an abort transaction or a commit transaction.

Abstract: A system and method of responding to a database query. A query is received for MPP database data stored on a plurality of processing systems. A total splits number of the database data, each split containing at least a portion of the database, is determined. If the total splits number splits is greater than a splits threshold number, partial task maps are created and streamed to the processing systems after compiling the query. If the total splits number is less than the splits threshold number, a complete task map for all splits is created and output to the plurality of processing systems.

Abstract: System and method embodiments are provided for multi-version support in indexes in a database. The embodiments enable substantially optimized multi-version support in index and avoid backfill of commit log sequence number (LSN) for a transaction identifier (TxID). In an embodiment, a method in a data processing system for managing a database includes determining with the data processing system whether a record is deleted according to a delete indicator in an index leaf page record corresponding to the record; and determining with the data processing system, when the record is not deleted, whether the record is visible according to a new record indicator in the index leaf page record and according to a comparison of a system commit TxID at the transaction start with a record commit TxID obtained from the index leaf page record.

Abstract: System and method embodiments are provided for multi-version support in indexes in a database. The embodiments enable substantially optimized multi-version support in index and avoid backfill of commit log sequence number (LSN) for a transaction identifier (TxID). In an embodiment, a method in a data processing system for managing a database includes determining with the data processing system whether a record is deleted according to a delete indicator in an index leaf page record corresponding to the record; and determining with the data processing system, when the record is not deleted, whether the record is visible according to a new record indicator in the index leaf page record and according to a comparison of a system commit TxID at the transaction start with a record commit TxID obtained from the index leaf page record.