International Business Machines Corporation

Amazon Technologies, Inc.

John Benjamin Tobler

Nigel G Slinger

Arthur Marais

Daniel Kozin

Christopher J Munson

Wen Jie Zhu

Meichi M Lin

Wen J Zhu

Anurag Windlass Gupta

John Joseph Campbell

Andrew Edward Caldwell

Terence Patrick Purcell

Thomas Abel Beavin

Andrea Olgiati

Bhaven Avalani

Maryela Evelin Weihrauch

Michail Petropoulos

Stavros Harizopoulos

Matthias Tschaffler

Michael Reichert

Vikram Singh Bisht

Carlos Garcia-Alvarado

Andreas Limmer

Zhuzeng Lu

Terence Kelly

Ramakrishna Kotla

James Thomas Kiraly

Yousuf Hussain Syed Mohammad

Partha V Kanuparthy

Joydeep Sinha

Kaituo Li

David R Moy

Stephan Arenswald

Jerome P Kenyon

Maggie M Lin

Timothy E McAllister

A determination is made as to whether a workload associated with a collection of data items satisfies a first condition. If the first condition is satisfied, a determination is made as to whether a metric of dirty records to which delete operations have been directed within a portion of a data item satisfies a second condition. If the second condition is also satisfied, a cleanup operation may be initiated so that data blocks storing the portion of the data item do not include the deleted record.

Background incremental deletion cleanup techniques at storage services

Granular performance analysis may be performed for database queries. Database query performance may be monitored. For some database queries, performance of portions of the database query may be measure. The measure performance of the portions may be compared with performance goals that correspond to the portions of the database query. Portions that do not meet or exceed the corresponding performance goals may be identified so that an indication of the identified portions may be provided.

Granular performance analysis for database queries

A tree-based format may be implemented for data stored in a data store. A table may be maintained across one or multiple storage nodes in storage slabs. Storage slabs may be mapped to different nodes of a tree. Each node of the tree may be assigned a different range of distribution scheme values which identify what portions of the table are stored in the storage slab. Storage slabs mapped to child nodes in the tree may be assigned portions of the range of distribution scheme values assigned to a parent. Storage nodes may be added or removed for storing the table. Storage slabs may be moved from one storage node to another in order to accommodate the addition or removal of storage nodes.

Tree-based format for data storage

According to one embodiment of the present invention, a system for processing a database query stores one or more result sets for one or more first database queries in a data store. The system receives a second database query and compares the second database query to the one or more first database queries to determine presence of a corresponding result set in the data store for the second database query. The system provides the corresponding result set from the data store for the second database query based on the comparison. Embodiments of the present invention further include a method and computer program product for processing a database query in substantially the same manners described above.

Dynamic result set caching with a database accelerator

In an embodiment, a method of resource pre-configuration includes obtaining, at a target system, configuration information about a resource that is predicted to be used by a transaction which will be executed on the target system. The resource is configured, at the target system, based on the configuration information. The configuring is before the transaction requests use of the resource.

Resource pre-configuration

According to one embodiment of the present invention, a system compares database transactions to corresponding performance information to identify conforming database transactions with an acceptable deviation from the performance information and outlier database transactions beyond the acceptable deviation from the performance information. The system aggregates information from a threshold quantity of conforming database transactions into an aggregated record, wherein the threshold quantity is dynamically adjusted, and generates a record for each outlier database transaction, wherein conditions for identifying the outlier database transactions are dynamically adjusted. Embodiments of the present invention further include a method and computer program product for managing database transactions in substantially the same manners described above.

Managing transactional data for high use databases

Management is provided for threads of a database system that is subject to a plurality of disparate bottleneck conditions for resources. A monitor thread retrieves, from a first thread, first monitor data for first bottleneck condition of a first type. The monitor thread compares the first monitor data to a trigger level for the first bottleneck condition and then determines, in response to the comparison of the first monitor data to the trigger level, a potential source of the first bottleneck condition. A potential blocker thread is identified based upon the potential source of the first bottleneck condition. The monitor thread retrieves, from the potential blocker thread, second monitor data for a second type of bottleneck condition that is different from the first type of bottleneck condition. Based upon monitor data, a blocking thread is identified, and a particular blocking solution is applied to the blocking thread.

Management of bottlenecks in database systems

According to one embodiment of the present invention, a system inserts data into a database object. The system associates the database object with a parameter specifying materialization of data for the database object. The system inserts data into the database object and materializes the data in accordance with the parameter to provide access to the data from the database object, wherein the parameter specifies a portion of the data to be materialized upon insertion. Embodiments of the present invention further include a method and computer program product for inserting data into a database object in substantially the same manners described above.

Database insert with deferred materialization

According to one embodiment of the present invention, a system includes a processor to copy an object of a database system. The system determines one or more portions of the object that are active and reside within a buffer pool of the database system, and copies the determined portions of the object from the buffer pool. Remaining portions of the object that are non-active are copied from database storage. A copy of the object is created from the copied object portions. Embodiments of the present invention further include a method and program product for copying an object of a database system in substantially the same manner described above.

Producing an image copy of a database object based on information within database buffer pools

Growing community of inventors

San Jose, CA, United States of America

John Benjamin Tobler