Select 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, wherein the leaf nodes include information on members of the data set, wherein the internal nodes include one or more keys used to traverse the tree data structure to reach the leaf nodes that are used to access the members of the data set;
selecting at least one page allocated to the leaf nodes and the internal nodes based on durations during which the allocated pages have not been used, wherein pages allocated to the leaf nodes are selected for reuse at a higher rate than the pages allocated to the internal nodes; and
indicating the selected at least one page as available for reuse to store data for a data set member or as a node in the data set index.
0 Assignments
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, wherein the leaf nodes include information on members of the data set. The internal nodes include one or more keys used to traverse the tree data structure to reach the leaf nodes to access the members of the data set. At least one page allocated to the leaf nodes and the internal nodes is selected based on durations during which the allocated pages have not been used. Pages allocated to the leaf nodes are selected for reuse at a higher rate than the pages allocated to the internal nodes.
13 Citations
25 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, wherein the leaf nodes include information on members of the data set, wherein the internal nodes include one or more keys used to traverse the tree data structure to reach the leaf nodes that are used to access the members of the data set; selecting at least one page allocated to the leaf nodes and the internal nodes based on durations during which the allocated pages have not been used, wherein pages allocated to the leaf nodes are selected for reuse at a higher rate than the pages allocated to the internal nodes; and indicating the selected at least one page as available for reuse to store data for a data set member or as a node in the data set index. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. 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, wherein the leaf nodes include information on members of the data set, wherein the internal nodes include one or more keys used to traverse the tree data structure to reach the leaf nodes that are used to access the members of the data set; selecting at least one page allocated to the leaf nodes and the internal nodes based on durations during which the allocated pages have not been used, wherein pages allocated to the leaf nodes are selected for reuse at a higher rate than the pages allocated to the internal nodes; and indicating the selected at least one page as available for reuse to store data for a data set member or as a node in the data set index. - View Dependent Claims (11, 12, 13, 14, 15, 16, 17)
-
-
18. A method, comprising:
-
allocating pages in a memory to internal nodes and leaf nodes of a tree data structure representing all or a portion of a data set index for a data set in storage, wherein the leaf nodes include information on members of the data set, wherein the internal nodes include one or more keys used to traverse the tree data structure to reach the leaf nodes that are used to access the members of the data set; selecting at least one page allocated to the leaf nodes and the internal nodes based on durations during which the allocated pages have not been used, wherein pages allocated to the leaf nodes are selected for reuse at a higher rate than the pages allocated to the internal nodes; and indicating the selected at least one page as available for reuse to store data for a data set member or as a node in the data set index. - View Dependent Claims (19, 20, 21, 22, 23, 24, 25)
-
Specification