Selecting pages implementing leaf nodes and internal nodes of a data set index for reuse
First Claim
1. A computer program product for managing a data set stored in a storage in a memory, the computer program product comprising a non-transitory computer readable storage medium having computer readable program code embodied therein that executes to perform operations, the operations comprising:
- allocating pages in the memory 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;
maintaining a leaf node duration and an internal node duration, wherein the leaf node duration indicates an amount of time after which an unused page allocated to one of the leaf nodes is eligible for reuse and wherein the internal node duration indicates an amount of time after which an unused page allocated to one of the internal nodes is eligible for reuse, wherein the internal node duration comprises a greater temporal duration than the leaf node duration to cause the leaf nodes to be selected at a higher rate for reuse than the internal nodes; and
selecting 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 of the leaf node duration and the internal node duration, respectively, for reuse.
1 Assignment
0 Petitions
Accused Products
Abstract
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.
15 Citations
15 Claims
-
1. A computer program product for managing a data set stored in a storage in a memory, the computer program product comprising a non-transitory computer readable storage medium having computer readable program code embodied therein that executes to perform operations, the operations comprising:
-
allocating pages in the memory 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; maintaining a leaf node duration and an internal node duration, wherein the leaf node duration indicates an amount of time after which an unused page allocated to one of the leaf nodes is eligible for reuse and wherein the internal node duration indicates an amount of time after which an unused page allocated to one of the internal nodes is eligible for reuse, wherein the internal node duration comprises a greater temporal duration than the leaf node duration to cause the leaf nodes to be selected at a higher rate for reuse than the internal nodes; and selecting 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 of the leaf node duration and the internal node duration, respectively, for reuse. - View Dependent Claims (2, 3, 4, 5)
-
-
6. A system for managing a data set stored in a storage, comprising:
-
a processor; a memory; a computer readable storage medium having code executed by the processor to perform operations, the operations comprising; allocating pages in the memory 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; maintaining a leaf node duration and an internal node duration, wherein the leaf node duration indicates an amount of time after which an unused page allocated to one of the leaf nodes is eligible for reuse and wherein the internal node duration indicates an amount of time after which an unused page allocated to one of the internal nodes is eligible for reuse, wherein the internal node duration comprises a greater temporal duration than the leaf node duration to cause the leaf nodes to be selected at a higher rate for reuse than the internal nodes; and selecting 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 of the leaf node duration and the internal node duration, respectively, for reuse. - View Dependent Claims (7, 8, 9, 10)
-
-
11. A method, comprising:
-
allocating pages in a memory to internal nodes and leaf nodes of a tree data structure in a non-transitory computer readable storage medium representing all or a portion of a data set index for a data set; maintaining a leaf node duration and an internal node duration, wherein the leaf node duration indicates an amount of time after which an unused page allocated to one of the leaf nodes is eligible for reuse and wherein the internal node duration indicates an amount of time after which an unused page allocated to one of the internal nodes is eligible for reuse, wherein the internal node duration comprises a greater temporal duration than the leaf node duration to cause the leaf nodes to be selected at a higher rate for reuse than the internal nodes; and selecting 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 of the leaf node duration and the internal node duration, respectively, for reuse. - View Dependent Claims (12, 13, 14, 15)
-
Specification