Abstract: A method of classifying and monitoring database operations based on a recovery cost may include receiving an indication of a recoverable operation. A count in a persistent storage, such as a catalog, corresponding to an occurrence of the recoverable operation is incremented.

Abstract: According to one embodiment of the present invention, a method for processing a query in a column database is provided. The method for analyzing test results may include a computer, associating a first set of metadata values with a set of records in a table, wherein each record has an associated state indicated by a metadata value. The method may further include the computer receiving a query to return one or more records of the set of records. The method may further include the computer determining that one or more records in the set of records satisfies the query. The method may further include the computer determining whether at least a first record in the one or more records that satisfies the query is in a returnable state based, at least in part, on the metadata value.

Abstract: According to one embodiment of the present invention, a method for processing a query in a column database is provided. The method for analyzing test results may include a computer, associating a first set of metadata values with a set of records in a table, wherein each record has an associated state indicated by a metadata value. The method may further include the computer receiving a query to return one or more records of the set of records. The method may further include the computer determining that one or more records in the set of records satisfies the query. The method may further include the computer determining whether at least a first record in the one or more records that satisfies the query is in a returnable state based, at least in part, on the metadata value.

Abstract: Embodiments relate to database systems. An aspect includes deferring row insert operations until occurrence of a triggering event. One method includes receiving a row insert for a tuple into a column group store table, where the tuple includes one or more tuplets and each of the tuplets corresponds to a column group in the column group store table. The method also includes copying at least one of the tuplets into an insert buffer that is specific to one of the column groups in the column group store table. The method also includes deferring the row insert into the column group store table until an occurrence of one or more triggering events. The method also includes flushing the row insert into storage associated with the column group store table, in response to the occurrence of the one or more triggering events.

Abstract: Provided are techniques for using parallel inserts to insert into a column store. A list of sub-ranges for a columnar table is created. A change statement for one or more rows to be inserted into the columnar table is received. For each of the received change statements, a sub-range from the list of sub-ranges is identified and data is serially inserted into the identified sub-range of the columnar table, while allowing parallel processing of each change statement for different sub-ranges of the columnar table.

Abstract: Provided are techniques for using parallel inserts to insert into a column store. A list of sub-ranges for a columnar table is created. A change statement for one or more rows to be inserted into the columnar table is received. For each of the received change statements, a sub-range from the list of sub-ranges is identified and data is serially inserted into the identified sub-range of the columnar table, while allowing parallel processing of each change statement for different sub-ranges of the columnar table.

Abstract: A method of classifying and monitoring database operations based on a recovery cost may include receiving an indication of a recoverable operation. A count in a persistent storage, such as a catalog, corresponding to an occurrence of the recoverable operation is incremented.

Abstract: A method of optimizing the number and type of database backups to achieve a given RTO is provided and may include receiving a RTO and receiving a heuristic for determining an amount of unencumbered processing time. A type of next backup, (i.e., a next backup), is determined wherein the type of next backup is an incremental backup when the sum of the heuristic, and the times to: restore the latest full backup, restore zero or more incremental backups, complete a current incremental backup, and perform a full backup is less than the received RTO, else the type of the next backup is a full backup. A time to schedule the next backup is scheduled based on the received RTO being a total of an amount of time to: complete the type of next backup; rollforward zero or more transaction log records; and to restore at least one backup.

Abstract: A method of classifying and monitoring database operations based on a recovery cost may include receiving an indication of a recoverable operation. A count in a persistent storage, such as a catalog, corresponding to an occurrence of the recoverable operation is incremented.

Abstract: Techniques are disclosed for performing an operation for determining whether a standby database is synchronized with a primary database in a log shipping physical database replication environment. In one embodiment, the operation may include receiving a transaction log at the standby database from the primary database. The transaction log may specify a first one or more checksum values for a first set of pages on the primary database. The operation may also include calculating a second one or more checksum values for a second set of pages on the standby database. The operation may also include determining whether the standby database is synchronized with the primary database by comparing the first one or more checksum values with the second one or more checksum values.

Abstract: Techniques are disclosed for performing an operation for determining whether a standby database is synchronized with a primary database in a log shipping physical database replication environment. In one embodiment, the operation may include receiving a transaction log at the standby database from the primary database. The transaction log may specify a first one or more checksum values for a first set of pages on the primary database. The operation may also include calculating a second one or more checksum values for a second set of pages on the standby database. The operation may also include determining whether the standby database is synchronized with the primary database by comparing the first one or more checksum values with the second one or more checksum values.

Abstract: Generating a standby index on a standby database server in a physical log-shipping data replication environment. Embodiments of the invention include providing a primary database server and a standby database server, replicating a primary database and a primary database index from the primary database server to the standby database server, generating a standby index on the standby database server, and cataloging the standby index on the standby database server.

Abstract: Methods, systems and program products for log-shipping data replication from a primary system to a communicatively-coupled standby system. Embodiments of the invention may receive transactional log data at a standby system, from the primary system, and before the transactional log data is written to storage on the primary system. Embodiments may then receive a notification from the primary system indicating that the corresponding log data was written to storage on the primary system, and responsive to receiving the notification, may process the received transactional log data.

Abstract: Generating a standby index on a standby database server in a physical log-shipping data replication environment. Embodiments of the invention include providing a primary database server and a standby database server, replicating a primary database and a primary database index from the primary database server to the standby database server, generating a standby index on the standby database server, and cataloging the standby index on the standby database server.

Abstract: A method, system, and computer program product for reducing likelihood of data loss during performance of failovers in a high-availability system comprising a primary system and a standby system are provided. The method, system, and computer program product provide for defining a halt duration, periodically determining a halt end time, halting data modifications at the primary system responsive to failure of data replication to the standby system, resuming data modifications at the primary system responsive to a last determined halt end time being reached or data replication to the standby system resuming, and responsive to the primary system failing prior to a previously determined halt end time, determining that a failover to the standby system will not result in data loss on the standby system with respect to the primary system.

Abstract: A log-shipping data replication system employs a primary server coupled to a standby server. In operation, the primary server concurrently flushes log data at the primary server and transmits the same log data from the primary server to the standby server. The primary server further transmits at least one buffer flush boundary indication to the standby server indicating the flushing status of the log data at the primary server. The standby server processes the log data as a function of receiving the log data from the primary server, and/or receiving the at least one buffer flush boundary indication from the primary server.

Abstract: A method and system are provided for providing a consistent reintegration of a failed primary instance as a new secondary instance with implementation of truncation of log records. Upon failure of a primary instance, a secondary instance may be reassigned as the new primary instance. Prior to reintegration, any portion of the database log of the failed primary that is after the log position of the new primary instance may be truncated, followed by a comparison of the log positions of both the new primary instance and the new secondary instance. In limited circumstances, the truncation of the log data generated by the failed primary instance after the point of failure is possible, and supports reintegration of the failed primary as a new secondary instance with limited overhead.

Abstract: The replacement selection algorithm for ordered merging is improved by remembering at each node of the selection tree when a losing data item is a duplicate of the prior winning data item at that node. The next time a key comparison between data items would be performed at such a node, it is not, and instead the duplicate prior loser is instantly promoted to be the next winner, avoiding the need for any further key comparisons for that winner. A data item's “duplicate” status in a node is indicated by a value of a status indicator having other values corresponding to “empty”, “merging” and “done”. The status indicator is an integer variable in the array data structure representing the selection tree, and has values 0 (empty), 1 (duplicate), 2 (merging), and 3 (done), so that comparisons of two integer values of status indicators can determine whether a duplicate value is ready for instant promotion to become the winning data item.

Abstract: An improved recovery method utilizes sequence numbers to order log records and reduce the excess compensating actions due to a failure during recovery. Next undo records are written to the log after a preset number of compensating actions which include the sequence number of the record currently being scanned. After a failure, all records between the next undo record and the record having the sequence number included in the next undo record are ignored during when the log is scanned backwards.