International Business Machines Corporation

Christian Marcelo Garcia-Arellano

Adam J Storm

Ian R Finlay

Sam Sampson Lightstone

Calisto Paul Zuzarte

Ronen Grosman

Ronald Jason Barber

Vijayshankar Raman

Hamdi Roumani

Richard Sefton Sidle

Matthew Albert Huras

Pinar Tozun

Matthew James Carroll

Gennady Yakub

Maheswaran Surendra

Yixin Diao

Wojciech Kuczynski

Guy Maring Lohman

Mir Hamid Pirahesh

David C Kalmuk

Yuanyuan Tian

Daniele Costante Zilio

Rene Mueller

Roger Luo Quan Zheng

Sarah Posner

Gustavo Arocena

Alexander Cheung

Chandrasekaran Mohan

Bruce Gilbert Lindsay

Joseph L Hellerstein

David Alan Hepkin

Xun Xue

Aamer U Sachedina

Sujay Sunil Parekh

Matthias Seul

Gary Valentin

Daniel Costante Zilio

James Liam Finnie

Scott Douglas Walkty

Michael Joshua Snowbell

Andrew David Buckler

Patrick R Perez

Adriana Zubiri

Lan Pham

Robert C Hooper

Daniel Silveira

Zvonimir Fras

Mehran Khan

Ketan Rampurkar

A computer-implemented method for digital fingerprint obfuscation is disclosed. The computer-implemented method includes training a machine learning model to classify web traffic data into one or more personas. The computer-implemented method further includes identifying, using the trained machine learning model, a particular persona of a user based, at least in part, on a user's real traffic data generated during a current user session. The computer-implemented method further includes generating synthetic traffic data based, at least in part, on the identified particular persona of the user.

Method to randomize online activity

Examples described herein provide a computer-implemented method for storing data pages of a database in a remote storage. The method includes receiving a write request associated with one or more data pages of the database. The method further includes storing, in a first storage layer having a write ahead log, the write request associated with the one or more data pages. The method further includes storing, in a first write buffer, the received write request associated with the one or more data pages that each include a legacy data page identifier. The method further includes storing, in a second storage layer having a second write buffer, a sorted string table (SST) of the received write request. The method further includes storing, in a top level of a log structured merge (LSM) tree disposed in the remote storage, the SST from the second write buffer.

Storing data pages of a database in a cloud object storage

Described are techniques for creating a point-in-time backup of application data stored on disparate storage systems. The techniques include initiating a snapshot of the first datastore. The techniques further include initiating a suspension of delete operations at the second datastore to preserve immutable application data stored on the second datastore. The techniques further include initiating a background copy of the second datastore. The techniques further include initiating a resumption of the delete operations at the second datastore in response to completion of the background copy of the second datastore.

Point-in-time backup of application data stored on disparate storage systems

An approach is provided in which the approach receives a query request to execute a query. The approach provides multiple query execution options based on multiple hardware configurations. The multiple query execution options include multiple execution times and multiple execution costs. The approach receives a selection that selects at least one of the query execution options and, in turn, executes the query on at least one of the hardware configurations based on the received selection.

Providing multi-tier query execution options in a serverless query environment

One embodiment provides for a method to track replication state and providing quorum visible retrievals. The method includes assigning, by a writer node performing write operations, a sequence number. The sequence number is replicated with a write operation to other replica nodes in an asynchronous fashion thru a first network channel. On a second network channel, a state of a local system is communicated by sending a latest sequence number available that has been hardened to the other replica nodes. A query is obtained by a reader node, and a sequence number limit is selected. Results up to the sequence number limit are returned.

Tracking data availability using heartbeats

One embodiment provides for a method including performing, by a processing thread, a process that analyzes transactional operations by maintaining the transactional operations in transaction local side logs, and waiting until a successful transaction commit to append the transaction local side logs to a log stream. The processing thread processes the transactional operations on a key used to determine whether existing data is found for the key. The transactional operations are sped up through parallelism based on partitioning tables across nodes handling the transactional operations. A first process is performed by a first processor that processes updates for values of a key based on updating a first start time table index using unique keys and a start time field of a row for a first appearance of each unique key from the transactional operations.

Resolving versions in an append-only large-scale data store in distributed data management systems

The method includes identifying at least one of a minimum value, a maximum value, and a Bloom filter value for a row of data in a metadata table, wherein the metadata table contains metadata corresponding to a row of data in a main table. The method includes adjusting at least one of an identified first minimum value to a second minimum value, an identified first maximum value to a second maximum value, and an identified first Bloom filter value to a second Bloom filter value.

Optimization of metadata via lossy compression

Reducing data access resources by creating a scoring mechanism for computing a running score for data objects in a database having an associated score value in order to determine whether or not a set of data object(s) should remain in a caching gateway or whether or not the set of data object(s) should be removed from the caching gateway.

Reducing data access resources in a serverless computing environment using caching

One embodiment provides for a method for grooming transactional operations in a multi-master distributed data management system including maintaining transactional operations in at least one transaction-local side-log. A table log scan is performed for a table including recording identification for each record in a log. Tuple sequence numbers are generated for the records and the records are written on groomed transaction blocks to the table.

Transactional operations in multi-master distributed data management systems

One embodiment provides for a method including processing transactional operations on a key used to determine whether existing data is found for that key. A first time index is updated using unique keys and a start time field of a first appearance of each key from the transactional operations. A deferred update of prior versions of the key is performed for non-recent data upon determining that recent data in the transactional operations is found for the key.

A method, computer system, and a computer program product for resource scaling is provided. The present invention may include receiving a request for resources. The present invention may include receiving a request for a plurality of resources from a virtual device. The present invention may then include estimating a resource allocation based on a predetermined level of service based on the received request. The present invention may also include estimating a benefit curve of a workload for a plurality of tiers of resources based on the estimated resource allocation. The present invention may further include estimating a performance cost of the workload for the plurality of tiers of resources based on the estimated benefit curve.

Database resource scaling

Merging adjacent rows of a synopsis table so as to increase the effectiveness of the synopsis table regarding data skipping. Adjacent rows for merging are identified based on statistics regarding: (i) queries of the database; (ii) effectiveness of the synopsis table for data skipping; and (iii) usage of predicates in queries of the database. Once merged, the synopsis table is smaller, and more effective with respect to data skipping, while fewer computing resources (administrative, maintenance, memory, clock cycles, storage space, etc.) are needed to process the database queries.

Automatically revising synopsis table structure

Embodiments of the present invention provide systems and methods for data management. Synopsis tables have been found to be more effective for maintaining a high level of system performance while answering analytical queries. Synopsis tables, which contain MAX, MIN, and Bloom filter columns, may be modified by dropping ineffective data content within these columns and regenerating dropped data when beneficial. By automatically modifying data, database queries may be optimized.

Pruning of columns in synopsis tables

A current minimum memory requirement for each memory consumer of one or more memory consumers of a primary database system is received. A current memory allocation for a standby database system is received. A set of benefit-to-cost metrics is received. A benefit-to-cost metric is a measure of whether each memory consumer would benefit or would not benefit from additional memory. The set of benefit-to-cost metrics is applied to the standby database system to define an upper bound memory allocation of the standby database system to function in the event of a failover from the primary database system. A scaling factor is determined. In response to receiving an indication of a failover of the primary database system to the standby database system, a ramp up of the standby database system is monitored. The ramp up of the standby database system uses the set of benefit-to-cost metrics and the determined scaling factor.

Optimizing standby database memory for post failover operation

Growing community of inventors

Richmond Hill, Canada

Christian Marcelo Garcia-Arellano