International Business Machines Corporation

Huawei Technologies Co., Limited

Ibm Canada Limited - Ibm Canada Limitee

Xun Xue

Matthew Albert Huras

Adam J Storm

Hebert Walter Pereyra

Vijayshankar Raman

Guy Maring Lohman

Ronald Jason Barber

Richard Sefton Sidle

Bishwaranjan Bhattacharjee

Chandrasekaran Mohan

Mohammad Sadoghi Hamedani

Aamer U Sachedina

Keriley Kay Romanufa

Roger L Q Zheng

James Liam Finnie

Jon A Lind

Garret Frederick Swart

David C Kalmuk

Ronen Grosman

Stewart L Palmer

Gopi K Attaluri

Steven Robert Pearson

Kevin James Cherkauer

Robin Grosman

Jeffrey James Goss

Piotr M Plachta

Jack Hon Wai Ng

Kaarel Truuvert

Bret Ronald Olszewski

Yuk Kuen Chan

Wenbin Ma

Roger L Zheng

Matthew A Huras

Sam Sampson Lightstone

Chong Chen

Paul Miller Bird

Timothy Ray Malkemus

Christian Marcelo Garcia-Arellano

Scott David Lashley

Timothy Jon Vincent

Gary Valentin

Nattavut Sutyanyong

Per-Ake Larson

Effi Ofer

Huaxin Zhang

Sean W McKeough

Andrew David Buckler

Matthew James Carroll

Herbert Walter Pereyra

Wojciech Kuczynski

Tim J Vincent

Peter K L Shum

Roger Lq Zheng

Kelly W Schlamb

Nickolay V Tchervenski

Anthony Anthony

Junhan Hu

Paul M Bird

Timothy J Vincent

Hebert W Pereyra

The disclosed systems and methods for intelligent heterogeneous computation directed to receiving monitoring data and a set of training data, wherein the monitoring data includes an occupancy rate of a preprocessed data queue and a utilization factor of accelerating devices, generating a resource computation job list in accordance with the monitoring data, forwarding jobs, in the resource computation job list to be executed on a central processing unit (CPU), to a CPU worker queue, forwarding control messages to the CPU worker queue, wherein the control messages are associated with jobs in the resource computation job list to be executed on the accelerating devices, and executing, by the accelerating devices, jobs in the resource computation job list to be executed on the accelerating devices.

System, method, and apparatus for selecting a CPU or an accelerator to preprocess data based on monitored information

A method includes storing an anchor row vector identification for an anchor row to a local memory. It is determined whether the anchor row vector identification is visible based on isolation requirements. The anchor row vector identification is accessed upon a determination that the anchor row vector identification is visible, and the row vector identification is re-read from the local memory. It is determined whether the anchor row vector identification has not changed since a start of the accessing. Upon a determination that the anchor row vector identification has not changed, read anchor row fields are returned. A first check history is performed on an anchor row history tuple sequence number (TSN) for the anchor row.

In-place updates with concurrent reads in a decomposed state

Methods and systems are described for managing a shared database. One or more processing nodes may access a shared database. A common log node may manage the shared database. The common log node may validate database operations requested by the one or more processing nodes. During validation, the common log node may detect conflicts that occur between database operations requested by the one or more processing nodes.

Systems and methods for managing a shared database

This application provides a data processing method and apparatus. The method includes: receiving, by a master storage node, information that is about a first transaction and that is sent by a read-write node, where the information about the first transaction is used to request to perform a write operation on first data stored on the master storage node; determining, by the master storage node, the first data based on the information about the first transaction, and executing the first transaction; generating, by the master storage node, first transaction status metadata when the first transaction ends, where the first transaction status metadata includes identification information of expired data and identification information of the first transaction; and sending, by the master storage node, the first transaction status metadata to at least one read-only node. According to the data processing method and apparatus, a read delay of a read-only node can be eliminated.

Data processing method and apparatus

The disclosed computing node comprises a processor and a non-transitory storage medium storing instructions executable by the processor. A method and a system are also disclosed. A subset of a plurality of conventional redo records, corresponding to received write requests, is selected based on an identical data location identifier. The conventional redo records of such selected subset are combined into a consolidated redo record. The consolidated redo record is then transmitted to a target node for processing.

System, computing node and method for processing write requests

Techniques for data replication from a primary system to a standby system. A first buffer portion of a transaction log buffer is allocated to a first transaction at a primary system. Upon determining that the first buffer portion is fully formed, before the log data is written to the storage on the primary system, and before the transaction log buffer is entirely full, the log data in the first buffer portion is transmitted to the standby system, from the primary system. Upon writing the log data to the storage on the primary system and after the log data in the first buffer portion is transmitted to the standby system, a notification is transmitted to the standby system, from the primary system, where the standby system is configured to process the received log data responsive to receiving the notification from the primary system.

Log-shipping data replication with early log record fetching

A method includes setting, by an update processor, a write latch in a first data structure associated with an object. The first data structure is copied to a storage structure. A history tuple sequence number (TSN) of the first data structure is set to point to a TSN of the copied first data structure. The version identifier is set to point to a transaction identification for the object. Data portions are updated for the first data structure. The version identifier is read from the first data structure. It is determined whether the version identifier of the first data structure is visible for a transaction including isolation requirements. If version identifier of the first data structure is visible, the first data structure is accessed and it is determined whether the version identifier of the first data structure changed since starting the transaction.

A first request may be received to update a first set of values. The first set of values may be stored at a first location within a first data page of a database. The first location may be read-only. In response to the receiving of the first request, a first set of records may be inserted into a second data page. The first set of records may include the update of the first set of values. In response to the inserting, a forward pointer may be stored in the first data page that points to the first set of records on the second data page. One or more committed values may be identified on the second data page. In response to the identifying, the one or more committed values may be merged from the second data page to a third data page.

Reducing the cost of update, delete, and append-only insert operations in a database

In a shared data system comprising one or more primary nodes and a plurality of secondary nodes, global lock manager on a primary node manages locks for shared resources by exchanging an abstract lock state with local lock managers on the secondary nodes. The abstract lock state includes a particular representation of all of the applications on the nodes that are requesting or are granted locks. The exchange of these particular lock states instead of individual requests improves performance by increasing concurrency and reducing off-machine communication. A global deadlock detector on a node detects and resolves global deadlocks, in conjunction with local deadlock detectors on the secondary nodes.

Two-level management of locks on shared resources

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.

Technology for applying locks to memory pages. More specifically, a sticky lock is chosen by matching observed usage patterns with predetermined patterns associated with various sticky locks and/or types of stick locks increase database performance by reducing required communications and information transfers.

Increase database performance by reducing required communications and information transfers

According to embodiments of the present invention, one or more computer processors determine that a predetermined workload threshold associated with an invalidated object is not exceeded and transmits an invalidation command associated with the invalidated object to the owner of the invalidated object. The one or more computer processors instruct the modifier of the invalidated object to retain possession of a first lock on the object beyond the transaction. The one or more computer processors determine that a usage pattern associated with the invalidated object matches a predetermined usage pattern for selecting a lock that can be retained beyond an associated transaction and transmits a second lock a requestor. The one or more computer processors instruct the modifier to release possession of the first lock to the owner and transmit a first image of the current version of the invalidated object to the owner for subsequent transmission to the requestor.

Growing community of inventors

Markham, Canada

Xun Xue