International Business Machines Corporation

Helen Maria Witter

Neal E Bohling

Roity Prieto Perez

Colin R Penfold

Kam H Ho

Martin W J Cocks

Clifford Peter Chan

Patricia Hatami Mejia

Dai C Middleton

Lawrence Loong-Tak Law

Aspects of the present disclosure relate to managing concurrent updates on data. A transactional update on at least one record within a data set is detected. A log is generated for the transactional update, the log including an image of the at least one record within the data set before the transactional update. A batch update is detected. A determination is made whether the batch update collides with the transactional update by referencing the log. In response to determining that the batch update collides with the transactional update, a collision policy is referenced. A collision action indicated in the collision policy is then issued.

Concurrent update management

A method, apparatus and computer program product for performing database maintenance is described. Index information for data stored in a tree based file system running in a computer is received. The file system includes a set of data blocks arranged in logical layers and a set of pointers within the set of data blocks which reference respective data blocks in different logical layers. The received index information is parsed. A model of the file system is built based on the parsed index information. A graphical user interface having an index panel is presented. In the index panel, ones of a plurality of icons respectively represent ones of the set of data blocks and are arranged in layers representing the logical layers.

Data set visualizer for tree based file systems

A transaction processing system is operated. A first resource is locked as a shared resource by a first task executing on a computing device. The first task attempts to lock a second resource as an exclusive resource. The occurrence of a deadlock is ascertained. A second task that wishes to use the locked first resource is identified. A current position of the first task with respect to the first resource is stored. The lock on the first resource is removed. The second task is prompted to use the first resource. The first task locks the first resource as the shared resource. The first task is repositioned with respect to first resource according to the stored position. The first task locks the second resource as the exclusive resource. The first task is performed.

Deadlock avoidance

Growing community of inventors

Morgan Hill, CA, United States of America

Helen Maria Witter