Abstract: A weak record locking scheme that, while enforcing serialization of record updates, permits a read to extract data from uncommitted updates. Specifically, records are locked in association with a process or thread performing a lock. When the records affected by a transaction are initially locked for reading or updating, they are locked at the process level. When a particular record is to be read or updated as part of a transaction, it is locked at the thread level. A read transaction that will accept uncommitted changes uses a weak lock to lock the record for reading. A weak lock may be made on a record so long as the record is not already locked for updating at the thread level. While a record is weakly locked for reading, it cannot be locked for updating at the thread level. A record may thus be weakly locked even though the record is locked for updating at the process level by the same process. Weak locking thus preserves serialization of updates, while reducing delays caused by locking conflicts.

Abstract: A weak record locking scheme that, while enforcing serialization of record updates, permits a read to extract data from uncommitted updates. Specifically, records are locked in association with a process or thread performing a lock. When the records affected by a transaction are initially locked for reading or updating, they are locked at the process level. When a particular record is to be read or updated as part of a transaction, it is locked at the thread level. A read transaction that will accept uncommitted changes uses a weak lock to lock the record for reading. A weak lock may be made on a record so long as the record is not already locked for updating at the thread level. While a record is weakly locked for reading, it cannot be locked for updating at the thread level. A record may thus be weakly locked even though the record is locked for updating at the process level by the same process. Weak locking thus preserves serialization of updates, while reducing delays caused by locking conflicts.

Abstract: A method, memory system, and computer program product are provided for implementing lock based delayed space recycle control. The memory space recycle method is used with a memory in a computer system. A data element lock is obtained for a data record in a data block. Then an update on the data record is performed. A waiting to be recycled index for the data block is maintained. The waiting to be recycled index includes a record number, an address of the large object block (LOB) and the length of the LOB space. When the last lock on a data element is about to be released the waiting to be recycled areas associated with that data element are freed.

Abstract: A method and computer program product are provided for implementing highly concurrent record insertion in an ordinal number dependent database. Serialized processing is provided with one concurrent task of multiple concurrent tasks allowed to execute, for allocation of ordinal numbers for record insertion. Concurrent validation processing operations of multiple concurrent tasks are enabled for record insertion in the ordinal number dependent database. A set of counter variables are maintained with the database to enable removal of serialization from the validation phase processing operations for record insertion in the ordinal number dependent database.