Patents by Inventor Daniel E. Beuch
Daniel E. Beuch 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).
-
Publication number: 20170339150Abstract: Systems, methods, and computer program products to perform an operation comprising identifying a first access to a first subset of a first database table on a first storage node, of a plurality of storage nodes, identifying a second access to a second subset of the first database table on a second storage node, of the plurality of storage nodes, and performing a predefined operation to restrict access to the first database table on the plurality of storage nodes based on the first and second accesses.Type: ApplicationFiled: May 20, 2016Publication date: November 23, 2017Inventors: Eric L. BARSNESS, Daniel E. Beuch, Brian R. Muras, John M. Santosuosso
-
Patent number: 9378234Abstract: A method, system, and computer program product to efficiently maintain a database is disclosed. The method, system, and computer program product may include structuring the database to have a table, an index associated with the table, and a log associated with the index. The method, system, and computer program product may include receiving a maintenance request related to the index. The method, system, and computer program product may include accounting for the maintenance request when the index is being searched. The method, system, and computer program product may include adding the maintenance request to the log when the index is not being searched.Type: GrantFiled: March 11, 2013Date of Patent: June 28, 2016Assignee: International Business Machines CorporationInventors: Robert J. Bestgen, Daniel E. Beuch
-
Patent number: 9378235Abstract: A method, system, and computer program product to efficiently maintain a database is disclosed. The method, system, and computer program product may include structuring the database to have a table, an index associated with the table, and a log associated with the index. The method, system, and computer program product may include receiving a maintenance request related to the index. The method, system, and computer program product may include accounting for the maintenance request when the index is being searched. The method, system, and computer program product may include adding the maintenance request to the log when the index is not being searched.Type: GrantFiled: March 15, 2013Date of Patent: June 28, 2016Assignee: International Business Machines CorporationInventors: Robert J. Bestgen, Daniel E. Beuch
-
Patent number: 9355128Abstract: A method and system of managing a database is disclosed. The database may be structured to include a sequence object. The sequence object can have a set of sequential values. The set of sequential values may be used as a set of key values for a set of jobs. A count of jobs accessing the sequence object may be monitored. Based on the count of jobs accessing the sequence object, a quantity of sequential values of the set of sequential values may be allocated.Type: GrantFiled: May 29, 2014Date of Patent: May 31, 2016Assignee: International Business Machines CorporationInventors: Robert J. Bestgen, Daniel E. Beuch
-
Patent number: 9311343Abstract: A method and system of managing a database is disclosed. The database may be structured to include a sequence object. The sequence object can have a set of sequential values. The set of sequential values may be used as a set of key values for a set of jobs. A count of jobs accessing the sequence object may be monitored. Based on the count of jobs accessing the sequence object, a quantity of sequential values of the set of sequential values may be allocated.Type: GrantFiled: April 2, 2014Date of Patent: April 12, 2016Assignee: International Business Machines CorporationInventors: Robert J. Bestgen, Daniel E. Beuch
-
Publication number: 20160092599Abstract: A method for processing a database query includes receiving a database query to be executed according to a first processing profile and determining whether the database query is likely to be an ad hoc query. The determining of whether the database query is likely to be an ad hoc query is based on a factor. The factor can include a query originator factor, a job type factor, a run history factor, or a query quality factor. A second processing profile is generated before executing the database query in response to determining that the database query is likely to be an ad hoc query. The second processing profile is configured to limit performance impacts, such as by providing a lower execution priority, prohibiting parallel database operations, limiting memory allocation, or delaying or blocking the query.Type: ApplicationFiled: September 30, 2014Publication date: March 31, 2016Inventors: Eric L. Barsness, Robert J. Bestgen, Daniel E. Beuch, John M. Santosuosso
-
Patent number: 9229961Abstract: A method, system, and computer program product to efficiently delete data from a database is disclosed. The method, system, and computer program product may include structuring the database to have a plurality of tables having indexes to related rows and having keys with key values associated with particular rows. The method, system, and computer program product may include deleting rows in the database tables by deleting keys in indexes related to the rows in an order such that corresponding rows are deleted based on relation to the keys. The method, system, and computer program product may include ordering the rows to be deleted based on concepts such as hierarchy, spatial locality, temporal locality, frequency of access, number of rows, and value uniqueness. Comparatively closely related relationships may be prioritized to be deleted.Type: GrantFiled: March 12, 2013Date of Patent: January 5, 2016Assignee: International Business Machines CorporationInventors: Robert J. Bestgen, Daniel E. Beuch
-
Patent number: 9229968Abstract: A method, system, and computer program product to efficiently search a database is disclosed. The method, system, and computer program product may include structuring the database to have a table, an index associated with the table, and a log associated with the index, the log adapted to include an entry. The method, system, and computer program product may include receiving a search request related to the index. The method, system, and computer program product may include searching the index when the search request is not associated with the entry. The method, system, and computer program product may include accounting for the entry and searching the index when the search request is associated with the entry.Type: GrantFiled: March 11, 2013Date of Patent: January 5, 2016Assignee: Intenational Business Machines CorporationInventors: Robert J. Bestgen, Daniel E. Beuch
-
Patent number: 9229960Abstract: A method, system, and computer program product to efficiently delete data from a database is disclosed. The method, system, and computer program product may include structuring the database to have a plurality of tables having indexes to related rows and having keys with key values associated with particular rows. The method, system, and computer program product may include deleting rows in the database tables by deleting keys in indexes related to the rows in an order such that corresponding rows are deleted based on relation to the keys. The method, system, and computer program product may include ordering the rows to be deleted based on concepts such as hierarchy, spatial locality, temporal locality, frequency of access, number of rows, and value uniqueness. Comparatively closely related relationships may be prioritized to be deleted.Type: GrantFiled: February 11, 2013Date of Patent: January 5, 2016Assignee: International Business Machines CorporationInventors: Robert J. Bestgen, Daniel E. Beuch
-
Patent number: 9229969Abstract: A method, system, and computer program product to efficiently search a database is disclosed. The method, system, and computer program product may include structuring the database to have a table, an index associated with the table, and a log associated with the index, the log adapted to include an entry. The method, system, and computer program product may include receiving a search request related to the index. The method, system, and computer program product may include searching the index when the search request is not associated with the entry. The method, system, and computer program product may include accounting for the entry and searching the index when the search request is associated with the entry.Type: GrantFiled: March 15, 2013Date of Patent: January 5, 2016Assignee: International Business Machines CorporationInventors: Robert J. Bestgen, Daniel E. Beuch
-
Publication number: 20150286660Abstract: A method and system of managing a database is disclosed. The database may be structured to include a sequence object. The sequence object can have a set of sequential values. The set of sequential values may be used as a set of key values for a set of jobs. A count of jobs accessing the sequence object may be monitored. Based on the count of jobs accessing the sequence object, a quantity of sequential values of the set of sequential values may be allocated.Type: ApplicationFiled: May 29, 2014Publication date: October 8, 2015Applicant: International Business Machines CorporationInventors: Robert J. Bestgen, Daniel E. Beuch
-
Publication number: 20150286659Abstract: A method and system of managing a database is disclosed. The database may be structured to include a sequence object. The sequence object can have a set of sequential values. The set of sequential values may be used as a set of key values for a set of jobs. A count of jobs accessing the sequence object may be monitored. Based on the count of jobs accessing the sequence object, a quantity of sequential values of the set of sequential values may be allocated.Type: ApplicationFiled: April 2, 2014Publication date: October 8, 2015Applicant: International Business Machines CorporationInventors: Robert J. Bestgen, Daniel E. Beuch
-
Publication number: 20140258264Abstract: A method, system, and computer program product to efficiently search a database is disclosed. The method, system, and computer program product may include structuring the database to have a table, an index associated with the table, and a log associated with the index, the log adapted to include an entry. The method, system, and computer program product may include receiving a search request related to the index. The method, system, and computer program product may include searching the index when the search request is not associated with the entry. The method, system, and computer program product may include accounting for the entry and searching the index when the search request is associated with the entry.Type: ApplicationFiled: March 15, 2013Publication date: September 11, 2014Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Robert J. Bestgen, Daniel E. Beuch
-
Publication number: 20140258251Abstract: A method, system, and computer program product to efficiently maintain a database is disclosed. The method, system, and computer program product may include structuring the database to have a table, an index associated with the table, and a log associated with the index. The method, system, and computer program product may include receiving a maintenance request related to the index. The method, system, and computer program product may include accounting for the maintenance request when the index is being searched. The method, system, and computer program product may include adding the maintenance request to the log when the index is not being searched.Type: ApplicationFiled: March 15, 2013Publication date: September 11, 2014Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Robert J. Bestgen, Daniel E. Beuch
-
Publication number: 20140229427Abstract: A method, system, and computer program product to efficiently delete data from a database is disclosed. The method, system, and computer program product may include structuring the database to have a plurality of tables having indexes to related rows and having keys with key values associated with particular rows. The method, system, and computer program product may include deleting rows in the database tables by deleting keys in indexes related to the rows in an order such that corresponding rows are deleted based on relation to the keys. The method, system, and computer program product may include ordering the rows to be deleted based on concepts such as hierarchy, spatial locality, temporal locality, frequency of access, number of rows, and value uniqueness. Comparatively closely related relationships may be prioritized to be deleted.Type: ApplicationFiled: February 11, 2013Publication date: August 14, 2014Applicant: International Business Machines CorporationInventors: Robert J. Bestgen, Daniel E. Beuch
-
Publication number: 20140229429Abstract: A method, system, and computer program product to efficiently delete data from a database is disclosed. The method, system, and computer program product may include structuring the database to have a plurality of tables having indexes to related rows and having keys with key values associated with particular rows. The method, system, and computer program product may include deleting rows in the database tables by deleting keys in indexes related to the rows in an order such that corresponding rows are deleted based on relation to the keys. The method, system, and computer program product may include ordering the rows to be deleted based on concepts such as hierarchy, spatial locality, temporal locality, frequency of access, number of rows, and value uniqueness. Comparatively closely related relationships may be prioritized to be deleted.Type: ApplicationFiled: March 12, 2013Publication date: August 14, 2014Applicant: International Business Machines CorporationInventors: Robert J. Bestgen, Daniel E. Beuch
-
Patent number: 8452756Abstract: A database query optimizer includes an access plan storage mechanism that stores execution detail corresponding to a query statement in an access plan cache. By storing execution detail in the access plan cache along with the query statement, the execution detail is available when needed to debug database problems, even after a problem occurs. The execution detail stored in the access plan cache may be mined and analyzed after-the-fact, producing a very powerful tool for debugging database problems. Snapshots of the execution detail may also be created by a user. In addition, the user may setup autonomic snapshots and comparisons so that a user may be alerted from a degradation in database performance between two snapshots.Type: GrantFiled: November 9, 2006Date of Patent: May 28, 2013Assignee: International Business Machines CorporationInventors: Mark John Anderson, Robert Joseph Bestgen, Daniel E. Beuch, Curtis Neal Boger, James Michael Flanagan, Scott Forstie, Shantan Kethireddy, Thomas Owen McKinley, Michael Donald Pfeifer
-
Patent number: 7890480Abstract: A deterministic UDF processing mechanism processes user-defined functions (UDFs) using multiple hash tables. Data access patterns for a UDF are collected, and an appropriate hash table set is then determined for the UDF from the data access patterns. If a UDF accesses some similar columns and some disjoint columns, the similar columns are grouped together, and one or more hash tables are allocated to the similar columns. Disjoint columns are allocated their own hash tables. In addition, the allocation of hash tables may be adjusted based on historical access patterns collected over time. By dynamically allocating and adjusting sets of hash tables to a deterministic UDF, the performance of the UDF is greatly increased.Type: GrantFiled: February 11, 2008Date of Patent: February 15, 2011Assignee: International Business Machines CorporationInventors: Eric Lawrence Barsness, Daniel E. Beuch, Theresa Renee Euler, Paul Stuart Nelsestuen, John Matthew Santosuosso
-
Publication number: 20090204566Abstract: A deterministic UDF processing mechanism processes user-defined functions (UDFs) using multiple hash tables. Data access patterns for a UDF are collected, and an appropriate hash table set is then determined for the UDF from the data access patterns. If a UDF accesses some similar columns and some disjoint columns, the similar columns are grouped together, and one or more hash tables are allocated to the similar columns. Disjoint columns are allocated their own hash tables. In addition, the allocation of hash tables may be adjusted based on historical access patterns collected over time. By dynamically allocating and adjusting sets of hash tables to a deterministic UDF, the performance of the UDF is greatly increased.Type: ApplicationFiled: February 11, 2008Publication date: August 13, 2009Inventors: Eric Lawrence Barsness, Daniel E. Beuch, Theresa Renee Euler, Paul Stuart Nelsestuen, John Matthew Santosuosso
-
Publication number: 20090089743Abstract: In one aspect, a method is provided. The method includes (1) generating code in an integrated development environment (IDE), the code including instructions for a database; and (2) receiving feedback in the IDE, the feedback relating to the instructions for the database.Type: ApplicationFiled: October 2, 2007Publication date: April 2, 2009Inventors: Eric L. Barsness, Daniel E. Beuch, Paul S. Nelsestuen, John M. Santosuosso