International Business Machines Corporation

Adam J Storm

Christian Marcelo Garcia-Arellano

Richard Sefton Sidle

Sam Sampson Lightstone

Vijayshankar Raman

Ronald Jason Barber

Chandrasekaran Mohan

Ian R Finlay

Bishwaranjan Bhattacharjee

Guy Maring Lohman

Ronen Grosman

Mohammad Sadoghi Hamedani

Calisto Paul Zuzarte

Xun Xue

Steven Robert Pearson

Daniele Costante Zilio

Walter Duke Alvey

Pinar Tozun

Mir Hamid Pirahesh

Matthew Albert Huras

Maheswaran Surendra

Yixin Diao

Matthew James Carroll

Gennady Yakub

Yuanyuan Tian

James John Seeger, Jr

James L Finnie

Roger L Q Zheng

Hamdi Roumani

Wojciech Kuczynski

Johnny Meng-Han Shieh

Susann Marie Keohane

Sriram Kolinjivadi Padmanabhan

Joseph L Hellerstein

Mustafa Canim

Timothy Ray Malkemus

Jens Leenstra

Gary Paul Noble

Yi Ding

Kenneth Andrew Ross

Ippokratis Pandis

Rene Mueller

Gary Valentin

Daniel Costante Zilio

Roger Luo Quan Zheng

Sarah Posner

Gustavo Arocena

Eduard Diner

David Arlen Elko

Bruce Gilbert Lindsay

Jeffrey M Keller

Jun Rao

John Frederick Hornibrook

Sujay Sunil Parekh

Sunil Sarin

Robin Grosman

Ivan Popivanov

Miroslaw Adam Flasza

Uttam Setty

James Liam Finnie

Michael Joshua Snowbell

Stewart L Palmer

James J Seeger

Chen Luo

Adriana Zubiri

Lan Pham

Matthew J Spilchen

David C Smith

Di Xiao

Sam B Lightstone

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

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

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

In updating a synopsis table of a database system, a database management unit performs a transaction to insert row(s) in a section of the base table and determines whether a synopsis entry for the section is stored in the memory. If stored in the memory, the in-memory synopsis entry is retrieved and metadata values in the in-memory synopsis entry are updated with data from the row(s) to be inserted. If not stored in the memory, the in-memory synopsis entry is generated and the metadata values in the in-memory synopsis entry are updated with data from the row(s). The insert transaction is then committed. Synopsis entry on-disk updates are thus avoided, significantly reducing the cost of updating the synopsis entries from the insert transaction. This yields enhanced performance especially for inserts of a small number of rows, while the benefits of synopsis entries are still available.

Updating of in-memory synopsis metadata for inserts in database table

One embodiment provides for monotonic transactions in a multi-master database with loosely coupled nodes including performing, by a processor, a read transaction protocol including: performing, by the processor, a read transaction protocol including issuing read transactions at any one of the nodes; attempting to return rows that are known to be replicated by at least a read quorum of the nodes; and for timing-out of the attempting to return rows known to be replicated by at least the read quorum of the nodes based on the special-node being non-responsive: selecting a new special-node from the nodes; and repeating attempting to return rows that are known to be replicated by at least the read quorum of the nodes.

Monotonic transactions in a multi-master database with loosely coupled nodes

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

According to one or more embodiments of the present invention, a computer-implemented method includes creating a hybrid index for a multi-zone data storage system in which a first zone has data that is organized for transaction processing, and a second zone that has data organized for analytic processing. Each index entry in the hybrid index includes an index key including an equality column, a begin-timestamp column, and a tuple-sequence-number column. The method further includes building an index run to be included in the hybrid index, the index run includes multiple index entries. An index run is created by selecting columns by scanning data blocks from the first zone, computing tuple-sequence-number values for the index entries to be included in the hybrid index, and sorting the index entries according to a predetermined order using the columns to be included in the index run.

Indexing for evolving large-scale datasets in multi-master hybrid transactional and analytical processing systems

Provided is a method and system for recommending an e-book. A processor may collect reader data related to a plurality of e-books from a plurality of user devices. The processor may determine an interest score for each section of a plurality of sections of each e-book. The processor may identify a set of sections from the plurality of sections that meet a predetermined interest score threshold. The processor may analyze the set of sections to determine a sentimental score for each section. The processor may generate a scoring matrix using the interest score and the sentimental score for each section of each e-book. The processor may compare scoring matrices of each e-book of the plurality of e-books. The processor may identify two or more e-books having similar scoring matrices. The processor may provide a recommendation to a user based on the identified two or more e-books.

Sentimental and emotional analysis of electronic documents

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

Optimizing database table scans in presence of SMDO records is provided. An SMDO record corresponding to a most recent span of rows for a column associated with a query predicate is read. It is determined whether a condition for excluding a span of rows is true for the SMDO record based on a type of the query predicate. In response to determining that a condition for excluding a span of rows is not true for the SMDO record, the most recent span of rows is added to a list of spans of rows to scan. It is determined whether a condition for excluding all preceding spans of rows is true for the SMDO record based on the type of the query predicate. In response to determining that a condition for excluding all preceding spans of rows is true for the SMDO record, reading the set of SMDO records is stopped.

Optimizing database table scans in the presence of ordered data

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

The present disclosure relates to techniques for helping targeted users determine whether it is safe to supply personal information requested by a web site. In one embodiment, a method generally includes extracting textual content from a web page that requests information from a user and determining, based on the textual content, the type of information requested. A service type the web page provides is also determined based on the textual content. The service type and the information type are then compared to a set of predefined rules to determine a risk level associated with the web page. A visual indicator of the risk level is then displayed with the web page.

Security-risk plugin to help targeted users interact with web pages and applications

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

Growing community of inventors

Toronto, Canada

Adam J Storm