Data storage method, device, equipment and storage medium

By dividing the storage space into multiple sub-storage spaces and decomposing the data, determining the target sub-storage space, the problem of data protection in the existing technology cannot be solved throughout the life cycle of sensitive data, and the full life cycle security of data is achieved and reliability, and reduce maintenance costs and improve efficiency.

CN113535067BActive Publication Date: 2024-11-08CHINA MOBILE INFORMATION TECHNOLOGY CO LTD +1
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202010317023.0
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2020-04-21
Publication Date
2024-11-08
Estimated Expiration
2040-04-21

AI Technical Summary

Technical Problem

The prior art cannot achieve data protection throughout the life cycle of sensitive data, and the later maintenance costs are high and inefficient.

Method used

By dividing the storage space, multiple sub-storage spaces are generated, the data to be stored is decomposed and the target sub-storage space is determined, ensuring the security of the data throughout the life cycle, and data protection is started from storage.

Benefits of technology

It realizes data protection throughout the entire life cycle, improves data security and reliability, and simplifies post-maintenance, avoids data leakage, reduces maintenance costs and improves operational efficiency.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN113535067B_ABST
    Figure CN113535067B_ABST
Patent Text Reader

Abstract

The embodiment of the present invention discloses a data storage method, device, equipment and storage medium. The method includes: dividing a first storage space to obtain multiple sub-storage spaces; when the first storage space receives data to be stored, decomposing the data according to the data and the multiple sub-storage spaces, and determining a target sub-storage space, wherein the target sub-storage space is at least one sub-storage space among the multiple sub-storage spaces; storing the decomposed data in the target sub-storage space. The embodiment of the present invention divides the storage space and performs data storage for data in the transmission state, thereby ensuring the security of the data during the transmission process, thereby realizing data protection throughout the entire life cycle of the data and improving data security.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of data security, and in particular to a data storage method, device, equipment and storage medium. Background Art

[0002] With the development of information technology and the Internet industry, users' demand for the security of information systems is increasing day by day. When the information managed by information systems continues to increase, the importance of data security has gradually become prominent. How information systems can prevent sensitive data from being leaked has become an important issue that information systems need to consider.

[0003] However, current technologies are unable to protect sensitive data throughout its entire life cycle. Summary of the invention

[0004] The embodiments of the present invention provide a data storage method, apparatus, device and storage medium, which store data in a transmission state, ensure the security of the data during the transmission process, thereby realizing data protection throughout the entire life cycle of the data and improving data security.

[0005] In a first aspect, a data storage method is provided, the method comprising:

[0006] Dividing the first storage space to obtain a plurality of sub-storage spaces;

[0007] When the first storage space receives data to be stored, the first storage space decomposes the data according to the data and the multiple sub-storage spaces, and determines a target sub-storage space, wherein the target sub-storage space is at least one sub-storage space among the multiple sub-storage spaces;

[0008] Store the decomposed data into the target sub-storage space.

[0009] In some implementations of the first aspect, decomposing data according to the data and the multiple sub-storage spaces includes:

[0010] The data is decomposed according to the data and the multiple sub-storage spaces, and decomposition identification information corresponding to the data is generated, and the decomposition identification information is used to restore the decomposed data.

[0011] In some implementations of the first aspect, determining the target sub-storage space includes:

[0012] At least one sub-storage space that meets a preset threshold is determined as a target sub-storage space, wherein the preset threshold is greater than a data block size of the decomposed data.

[0013] In some implementations of the first aspect, determining at least one sub-storage space that meets a preset threshold as a target sub-storage space includes:

[0014] A target sub-storage space is determined according to at least one sub-storage space that meets a preset threshold and an evaluation value between at least one sub-storage space that meets a preset threshold.

[0015] In some implementations of the first aspect,

[0016] The evaluation value is determined according to the first distance and the second distance between at least one sub-storage space that meets the preset threshold, and satisfies the formula:

[0017] Q=a∑ N G i +b∑ N H i

[0018] Among them, Q is the evaluation value, G i is the first distance between at least one sub-storage space, H i is the second distance between at least one sub-storage space, a is the weight of the first distance in the evaluation value Q, b is the weight of the second distance in the evaluation value Q, and N is the number of sub-storage spaces.

[0019] In a second aspect, a data storage device is provided, the device comprising:

[0020] A processing module, used for dividing the first storage space into a plurality of sub-storage spaces;

[0021] The processing module is further used to decompose the data according to the data and the multiple sub-storage spaces when the first storage space receives the data to be stored, and determine a target sub-storage space, wherein the target sub-storage space is at least one sub-storage space among the multiple sub-storage spaces;

[0022] The processing module is also used to store the decomposed data into the target sub-storage space.

[0023] In some implementations of the second aspect,

[0024] The processing module is also used to decompose the data according to the data and the multiple sub-storage spaces, and generate decomposition identification information corresponding to the data, and the decomposition identification information is used to restore the decomposed data.

[0025] In some implementations of the second aspect,

[0026] The processing module is further used to determine at least one sub-storage space that meets a preset threshold as a target sub-storage space, wherein the preset threshold is greater than the data block size of the decomposed data.

[0027] In some implementations of the second aspect,

[0028] The processing module is further used to determine the target sub-storage space according to at least one sub-storage space that meets the preset threshold and the evaluation value between at least one sub-storage space that meets the preset threshold.

[0029] In some implementations of the second aspect,

[0030] The evaluation value is determined according to the first distance and the second distance between at least one sub-storage space that meets the preset threshold, and satisfies the formula:

[0031] Q=a∑ N G i +b∑ N H i

[0032] Among them, Q is the evaluation value, G i is the first distance between at least one sub-storage space, H i is the second distance between at least one sub-storage space, a is the weight of the first distance in the evaluation value Q, b is the weight of the second distance in the evaluation value Q, and N is the number of sub-storage spaces.

[0033] In a third aspect, a data storage device is provided, the device comprising: a processor and a memory storing computer program instructions;

[0034] The processor implements the first aspect and the data storage method in some implementations of the first aspect when executing computer program instructions.

[0035] In a fourth aspect, a computer storage medium is provided, on which computer program instructions are stored. When the computer program instructions are executed by a processor, the first aspect and the data storage method in some implementations of the first aspect are implemented.

[0036] The embodiments of the present invention provide a data storage method, apparatus, device and storage medium, which divide a first storage space into multiple sub-storage spaces, decompose the data to be stored and determine the target sub-storage space based on the divided multiple sub-storage spaces, and store the data to be stored in the target sub-storage space. During the life cycle of the data, data protection is performed starting from storage, so that even if a small-scale leakage occurs in subsequent transmission, it will not cause data leakage, thereby achieving data protection throughout the entire life cycle of the data, improving the security and reliability of the data, and simplifying the subsequent maintenance. This solves the problem that the prior art only protects against data leakage in the transmission state, but cannot protect data throughout the entire life cycle of the data, and has high subsequent maintenance costs and low efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

[0037] In order to more clearly illustrate the technical solution of the embodiment of the present invention, the following briefly introduces the drawings required for use in the embodiment of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0038] Figure 1 is an interactive schematic diagram of a data storage method provided by an embodiment of the present invention;

[0039] Figure 2 It is a flow chart of a data storage method provided by an embodiment of the present invention;

[0040] Figure 3 is an interactive schematic diagram of a data transmission method provided by an embodiment of the present invention;

[0041] Figure 4 is a structural schematic diagram of a data storage device provided by an embodiment of the present invention;

[0042] Figure 5 It is a structural diagram of an exemplary hardware architecture of a computing device provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0043] The features and exemplary embodiments of various aspects of the present invention will be described in detail below. In order to make the purpose, technical solutions and advantages of the present invention clearer, the present invention will be further described in detail below in conjunction with the accompanying drawings and Examples. It should be understood that the specific embodiments described herein are only configured to explain the present invention and are not configured to limit the present invention. For those skilled in the art, the present invention can be implemented without the need for some of these specific details. The following description of the embodiments is only to provide a better understanding of the present invention by illustrating examples of the present invention.

[0044] It should be noted that, in this article, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, the elements defined by the statement "include..." do not exclude the presence of other identical elements in the process, method, article or device including the elements.

[0045] At present, with the development of information technology and the Internet industry, users' demand for information system security is increasing day by day. As the amount of information managed by information systems continues to increase, the importance of data security has gradually become prominent. How information systems can prevent sensitive data from being leaked has become one of the important issues that information systems need to consider.

[0046] Sensitive data, also known as privacy data, may include name information, ID number information, address information, telephone information, bank account information, email information, password information, medical information, educational background information, etc.

[0047] At present, the existing methods are limited to leakage in the transmission state, but cannot protect sensitive data throughout the entire life cycle of sensitive data, and there are still problems such as high development and maintenance costs and low operating efficiency. Among them, the life cycle can include transmission and storage.

[0048] In summary, existing technical solutions have the problem of being unable to protect sensitive data throughout its entire life cycle, and having high subsequent maintenance costs and low efficiency.

[0049] In order to solve the problems in the existing technical solutions that data protection cannot be performed throughout the entire life cycle of sensitive data, and the maintenance cost is high and the efficiency is low, the embodiments of the present invention provide a data storage method, device, equipment and storage medium, which divides a first storage space into multiple sub-storage spaces, combines the multiple divided sub-storage spaces, decomposes the data to be stored and determines the target sub-storage space, and stores the data to be stored in the target sub-storage space. During the life cycle of the data, sensitive data protection is performed starting from storage, so that even if a small-scale leakage occurs in subsequent transmission, it will not cause data leakage, and data protection is achieved throughout the entire life cycle of the data, thereby improving the security and reliability of the data, and simplifying the subsequent maintenance. This solves the problem that the prior art only protects against sensitive data leakage in the transmission state, but cannot protect data throughout the entire life cycle of the sensitive data, and has high subsequent maintenance costs and low efficiency.

[0050] The embodiment of the present invention provides a data storage method, device, equipment and storage medium. The technical solution provided by the embodiment of the present invention is described below in conjunction with the accompanying drawings.

[0051] Figure 1It is an interactive schematic diagram of a data storage method provided by an embodiment of the present invention. In an embodiment of the present invention, the intermediate platform may include a security level interval and a non-security level interval. When data is sent from the security level interval to the non-security level interval through a security level gateway, because data storage in the non-security level interval is relatively unsafe, data leakage problems often occur in the storage link. Therefore, an embodiment of the present invention provides a data storage method, device, equipment and storage medium, which divides the storage space for the non-security level interval of the intermediate platform, and decomposes and stores data according to the divided non-security level interval. In an embodiment of the present invention, the non-security level area can be called the first storage space, and the security level interval can be called the second storage space.

[0052] In addition, using a security-level gateway to place the part of the intermediate platform where leakage may occur in a non-security-level area can also help increase the controllability of data leakage.

[0053] Figure 2 It is a flowchart of a data storage method provided by an embodiment of the present invention.

[0054] like Figure 2 As shown, the execution subject of the method is a data storage device, and the data storage method may include:

[0055] S101: Divide a first storage space into multiple sub-storage spaces.

[0056] Specifically, the first storage space is divided into multiple sub-storage spaces, wherein the first storage space is Figure 1 The non-security level area of ​​the middle platform.

[0057] To ensure that the sub-storage space can store data securely, optionally, in one embodiment, the storage space in the non-security level interval may be divided into a plurality of mutually isolated sub-storage spaces. Furthermore, the size of the sub-storage space mentioned here may be smaller than the size of the received data.

[0058] In order to more clearly represent the sub-storage space, optionally, in one embodiment, the size of a storage space is defined as M i ; Multiple sub-storage spaces can use the collection {M 1 , M 2 , …, M i , …, M n}, where n can be the number of sub-storage spaces.

[0059] S102: When the first storage space receives data to be stored, the first storage space decomposes the data according to the data and a plurality of sub-storage spaces, and determines a target sub-storage space.

[0060] The target sub-storage space may be at least one sub-storage space among the multiple sub-storage spaces, or may be at least two sub-storage spaces.

[0061] In order to improve the security of the data itself, that is, it can also mean to improve the security of sensitive data itself, when decomposing the data according to the data and multiple sub-storage spaces, decomposition identification information corresponding to the data can be generated, and the decomposition identification information is used to restore the decomposed data to achieve the security of the data itself.

[0062] Optionally, in one embodiment, when decomposing data and multiple sub-storage space data, a dictionary corresponding to the data can be generated at the same time. The dictionary will provide specific information of the data decomposition and can be provided to a reading device so that the reading device can restore the data according to the dictionary, thereby enhancing the security of the data itself.

[0063] Because after the data is decomposed and a dictionary is generated, the party that obtains the data needs to obtain the dictionary corresponding to the data before it can fully obtain the information, so it is helpful to improve the security of the data itself.

[0064] In order to make the calculation of the sub-storage space easier, a sequence list can be generated in the first storage space, that is, the non-safe interval, and the sequence list can include the sub-storage space information. Specifically, the sub-storage space information can include the serial number, the sub-storage space size, and the logical distance and physical distance between the sub-storage spaces. In the sequence list, the storage space can be sorted according to the storage size of the sub-storage space, and this sorting can be in reverse order or in order.

[0065] When determining the target sub-storage space, in order to make the determined sub-storage space sufficient to decompose the received data, it is also possible to determine that a preset threshold is met, that is, at least one sub-storage space that satisfies a safety threshold P is determined as the target sub-storage space, wherein the preset threshold is greater than the data block size of the decomposed data. The at least one sub-storage space that satisfies the preset threshold may be a set of sub-storage spaces that are smaller than a certain storage size in the sequence table. In addition, based on the generated sequence table, a set of sub-storage spaces that are smaller than a certain storage size may be quickly determined.

[0066] Optionally, in one embodiment, a safety threshold P may be introduced. When the decomposed data block is smaller than the safety threshold P, the storage method is considered safe. The data block size in a safe situation may satisfy formula (1):

[0067]

[0068] Among them, P is the preset safety threshold, M 0 Receive the size of the data to be stored, M i The size of a sub-storage space.

[0069] The sub-storage space is judged using the security threshold P, and the storage space is evaluated according to the security threshold P. The sub-storage spaces that pass the evaluation form a set M, wherein the set M can actually be regarded as a set of storage spaces that are smaller than a certain storage size in the sequence table. At this time, the sub-storage space set M obtained has met the requirements of the decomposed data in size, so that the data to be stored can be successfully decomposed and decomposed into a safe form.

[0070] The sub-storage space included in the sub-storage space set M after evaluation and selection is a sub-storage space with a small storage capacity. When each sub-storage space leaks separately, it is impossible to obtain complete information from a sub-storage space, thereby improving the security and reliability of the data platform, and the storage space with a small storage capacity is beneficial to the life cycle of sensitive data, especially for the destruction and sharing of sensitive data. If combined with a dictionary, when sensitive data is leaked, the party that obtains the sensitive data needs to obtain not only the data of all storage spaces corresponding to a sensitive data, but also the dictionary, in order to fully obtain the sensitive data, further improving the security of the data.

[0071] After obtaining the evaluated sub-storage space set M whose size meets the safety threshold P, the evaluated sub-storage space set M may be further screened to obtain a sub-storage space set that meets both safety and efficiency requirements.

[0072] That is, the target sub-storage space is determined according to at least one sub-storage space that meets the preset threshold and the evaluation value between at least one sub-storage space that meets the preset threshold.

[0073] Optionally, in one embodiment, the evaluation value Q of the sub-storage space set may be defined by formula (2):

[0074] Q=a∑ N G i +b∑ N H i (2)

[0075] Among them, Q is the evaluation value of the sub-storage space set, G i It can be the logical distance between the sub-storage spaces in the multiple sub-storage spaces, that is, the first distance, H i It can be the physical distance between the sub-storage spaces in the multiple sub-storage spaces, that is, the second distance, a is the weight of the logical distance in the evaluation value Q, b is the weight of the physical distance in the evaluation value Q, and N is the number of sub-storage spaces.

[0076] After determining the evaluation value Q of the sub-storage space set, the sub-storage space set corresponding to the evaluation value Q that meets the preset condition can be selected as the target sub-storage space. The preset condition can be adjusted according to actual conditions, and the maximum value of the evaluation value Q can be selected as the preset condition.

[0077] The set of sub-storage spaces that meet the evaluation value Q maintains a balance between the logical distance and the physical distance between the sub-storage spaces, increases the difficulty of maliciously acquiring the entire set of sub-storage spaces, and further improves data security.

[0078] Then, the received data to be stored is decomposed according to the determined target sub-storage space and then stored, that is,

[0079] S103: Storing the decomposed data into the target sub-storage space.

[0080] This completes the process of storing the decomposed data.

[0081] Figure 1 The data storage method in the data storage system divides the storage space and protects sensitive data from the storage point of view, so that even if a small-scale leakage occurs during subsequent transmission, it will not cause data leakage, thus realizing data protection throughout the entire life cycle of the data and improving the security and reliability of the data.

[0082] Figure 3 FIG. 1 is an interactive schematic diagram of a data transmission method provided by an embodiment of the present invention. Figure 3 As shown in the figure, when the front-end platform needs to request data from the back-end platform, the front-end platform sends a request to the back-end platform through the middle platform. The data generated by the back-end platform according to the request is first sent to the security level section of the middle platform. The security level section then sends the data to the non-security level section through the gateway. The non-security level section is based on Figure 2 The data storage method shown in decomposes and stores the data, and then sends it to the front-end platform that requests the data, completing a complete data transmission process.

[0083] The data storage method provided by the embodiment of the present invention obtains multiple sub-storage spaces by dividing a first storage space, decomposes the data to be stored and determines the target sub-storage space based on the multiple divided sub-storage spaces, and stores the data to be stored in the target sub-storage space. During the life cycle of the data, sensitive data protection is performed starting from storage, so that even if a small-scale leakage occurs in subsequent transmission, it will not cause data leakage, thereby achieving data protection throughout the entire life cycle of the data, improving the security and reliability of the data, and simplifying the subsequent maintenance. This solves the problem in the prior art that only sensitive data leakage in the transmission state is targeted, but data protection cannot be performed throughout the entire life cycle of the sensitive data, and the subsequent maintenance cost is high and the efficiency is low.

[0084] Corresponding to the embodiment of the data storage method, the embodiment of the present invention further provides a data storage device.

[0085] Figure 4 Schematic diagram of a data storage device provided by an embodiment of the present invention. Figure 4 As shown, the optimization device of the object detection model may include: a processing module 201 and a storage module 202, wherein:

[0086] Processing module 201, used for dividing the first storage space into multiple sub-storage spaces;

[0087] The processing module 201 is further used to decompose the data according to the data and the multiple sub-storage spaces and determine a target sub-storage space when the first storage space receives data to be stored, wherein the target sub-storage space is at least one sub-storage space among the multiple sub-storage spaces.

[0088] The processing module 201 is further used to store the decomposed data into the target sub-storage space.

[0089] The storage module 202 is used to store the decomposed data.

[0090] The processing module 201 is further used to decompose the data according to the data and the multiple sub-storage spaces, and generate decomposition identification information corresponding to the data, and the decomposition identification information is used to restore the decomposed data.

[0091] The processing module 201 is further used to determine at least one sub-storage space that meets a preset threshold as a target sub-storage space, wherein the preset threshold is greater than a data block size of the decomposed data.

[0092] The processing module 201 is further configured to determine a target sub-storage space according to at least one sub-storage space that meets a preset threshold and an evaluation value between at least one sub-storage space that meets a preset threshold.

[0093] The evaluation value is determined according to the first distance and the second distance between at least one sub-storage space that meets the preset threshold, and satisfies the formula:

[0094] Q=a∑ N G i +b∑ N H i

[0095] Among them, Q is the evaluation value, G i is the first distance between at least one sub-storage space, H iis the second distance between at least one sub-storage space, a is the weight of the first distance in the evaluation value Q, b is the weight of the second distance in the evaluation value Q, and N is the number of sub-storage spaces.

[0096] The data storage device provided by the embodiment of the present invention obtains multiple sub-storage spaces by dividing a first storage space, and decomposes the data to be stored and determines the target sub-storage space based on the multiple divided sub-storage spaces, and stores the data to be stored in the target sub-storage space. During the life cycle of the data, sensitive data protection is performed starting from storage, so that even if a small-scale leakage occurs in subsequent transmission, it will not cause data leakage, thereby achieving data protection throughout the entire life cycle of the data, improving the security and reliability of the data, and simplifying the subsequent maintenance. This solves the problem in the prior art that only sensitive data leakage in the transmission state is targeted, but data protection cannot be performed throughout the entire life cycle of the sensitive data, and the subsequent maintenance cost is high and the efficiency is low.

[0097] Figure 5 FIG. 1 is a block diagram of an exemplary hardware architecture of a computing device capable of implementing the data storage method of an embodiment of the present invention. Figure 5 As shown, the computing device 300 includes an input device 301, an input interface 302, a central processing unit 303, a memory 304, an output interface 305, and an output device 306. The input interface 302, the central processing unit 303, the memory 304, and the output interface 305 are connected to each other via a bus 310, and the input device 301 and the output device 306 are connected to the bus 310 via the input interface 302 and the output interface 305, respectively, and are further connected to other components of the computing device 300.

[0098] Specifically, the input device 301 receives input information from the outside and transmits the input information to the central processing unit 303 through the input interface 302; the central processing unit 303 processes the input information based on the computer executable instructions stored in the memory 304 to generate output information, temporarily or permanently stores the output information in the memory 304, and then transmits the output information to the output device 306 through the output interface 305; the output device 306 outputs the output information to the outside of the computing device 300 for user use.

[0099] That is to say, Figure 5 The computing device shown may also be implemented as a data storage device, which may include: a memory storing computer executable instructions; and a processor, which may implement the data storage method provided by the embodiment of the present invention when executing the computer executable instructions.

[0100] An embodiment of the present invention further provides a computer-readable storage medium, on which computer program instructions are stored; when the computer program instructions are executed by a processor, the data storage method provided by the embodiment of the present invention is implemented.

[0101] It should be clear that the present invention is not limited to the specific configuration and processing described above and shown in the figures. For the sake of simplicity, a detailed description of the known method is omitted here. In the above embodiments, several specific steps are described and shown as examples. However, the method process of the present invention is not limited to the specific steps described and shown, and those skilled in the art can make various changes, modifications and additions, or change the order between the steps after understanding the spirit of the present invention.

[0102] The functional blocks shown in the above-described block diagram can be implemented as hardware, software, firmware or a combination thereof. When implemented in hardware, it can be, for example, an electronic circuit, an application specific integrated circuit (ASIC), appropriate firmware, a plug-in, a function card, etc. When implemented in software, the elements of the present invention are programs or code segments that are used to perform the required tasks. The program or code segment can be stored in a machine-readable medium, or transmitted on a transmission medium or a communication link by a data signal carried in a carrier wave. "Machine-readable medium" can include any medium capable of storing or transmitting information. Examples of machine-readable media include electronic circuits, semiconductor memory devices, ROM, flash memory, erasable ROM (EROM), floppy disks, CD-ROMs, optical disks, hard disks, optical fiber media, radio frequency (RF) links, etc. The code segment can be downloaded via a computer network such as the Internet, an intranet, etc.

[0103] It should also be noted that the exemplary embodiments mentioned in the present invention describe some methods or systems based on a series of steps or devices. However, the present invention is not limited to the order of the above steps, that is, the steps can be performed in the order mentioned in the embodiments, or in a different order from the embodiments, or several steps can be performed simultaneously.

[0104] The above is only a specific implementation of the present invention. Those skilled in the art can clearly understand that for the convenience and simplicity of description, the specific working process of the system, module and unit described above can refer to the corresponding process in the aforementioned method embodiment, and will not be repeated here. It should be understood that the protection scope of the present invention is not limited to this. Any technician familiar with the technical field can easily think of various equivalent modifications or replacements within the technical scope disclosed by the present invention, and these modifications or replacements should be covered within the protection scope of the present invention.

Claims

1. A data storage method, It is characterized in that The method comprises: Dividing the first storage space into a plurality of sub-storage spaces, wherein the plurality of sub-storage spaces are isolated from each other; When the first storage space receives data to be stored, the first storage space decomposes the data according to the data and the plurality of sub-storage spaces, and determines a target sub-storage space, wherein the target sub-storage space is at least one sub-storage space among the plurality of sub-storage spaces; storing the decomposed data into the target sub-storage space; Decomposing the data according to the data and the plurality of sub-storage spaces, comprising: decomposing the data according to the data and the plurality of sub-storage spaces, and generating decomposition identification information and a dictionary corresponding to the data, wherein the decomposition identification information is used to restore the decomposed data, and the dictionary provides specific information of the data decomposition and is provided to a reading device, so that the reading device restores the data according to the dictionary; The determining of the target sub-storage space includes: Determining a target sub-storage space according to at least one sub-storage space that meets a preset threshold and an evaluation value between at least one sub-storage space that meets a preset threshold; The evaluation value is determined according to the logical distance and the physical distance between at least one sub-storage space that meets a preset threshold, and satisfies the formula: Q=a∑ N G i +b∑ N H i Among them, Q is the evaluation value, G i is the logical distance between the at least one sub-storage space, H i is the physical distance between the at least one sub-storage space, a is the weight of the logical distance in the evaluation value Q, b is the weight of the physical distance in the evaluation value Q, and N is the number of sub-storage spaces.

2. The method according to claim 1, It is characterized in that Determine the target sub-storage space, including: At least one sub-storage space that meets a preset threshold is determined as the target sub-storage space, wherein the preset threshold is greater than a data block size of the decomposed data.

3. A device for storing data, It is characterized in that The device comprises: A processing module, used for dividing the first storage space into a plurality of sub-storage spaces; The processing module is further configured to, when the first storage space receives data to be stored, decompose the data according to the data and the multiple sub-storage spaces, and determine a target sub-storage space, wherein the target sub-storage space is at least one sub-storage space among the multiple sub-storage spaces; The processing module is further used to store the decomposed data into the target sub-storage space; The processing module is further used to decompose the data according to the data and the multiple sub-storage spaces, and generate decomposition identification information corresponding to the data, wherein the decomposition identification information is used to restore the decomposed data; The processing module is further used for: Determining a target sub-storage space according to at least one sub-storage space that meets a preset threshold and an evaluation value between at least one sub-storage space that meets a preset threshold; The evaluation value is determined according to the logical distance and the physical distance between at least one sub-storage space that meets a preset threshold, and satisfies the formula: Q=a∑ N G i +b∑ N H i Among them, Q is the evaluation value, G i is the logical distance between the at least one sub-storage space, H i is the physical distance between the at least one sub-storage space, a is the weight of the logical distance in the evaluation value Q, b is the weight of the physical distance in the evaluation value Q, and N is the number of sub-storage spaces.

4. The device according to claim 3, It is characterized in that The processing module is further configured to determine at least one sub-storage space that meets a preset threshold as the target sub-storage space, wherein the preset threshold is greater than a data block size of the decomposed data.

5. A device for storing data, It is characterized in that The device comprises: a processor and a memory storing computer program instructions; When the processor executes the computer program instructions, the data storage method according to any one of claims 1 to 2 is implemented.

6. A computer storage medium, It is characterized in that The computer storage medium stores computer program instructions, which, when executed by a processor, implement the data storage method according to any one of claims 1 to 2.