Patents by Inventor Derek L. Erdmann
Derek L. Erdmann 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: 11294573Abstract: Provided are a computer program product, system, and method for generating node access information for a transaction accessing nodes of a data set index. Pages in the memory are allocated to internal nodes and leaf nodes of a tree data structure representing all or a portion of a data set index for the data set. A transaction is processed with respect to the data set that involves accessing the internal and leaf nodes in the tree data structure, wherein the transaction comprises a read or write operation. Node access information is generated in transaction information, for accessed nodes comprising nodes in the tree data structure accessed as part of processing the transaction. The node access information includes a pointer to the page allocated to the accessed node prior to the transaction in response to the node being modified during the transaction.Type: GrantFiled: June 3, 2019Date of Patent: April 5, 2022Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Derek L. Erdmann, David C. Reed, Thomas C. Reed, Max D. Smith
-
Patent number: 11237735Abstract: A method for storing data includes establishing an extended generation group comprising a plurality of data sets. The plurality of data sets includes a first data set containing primary members and a first number of generations of each of the primary members, and a second data set containing a second number of generations of each of the primary members. The method further indicates, in the metadata of the first data set, a maximum number of generations allowable in each of the first and second data sets When a primary member is modified in the first data set, the method automatically moves an oldest generation in the first data set to the second data set, and deletes an oldest generation in the second data set to ensure that the extended generation group does not exceed the maximum number.Type: GrantFiled: February 2, 2018Date of Patent: February 1, 2022Assignee: International Business Machines CorporationInventors: Derek L. Erdmann, David C. Reed, Thomas C. Reed, Max D. Smith
-
Patent number: 10915527Abstract: Methods that can parallel search a partitioned data set extended (PSDE) indexes are provided. One method includes managing a set of quick indexes in a memory device in which the set of quick indexes include references to storage locations for a subset of members of a PDSE stored in a set of long-term storage devices. The method further includes receiving a request to determine a storage location of a member of the PDSE and, in response to the request, searching the set of quick indexes to determine the storage location. Systems and computer program products for performing the above method are also provided.Type: GrantFiled: June 7, 2017Date of Patent: February 9, 2021Assignee: International Business Machines CorporationInventors: Derek L. Erdmann, David C. Reed, Thomas C. Reed, Max D. Smith
-
Patent number: 10901619Abstract: Provided are a computer program product, system, and method for selecting pages implementing leaf nodes and internal nodes of a data set index for reuse in memory. Pages in the memory are allocated to internal nodes and leaf nodes of a tree data structure representing all or a portion of a data set index for the data set. At least at least one duration parameter indicates an amount of time after which an unused page implement one of the internal nodes or leaf nodes is eligible for reuse. Selection is made of at least one selected page allocated to at least one of the leaf nodes and the internal nodes that has not been used for one of the at least one duration parameter for reuse.Type: GrantFiled: June 12, 2019Date of Patent: January 26, 2021Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Derek L. Erdmann, David C. Reed, Thomas C. Reed, Max D. Smith
-
Patent number: 10649696Abstract: Provided are a computer program product, system, and method for an application to provide for, in one embodiment, using hierarchical storage management to respond to a request to delete a data set by migrating the data set to another storage tier in a storage system before deleting the data set from its current location. As a result, the data set is stored on another tier to provide an opportunity to reverse the decision to delete the data set. In one embodiment, a temporary interval of time is provided to reverse the deletion decision and restore the data set from the migrated data set, before the data set is permanently deleted.Type: GrantFiled: August 14, 2018Date of Patent: May 12, 2020Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Derek L. Erdmann, Franklin E. McCune, Miguel A. Perez
-
Patent number: 10606802Abstract: A computer-implemented method according to one embodiment includes intercepting one or more updates made to a catalog data set, storing the one or more updates in an update buffer, retrieving the one or more updates from the update buffer, sequentially applying the one or more updates to a backup catalog data set, identifying a request to replace the catalog data set, and replacing the catalog data set with the backup catalog data set, in response to the request.Type: GrantFiled: May 15, 2017Date of Patent: March 31, 2020Assignee: International Business Machines CorporationInventors: Derek L. Erdmann, Eric J. Harris, Franklin E. Mccune, Thomas C. Reed
-
Patent number: 10521132Abstract: A method for managing volumes in a scratch pool of a virtual tape system is disclosed. In one embodiment, such a method provides a scratch pool containing volumes for use in a virtual tape system. The method further enables a user to predefine an external pool of volumes residing outside of the scratch pool. This external pool may be hidden to a host system accessing the virtual tape system. The method monitors current and/or past usage of the volumes in the scratch pool and, based on the usage, predicts a future need for volumes in the scratch pool. The method automatically moves volumes between the external pool and the scratch pool in accordance with the future need. A corresponding system and computer program product are also disclosed.Type: GrantFiled: June 17, 2018Date of Patent: December 31, 2019Assignee: International Business Machines CorporationInventors: Michael R. Scott, David C. Reed, Sosuke Matsui, Derek L. Erdmann
-
Publication number: 20190384507Abstract: A method for managing volumes in a scratch pool of a virtual tape system is disclosed. In one embodiment, such a method provides a scratch pool containing volumes for use in a virtual tape system. The method further enables a user to predefine an external pool of volumes residing outside of the scratch pool. This external pool may be hidden to a host system accessing the virtual tape system. The method monitors current and/or past usage of the volumes in the scratch pool and, based on the usage, predicts a future need for volumes in the scratch pool. The method automatically moves volumes between the external pool and the scratch pool in accordance with the future need. A corresponding system and computer program product are also disclosed.Type: ApplicationFiled: June 17, 2018Publication date: December 19, 2019Applicant: International Business Machines CorporationInventors: Michael R. Scott, David C. Reed, Sosuke Matsui, Derek L. Erdmann
-
Publication number: 20190294338Abstract: Provided are a computer program product, system, and method for selecting pages implementing leaf nodes and internal nodes of a data set index for reuse in memory. Pages in the memory are allocated to internal nodes and leaf nodes of a tree data structure representing all or a portion of a data set index for the data set. At least at least one duration parameter indicates an amount of time after which an unused page implement one of the internal nodes or leaf nodes is eligible for reuse. Selection is made of at least one selected page allocated to at least one of the leaf nodes and the internal nodes that has not been used for one of the at least one duration parameter for reuse.Type: ApplicationFiled: June 12, 2019Publication date: September 26, 2019Inventors: Derek L. Erdmann, David C. Reed, Thomas C. Reed, Max D. Smith
-
Publication number: 20190286339Abstract: Provided are a computer program product, system, and method for generating node access information for a transaction accessing nodes of a data set index. Pages in the memory are allocated to internal nodes and leaf nodes of a tree data structure representing all or a portion of a data set index for the data set. A transaction is processed with respect to the data set that involves accessing the internal and leaf nodes in the tree data structure, wherein the transaction comprises a read or write operation. Node access information is generated in transaction information, for accessed nodes comprising nodes in the tree data structure accessed as part of processing the transaction. The node access information includes a pointer to the page allocated to the accessed node prior to the transaction in response to the node being modified during the transaction.Type: ApplicationFiled: June 3, 2019Publication date: September 19, 2019Inventors: Derek L. Erdmann, David C. Reed, Thomas C. Reed, Max D. Smith
-
Patent number: 10394452Abstract: Provided are a computer program product, system, and method for selecting pages implementing leaf nodes and internal nodes of a data set index for reuse in memory. Pages in the memory are allocated to internal nodes and leaf nodes of a tree data structure representing all or a portion of a data set index for the data set. At least at least one duration parameter indicates an amount of time after which an unused page implement one of the internal nodes or leaf nodes is eligible for reuse. Selection is made of at least one selected page allocated to at least one of the leaf nodes and the internal nodes that has not been used for one of the at least one duration parameter for reuse.Type: GrantFiled: June 5, 2017Date of Patent: August 27, 2019Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Derek L. Erdmann, David C. Reed, Thomas C. Reed, Max D. Smith
-
Patent number: 10372348Abstract: Provided are a computer program product, system, and method for generating node access information for a transaction accessing nodes of a data set index. Pages in the memory are allocated to internal nodes and leaf nodes of a tree data structure representing all or a portion of a data set index for the data set. A transaction is processed with respect to the data set that involves accessing the internal and leaf nodes in the tree data structure, wherein the transaction comprises a read or write operation. Node access information is generated in transaction information, for accessed nodes comprising nodes in the tree data structure accessed as part of processing the transaction. The node access information includes a pointer to the page allocated to the accessed node prior to the transaction in response to the node being modified during the transaction.Type: GrantFiled: August 23, 2018Date of Patent: August 6, 2019Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Derek L. Erdmann, David C. Reed, Thomas C. Reed, Max D. Smith
-
Publication number: 20180364923Abstract: Provided are a computer program product, system, and method for generating node access information for a transaction accessing nodes of a data set index. Pages in the memory are allocated to internal nodes and leaf nodes of a tree data structure representing all or a portion of a data set index for the data set. A transaction is processed with respect to the data set that involves accessing the internal and leaf nodes in the tree data structure, wherein the transaction comprises a read or write operation. Node access information is generated in transaction information, for accessed nodes comprising nodes in the tree data structure accessed as part of processing the transaction. The node access information includes a pointer to the page allocated to the accessed node prior to the transaction in response to the node being modified during the transaction.Type: ApplicationFiled: August 23, 2018Publication date: December 20, 2018Inventors: Derek L. Erdmann, David C. Reed, Thomas C. Reed, Max D. Smith
-
Publication number: 20180357277Abstract: Methods that can parallel search a partitioned data set extended (PSDE) indexes are provided. One method includes managing a set of quick indexes in a memory device in which the set of quick indexes include references to storage locations for a subset of members of a PDSE stored in a set of long-term storage devices. The method further includes receiving a request to determine a storage location of a member of the PDSE and, in response to the request, searching the set of quick indexes to determine the storage location. Systems and computer program products for performing the above method are also provided.Type: ApplicationFiled: June 7, 2017Publication date: December 13, 2018Inventors: Derek L. Erdmann, David C. Reed, Thomas C. Reed, Max D. Smith
-
Publication number: 20180349064Abstract: Provided are a computer program product, system, and method for an application to provide for, in one embodiment, using hierarchical storage management to respond to a request to delete a data set by migrating the data set to another storage tier in a storage system before deleting the data set from its current location. As a result, the data set is stored on another tier to provide an opportunity to reverse the decision to delete the data set. In one embodiment, a temporary interval of time is provided to reverse the deletion decision and restore the data set from the migrated data set, before the data set is permanently deleted.Type: ApplicationFiled: August 14, 2018Publication date: December 6, 2018Inventors: Derek L. Erdmann, Franklin E. McCune, Miguel A. Perez
-
Publication number: 20180329919Abstract: A computer-implemented method according to one embodiment includes intercepting one or more updates made to a catalog data set, storing the one or more updates in an update buffer, retrieving the one or more updates from the update buffer, sequentially applying the one or more updates to a backup catalog data set, identifying a request to replace the catalog data set, and replacing the catalog data set with the backup catalog data set, in response to the request.Type: ApplicationFiled: May 15, 2017Publication date: November 15, 2018Inventors: Derek L. Erdmann, Eric J. Harris, Franklin E. Mccune, Thomas C. Reed
-
Patent number: 10114559Abstract: Provided are a computer program product, system, and method for generating node access information for a transaction accessing nodes of a data set index. Pages in the memory are allocated to internal nodes and leaf nodes of a tree data structure representing all or a portion of a data set index for the data set. A transaction is processed with respect to the data set that involves accessing the internal and leaf nodes in the tree data structure, wherein the transaction comprises a read or write operation. Node access information is generated in transaction information, for accessed nodes comprising nodes in the tree data structure accessed as part of processing the transaction. The node access information includes a pointer to the page allocated to the accessed node prior to the transaction in response to the node being modified during the transaction.Type: GrantFiled: August 12, 2016Date of Patent: October 30, 2018Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Derek L. Erdmann, David C. Reed, Thomas C. Reed, Max D. Smith
-
Patent number: 10101948Abstract: Provided are a computer program product, system, and method for an application to provide for, in one embodiment, using hierarchical storage management to respond to a request to delete a data set by migrating the data set to another storage tier in a storage system before deleting the data set from its current location. As a result, the data set is stored on another tier to provide an opportunity to reverse the decision to delete the data set. In one embodiment, a temporary interval of time is provided to reverse the deletion decision and restore the data set from the migrated data set, before the data set is permanently deleted.Type: GrantFiled: June 20, 2017Date of Patent: October 16, 2018Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Derek L. Erdmann, Franklin E. McCune, Miguel A. Perez
-
Publication number: 20180157432Abstract: A method for storing data includes establishing an extended generation group comprising a plurality of data sets. The plurality of data sets includes a first data set containing primary members and a first number of generations of each of the primary members, and a second data set containing a second number of generations of each of the primary members. The method further indicates, in the metadata of the first data set, a maximum number of generations allowable in each of the first and second data sets When a primary member is modified in the first data set, the method automatically moves an oldest generation in the first data set to the second data set, and deletes an oldest generation in the second data set to ensure that the extended generation group does not exceed the maximum number.Type: ApplicationFiled: February 2, 2018Publication date: June 7, 2018Applicant: International Business Machines CorporationInventors: Derek L. Erdmann, David C. Reed, Thomas C. Reed, Max D. Smith
-
Patent number: 9927989Abstract: A method for storing data includes establishing an extended generation group comprising a plurality of data sets. The plurality of data sets include a first data set containing primary members and a first number of generations of each of the primary members, and a second data set containing a second number of generations of each of the primary members. The first data set and the second data set are stored on different tiers of a tiered storage system, and may even be stored on different volumes. The first data set may be stored on higher performance storage media and the second data set may be stored on lower performance storage media. Additionally, the second number will typically be greater than the first number so that more generations are stored on lower performance storage media. A corresponding system and computer program product are also disclosed.Type: GrantFiled: November 1, 2015Date of Patent: March 27, 2018Assignee: International Business Machines CorporationInventors: Derek L. Erdmann, David C. Reed, Thomas C. Reed, Max D. Smith