International Business Machines Corporation

New Relic, Inc.

Yuke Zhuge

Jason Christopher Young

Roger L Q Zheng

Effi Ofer

Bruce M Jackson

Mark Dennehy

Marzia Mura

Kirill Bogdanov

Diarmuid Flynn

Steven Robert Pearson

Vincent Kulandaisamy

Dale Murray McInnis

Jon A Lind

Steve Raspudic

A dynamic hash partition management scheme includes associating first partitions of a database with a first partition number, and second partitions of the database with a second partition number, associating first partitions of a database with a first partition number defining a total number of first partitions, and second partitions of the database with a second partition number defining a total number of second partitions. The method further includes, after receiving a request to insert a record in the database, determining an active partition number, and determining the first partition number as an active partition number. The method further includes determining a record key for the record, generating a partition identifier defining a partition of the first partitions using the record key and the active partition number, and inserting the record in the partition defined by the partition identifier.

Dynamic hash partitioning for large-scale database management systems

Data integrity is maintained during failed communications between a member node of a primary cluster and a backup cluster by assigning an assisting member node to run an assisting process that transmits data entered into the member node to the backup cluster. In this way, a replicated database is maintained during a partial communication failure between the primary cluster and the backup cluster.

Handling failed cluster members when replicating a database between clusters

Techniques are disclosed for sorting an input data set. A sort tool determines a distribution of values of a data set that includes a plurality of data records. The sort tool partitions the data set into a plurality of subsets based on the distribution. Each of the data records is inserted into one of the subsets based on a corresponding sort value of the data record. The sort tool identifies one or more of the subsets that contain at least two distinct sort values. In each of the identified subsets, the data records are sorted by a corresponding sort value of the data record.

Efficient sorting of large data set with duplicate values

A method, system, and computer program product for reducing likelihood of data loss during performance of failovers in a high-availability system comprising a primary system and a standby system are provided. The method, system, and computer program product provide for defining a halt duration, periodically determining a halt end time, halting data modifications at the primary system responsive to failure of data replication to the standby system, resuming data modifications at the primary system responsive to a last determined halt end time being reached or data replication to the standby system resuming, and responsive to the primary system failing prior to a previously determined halt end time, determining that a failover to the standby system will not result in data loss on the standby system with respect to the primary system.

Reducing likelihood of data loss during failovers in high-availability systems

Growing community of inventors

Portland, OR, United States of America

Yuke Zhuge