发明授权
US09305112B2 Select pages implementing leaf nodes and internal nodes of a data set index for reuse
有权
选择实现叶节点和数据集索引的内部节点以重新使用的页面
- 专利标题： Select pages implementing leaf nodes and internal nodes of a data set index for reuse
- 专利标题（中）： 选择实现叶节点和数据集索引的内部节点以重新使用的页面
-
申请号： US13619962申请日： 2012-09-14
-
公开(公告)号： US09305112B2公开(公告)日： 2016-04-05
- 发明人: Derek L. Erdmann , David C. Reed , Thomas C. Reed , Max D. Smith
- 申请人： Derek L. Erdmann , David C. Reed , Thomas C. Reed , Max D. Smith
- 申请人地址： US NY Armonk
- 专利权人： INTERNATIONAL BUSINESS MACHINES CORPORATION
- 当前专利权人： INTERNATIONAL BUSINESS MACHINES CORPORATION
- 当前专利权人地址： US NY Armonk
- 代理机构： Konrad Raynes Davda & Victor LLP
- 代理商 David W. Victor
- 主分类号： G06F13/00
- IPC分类号： G06F13/00 ; G06F13/28 ; G06F17/30
摘要：
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.
公开/授权文献
信息查询
