Data management for tenants

• US 10,339,123 B2
• Filed: 01/15/2015
• Issued: 07/02/2019
• Est. Priority Date: 11/01/2014
• Status: Active Grant

• Current Assignee: Hewlett Packard Enterprise Development LP (Hewlett-Packard Enterprise Company)
• Original Assignee: Hewlett Packard Enterprise Development LP (Hewlett-Packard Enterprise Company)
• Inventors: Venkatesh, Dinesh, M, Kishore Kumar
• Primary Examiner(s): Boccio, Vincent F
• Application Number:
  US15/507,227
• Publication Number:
  US 20170286465A1
• Time in Patent Office: 1,629 Days
• Field of Search: 707812
• CPC Class Codes: G06F 16/00 Information retrieval; Database structures therefor; File system structures therefor
• CPC Class Codes: G06F 16/13 File access structures, e.g. distributed indices arrangements of input from, or output to, record carriers G06F3/06
• CPC Class Codes: G06F 16/21 Design, administration or maintenance of databases
• CPC Class Codes: G06F 16/22 Indexing; Data structures therefor; Storage structures
• CPC Class Codes: G06F 16/2246 Trees, e.g. B+trees

Abstract

Examples of data management for tenants are described herein. In an example, a storage system includes a management tree for each of a plurality of tenants associated with the storage system. The management tree includes data management policies defined by the tenant. Further, the management tree includes a storage tree, which is mapped to a storage domain. The storage domain may hold data pertaining to the tenant. The data may be managed based on the data management policies defined by one of the management tree and the storage tree.

Claims

1. A storage system comprising:

a processor; and

a non-transitory storage medium storing data management instructions and storage instructions, the data management instructions executable on the processor to;

responsive to an access request from a first tenant of a plurality of tenants, access a namespace hierarchical structure comprising a plurality of management trees associated with respective tenants of the plurality of tenants, and

identify a first management tree, corresponding to the first tenant, from among the plurality of management tree, the first management tree being a namespace entity in the namespace hierarchical structure and having data management policies corresponding to the first tenant, wherein the namespace hierarchical structure further comprises storage trees mapped to respective management trees of the plurality of management trees; and

the storage instructions executable on the processor to;

identify a first storage tree corresponding to the first management tree, the first storage tree being one of the storage trees, wherein the first storage tree is a namespace entity in the namespace hierarchical instructions, the first storage tree providing for storage capacity management based on storage domains mapped to the first storage tree, the storage domains to store data of the first tenant, and

for the access request, execute a data management policy to manage data in a storage domain of the storage domains mapped to the first storage tree, wherein the data management policy is defined by one of the first management tree and the first storage tree.

2. The storage system of claim 1, wherein the storage instructions are executable on the processor to:

ascertain whether the first storage tree includes an additional data management policy;

in response to the first storage tree including the additional data management policy, determine whether the additional data management policy overrides a data management policy defined by the first management tree, based on a policy overriding rule; and

execute the additional data management policy to process the access request, based on the determining.

3. The storage system of claim 1, wherein the storage system comprises a global namespace based scale out storage system.

4. The storage system of claim 3, wherein each of the first management tree and the first storage tree is provided as a directory in a global namespace.

5. The storage system of claim 1, wherein the access request comprises an identifier of the first tenant, and wherein identifying the first management tree from among the plurality of management trees is based on the identifier of the first tenant.

6. The storage system of claim 1, wherein the storage domains are mapped to the first storage tree based on storage attributes defined by the first management tree.

7. The storage system of claim 1, wherein the namespace hierarchical structure further comprises child management trees that are linked to the first management tree, the child management trees associated with different units of the first tenant, and wherein the data management instructions are executable on the processor to:

select a child management tree of the child management trees based on a unit identifier that identifies a unit of the first tenant, the selected child management tree comprising a further data management policy for the identified unit of the first tenant to be applied in processing the access request.

8. The storage system of claim 1, further comprising administrative instructions executable on the processor to:

in response to detecting that the first tenant has exhausted a storage capacity of the first storage tree, allocate additional storage capacity to the first tenant by selecting an additional storage domain, and mapping the additional storage domain to the first storage tree in the namespace hierarchical structure.

9. The storage system of claim 8, wherein the administrative instructions are executable on the processor to:

select the additional storage domain based on storage attributes specified by the first data management tree.

10. A method performed by a system comprising a hardware processor, comprising:

creating a respective management tree for each of a plurality of tenants, the management trees being part of a namespace hierarchical structure associated with a storage system, each management tree of the management trees being associated with data management policies defining a manner in which data associated with a respective tenant is to be accessed and modified;

creating storage trees linked to the management trees in the namespace hierarchical structure, each storage tree of the storage trees being a namespace entity of the namespace hierarchical structure and below which data pertaining to the respective tenant is stored; and

mapping, in the namespace hierarchical structure, a first storage tree of the storage trees to storage domains of the storage system, the storage domains holding data pertaining to a first tenant, wherein the first storage tree provides for storage capacity management based on the storage domains mapped to the first storage tree;

in response to an access request from the first tenant, identifying a first management tree of the first management trees;

identifying the first storage tree that is linked to the first management tree; and

executing a data management policy as part of processing the access request, the data management policy that is executed specified by the first management tree or the first storage tree.

11. The method of claim 10, comprising:

determining whether a unit-wise data management policy specific to a unit of the first tenant is defined by the first tenant; and

creating a child management tree as a node of the first management tree, in response to determining that the unit-wise data management policy specific to the unit is defined, wherein the first storage tree maps to the child management tree in the namespace hierarchical structure.

12. The method of claim 10, wherein the mapping comprises selecting, based on storage attributes specified by the first tenant, the storage domains to be mapped to the first storage tree.

13. The method of claim 10, wherein further comprising:

ascertaining whether an additional storage capacity is to be allocated to the first tenant;

selecting, based on storage attributes specified by the first tenant, a new storage domain to provide the additional storage capacity; and

mapping the new storage domain to the first storage tree for capacity expansion.

14. A non-transitory computer readable medium comprising instructions that, when executed, cause a system to:

provide a namespace hierarchical structure comprising a plurality of management trees associated with respective tenants of a plurality of tenants, each management tree of the plurality of management trees comprising data management policies for a storage system, and wherein the namespace hierarchical structure further comprises storage trees mapped to respective management trees of the plurality of management trees, the storage trees to provide storage capacity management for respective tenants of the plurality of tenants;

in response to an access request from a first tenant, identify a first management tree, corresponding to the first tenant, from among the plurality of management trees;

as part of processing the access request, identify a first storage tree of the storage trees, the first storage tree corresponding to the first management tree, and wherein the first storage tree provides for storage capacity management based on storage domains mapped to the first storage tree, the storage domains to store data of the first tenant; and

execute a data management policy to manage data in a storage domain of the storage domains mapped to the first storage tree, the data management policy defined by the first data management tree or the first storage tree.

15. The non-transitory computer readable of claim 14, wherein the instructions, when executed, further cause the system to identify, based on a parent-child mapping, a child management tree of the first management tree, the child management tree defining a unit-wise data management policy corresponding to a unit of the first tenant.

16. The non-transitory computer readable of claim 14, wherein the instructions, when executed, further cause the system to:

ascertain whether the first storage tree includes an additional data management policy;

in response to the first storage tree including the additional data management policy, determine whether the additional data management policy overrides a data management policy defined by the first management tree, based on a policy overriding rule; and

execute the additional data management policy, based on the determining.

17. The non-transitory computer readable medium of claim 14, wherein the access request comprises an identifier of the first tenant, and wherein identifying the first management tree from among the plurality of management trees is based on the identifier of the first tenant.

18. The non-transitory computer readable medium of claim 14, wherein the storage domains are mapped to the first storage tree based on storage attributes defined by the first management tree.

19. The non-transitory computer readable medium of claim 14, wherein the instructions, when executed, further cause the system to:

in response to detecting that the first tenant has exhausted a storage capacity of the first storage tree, allocate additional storage capacity to the first tenant by selecting an additional storage domain, and mapping the additional storage domain to the first storage tree in the namespace hierarchical structure.

20. The non-transitory computer readable medium of claim 19, wherein the instructions, when executed, further cause the system to:

select the additional storage domain based on storage attributes specified by the first data management tree.