International Business Machines Corporation

Brian Robert Muras

Roger Alan Mittelstadt

Rafal Przemyslaw Konik

Mark William Theuer

Paul Reuben Day

Bin Cao

Chad Allen Olstad

Jessica R Eidem

Jingdong Sun

John Matthew Santosuosso

Daniel Leonard Hiebert

Eric L Barsness

Shawn Joseph Baranczyk

Anne Marie Ryg

Tanveer Zubair

Michael Steven Faunce

Daniel Beuch

Shantan Kethireddy

Randy Lynn Egan

Robert J Bestgen

Robert Russell Nelson

Cary Lee Bates

Alexander Cook

Robert Victor Downer

Thuy Phuong Christenson

Lynnette Elaine Carston

Christopher J Schaefer

James E Carey

Michael J Branson

Richard D Dettinger

Jim C Chen

Timothy P Winkler

David L Johnson

Andrew Peter Passe

Eric G Thiemann

Henry E Calzaretta

Daniel Joseph Strauss

James L Denton

Jeffrey Wayne Tenner

Frederick Allyn Kulack

Mark Gregory Megerian

Michael T Kalmbach

Kevin James Wendzel

Mark John Anderson

Robert Douglas Driesch, Jr

Travis Michael Drucker

Thomas Owen McKinley

Paul S Nelsestuen

Craig Stephen Aldrich

Thomas James Schreiber

Nathan Glenn Faiman

Jared W Patterson

John Francis Edwards

Mark Steven Smith

Michael S France

Lee William Jameson

Each of one or more commit cycles may be associated with a predicted number of updates. A statistics collection time for a database table can be determined by estimating a sum of predicted updates included in one or more commit cycles. Whether the estimated sum of predicted updates is greater than a first threshold may be determined. In addition, a progress point for a first one of the commit cycles can be determined. A time to collect statistics may be selected based on the progress point of the first commit cycle.

Dynamically adjusting statistics collection time in a database management system

Disclosed aspects relate to query plan management associated with a shared pool of configurable computing resources. A query, which relates to a set of data located on the shared pool of configurable computing resources, is detected. A virtual machine includes the set of data. With respect to the virtual machine, a set of burden values of performing a set of asset actions is determined. Based on the set of burden values, a query plan to access the set of data is established. Using at least one asset action of the set of asset actions, the query plan is processed.

Query plan management associated with a shared pool of configurable computing resources

A structured query language (SQL) query is configured to present a selected portion of a result set to a user interface. The selected portion of the result set can be based on an offset criteria appended to the SQL query. The offset criteria determines a location of a first presented instance of the selected portion of the result set. The offset criteria is configured to determine the location of the first presented instance of the selected portion of the result set independent of a number of instances appearing between a first instance of the result set and the first presented instance of the selected portion of the result set.

Result set output criteria

A computer-implemented method of establishing influence relationships between data in a question-answering environment is disclosed. Establishing influence relationships can include determining a set of conditions indicating a set of user statuses and analyzing, using a first natural language processing technique, a corpus of data including a set of user data. Establishing influence relationships between data can include identifying, based on analyzing the corpus of data, a set of influence factors corresponding to a subset of the set of user data and to a subset of the set of conditions. In embodiments, establishing influence relationships can include establishing, based on the set of influence factors, a set of influence relationships between the subset of the set of user data and the subset of the set of conditions.

Data relationships in a question-answering environment

A blockchain configuration may require constant and large amounts of resources to maintain a growing structure. One example method of operation may include receiving blockchain transactions and creating a blockchain block, identifying miner devices to process the blockchain block, identifying expenses associated with each of the miner devices, selecting an optimal cost miner device among the miner devices based on the identified expenses associated with each of the miner devices, and assigning the optimal cost miner device to solve the blockchain block.

Blockchain expense and resource utilization optimization

A method, system, and computer program product to manage a database is disclosed. The method, system, and computer program product may include structuring the database to have a first table having an index and a second table. A first key of the first table may be related to a second key of the second table. The method, system, and computer program product may include creating an entry locator in the index. The method, system, and computer program product may include maintaining an association between the second key of the second table and the entry locator of the index.

Management of a database system

Disclosed aspects include the database management system detecting that a first data storage medium includes a first set of data of a database. The first data storage medium has a first access-factor. The database management system detects that a second data storage medium includes a second set of data of the database. The second data storage medium has a second access-factor which differs from the first access-factor. Based on a data storage relationship, the database management system determines a query plan to access both the first set of data with respect to the first data storage medium and the second set of data with respect to the second data storage medium. The database management system establishes the query plan.

Query plan based on a data storage relationship

Systems and methods for providing automatic fork protection including determining that a transaction having fork protection was included in a first block that was appended to a blockchain, that a hash of the first block was validated, that a consensus decision was made by validator nodes approving the first block for addition to the blockchain, that a second block was appended to the blockchain after the first block, that the second block comprises a hash that is not based on the first block, that the first block was on a first fork and the second block was on a second fork, that the blockchain was resolved in favor of the second fork, and that the transaction failed as a result of the blockchain being resolved in favor of the second fork. The method including compensating a party that submitted the failed transaction based on the fork protection.

Blockchain: automatic fork protection

Embodiments of the preset disclosure include a method, a system, and a computer program product for rearranging a set of filters within a data streams environment. The method includes setting a first filter ordering of two or more filter processing elements. The method includes determining a filtering efficiency of the first filter ordering. The determining of the filtering efficiency includes monitoring a runtime, one or more tuples, and an amount of tuples retained after filtering of the first filter ordering. The method includes creating a second filter ordering of the two or more filter processing elements. The method includes comparing the filtering efficiency of the second filter ordering to the first filter ordering. The method includes selecting the second filter ordering in response to comparing the filtering efficiency of the second filter ordering to the filtering efficiency of the first filter ordering.

Filter optimizer for data streams

A query is received. Based on statistics for a database, a first query access plan is generated for executing the query on the database. A first result set for the query is obtained by implementing the first query access plan on the database. Based on at least one trend in the statistics, a target time after which implementing the first query access plan will fail a set of criteria is forecasted. In response to the forecasting and based on the statistics, a replacement query access plan is generated prior to the target time. After the target time, a second result set for the query is obtained by implementing the replacement query access plan rather than the first query access plan.

Forecasting query access plan obsolescence

Disclosed aspects relate to managing a stream computing environment. The stream computing environment may have a consistent region that includes a set of stream operators for processing a stream of tuples. An operator modification request with respect to the set of stream operators of the consistent region of the stream computing environment may be received. In response to receiving the operator modification request, a set of tuples of the stream of tuples may be detected in the consistent region. Using the operator modification request, a tuple adjustment action for the set of tuples of the stream of tuples in the consistent region may be determined. Based on the operator modification request, the set of stream operators may be modified. The set of tuples may be processed using the tuple adjustment action.

Managing a modification to a consistent region of a stream computing environment

A computer-implemented method for determining a query execution plan based on transaction state may include determining that a first set of database values in a database table are in a committed transaction state and that a second set of database values in the database table are in an uncommitted transaction state. In response to the determining, the first set of database values may have a first set of statistics generated and the second set of database values may have a second set of statistics generated. The first and second set of statistics may be for use in determining a query execution plan.

Database statistics based on transaction state

Growing community of inventors

Rochester, MN, United States of America

Brian Robert Muras