Multi-tenant Data Storage Policy Segmentation

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current multi-tenant data storage systems require preconfigured data distribution policies for each application scenario, leading to complexity in policy deployment and inflexibility in meeting varying tenant requirements.

Innovation Solution

A data storage method that uses a combination of first and second data distribution policies to dynamically determine the distribution of data across resource zones and nodes, allowing for flexible control of data placement based on tenant permissions and space availability, thereby reducing policy deployment complexity.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If a preconfigured data distribution policy is used for each application scenario, then the data distribution can be determined, but the policy deployment complexity increases

Engineering Contradiction:
Improvedata distribution flexibilityVSAvoidpolicy deployment complexity
Core Design Contradiction:
Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The patent segments the data distribution policy into two independent parts: a first data distribution policy for determining distribution across resource zones (RZs), and a second data distribution policy for determining distribution within nodes. This segmentation allows each policy to be configured independently, reducing the overall complexity while maintaining adaptability for different application scenarios

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent introduces dynamic selection mechanisms where the system can flexibly choose which first data distribution policy and second data distribution policy to apply based on the specific application scenario and tenant requirements. This dynamic approach enables the system to adapt to different scenarios without requiring preconfiguration of policies for every possible scenario

Inventive Principle:
Principle #15Dynamics

2Manufacturing precision

If multiple data distribution policies are preconfigured for different scenarios, then specific distribution results can be achieved, but the system becomes less flexible in meeting varying tenant requirements

Engineering Contradiction:
Improvedata distribution controlVSAvoidtenant requirement adaptability
Core Design Contradiction:
Manufacturing precisionVSAdaptability or versatility

Solution Approach 1:

The patent enables dynamic selection of data distribution policies based on tenant requirements and application scenarios. The system can flexibly combine different first data distribution policies (for RZ distribution) and second data distribution policies (for node distribution) to meet varying tenant needs, thereby maintaining both control precision and adaptability

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The patent allows changing the parameters of data distribution by selecting different policies for different scenarios. The first data distribution policy controls the distribution pattern across resource zones, while the second policy controls the distribution pattern within nodes, enabling flexible adjustment of distribution parameters to match tenant requirements

Inventive Principle:
Principle #35Parameter changes

Data Source

PatentEP3594798B1Data storage method and device
Publication Date: 2024.03.06 HUAWEI TECH CO LTD
  • EP3594798B1 patent drawingFigure 1~2
  • EP3594798B1 patent drawingFigure 3
  • EP3594798B1 patent drawingFigure 4~5

AI summary

Embodiments of this application provide a data storage method and apparatus. The method includes: receiving a data write request that is sent by a first tenant by using a client; determining, from a plurality of RZs and based on the data write request and storage permission of the first tenant for each of the plurality of resource zones RZs, at least one RZ available to the first tenant; determining, based on the data write request and a first data distribution policy, distribution of N duplicates in the at least one RZ; and storing, based on distribution of the N duplicates in the at least one RZ and a second data distribution policy, the N duplicates into at least one node corresponding to the at least one RZ. According to the data storage method and apparatus in the embodiments of this application, distribution of to-be-stored data of a tenant at a node can be flexibly controlled by using a combination of different data distribution policies, thereby reducing policy deployment complexity.