Invention Grant
US09378305B1 Selecting pages implementing leaf nodes and internal nodes of a data set index for reuse
有权
选择实现叶节点和数据集索引的内部节点以重新使用的页面
- Patent Title: Selecting pages implementing leaf nodes and internal nodes of a data set index for reuse
- Patent Title (中): 选择实现叶节点和数据集索引的内部节点以重新使用的页面
-
Application No.: US15048683Application Date: 2016-02-19
-
Publication No.: US09378305B1Publication Date: 2016-06-28
- Inventor: Derek L. Erdmann , David C. Reed , Thomas C. Reed , Max D. Smith
- Applicant: International Business Machines Corporation
- Applicant Address: US NY Armonk
- Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
- Current Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
- Current Assignee Address: US NY Armonk
- Agency: Konrad Raynes Davda & Victor LLP
- Agent David W. Victor
- Main IPC: G06F17/30
- IPC: G06F17/30

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.
Public/Granted literature
- US20160170654A1 SELECTING PAGES IMPLEMENTING LEAF NODES AND INTERNAL NODES OF A DATA SET INDEX FOR REUSE Public/Granted day:2016-06-16
Information query