Abstract: An approach is provided in which the approach receives a query request to execute a query. The approach provides multiple query execution options based on multiple hardware configurations. The multiple query execution options include multiple execution times and multiple execution costs. The approach receives a selection that selects at least one of the query execution options and, in turn, executes the query on at least one of the hardware configurations based on the received selection.

Abstract: According to one or more embodiments of the present invention, a computer-implemented method includes creating a hybrid index for a multi-zone data storage system in which a first zone has data that is organized for transaction processing, and a second zone that has data organized for analytic processing. Each index entry in the hybrid index includes an index key including an equality column, a begin-timestamp column, and a tuple-sequence-number column. The method further includes building an index run to be included in the hybrid index, the index run includes multiple index entries. An index run is created by selecting columns by scanning data blocks from the first zone, computing tuple-sequence-number values for the index entries to be included in the hybrid index, and sorting the index entries according to a predetermined order using the columns to be included in the index run.

Abstract: One embodiment provides for monotonic transactions in a multi-master database with loosely coupled nodes including performing, by a processor, a read transaction protocol including: performing, by the processor, a read transaction protocol including issuing read transactions at any one of the nodes; attempting to return rows that are known to be replicated by at least a read quorum of the nodes; and for timing-out of the attempting to return rows known to be replicated by at least the read quorum of the nodes based on the special-node being non-responsive: selecting a new special-node from the nodes; and repeating attempting to return rows that are known to be replicated by at least the read quorum of the nodes.

Abstract: One embodiment provides for monotonic transactions in a multi-master database with loosely coupled nodes including performing, by a processor, a write transaction protocol including: a client device issuing write transactions at any of the nodes, recording a write transaction locally at a node that issues a write transaction and asynchronously replicating the write transaction to at least one other node, and waiting for reception of an acknowledgment from at least a quorum of the nodes before returning a response to the client device. The quorum is any set of the nodes that includes a special node and at least one other node.

Abstract: One embodiment provides for a method to track replication state and providing quorum visible retrievals. The method includes assigning, by a writer node performing write operations, a sequence number. The sequence number is replicated with a write operation to other replica nodes in an asynchronous fashion thru a first network channel. On a second network channel, a state of a local system is communicated by sending a latest sequence number available that has been hardened to the other replica nodes. A query is obtained by a reader node, and a sequence number limit is selected. Results up to the sequence number limit are returned.

Abstract: One embodiment provides for a method including processing transactional operations on a key used to determine whether existing data is found for that key. A first time index is updated using unique keys and a start time field of a first appearance of each key from the transactional operations. A deferred update of prior versions of the key is performed for non-recent data upon determining that recent data in the transactional operations is found for the key.

Abstract: A request for changing data of a file system data structure stored on a shingled magnetic recording (SMR) drive is received. The data change is logged in a log entry of a log structure stored in a non-volatile random access memory (NVRAM). The log entry is added as a new entry at an end of the log structure. The log entry is marked within the NVRAM as modified and a predetermined criterion is determined to be satisfied. Responsive to determining that the predetermined criterion is satisfied, the NVRAM is searched for log entries marked as modified. The modified log entries are stored to the SMR drive.

Abstract: One embodiment provides for a method for grooming transactional operations in a multi-master distributed data management system including maintaining transactional operations in at least one transaction-local side-log. A table log scan is performed for a table including recording identification for each record in a log. Tuple sequence numbers are generated for the records and the records are written on groomed transaction blocks to the table.

Abstract: One embodiment provides for a method for grooming transactional operations in a multi-master distributed data management system including maintaining transactional operations in at least one transaction-local side-log. A table log scan is performed for a table including recording identification for each record in a log. Each column in the table is loaded with column values based on the identifications. Records based on the column values are written to the groomed transaction blocks that are table based, and the tuple sequence numbers for each record on groomed blocks are generated. The table is shared/sharded across nodes handling transactional operations in the multi-master distributed data management system to increase processing handling of the transactional operations.

Abstract: A request for changing data of a file system data structure stored on a shingled magnetic recording (SMR) drive is received. The data change is logged in a log entry of a log structure stored in a non-volatile random access memory (NVRAM). The log entry is added as a new entry at an end of the log structure. The log entry is marked within the NVRAM as modified and a predetermined criterion is determined to be satisfied. Responsive to determining that the predetermined criterion is satisfied, the NVRAM is searched for log entries marked as modified. The modified log entries are stored to the SMR drive.

Abstract: A request for changing data of a file system data structure stored on a shingled magnetic recording (SMR) drive is received. The data change is logged in a log entry of a log structure stored in a non-volatile random access memory (NVRAM). The log entry is added as a new entry at an end of the log structure. The log entry is marked within the NVRAM as modified and a predetermined criterion is determined to be satisfied. Responsive to determining that the predetermined criterion is satisfied, the NVRAM is searched for log entries marked as modified. The modified log entries are stored to the SMR drive.

Abstract: One embodiment provides for a method for grooming transactional operations in a multi-master distributed data management system including maintaining transactional operations in at least one transaction-local side-log. A table log scan is performed for a table including recording identification for each record in a log. Each column in the table is loaded with column values based on the identifications. Records based on the column values are written to the groomed transaction blocks that are table based, and the tuple sequence numbers for each record on groomed blocks are generated. The table is shared/sharded across nodes handling transactional operations in the multi-master distributed data management system to increase processing handling of the transactional operations.

Abstract: A request for changing data of a file system data structure stored on a shingled magnetic recording (SMR) drive is received. The data change is logged in a log entry of a log structure stored in a non-volatile random access memory (NVRAM). The log entry is added as a new entry at an end of the log structure. The log entry is marked within the NVRAM as modified and a predetermined criterion is determined to be satisfied. Responsive to determining that the predetermined criterion is satisfied, the NVRAM is searched for log entries marked as modified. The modified log entries are stored to the SMR drive.

Abstract: A request for changing data of a file system data structure stored on a shingled magnetic recording (SMR) drive is received. The data change is logged in a log entry of a log structure stored in a non-volatile random access memory (NVRAM). The log entry is added as a new entry at an end of the log structure. The log entry is marked within the NVRAM as modified and a predetermined criterion is determined to be satisfied. Responsive to determining that the predetermined criterion is satisfied, the NVRAM is searched for log entries marked as modified. The modified log entries are stored to the SMR drive.

Abstract: One embodiment provides for monotonic transactions in a multi-master database with loosely coupled nodes including performing, by a processor, a write transaction protocol including: a client device issuing write transactions at any of the nodes, recording a write transaction locally at a node that issues a write transaction and asynchronously replicating the write transaction to at least one other node, and waiting for reception of an acknowledgment from at least a quorum of the nodes before returning a response to the client device. The quorum is any set of the nodes that includes a special node and at least one other node.

Abstract: Technology for applying locks to memory pages. More specifically, a sticky lock is chosen by matching observed usage patterns with predetermined patterns associated with various sticky locks and/or types of stick locks increase database performance by reducing required communications and information transfers.

Abstract: According to embodiments of the present invention, one or more computer processors determine that a predetermined workload threshold associated with an invalidated object is not exceeded and transmits an invalidation command associated with the invalidated object to the owner of the invalidated object. The one or more computer processors instruct the modifier of the invalidated object to retain possession of a first lock on the object beyond the transaction. The one or more computer processors determine that a usage pattern associated with the invalidated object matches a predetermined usage pattern for selecting a lock that can be retained beyond an associated transaction and transmits a second lock a requestor. The one or more computer processors instruct the modifier to release possession of the first lock to the owner and transmit a first image of the current version of the invalidated object to the owner for subsequent transmission to the requestor.

Abstract: An ordering of operations in log records includes: performing update operations on a database object by a node; writing log records for the update operations into a local buffer by the node, the log records each including a local virtual timestamp; determining that a log flush to write the log records in the local buffer to a persistent storage is to be performed; in response, sending a request from the node to a log flush sequence server for a log flush sequence number; receiving the log flush sequence number by the node; inserting the log flush sequence number into the log records in the local buffer; and performing the log flush to write the log records in the local buffer to the persistent storage, where the log records written to the persistent storage comprises the local virtual timestamps and the log flush sequence number.

Abstract: According to embodiments of the present invention, one or more computer processors determine that a predetermined workload threshold associated with an invalidated object is not exceeded and transmits an invalidation command associated with the invalidated object to the owner of the invalidated object. The one or more computer processors instruct the modifier of the invalidated object to retain possession of a first lock on the object beyond the transaction. The one or more computer processors determine that a usage pattern associated with the invalidated object matches a predetermined usage pattern for selecting a lock that can be retained beyond an associated transaction and transmits a second lock a requestor. The one or more computer processors instruct the modifier to release possession of the first lock to the owner and transmit a first image of the current version of the invalidated object to the owner for subsequent transmission to the requestor.

Abstract: According to embodiments of the present invention, one or more computer processors determine that a predetermined workload threshold associated with an invalidated object is not exceeded and transmits an invalidation command associated with the invalidated object to the owner of the invalidated object. The one or more computer processors instruct the modifier of the invalidated object to retain possession of a first lock on the object beyond the transaction. The one or more computer processors determine that a usage pattern associated with the invalidated object matches a predetermined usage pattern for selecting a lock that can be retained beyond an associated transaction and transmits a second lock a requestor. The one or more computer processors instruct the modifier to release possession of the first lock to the owner and transmit a first image of the current version of the invalidated object to the owner for subsequent transmission to the requestor.