Method, apparatus, and computer program product for managing storage system

Patent metadata

Field	Value
Publication number	US-10984050-B2
Application number	US-201816236264-A
Country	US
Kind code	B2
Filing date	Dec 28, 2018
Priority date	Aug 3, 2018
Publication date	Apr 20, 2021
Grant date	Apr 20, 2021

Abstract

A method, apparatus and computer program product for managing a storage system are provided. For example, in a method, a tree index of the storage system is obtained, where a leaf node among multiple leaf nodes in the tree index comprising a keyword and an attribute of an object among multiple objects in the storage system. Respective attributes of nodes in a set of the multiple leaf nodes in the tree index are obtained, and the set of the multiple leaf nodes having a same parent node. The tree index is updated based on respective attributes of the leaf nodes in the set of the multiple leaf nodes. With the above example implementations, performance of the index of the storage system can be increased, and further overall response speed of the storage system can be improved. Further, there is provided an apparatus and computer program product for managing a storage system.

First claim

What is claimed is:

1. A method, comprising:
obtaining, by a system comprising a processor, a tree index of a storage system, a leaf node among multiple leaf nodes in the tree index comprising a keyword and an attribute of an object, represented by the keyword, of multiple objects in the storage system;
obtaining respective attributes of leaf nodes in a set of the multiple leaf nodes in the tree index, the set of the multiple leaf nodes having a parent node that is a same parent node;
updating the tree index based on the respective attributes of the leaf nodes in the set of the multiple leaf nodes; and
adding an abstract field to non-leaf nodes other than parent nodes in the tree index, wherein the abstract field comprises one or more attributes of one or more leaf nodes of a child tree that has a non-leaf node as a root node, wherein the one or more attributes comprise an owner of the object of the multiple objects represented by the keyword, and wherein the one or more attributes comprise a position of the object of the multiple objects represented by the keyword.

2. The method of claim 1 , wherein the abstract field is a first abstract field, and wherein the updating the tree index based on the respective attributes of the leaf nodes in the set of the multiple leaf nodes comprises:
adding a second abstract field to the parent node in the tree index;
determining statistical information based on the respective attributes of the leaf nodes in the set of the multiple leaf nodes, resulting in determined statistical information; and
adding the determined statistical information to the second abstract field.

3. The method of claim 2 , wherein the updating the tree index results in an updated tree index, and further comprising:
receiving a query request, the query request requesting that information of at least one object of the multiple objects matching a target attribute is to be looked up in the storage system; and
determining a result for the query request based on the determined statistical information in the abstract field in the updated tree index.

4. The method of claim 1 , wherein the tree index comprises multiple non-leaf nodes at multiple levels, the multiple non-leaf nodes describing sorting among respective keywords of the multiple objects;
wherein the obtaining the respective attributes of the leaf nodes in the set of the multiple leaf nodes in the tree index comprises:
determining a branch among multiple branches of the tree index according to the multiple levels, and
determining the set of the multiple leaf nodes in the branch, and
obtaining the respective attributes of the leaf nodes in the set of the multiple leaf nodes.

5. The method of claim 1 , wherein the updating the tree index results in an updated tree index, and further comprising: in response to receiving a delete request for deleting the object of the multiple objects with a target keyword from the storage system,
looking up a target leaf node of the set of the multiple leaf nodes associated with the target keyword in the updated tree index based on the target keyword;
updating the abstract field in the parent node of the target leaf node;
deleting information associated with the target leaf node from the updated tree index; and
deleting the object with the target keyword from the storage system.

6. The method of claim 1 , wherein the updating the tree index results in an updated tree index, and further comprising: in response to receiving an update request for updating the object of the multiple objects with a target keyword in the storage system,
looking up a target leaf node of the set of the multiple leaf nodes associated with the target keyword in the updated tree index based on the target keyword;
updating the abstract field in the parent node of the target leaf node based on a defined attribute specified by the update request;
updating the target leaf node based on the update request; and
updating the object with the target keyword in the storage system based on the update request.

7. The method of claim 1 , further comprising: in response to receiving an insert request for inserting a target object with a target keyword to the multiple objects of the storage system,
looking up a non-leaf node associated with the target keyword in the updated tree index as an insertion point based on the target keyword, a child node of the insertion point being one of the multiple leaf nodes;
determining a number of objects involved in child nodes of the insertion point; and
inserting the target object to the storage system based on the number of objects.

8. The method of claim 7 , wherein the inserting the target object to the storage system based on the number of objects comprises: in response to determining the number of objects has not reached a predefined maximum leaf node number,
adding one of the multiple leaf nodes to the insertion point, the one comprising a target object keyword and a target object attribute of the target object; and
updating the abstract field in the insertion point based on the target object attribute of the target object.

9. The method of claim 7 , and wherein the inserting the target object to the storage system based on the number of objects comprises: in response to determining the number of objects has reached a predefined maximum leaf node number,
performing tree splitting with respect to the insertion point so as to form a first leaf node and a second leaf node, wherein, after the tree splitting, neither of respective numbers of objects that are involved in respective leaf nodes of the first leaf node and the second leaf node reach the predefined maximum leaf node number;
adding a target object keyword and a first object attribute of the target object to the first leaf node; and
updating the abstract field of the parent node of the first leaf node and the second leaf node based on the first object attribute of the first leaf node and a second object attribute of the second leaf node, respectively.

10. An apparatus, comprising:
at least one processor;
a volatile memory; and
a memory coupled to the at least one processor and having instructions stored thereon, the instructions, when executed by the at least one processor, causing the apparatus to perform acts, comprising:
obtaining a tree index of the storage system, a leaf node among leaf nodes in the tree index comprising a keyword and an attribute of an object, represented by the keyword, of objects in the storage system;
obtaining respective attributes of leaf nodes in a set of the leaf nodes in the tree index, wherein a parent node of the set of the leaf nodes is a same parent node;
updating the tree index based on the respective attributes of the leaf nodes in the set of the leaf nodes, resulting in an updated tree index; and
adding an abstract field to non-leaf nodes other than parent nodes in the tree index, wherein the abstract field comprises an attribute of a leaf node of a child tree that has a non-leaf node as a root node, wherein the attribute comprises an owner of the object of the objects represented by the keyword, and wherein the attribute comprises a position of the object of the objects represented by the keyword.

11. The apparatus of claim 10 , wherein the updating the tree index based on the respective attributes of the leaf nodes in the set of the leaf nodes comprises:
adding an abstract field to the same parent node of the set of the leaf nodes in the tree index;
determining statistical information based on the respective attributes of the leaf nodes in the set of the leaf nodes; and
adding the statistical information to the abstract field.

12. The ap

Assignees

• Emc Ip Holding Co Llc

Inventors

• Lei Lu
• Sun Ao
• Wu Gary Jialei
• Teng Yu
• Sun Wesley Wei
• Chen Chun Xi Kenny

Classifications

• G06F3/0604

  Improving or facilitating administration, e.g. storage management · CPC title

• G06F3/061

  Improving I/O performance · CPC title

• G06F16/9038

  Presentation of query results · CPC title

• G06F3/064

  Management of blocks · CPC title

• G06F16/9027 Primary

  Trees · CPC title