Patents by Inventor Steven R. Pearson
Steven R. Pearson 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: 10831741Abstract: Techniques for data replication from a primary system to a standby system. A first buffer portion of a transaction log buffer is allocated to a first transaction at a primary system. Upon determining that the first buffer portion is fully formed, before the log data is written to the storage on the primary system, and before the transaction log buffer is entirely full, the log data in the first buffer portion is transmitted to the standby system, from the primary system. Upon writing the log data to the storage on the primary system and after the log data in the first buffer portion is transmitted to the standby system, a notification is transmitted to the standby system, from the primary system, where the standby system is configured to process the received log data responsive to receiving the notification from the primary system.Type: GrantFiled: December 4, 2017Date of Patent: November 10, 2020Assignee: International Business Machines CorporationInventors: Xun Xue, Steven R. Pearson, Roger L. Q. Zheng, Kevin J. Cherkauer
-
Patent number: 10176205Abstract: Provided are techniques for using parallel inserts to insert into a column store. A list of sub-ranges for a columnar table is created. A change statement for one or more rows to be inserted into the columnar table is received. For each of the received change statements, a sub-range from the list of sub-ranges is identified and data is serially inserted into the identified sub-range of the columnar table, while allowing parallel processing of each change statement for different sub-ranges of the columnar table.Type: GrantFiled: August 3, 2016Date of Patent: January 8, 2019Assignee: International Business Machines CorporationInventors: Walter D. Alvey, Chandrasekaran Mohan, Steven R. Pearson, James J. Seeger, Jr., Richard S. Sidle, Adam J. Storm, Roger L. Q. Zheng
-
Publication number: 20180101558Abstract: Techniques for data replication from a primary system to a standby system. A first buffer portion of a transaction log buffer is allocated to a first transaction at a primary system. Upon determining that the first buffer portion is fully formed, before the log data is written to the storage on the primary system, and before the transaction log buffer is entirely full, the log data in the first buffer portion is transmitted to the standby system, from the primary system. Upon writing the log data to the storage on the primary system and after the log data in the first buffer portion is transmitted to the standby system, a notification is transmitted to the standby system, from the primary system, where the standby system is configured to process the received log data responsive to receiving the notification from the primary system.Type: ApplicationFiled: December 4, 2017Publication date: April 12, 2018Inventors: Xun Xue, Steven R. Pearson, Roger L.Q. Zheng, Kevin J. Cherkauer
-
Patent number: 9910877Abstract: According to one embodiment of the present invention, a method for processing a query in a column database is provided. The method for analyzing test results may include a computer, associating a first set of metadata values with a set of records in a table, wherein each record has an associated state indicated by a metadata value. The method may further include the computer receiving a query to return one or more records of the set of records. The method may further include the computer determining that one or more records in the set of records satisfies the query. The method may further include the computer determining whether at least a first record in the one or more records that satisfies the query is in a returnable state based, at least in part, on the metadata value.Type: GrantFiled: March 11, 2015Date of Patent: March 6, 2018Assignee: International Business Machines CorporationInventors: Walter D. Alvey, Ronald J. Barber, Yi Ding, Chandrasekaran Mohan, Steven R. Pearson, Richard S. Sidle, Adam J. Storm
-
Patent number: 9910876Abstract: According to one embodiment of the present invention, a method for processing a query in a column database is provided. The method for analyzing test results may include a computer, associating a first set of metadata values with a set of records in a table, wherein each record has an associated state indicated by a metadata value. The method may further include the computer receiving a query to return one or more records of the set of records. The method may further include the computer determining that one or more records in the set of records satisfies the query. The method may further include the computer determining whether at least a first record in the one or more records that satisfies the query is in a returnable state based, at least in part, on the metadata value.Type: GrantFiled: June 11, 2014Date of Patent: March 6, 2018Assignee: International Business Machines CorporationInventors: Walter D. Alvey, Ronald J. Barber, Yi Ding, Chandrasekaran Mohan, Steven R. Pearson, Richard S. Sidle, Adam J. Storm
-
Patent number: 9892157Abstract: An approach for synopsis guided scan processing of MIN/MAX data queries where a minimal or maximal data query operation and a synopsis store are received. The synopsis store includes at least one of tuple range identifiers, column minimal and maximal metadata values. The synopsis store is sorted, where the column minimal or maximal metadata values search order is created for the tuple range identifiers. Dataset data associated with the tuple range identifiers is searched in the search order for a minimal or maximal value result until the minimal value result is less than or equal to a next column minimal metadata values or the maximal value result is greater than or equal to a next column maximal metadata values respectively and the minimal or maximal value result associated with the respective minimal or maximal data query operation is output.Type: GrantFiled: December 7, 2016Date of Patent: February 13, 2018Assignee: International Business Machines CorporationInventors: Madhusudan Kalarikal Janardhana, Andanagouda F. Patil, Steven R. Pearson
-
Patent number: 9886476Abstract: An approach for synopsis guided scan processing of MIN/MAX data queries where a minimal or maximal data query operation and a synopsis store are received. The synopsis store includes at least one of tuple range identifiers, column minimal and maximal metadata values. The synopsis store is sorted, where the column minimal or maximal metadata values search order is created for the tuple range identifiers. Dataset data associated with the tuple range identifiers is searched in the search order for a minimal or maximal value result until the minimal value result is less than or equal to a next column minimal metadata values or the maximal value result is greater than or equal to a next column maximal metadata values respectively and the minimal or maximal value result associated with the respective minimal or maximal data query operation is output.Type: GrantFiled: December 7, 2016Date of Patent: February 6, 2018Assignee: International Business Machines CorporationInventors: Madhusudan Kalarikal Janardhana, Andanagouda F. Patil, Steven R. Pearson
-
Patent number: 9864772Abstract: Methods, systems and program products for log-shipping data replication from a primary system to a communicatively-coupled standby system. Embodiments of the invention may receive transactional log data at a standby system, from the primary system, and before the transactional log data is written to storage on the primary system. Embodiments may then receive a notification from the primary system indicating that the corresponding log data was written to storage on the primary system, and responsive to receiving the notification, may process the received transactional log data.Type: GrantFiled: September 30, 2010Date of Patent: January 9, 2018Assignee: International Business Machines CorporationInventors: Kevin J. Cherkauer, Steven R. Pearson, Xun Xue, Roger L. Q. Zheng
-
Publication number: 20170212927Abstract: An approach for synopsis guided scan processing of MIN/MAX data queries where a minimal or maximal data query operation and a synopsis store are received. The synopsis store includes at least one of tuple range identifiers, column minimal and maximal metadata values. The synopsis store is sorted, where the column minimal or maximal metadata values search order is created for the tuple range identifiers. Dataset data associated with the tuple range identifiers is searched in the search order for a minimal or maximal value result until the minimal value result is less than or equal to a next column minimal metadata values or the maximal value result is greater than or equal to a next column maximal metadata values respectively and the minimal or maximal value result associated with the respective minimal or maximal data query operation is output.Type: ApplicationFiled: December 7, 2016Publication date: July 27, 2017Inventors: Madhusudan Kalarikal Janardhana, Andanagouda F. Patil, Steven R. Pearson
-
Publication number: 20170212936Abstract: An approach for synopsis guided scan processing of MIN/MAX data queries where a minimal or maximal data query operation and a synopsis store are received. The synopsis store includes at least one of tuple range identifiers, column minimal and maximal metadata values. The synopsis store is sorted, where the column minimal or maximal metadata values search order is created for the tuple range identifiers. Dataset data associated with the tuple range identifiers is searched in the search order for a minimal or maximal value result until the minimal value result is less than or equal to a next column minimal metadata values or the maximal value result is greater than or equal to a next column maximal metadata values respectively and the minimal or maximal value result associated with the respective minimal or maximal data query operation is output.Type: ApplicationFiled: December 7, 2016Publication date: July 27, 2017Inventors: Madhusudan Kalarikal Janardhana, Andanagouda F. Patil, Steven R. Pearson
-
Patent number: 9697242Abstract: Embodiments relate to database systems. An aspect includes deferring row insert operations until occurrence of a triggering event. One method includes receiving a row insert for a tuple into a column group store table, where the tuple includes one or more tuplets and each of the tuplets corresponds to a column group in the column group store table. The method also includes copying at least one of the tuplets into an insert buffer that is specific to one of the column groups in the column group store table. The method also includes deferring the row insert into the column group store table until an occurrence of one or more triggering events. The method also includes flushing the row insert into storage associated with the column group store table, in response to the occurrence of the one or more triggering events.Type: GrantFiled: January 30, 2014Date of Patent: July 4, 2017Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Walter D. Alvey, Matthew A. Huras, Sam B. Lightstone, Chandrasekaran Mohan, Steven R. Pearson, James J. Seeger, Richard S. Sidle, David C. Smith, Adam J. Storm
-
Patent number: 9633072Abstract: An approach for synopsis guided scan processing of MIN/MAX data queries where a minimal or maximal data query operation and a synopsis store are received. The synopsis store includes at least one of tuple range identifiers, column minimal and maximal metadata values. The synopsis store is sorted, where the column minimal or maximal metadata values search order is created for the tuple range identifiers. Dataset data associated with the tuple range identifiers is searched in the search order for a minimal or maximal value result until the minimal value result is less than or equal to a next column minimal metadata values or the maximal value result is greater than or equal to a next column maximal metadata values respectively and the minimal or maximal value result associated with the respective minimal or maximal data query operation is output.Type: GrantFiled: January 27, 2016Date of Patent: April 25, 2017Assignee: International Business Machines CorporationInventors: Madhusudan Kalarikal Janardhana, Andanagouda F. Patil, Steven R. Pearson
-
Patent number: 9569490Abstract: An approach for synopsis guided scan processing of MIN/MAX data queries where a minimal or maximal data query operation and a synopsis store are received. The synopsis store includes at least one of tuple range identifiers, column minimal and maximal metadata values. The synopsis store is sorted, where the column minimal or maximal metadata values search order is created for the tuple range identifiers. Dataset data associated with the tuple range identifiers is searched in the search order for a minimal or maximal value result until the minimal value result is less than or equal to a next column minimal metadata values or the maximal value result is greater than or equal to a next column maximal metadata values respectively and the minimal or maximal value result associated with the respective minimal or maximal data query operation is output.Type: GrantFiled: April 18, 2016Date of Patent: February 14, 2017Assignee: International Business Machines CorporationInventors: Madhusudan Kalarikal Janardhana, Andanagouda F. Patil, Steven R. Pearson
-
Publication number: 20160342635Abstract: Provided are techniques for using parallel inserts to insert into a column store. A list of sub-ranges for a columnar table is created. A change statement for one or more rows to be inserted into the columnar table is received. For each of the received change statements, a sub-range from the list of sub-ranges is identified and data is serially inserted into the identified sub-range of the columnar table, while allowing parallel processing of each change statement for different sub-ranges of the columnar table.Type: ApplicationFiled: August 3, 2016Publication date: November 24, 2016Inventors: Walter D. ALVEY, Chandrasekaran MOHAN, Steven R. PEARSON, James J. SEEGER, JR., Richard S. SIDLE, Adam J. STORM, Roger L.Q. ZHENG
-
Publication number: 20160342489Abstract: A method of optimizing the number and type of database backups to achieve a given RTO is provided and may include receiving a RTO and receiving a heuristic for determining an amount of unencumbered processing time. A type of next backup, (i.e., a next backup), is determined wherein the type of next backup is an incremental backup when the sum of the heuristic, and the times to: restore the latest full backup, restore zero or more incremental backups, complete a current incremental backup, and perform a full backup is less than the received RTO, else the type of the next backup is a full backup. A time to schedule the next backup is scheduled based on the received RTO being a total of an amount of time to: complete the type of next backup; rollforward zero or more transaction log records; and to restore at least one backup.Type: ApplicationFiled: August 3, 2016Publication date: November 24, 2016Inventors: Gary N. Jin, Steven R. Pearson, Prasadarao Akulavenkatavara
-
Publication number: 20160335162Abstract: A method of optimizing the number and type of database backups to achieve a given RTO is provided and may include receiving a RTO and receiving a heuristic for determining an amount of unencumbered processing time. A type of next backup, (i.e., a next backup), is determined wherein the type of next backup is an incremental backup when the sum of the heuristic, and the times to: restore the latest full backup, restore zero or more incremental backups, complete a current incremental backup, and perform a full backup is less than the received RTO, else the type of the next backup is a full backup. A time to schedule the next backup is scheduled based on the received RTO being a total of an amount of time to: complete the type of next backup; rollforward zero or more transaction log records; and to restore at least one backup.Type: ApplicationFiled: July 28, 2016Publication date: November 17, 2016Inventors: Gary N. Jin, Steven R. Pearson, Prasadarao Akulavenkatavara
-
Patent number: 9442913Abstract: Provided are techniques for using parallel inserts to insert into a column store. A list of sub-ranges for a columnar table is created. A change statement for one or more rows to be inserted into the columnar table is received. For each of the received change statements, a sub-range from the list of sub-ranges is identified and data is serially inserted into the identified sub-range of the columnar table, while allowing parallel processing of each change statement for different sub-ranges of the columnar table.Type: GrantFiled: January 30, 2014Date of Patent: September 13, 2016Assignee: International Business Machines CorporationInventors: Walter D. Alvey, Chandrasekaran Mohan, Steven R. Pearson, James J. Seeger, Jr., Richard S. Sidle, Adam J. Storm, Roger L. Q. Zheng
-
Patent number: 9442914Abstract: Provided are techniques for using parallel inserts to insert into a column store. A list of sub-ranges for a columnar table is created. A change statement for one or more rows to be inserted into the columnar table is received. For each of the received change statements, a sub-range from the list of sub-ranges is identified and data is serially inserted into the identified sub-range of the columnar table, while allowing parallel processing of each change statement for different sub-ranges of the columnar table.Type: GrantFiled: November 14, 2014Date of Patent: September 13, 2016Assignee: International Business Machines CorporationInventors: Walter D. Alvey, Chandrasekaran Mohan, Steven R. Pearson, James J. Seeger, Jr., Richard S. Sidle, Adam J. Storm, Roger L. Q. Zheng
-
Patent number: 9430335Abstract: A method of optimizing the number and type of database backups to achieve a given RTO is provided and may include receiving a RTO and receiving a heuristic for determining an amount of unencumbered processing time. A type of next backup, (i.e., a next backup), is determined wherein the type of next backup is an incremental backup when the sum of the heuristic, and the times to: restore the latest full backup, restore zero or more incremental backups, complete a current incremental backup, and perform a full backup is less than the received RTO, else the type of the next backup is a full backup. A time to schedule the next backup is scheduled based on the received RTO being a total of an amount of time to: complete the type of next backup; rollforward zero or more transaction log records; and to restore at least one backup.Type: GrantFiled: September 18, 2013Date of Patent: August 30, 2016Assignee: International Business Machines CorporationInventors: Gary N. Jin, Steven R. Pearson, Prasadarao Akulavenkatavara
-
Patent number: 9262279Abstract: A method of classifying and monitoring database operations based on a recovery cost may include receiving an indication of a recoverable operation. A count in a persistent storage, such as a catalog, corresponding to an occurrence of the recoverable operation is incremented.Type: GrantFiled: June 24, 2014Date of Patent: February 16, 2016Assignee: International Business Machines CorporationInventors: Gary N. Jin, Steven R. Pearson, Prasadarao Akulavenkatavara