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).

  • Adjusting Extension Size of a Database Table Using a Volatile Database Table Attribute
    Publication number: 20160171034
    Abstract: A respective volatility attribute associated with each of one or more tables of a computerized database is used to adjust an extension file size value associated with a database table file space. Various optional additional uses of a volatility attribute to manage a database are disclosed. Preferably, database parameters are automatically monitored over time and database table volatility state is automatically determined and periodically adjusted.
    Type: Application
    Filed: December 23, 2014
    Publication date: June 16, 2016
    Inventors: Rafal P. Konik, Roger A. Mittelstadt, Brian R. Muras, Mark W. Theuer
  • INTELLIGENT DATABASE WITH SECURE TABLES
    Publication number: 20160171235
    Abstract: Systems, methods, and computer program products to perform an operation comprising upon determining that a received query requests values of sensitive data stored in a secure database table of a database, computing a security score for the received query based on a determined specificity of a selection predicate of the received query, and upon determining that the security score exceeds a security threshold, performing a predefined operation to restrict access to the requested values of the sensitive data.
    Type: Application
    Filed: December 10, 2014
    Publication date: June 16, 2016
    Inventors: Rafal P. KONIK, Roger A. MITTELSTADT, Brian R. MURAS, Mark W. THEUER
  • Managing a Computerized Database Using a Volatile Database Table Attribute
    Publication number: 20160171032
    Abstract: A respective volatility attribute associated with each of one or more tables of a computerized database is used in any of various aspects to (a) determine how table data is stored in a physical storage device; (b) regulate the use of a materialized query table using database table data; and/or (c) influence circumstances under which indexes are created or advised by database analytic software. Various optional additional uses of a volatility attribute to manage a database are disclosed. Preferably, database parameters are automatically monitored over time and database table volatility state is automatically determined and periodically adjusted.
    Type: Application
    Filed: December 10, 2014
    Publication date: June 16, 2016
    Inventors: Rafal P. Konik, Roger A. Mittelstadt, Brian R. Muras, Mark W. Theuer
  • Adjusting Extension Size of a Database Table Using a Volatile Database Table Attribute
    Publication number: 20160171000
    Abstract: A respective volatility attribute associated with each of one or more tables of a computerized database is used to adjust an extension file size value associated with a database table file space. Various optional additional uses of a volatility attribute to manage a database are disclosed. Preferably, database parameters are automatically monitored over time and database table volatility state is automatically determined and periodically adjusted.
    Type: Application
    Filed: December 10, 2014
    Publication date: June 16, 2016
    Inventors: Rafal P. Konik, Roger A. Mittelstadt, Brian R. Muras, Mark W. Theuer
  • Preferentially Retaining Memory Pages Using a Volatile Database Table Attribute
    Publication number: 20160171022
    Abstract: A respective volatility attribute associated with each of one or more tables of a computerized database is used to determine circumstances under which a page of table data is paged out of memory, by preferentially retaining pages from volatile database tables in memory. Various optional additional uses of a volatility attribute to manage a database are disclosed. Preferably, database parameters are automatically monitored over time and database table volatility state is automatically determined and periodically adjusted.
    Type: Application
    Filed: December 10, 2014
    Publication date: June 16, 2016
    Inventors: Rafal P. Konik, Roger A. Mittelstadt, Brian R. Muras, Mark W. Theuer
  • Storing a Key Value to a Deleted Row Based On Key Range Density
    Publication number: 20160162525
    Abstract: In an embodiment, a first key value is received. A plurality of candidate rows are found in a database table, wherein the plurality of candidate rows are deleted. For the plurality of candidate rows, a plurality of respective impacts on a plurality of respective densities of each of other key values that are stored within a first key range of the first key value are calculated. For the plurality of candidate rows, a plurality of function results of the plurality of respective impacts on the plurality of respective densities are calculated. A selected candidate row of the plurality of candidate rows with a smallest function result of the plurality of function results of the plurality of respective impacts on the plurality of respective densities is selected. The first key value is stored to the selected candidate row.
    Type: Application
    Filed: February 15, 2016
    Publication date: June 9, 2016
    Inventors: Rafal P. Konik, Roger A. Mittelstadt, Brian R. Muras, Mark W. Theuer
  • READ AND DELETE INPUT/OUTPUT OPERATION FOR DATABASE MANAGEMENT
    Publication number: 20160140137
    Abstract: A computer-implemented method for improving database management may include selecting one or more database records that are requested based on a query statement. The one or more database records may be read from a first database file, wherein the one or more database records are copied from the first database file and stored to a memory. The one or more database records may be deleted from the first database file at substantially the same time as the reading the one or more database records, wherein the reading and the deleting occur through a single read and delete input/output (I/O) operation.
    Type: Application
    Filed: November 18, 2014
    Publication date: May 19, 2016
    Inventors: Rafal P. Konik, Roger A. Mittelstadt, Brian R. Muras, Mark W. Theuer
  • Using a partially built index in a computer database system
    Patent number: 9342545
    Abstract: A partially built index is used in a computer database system. When a database index is being built, or rebuilt, the database manager keeps track of the records processed using a relative row number (RRN) to track what part of the partially built index is complete. Queries are optimized by a query optimizer associated with the database manager that uses the portion of the index that is complete with reference to the RRN. The remainder of the database table beyond the RRN can be estimated or implemented using the completed data or can be determined by searching the relevant portion of the database table.
    Type: Grant
    Filed: November 12, 2012
    Date of Patent: May 17, 2016
    Assignee: International Business Machines Corporation
    Inventors: Rafal P. Konik, Roger A. Mittelstadt, Brian R. Muras, Mark W. Theuer
  • MATERIALIZED QUERY TABLES WITH SHARED DATA
    Publication number: 20160132557
    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: November 10, 2014
    Publication date: May 12, 2016
    Inventors: Rafal P. Konik, Roger A. Mittelstadt, Brian R. Muras, Mark W. Theuer
  • MATERIALIZED QUERY TABLES WITH SHARED DATA
    Publication number: 20160132558
    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: November 25, 2014
    Publication date: May 12, 2016
    Inventors: Rafal P. Konik, Roger A. Mittelstadt, Brian R. Muras, Mark W. Theuer
  • Storing a key value to a deleted row based on key range density
    Patent number: 9323798
    Abstract: In an embodiment, a first key value is received. A plurality of candidate rows are found in a database table, wherein the plurality of candidate rows are deleted. For the plurality of candidate rows, a plurality of respective impacts on a plurality of respective densities of each of other key values that are stored within a first key range of the first key value are calculated. For the plurality of candidate rows, a plurality of function results of the plurality of respective impacts on the plurality of respective densities are calculated. A selected candidate row of the plurality of candidate rows with a smallest function result of the plurality of function results of the plurality of respective impacts on the plurality of respective densities is selected. The first key value is stored to the selected candidate row.
    Type: Grant
    Filed: January 14, 2013
    Date of Patent: April 26, 2016
    Assignee: International Business Machines Corporation
    Inventors: Rafal P. Konik, Roger A. Mittelstadt, Brian R. Muras, Mark W. Theuer
  • Changing the compression level of query plans
    Patent number: 9298775
    Abstract: In an embodiment, a query plan is compressed to data in a cache at a high compression level if a runtime of a query that the query plan implements is greater than a high time threshold. The query plan is compressed to the data in the cache at a medium compression level if the runtime of the query that the query plan implements is less than the high time threshold and greater than a low time threshold. The query plan is stored to the data in the cache at an uncompressed level if the runtime of the query that the query plan implements is less than the low time threshold.
    Type: Grant
    Filed: January 25, 2015
    Date of Patent: March 29, 2016
    Assignee: International Business Machines Corporation
    Inventors: Rafal P. Konik, Roger A. Mittelstadt, Brian R. Muras, Mark W. Theuer
  • Performing a function on rows of data determined from transitive relationships between columns
    Patent number: 9298829
    Abstract: In an embodiment, a request is received that specifies a function and a specified key value. Rows from all tables that are accessible from the specified key value are transitively searched, wherein the transitively searching further comprises finding values in a plurality of pairs of columns, wherein found rows that are found by the transitively searching comprise values in a respective first column of the plurality of pairs of columns that satisfy a dependency relationship with values in a respective second column of the plurality of pairs of columns. The function is executed against only the found rows.
    Type: Grant
    Filed: December 18, 2012
    Date of Patent: March 29, 2016
    Assignee: International Business Machines Corporation
    Inventors: Rafal P. Konik, Roger A. Mittelstadt, Brian R. Muras, Mark W. Theuer
  • Changing the compression level of query plans
    Patent number: 9298774
    Abstract: In an embodiment, a query plan is compressed to data in a cache at a high compression level if a runtime of a query that the query plan implements is greater than a high time threshold. The query plan is compressed to the data in the cache at a medium compression level if the runtime of the query that the query plan implements is less than the high time threshold and greater than a low time threshold. The query plan is stored to the data in the cache at an uncompressed level if the runtime of the query that the query plan implements is less than the low time threshold.
    Type: Grant
    Filed: January 25, 2015
    Date of Patent: March 29, 2016
    Assignee: International Business Machines Corporation
    Inventors: Rafal P. Konik, Roger A. Mittelstadt, Brian R. Muras, Mark W. Theuer
  • Performing a function on rows of data determined from transitive relationships between columns
    Patent number: 9286393
    Abstract: In an embodiment, a request is received that specifies a function and a specified key value. Rows from all tables that are accessible from the specified key value are transitively searched, wherein the transitively searching further comprises finding values in a plurality of pairs of columns, wherein found rows that are found by the transitively searching comprise values in a respective first column of the plurality of pairs of columns that satisfy a dependency relationship with values in a respective second column of the plurality of pairs of columns. The function is executed against only the found rows.
    Type: Grant
    Filed: March 11, 2013
    Date of Patent: March 15, 2016
    Assignee: International Business Machines Corporation
    Inventors: Rafal P. Konik, Roger A. Mittelstadt, Brian R. Muras, Mark W. Theuer
  • Reading rows from memory prior to reading rows from secondary storage
    Patent number: 9218394
    Abstract: In an embodiment, a first plurality of rows of a first table are read from memory in an order of page addresses of pages in the memory that comprise the first plurality of rows. First selected rows from the first plurality of rows that meet a query predicate are stored into a result set. After the reading the first plurality of rows in the order of the page addresses, a second plurality of rows of the first table are read from secondary storage, in an order of row identifiers of the second plurality of the rows in the first table. Second selected rows from the second plurality of rows that meet the query predicate are stored into the result set.
    Type: Grant
    Filed: October 19, 2010
    Date of Patent: December 22, 2015
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Randy L. Egan, Rafal P. Konik, Roger A. Mittelstadt, Mark W. Theuer
  • GENERATING AND ACCESSING A DATA TABLE
    Publication number: 20150363415
    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: August 25, 2014
    Publication date: December 17, 2015
    Inventors: Rafal P. Konik, Roger A. Mittelstadt, Brian R. Muras, Mark W. Theuer
  • GENERATING AND ACCESSING A DATA TABLE
    Publication number: 20150363441
    Abstract: A data sharing space (DSS) is generated for a base table having a set of rows with stored data. Requests are received to generate tables, each request including a query to the base table. A row from the set of rows is then accessed. The query is then applied to the row to generate results. An index value is then determined and a portion of the row is stored in the DSS based on the index value.
    Type: Application
    Filed: June 12, 2014
    Publication date: December 17, 2015
    Inventors: Rafal P. Konik, Roger A. Mittelstadt, Brian R. Muras, Mark W. Theuer
  • GENERATING AND ACCESSING A DATA TABLE
    Publication number: 20150363445
    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: June 12, 2014
    Publication date: December 17, 2015
    Inventors: Rafal P. Konik, Roger A. Mittelstadt, Brian R. Muras, Mark W. Theuer
  • GENERATING AND ACCESSING A DATA TABLE
    Publication number: 20150363399
    Abstract: A data sharing space (DSS) is generated for a base table having a set of rows with stored data. Requests are received to generate tables, each request including a query to the base table. A row from the set of rows is then accessed. The query is then applied to the row to generate results. An index value is then determined and a portion of the row is stored in the DSS based on the index value.
    Type: Application
    Filed: August 25, 2014
    Publication date: December 17, 2015
    Inventors: Rafal P. Konik, Roger A. Mittelstadt, Brian R. Muras, Mark W. Theuer