# US 2017/0286465 A1 · Data management for tenants

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2017/0286465 A1
- Document ID: US20170286465A1
- Status: Published application
- Kind: A1
- Application number: 15/507,227
- Filed: 2015-01-15
- Published: 2017-10-05
- Earliest claimed: 2014-11-01
- Assignees: Hewlett Packard Enterprise Development LP
- Applicants: Hewlett Packard Enterprise Development LP
- Inventors: Dinesh Venkatesh; Kishore Kumar M
- Web page: https://patentgrep.com/patent/US20170286465A1

## CPC

- G06F 16/2246: {Trees, e.g. B+trees}
- G06F 16/00: Information retrieval; Database structures therefor; File system structures therefor
- G06F 16/13: File access structures, e.g. distributed indices (arrangements of input from, or output to, record carriers G06F3/06)
- G06F 16/21: Design, administration or maintenance of databases
- G06F 16/22: Indexing; Data structures therefor; Storage structures
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## 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

### Claim 1

A storage system comprising:
a processor;
a data management module coupled to the processor to identify a management tree corresponding to a tenant, from among a plurality of tenants, the management tree being a namespace entity having with data management policies corresponding to the tenant, wherein each of the plurality of tenants is associated with a corresponding management tree; and
a storage module coupled to the processor to:
identify a storage tree corresponding to the management tree, the storage tree being mapped to a storage domain holding data pertaining to the tenant, wherein the storage tree is a namespace entity below which the data pertaining to the tenant is stored; and
determine the data management policies to be executed to manage the data in the storage domain, wherein the data management policies are defined by one of the management tree and the storage tree.

### Claim 2 (depends on 1)

The storage system as claimed in claim 1, wherein the storage tree corresponding to the plurality of tenants maps to the storage domain, wherein the data pertaining to the plurality of the tenants is stored in the storage domain.

### Claim 3 (depends on 1)

The storage system as claimed in claim 1, wherein the storage module to:
ascertain whether the storage tree includes additional data management policies;
determine, when the storage tree includes additional data management policies, whether the additional data management policies override the data management policies defined by the management tree, based on the policy overriding rules; and
execute the additional data management policies, based on the determining.

### Claim 4 (depends on 1)

The storage system as claimed in claim 1, wherein the data management module identifies a child management tree defining the data management policies corresponding to a unit of the tenant, when the tenant includes one or more units, and wherein the child management tree maps to the storage tree to store the data pertaining to the unit of the tenant.

### Claim 5 (depends on 1)

The storage system as claimed in claim 1, wherein the storage module manages the data in the storage domain, based on the data management policies defined by the management tree.

### Claim 6 (depends on 1)

The storage system as claimed in claim 1, wherein the storage system comprises a global namespace based scale out storage system.

### Claim 7 (depends on 6)

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

### Claim 8

A method comprising:
creating a management tree for each of the plurality tenants associated with a storage system, the management tree being associated with data management policies defining a manner in which data associated with a tenant is to be accessed and modified;
creating a storage tree mapping to the management tree, the storage tree being a namespace entity below which data pertaining to the tenant is stored; and
mapping the storage tree to a storage domain of the storage system, the storage domain holding the data pertaining to the tenant, wherein the data in the storage domain is managed based on the data management policies defined by one of the storage tree and the management tree.

### Claim 9 (depends on 8)

The method as claimed in claim 8, wherein the method further comprises:
ascertaining whether the data management policies specific to a unit of the tenant are defined by the tenant; and
creating a child management tree as a node of the management tree, when the data management policies specific to the unit are defined, wherein the storage tree maps to the child management tree.

### Claim 10 (depends on 8)

The method as claimed in claim 8, wherein the mapping further comprises selecting, based on storage attributes specified by the tenant, storage domain to be mapped to the storage tree.

### Claim 11 (depends on 8)

The method as claimed in claim 8, wherein the method further comprises:
ascertaining whether additional storage capacity is to be allocated to the tenant;
selecting, based on storage attributes specified by the tenant, a new storage domain to provide additional storage capacity; and
mapping the new storage domain to the storage tree to reflect capacity expansion.

### Claim 12

A non-transitory computer readable medium having a set of computer readable instructions that, when executed, cause a processor to
create a management tree corresponding to a tenant, from among a plurality of tenants supported by a storage system, the management tree being associated data management policies defined for the tenant, wherein the management tree branches to a storage tree to provide for capacity management;
associate at least one storage domain with the management tree, the at least one storage domain being selected based on storage attributes specified by the tenant; and
create a storage tree branching from the management tree to provide for capacity management, the storage tree being mapped to the at least one storage domain, wherein data in the at least one storage domain is managed based on the data management policies defined by the management tree.

### Claim 13 (depends on 12)

The non-transitory computer readable as claimed in claim 12, wherein the set of computer readable instructions, when executed, further cause the processor to manage data pertaining to the plurality of tenants in the at least one storage domain, when the storage tree of each of the plurality of tenants maps to the at least one storage domain.

### Claim 14 (depends on 12)

The non-transitory computer readable as claimed in claim 12, wherein the set of computer readable instructions, when executed, further cause the processor to identify, based on a parent-child mapping, a child management tree of the management tree, the child management tree defining the data management policies corresponding to a unit of the tenant, wherein the at least one storage domain is identified based on the storage tree corresponding to the child management tree.

### Claim 15 (depends on 12)

The non-transitory computer readable as claimed in claim 12, wherein the set of computer readable instructions, when executed, further cause the processor to:
ascertain whether the storage tree includes additional data management policies;
determine, when the storage tree includes additional data management policies, whether the additional data management policies override the data management policies defined by the management tree, based policy overriding rules; and
execute the additional data management policies, based on the determining.
