Abstract: Log records are generated by a computer system and stored in a computer readable storage area for recording changes to database objects responsive to receiving transaction requests, wherein the locators for the log records are of a predetermined maximum size that provides a maximum trackable size limit of the storage area. A computer system estimates an amount of time for the storing of the generated log records to fill the storage area up to the maximum trackable size limit. A computer system sets a soft limit to the storage area that is smaller than the maximum trackable size limit, including setting the soft limit based on the estimated amount of time.

Abstract: Provided are techniques for using a series of compare and swap operations to assign a Relative Byte Address (RBA) and a Logical Record Sequence Number (LRSN) to a log record. One or more log buffers for storing the log record are identified, and the log record is moved to the one or more log buffers.

Abstract: Provided are techniques for using a series of compare and swap operations to assign a Relative Byte Address (RBA) and a Logical Record Sequence Number (LRSN) to a log record. One or more log buffers for storing the log record are identified, and the log record is moved to the one or more log buffers.

Abstract: Log records are generated by a computer system and stored in a computer readable storage area for recording changes to database objects responsive to receiving transaction requests, wherein the locators for the log records are of a predetermined maximum size that provides a maximum trackable size limit of the storage area. A computer system estimates an amount of time for the storing of the generated log records to fill the storage area up to the maximum trackable size limit. A computer system sets a soft limit to the storage area that is smaller than the maximum trackable size limit, including setting the soft limit based on the estimated amount of time.

Abstract: Embodiments of the invention comprise a method for dynamically switching a serialization method of a data structure. If use of the serialization mechanism is desired, an instruction to obtain the serialization mechanism is received. If use of the serialization mechanism is not desired and if the serialization mechanism is in use, an instruction to obtain the serialization mechanism is received. If use of the serialization mechanism is not desired and if the serialization mechanism is not in use, an instruction to access the data structure without obtaining the serialization mechanism is received.

Abstract: Embodiments of the invention comprise a method for dynamically switching a serialization method of a data structure. If use of the serialization mechanism is desired, an instruction to obtain the serialization mechanism is received. If use of the serialization mechanism is not desired and if the serialization mechanism is in use, an instruction to obtain the serialization mechanism is received. If use of the serialization mechanism is not desired and if the serialization mechanism is not in use, an instruction to access the data structure without obtaining the serialization mechanism is received.

Abstract: Embodiments of the invention comprise a method for dynamically switching a serialization method of a data structure. If use of the serialization mechanism is desired, an instruction to obtain the serialization mechanism is received. If use of the serialization mechanism is not desired and if the serialization mechanism is in use, an instruction to obtain the serialization mechanism is received. If use of the serialization mechanism is not desired and if the serialization mechanism is not in use, an instruction to access the data structure without obtaining the serialization mechanism is received.

Abstract: Provided are techniques for using a series of compare and swap operations to assign a Relative Byte Address (RBA) and a Logical Record Sequence Number (LRSN) to a log record. One or more log buffers for storing the log record are identified, and the log record is moved to the one or more log buffers.

Abstract: Provided are techniques for using a series of compare and swap operations to assign a Relative Byte Address (RBA) and a Logical Record Sequence Number (LRSN) to a log record. One or more log buffers for storing the log record are identified, and the log record is moved to the one or more log buffers.

Abstract: A method, system and program for accessing records in a database object, such as an index or table. A cursor is maintained that points to a start entry in the database object. The database object has rows and columns of values. A runtime component receives a command to return a kth entry in the object having column values that satisfy predicates in a query statement. The runtime component calls a manager component that accesses entries in the database object to return the kth entry in the object having column values that satisfy the predicates. The manager component moves the cursor through sequential entries in the database object, in either the forward or reverse direction, until a kth entry that satisfies the predicates from the start entry is reached. The manager component positions the cursor to an entry that is the kth entry that satisfies the predicates from the start entry and returns data from the kth entry pointed to by the cursor to the runtime component.

Abstract: Provided is a system, method, and program for performing a reverse scan of an index implemented as a tree of pages. Each leaf page includes one or more ordered index keys and previous and next pointers to the previous and next pages, respectively. The scan is searching for keys in the leaf pages that satisfy the search criteria. If a current index key is a first key on a current page, then a request is made for a conditional shared latch on a previous page prior to the current page. If the requested conditional shared latch is not granted, then the latch on the current page is released and a request is made for unconditional latches on the previous page and the current page. After receiving the latches on the previous and current pages, a determination is made of whether the current index key is on the current page if the current page was modified since the unconditional latch was requested. The current index key is located on the current page if the current index key is on the current page.

Abstract: Provided is a system, method, and program for performing a reverse scan of an index implemented as a tree of pages. Each leaf page includes one or more ordered index keys and previous and next pointers to the previous and next pages, respectively. The scan is searching for keys in the leaf pages that satisfy the search criteria. If a current index key is a first key on a current page, then a request is made for a conditional shared latch on a previous page prior to the current page. If the requested conditional shared latch is not granted, then the latch on the current page is released and a request is made for unconditional latches on the previous page and the current page. After receiving the latches on the previous and current pages, a determination is made of whether the current index key is on the current page if the current page was modified since the unconditional latch was requested. The current index key is located on the current page if the current index key is on the current page.