| 发明名称 |
ACCELERATING OPERATIONS IN B+-TREE |
| 摘要 |
Methods and a system are provided for accelerating an operation in a B+-tree. A method including forming triplets, by a triplet manager. Each of the triplets includes a pointer to a leaf node, a lower bound of a key on the leaf node, and an upper bound of the key on the leaf node. The method further includes performing, by the triplet manager, a lookup operation on the triplets responsive to the operation to avoid traversals of intermediate nodes for the operation. The method also includes executing, by a processor, the operation in the B+-tree while avoiding the traversals of the intermediate nodes for the operation responsive to a result of the lookup operation. The operation is any one of an insertion operation, a deletion operation, and a search operation. |
| 申请公布号 |
US2017039231(A1) |
申请公布日期 |
2017.02.09 |
| 申请号 |
US201514819675 |
申请日期 |
2015.08.06 |
| 申请人 |
INTERNATIONAL BUSINESS MACHINES CORPORATION |
发明人 |
Ishizaki Kazuaki |
| 分类号 |
G06F17/30 |
主分类号 |
G06F17/30 |
| 代理机构 |
|
代理人 |
|
| 主权项 |
1. A method for accelerating an operation in a B+-tree, the method comprising:
forming triplets, by a d triplet manager, each of the triplets including a pointer to a leaf node, a lower bound of a key on the leaf node, and an upper bound of the key on the leaf node; performing, by the triplet manager, a lookup operation on the triplets responsive to the operation to avoid traversals of intermediate nodes for the operation; and executing, by a processor, the operation in the B+-tree while avoiding the traversals of the intermediate nodes for the operation responsive to a result of the lookup operation, wherein the operation is any one of an insertion operation, a deletion operation, and a search operation. |
| 地址 |
Armonk NY US |
