Abstract: A computer-implemented method for determining a query execution plan based on transaction state may include determining that a first set of database values in a database table are in a committed transaction state and that a second set of database values in the database table are in an uncommitted transaction state. In response to the determining, the first set of database values may have a first set of statistics generated and the second set of database values may have a second set of statistics generated. The first and second set of statistics may be for use in determining a query execution plan.

Abstract: Aspects of the present disclosure are directed towards managing computing resources. Managing computing resources can include initializing in a computer system, an application that corresponds to one or more commit signatures, each of the one or more commit signatures correspond to a transaction within the application and determining that a commit signature of one or more commit signatures is saved in a commit block (COB). Managing computing resources can include retrieving, from the COB, in response to determining that the commit signature is saved in the COB, a first set of resource data that corresponds to the commit signature, the first set of resource data contains information for resource usage that corresponds to the application and allocating resources accessible to the computer system based on the first set of resource data.

Abstract: Aspects of the present disclosure are directed towards managing computing resources. Managing computing resources can include initializing in a computer system, an application that corresponds to one or more commit signatures, each of the one or more commit signatures correspond to a transaction within the application and determining that a commit signature of one or more commit signatures is saved in a commit block (COB). Managing computing resources can include retrieving, from the COB, in response to determining that the commit signature is saved in the COB, a first set of resource data that corresponds to the commit signature, the first set of resource data contains information for resource usage that corresponds to the application and allocating resources accessible to the computer system based on the first set of resource data.

Abstract: A computer-implemented method for reusing deleted database records includes, receiving, by a database manager executing within a computing device, a first query request to insert, into a database table, a first set of database records. The database manager identifies a first set of entries within a journal log bundle. The database manager also determines, in response to identifying a first set of entries, that there is a third set of deleted database records located on a same page as a second set of database records. The database manager also, in response to determining that there is a third set of deleted database records located on a same page as the second set of database records, inserts into the database table the first set of database records using the third set of deleted database records.

Abstract: A computer-implemented method for reusing deleted database records includes, receiving, by a database manager executing within a computing device, a first query request to insert, into a database table, a first set of database records. The database manager identifies a first set of entries within a journal log bundle. The database manager also determines, in response to identifying a first set of entries, that there is a third set of deleted database records located on a same page as a second set of database records. The database manager also, in response to determining that there is a third set of deleted database records located on a same page as the second set of database records, inserts into the database table the first set of database records using the third set of deleted database records.

Abstract: Aspects of the present disclosure are directed towards managing computing resources. Managing computing resources can include initializing in a computer system, an application that corresponds to one or more commit signatures, each of the one or more commit signatures correspond to a transaction within the application and determining that a commit signature of one or more commit signatures is saved in a commit block (COB). Managing computing resources can include retrieving, from the COB, in response to determining that the commit signature is saved in the COB, a first set of resource data that corresponds to the commit signature, the first set of resource data contains information for resource usage that corresponds to the application and allocating resources accessible to the computer system based on the first set of resource data.

Abstract: Aspects of the present disclosure are directed towards managing computing resources. Managing computing resources can include initializing in a computer system, an application that corresponds to one or more commit signatures, each of the one or more commit signatures correspond to a transaction within the application and determining that a commit signature of one or more commit signatures is saved in a commit block (COB). Managing computing resources can include retrieving, from the COB, in response to determining that the commit signature is saved in the COB, a first set of resource data that corresponds to the commit signature, the first set of resource data contains information for resource usage that corresponds to the application and allocating resources accessible to the computer system based on the first set of resource data.

Abstract: A computer-implemented method for determining a query execution plan based on transaction state may include determining that a first set of database values in a database table are in a committed transaction state and that a second set of database values in the database table are in an uncommitted transaction state. In response to the determining, the first set of database values may have a first set of statistics generated and the second set of database values may have a second set of statistics generated. The first and second set of statistics may be for use in determining a query execution plan.

Abstract: A computer-implemented method for determining a query execution plan based on transaction state may include determining that a first set of database values in a database table are in a committed transaction state and that a second set of database values in the database table are in an uncommitted transaction state. In response to the determining, the first set of database values may have a first set of statistics generated and the second set of database values may have a second set of statistics generated. The first and second set of statistics may be for use in determining a query execution plan.

Abstract: A first database management system (DBMS) running on first computer having a first set of computing resources determines that with respect to the first set of computing resources a first query access plan for executing a query satisfies a set of query optimization criteria. A determination is then made that with respect to a second set of computing resources the first query access plan fails a set of preliminary criteria. In response to this failure determination, a second query access plan for executing the query is generated. Prior to having a second DBMS running on a second computer having the second set of computing resources receive a request to execute the query, a determination is made that with respect to the second set of computing resources the second query access plan satisfies the set query optimization criteria.

Abstract: Each of one or more commit cycles may be associated with a predicted number of updates. A statistics collection time for a database table can be determined by estimating a sum of predicted updates included in one or more commit cycles. Whether the estimated sum of predicted updates is greater than a first threshold may be determined. In addition, a progress point for a first one of the commit cycles can be determined. A time to collect statistics may be selected based on the progress point of the first commit cycle.

Abstract: Each of one or more commit cycles may be associated with a predicted number of updates. A statistics collection time for a database table can be determined by estimating a sum of predicted updates included in one or more commit cycles. Whether the estimated sum of predicted updates is greater than a first threshold may be determined. In addition, a progress point for a first one of the commit cycles can be determined. A time to collect statistics may be selected based on the progress point of the first commit cycle.

Abstract: A database management system (DBMS) runs on scalable production system. The DBMS includes a first operating mode, wherein the scalable production system runs on a first set of computing resources, and a second operating mode, wherein the scalable production system runs on a second set of computing resources. The DBMS in the first mode determines that with respect to the first set of resources a first query access plan for executing a query satisfies optimization criteria. A determination is made that with respect to the second set of resources the first plan fails preliminary criteria. In response to this failure determination, a second query access plan for executing the query is generated. Prior to having the DBMS receive a request to execute the query while in the second mode, a determination is made that with respect to the second set of resources the second plan satisfies the optimization criteria.

Abstract: A database management system (DBMS) runs on scalable production system. The DBMS includes a first operating mode, wherein the scalable production system runs on a first set of computing resources, and a second operating mode, wherein the scalable production system runs on a second set of computing resources. The DBMS in the first mode determines that with respect to the first set of resources a first query access plan for executing a query satisfies optimization criteria. A determination is made that with respect to the second set of resources the first plan fails preliminary criteria. In response to this failure determination, a second query access plan for executing the query is generated. Prior to having the DBMS receive a request to execute the query while in the second mode, a determination is made that with respect to the second set of resources the second plan satisfies the optimization criteria.

Abstract: A first database management system (DBMS) running on first computer having a first set of computing resources determines that with respect to the first set of computing resources a first query access plan for executing a query satisfies a set of query optimization criteria. A determination is then made that with respect to a second set of computing resources the first query access plan fails a set of preliminary criteria. In response to this failure determination, a second query access plan for executing the query is generated. Prior to having a second DBMS running on a second computer having the second set of computing resources receive a request to execute the query, a determination is made that with respect to the second set of computing resources the second query access plan satisfies the set query optimization criteria.

Abstract: A program identifier, a limit identifier, a minimum value, and an increment value are stored to limit data. The limit identifier identifies a first variable used by the program. In response to storing a data value to a second variable, the stored limit identifier is found and a determination is made whether the stored limit identifier identifies the second variable. If the stored limit identifier identifies the second variable, a determination is made whether the data value is greater than the minimum value. If the data value is greater than the minimum value, the data value is stored to a log if an absolute value of the data value minus a most recently logged data value that was previously stored to the second variable is greater than the increment value. The execution of the program is halted or a user is notified in response to the storing to the log.

Abstract: A program identifier, a limit identifier, a minimum value, and an increment value are stored to limit data. The limit identifier identifies a first variable used by the program. In response to storing a data value to a second variable, the stored limit identifier is found and a determination is made whether the stored limit identifier identifies the second variable. If the stored limit identifier identifies the second variable, a determination is made whether the data value is greater than the minimum value. If the data value is greater than the minimum value, the data value is stored to a log if an absolute value of the data value minus a most recently logged data value that was previously stored to the second variable is greater than the increment value. The execution of the program is halted or a user is notified in response to the storing to the log.

Abstract: An operating system on a source computer system includes a filtered remote journal mechanism that generates a target map of a remote journal to specify where in the remote journal entries will be stored, then generates a vector array that represents the data of interest in the database journal based on specified selection criteria and the target map. The vector array and location information from the target map is then sent to a communication manager, which sends the data indicated in the vector array to the target computer system. On the target computer system, the communication manager reads the data sent from the source computer system and writes the data to the remote journal. The filtered remote journal mechanism may operate on an existing database journal, or may operate iteratively as journal entries are written on the source computer system.

Abstract: An operating system on a source computer system includes a filtered remote journal mechanism that generates a target map of a remote journal to specify where in the remote journal entries will be stored, then generates a vector array that represents the data of interest in the database journal based on specified selection criteria and the target map. The vector array and location information from the target map is then sent to a communication manager, which sends the data indicated in the vector array to the target computer system. On the target computer system, the communication manager reads the data sent from the source computer system and writes the data to the remote journal. The filtered remote journal mechanism may operate on an existing database journal, or may operate iteratively as journal entries are written on the source computer system.

Abstract: A method, apparatus, system, and signal-bearing medium that in an embodiment determine, after a restore of a version of an object, where to begin applying changes from a change log to the object based on an identification in the saved version of the object. When a save command for an object is received, an identification of the change log entry associated with the save command is stored in the saved version of the object. Changes to the object then continue to be logged to the change log. After the saved version of the object is restored, the identification in the saved version of the object is used to find the change log entry at which to start applying changes from the change log to the object. In this way, the point in the change log at which to start applying changes to the object may be determined based on the saved version of the object. In an embodiment, this allows the object to continue to be accessed while the save operation is performed.