Patents by Inventor Roger A. Mittelstadt

Roger A. Mittelstadt has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 9996565
    Abstract: A method, a system, and a computer program product for managing a database are disclosed. Managing the database includes managing an index of a table of the database. Managing the index includes determining the table includes a first field having a first input value configured to identify a first dynamic data function utilized to determine a first output value for the first field. In embodiments, managing the index includes determining the first dynamic data function is deterministic, determining the first output value for the first field using the first dynamic data function, and storing the first output value for the first field. In embodiments, managing the index includes determining the first dynamic data function is nondeterministic, determining a first special value to represent the first output value for the first field, and storing the first special value for the first field.
    Type: Grant
    Filed: July 14, 2016
    Date of Patent: June 12, 2018
    Assignee: International Business Machines Corporation
    Inventors: Rafal P. Konik, Roger A. Mittelstadt, Brian R. Muras, Mark W. Theuer
  • Patent number: 9990396
    Abstract: 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.
    Type: Grant
    Filed: February 3, 2015
    Date of Patent: June 5, 2018
    Assignee: International Business Machines Corporation
    Inventors: Shawn J. Baranczyk, Rafal P. Konik, Roger A. Mittelstadt, Brian R. Muras
  • Patent number: 9984121
    Abstract: 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.
    Type: Grant
    Filed: October 31, 2017
    Date of Patent: May 29, 2018
    Assignee: International Business Machines Corporation
    Inventors: Rafal P. Konik, Roger A. Mittelstadt, Brian R. Muras, Chad A. Olstad
  • Patent number: 9984120
    Abstract: 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.
    Type: Grant
    Filed: October 31, 2017
    Date of Patent: May 29, 2018
    Assignee: International Business Machines Corporation
    Inventors: Rafal P. Konik, Roger A. Mittelstadt, Brian R. Muras, Chad A. Olstad
  • Publication number: 20180129705
    Abstract: System, method, and computer program product to perform an operation comprising determining that a sort sequence of a query specifying to access data in a first column of a shared weight object based on a first selection predicate applied to the first column does not match a sort sequence of the shared weight object, adding a second selection predicate to the query based on the sort sequence of the first selection predicate and the shared weight sort sequence of the first column of the shared weight object, and executing the query by using the second selection predicate as a key selection against the first column in the shared weight object to return a result set, wherein the result set does not include a shared weight data value of a first row of the first column that would have been returned using the shared weight object to process the query.
    Type: Application
    Filed: November 13, 2017
    Publication date: May 10, 2018
    Inventors: Roger A. MITTELSTADT, Brian R. MURAS
  • Publication number: 20180121471
    Abstract: A computer-implemented method for improving database management includes selecting one or more database records that are requested based on a query statement. The one or more database records may are read from a first database file. The one or more database records are copied from the first database file and stored to a memory. The one or more database records are deleted from the first database file at substantially the same time as the reading the one or more database records. The reading and the deleting occur through a single read and delete input/output (I/O) operation.
    Type: Application
    Filed: December 28, 2017
    Publication date: May 3, 2018
    Inventors: Rafal P. Konik, Roger A. Mittelstadt, Brian R. Muras, Mark W. Theuer
  • Publication number: 20180114218
    Abstract: 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.
    Type: Application
    Filed: October 26, 2016
    Publication date: April 26, 2018
    Inventors: Rafal P. Konik, Roger A. Mittelstadt, Brian R. Muras, Chad A. Olstad
  • Publication number: 20180113921
    Abstract: Systems, methods, and computer program products to perform an operation comprising receiving, by a database management system (DBMS) from an application, a request specifying to generate a global temporary table (GTT) of a first format, identifying a first GTT, of a plurality of GTTs stored by the DBMS, that has a second format, different than the first format, modifying the first GTT such that at least a portion of the modified first GTT is of the first format, and providing the modified first GTT to the application.
    Type: Application
    Filed: October 20, 2016
    Publication date: April 26, 2018
    Inventors: Shawn J. BARANCZYK, Rafal P. KONIK, Roger A. MITTELSTADT, Brian R. MURAS
  • Publication number: 20180107712
    Abstract: Techniques are described for managing exceptions occurring during query execution. Embodiments receive, from a requesting entity, a query for execution against a database. A first query plan for executing the query is generated, where the query plan comprises a first ordered sequence of operations to be performed in executing the query against the database. Embodiments determine a likelihood that the first query plan, if executed, will result in one or more exceptions being thrown and dynamically modify the first query plan based on the determined likelihood. The modified first query plan is executed against the database to produce a set of query results and the set of query results is returned to the requesting entity.
    Type: Application
    Filed: October 13, 2016
    Publication date: April 19, 2018
    Inventors: Craig S. ALDRICH, Rafal P. KONIK, Roger A. MITTELSTADT, Brian R. MURAS, Jane A. VOLD
  • Publication number: 20180107958
    Abstract: 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.
    Type: Application
    Filed: October 14, 2016
    Publication date: April 19, 2018
    Inventors: Rafal P. Konik, Roger A. Mittelstadt, Brian R. Muras, Chad A. Olstad
  • Publication number: 20180107713
    Abstract: Method, apparatus and article of manufacture for managing query execution. A query is received from a requesting entity for execution against a database. Embodiments execute the query to produce a set of query results, by initiating execution of a query plan for the query, catching, via an exception handler, a first one or more exceptions occurring while determining a first one or more query result rows and, after catching the first one or more exceptions, continuing execution of the query plan to produce an initial set of query results. The first one or more query result rows are added to an end of the initial set of query results, to produce the set of query results and the set of query results is returned to the requesting entity, where at least one erroneous query result row that was not omitted is appended to the end of the query results.
    Type: Application
    Filed: October 13, 2016
    Publication date: April 19, 2018
    Inventors: Craig S. ALDRICH, Rafal P. KONIK, Roger A. MITTELSTADT, Brian R. MURAS, Jane A. VOLD
  • Publication number: 20180096030
    Abstract: A computer system can generate a materialized query table (MQT) for data from a base table that has a plurality of rows and columns that each contain stored data. The computer system can receive a query to data stored in a row from the base table. The system can identify a column in the row and determine that data from a cell in the row and the column is above a threshold memory size. The system can generate, in response to determining that the data being above the threshold memory size, an MQT that includes data for the row and that includes a reference pointer that points to a location shared with another table.
    Type: Application
    Filed: December 6, 2017
    Publication date: April 5, 2018
    Inventors: Rafal P. Konik, Roger A. Mittelstadt, Brian R. Muras, Mark W. Theuer
  • Patent number: 9934274
    Abstract: A computer system can generate a materialized query table (MQT) for data from a base table that has a plurality of rows and columns that each contain stored data. The computer system can receive a query to data stored in a row from the base table. The system can identify a column in the row and determine that data from a cell in the row and the column is above a threshold memory size. The system can generate, in response to determining that the data being above the threshold memory size, an MQT that includes data for the row and that includes a reference pointer that points to a location shared with another table.
    Type: Grant
    Filed: November 25, 2014
    Date of Patent: April 3, 2018
    Assignee: International Business Machines Corporation
    Inventors: Rafal P. Konik, Roger A. Mittelstadt, Brian R. Muras, Mark W. Theuer
  • Patent number: 9928259
    Abstract: A computer-implemented method for reusing deleted database records includes, receiving, by a database manager executing within a computing device, a first query request to insert, into a database table, a first set of database records. The database manager identifies a first set of entries within a journal log bundle. The database manager also determines, in response to identifying a first set of entries, that there is a third set of deleted database records located on a same page as a second set of database records. The database manager also, in response to determining that there is a third set of deleted database records located on a same page as the second set of database records, inserts into the database table the first set of database records using the third set of deleted database records.
    Type: Grant
    Filed: April 21, 2015
    Date of Patent: March 27, 2018
    Assignee: International Business Machines Corporation
    Inventors: Rafal P. Konik, Roger A. Mittelstadt, Brian R. Muras, Chad A. Olstad
  • Patent number: 9928277
    Abstract: A computer system can generate a materialized query table (MQT) for data from a base table that has a plurality of rows and columns that each contain stored data. The computer system can receive a query to data stored in a row from the base table. The system can identify a column in the row and determine that data from a cell in the row and the column is above a threshold memory size. The system can generate, in response to determining that the data being above the threshold memory size, an MQT that includes data for the row and that includes a reference pointer that points to a location shared with another table.
    Type: Grant
    Filed: November 10, 2014
    Date of Patent: March 27, 2018
    Assignee: International Business Machines Corporation
    Inventors: Rafal P. Konik, Roger A. Mittelstadt, Brian R. Muras, Mark W. Theuer
  • Publication number: 20180081920
    Abstract: An index shared between a plurality of tables is used to access a data sharing space (DSS) storing a set of rows from a base table having a plurality of rows with stored data. First data values of the index are identified in response to a query for a table. A subset of rows is then retrieved from the DSS using the index elements corresponding to the first data values. Second data values and some of the first data values are then identified in response to a second query for a table. A second subset of rows are then retrieved from the DSS using the index elements corresponding to the second data values and some of the first data values and the query is then applied to the subset of rows.
    Type: Application
    Filed: November 29, 2017
    Publication date: March 22, 2018
    Inventors: Rafal P. Konik, Roger A. Mittelstadt, Brian R. Muras, Mark W. Theuer
  • Patent number: 9916354
    Abstract: A database management system (DBMS) runs on scalable production system. The DBMS includes a first operating mode, wherein the scalable production system runs on a first set of computing resources, and a second operating mode, wherein the scalable production system runs on a second set of computing resources. The DBMS in the first mode determines that with respect to the first set of resources a first query access plan for executing a query satisfies optimization criteria. A determination is made that with respect to the second set of resources the first plan fails preliminary criteria. In response to this failure determination, a second query access plan for executing the query is generated. Prior to having the DBMS receive a request to execute the query while in the second mode, a determination is made that with respect to the second set of resources the second plan satisfies the optimization criteria.
    Type: Grant
    Filed: June 9, 2015
    Date of Patent: March 13, 2018
    Assignee: International Business Machines Corporation
    Inventors: Rafal P. Konik, Roger A. Mittelstadt, Brian R. Muras, Chad A. Olstad
  • Patent number: 9916353
    Abstract: A database management system (DBMS) runs on scalable production system. The DBMS includes a first operating mode, wherein the scalable production system runs on a first set of computing resources, and a second operating mode, wherein the scalable production system runs on a second set of computing resources. The DBMS in the first mode determines that with respect to the first set of resources a first query access plan for executing a query satisfies optimization criteria. A determination is made that with respect to the second set of resources the first plan fails preliminary criteria. In response to this failure determination, a second query access plan for executing the query is generated. Prior to having the DBMS receive a request to execute the query while in the second mode, a determination is made that with respect to the second set of resources the second plan satisfies the optimization criteria.
    Type: Grant
    Filed: April 1, 2015
    Date of Patent: March 13, 2018
    Assignee: International Business Machines Corporation
    Inventors: Rafal P. Konik, Roger A. Mittelstadt, Brian R. Muras, Chad A. Olstad
  • Publication number: 20180046672
    Abstract: 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.
    Type: Application
    Filed: October 31, 2017
    Publication date: February 15, 2018
    Inventors: Rafal P. Konik, Roger A. Mittelstadt, Brian R. Muras, Chad A. Olstad
  • Publication number: 20180046673
    Abstract: 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.
    Type: Application
    Filed: October 31, 2017
    Publication date: February 15, 2018
    Inventors: Rafal P. Konik, Roger A. Mittelstadt, Brian R. Muras, Chad A. Olstad