Data storage method and system for solid state disk

Abstract

The invention discloses a data storage method and system for a solid state disk. The method comprises the following steps: acquiring to-be-stored data; dividing the to-be-stored data into a plurality of sub-data, and calculating hash values of the sub-data; comparing and analyzing the hash values of the sub-data and a preset hash value table, and if the same hash value exists, finding out a corresponding physical page according to the same hash value; and if the same hash value does not exist, writing the corresponding sub-data into the blank physical page. The same sub-data are stored in the same physical page, repeated data storage is avoided, the capacity of the solid state disk is saved, and the storage capacity of the solid state disk is improved; in addition, the speed of service life attenuation of the corresponding solid state disk is delayed by balancing the erasure times.

Description

Technical Field

[0001] The present invention relates to the technical field of solid-state hard disks, and more specifically, to a method and system for storing data in a solid-state hard disk. Background Art

[0002] With the rapid development of big data and cloud computing technologies, solid-state drives (SSDs) have gradually become the core storage medium for data centers and consumer computers due to their advantages such as high-speed read and write speeds, low latency, and vibration resistance. However, traditional SSDs use a fixed mapping strategy. When the same data is repeatedly stored at different logical addresses, redundant physical space is occupied, resulting in a decrease in storage density. In addition, each storage unit in an SSD has a limited number of erase times. Frequent write / deletion operations will shorten the lifespan of the corresponding SSD. Summary of the Invention

[0003] In view of the above problems, the purpose of the present invention is to provide a data storage method and system for a solid-state hard disk, which can store the same sub-data in the same physical page, avoid repeated storage of data, save the capacity of the solid-state hard disk, and improve the storage capacity of the solid-state hard disk; in addition, by balancing the number of erase times, the speed of decay of the corresponding solid-state hard disk life is slowed down.

[0004] A first aspect of the present invention provides a method for storing data in a dynamic hard disk, comprising: Get the data to be saved; Divide the data to be saved into multiple sub-data and calculate the hash value of the sub-data; Compare and analyze the hash value of the sub-data with the preset hash value table. If the same hash value exists, find the corresponding physical page based on the same hash value. If the same hash value does not exist, the corresponding sub-data is written to a blank physical page.

[0005] This plan also includes: Get the number of physical page references; When the number of references to a physical page is greater than or equal to 1, the corresponding physical page cannot be overwritten or deleted; When a logical page is deleted or overwritten, the corresponding physical page is queried based on the corresponding logical page, and the number of references to the corresponding physical page is reduced by one.

[0006] This plan also includes: When a logical page is modified, if the number of references to the physical page currently mapped by the logical page is greater than one, a new physical page is allocated and the original data is copied; then the logical page is updated to map to the new physical page, and the number of references to the original physical page is reduced by one; If the number of references to the physical page currently mapped by the logical page is one, the logical page will be updated to map to the original physical page, and the hash value of the sub-data will be modified again; If the hash value of the re-modified sub-data is the same as any hash value in the preset hash value table, the physical page of the sub-data storage corresponding to the same hash value is extracted; The logical page is mapped to the physical page of the sub-data storage corresponding to the same hash value, the reference count of the corresponding physical page is increased by one, and the original physical page is set as a redundant physical page.

[0007] This plan includes: Get the time when redundant physical pages were last cleared and set it as the first time; Get the current time, set it as the second time, and subtract the first time from the second time to get the time difference; Get the current free capacity of the solid-state drive and the total capacity of the solid-state drive; Set the scanning period to T, and the formula is ,in Expressed as coefficients, is the current free capacity of the solid-state drive. Indicates the total capacity of the solid-state drive; When the scanning period is less than or equal to the time difference, the redundant physical pages in the entire solid state drive are scanned, and the data in the redundant physical pages are deleted to obtain blank physical pages.

[0008] This plan also includes: Based on a preset environmental sensor, obtain environmental data information of the solid-state drive, wherein the environmental data includes at least temperature data and humidity data; According to the environmental data information, the environmental index of the corresponding solid state drive is determined. The formula is: , where j represents the environmental factor, n represents the set of all environmental factors, represents the value of the environmental factor j, represents the weight coefficient of environmental factor j, and H represents the environmental index; When the environmental index is greater than a preset environmental index threshold, the environmental index is divided by the preset environmental index threshold to obtain a scanning period revision coefficient, and the scanning period revision coefficient is multiplied by the scanning period to obtain a revised scanning period.

[0009] This plan also includes: When the free capacity of the solid-state hard disk is less than a preset capacity threshold, the last access time and the number of accesses of the data stored in the solid-state hard disk are obtained; According to the last access time and access times of the data stored in the solid-state drive, the clearing index Q of the corresponding stored data is obtained, and its formula is: ,in 、 Represents the corresponding weight coefficient, Indicates the last access time of the corresponding stored data. Indicates the number of visits; When the purge index is greater than or equal to the preset purge index threshold, the data corresponding to the purge index is sent to the preset purge list for display.

[0010] This plan also includes: Get the number of times each blank physical page has been erased; According to the number of times each blank physical page is erased, the wear index of each blank physical page is determined. The formula is: ,in represents the wear index of blank physical page i, Indicates the number of times blank physical page i is erased, Indicates the average number of erase times for all physical pages, is the smoothing factor; The blank physical pages are sorted in ascending order according to the wear index of the corresponding blank physical pages, so as to obtain the order in which the blank physical pages are selected to store the sub-data.

[0011] A second aspect of the present invention provides a data storage system for a solid-state hard disk, including a memory and a processor. The memory stores a data storage method program for a solid-state hard disk, and when the data storage method program for the solid-state hard disk is executed by the processor, the following steps are implemented: Get the data to be saved; Divide the data to be saved into multiple sub-data and calculate the hash value of the sub-data; Compare and analyze the hash value of the sub-data with the preset hash value table. If the same hash value exists, find the corresponding physical page based on the same hash value. If the same hash value does not exist, the corresponding sub-data is written to a blank physical page.

[0012] This plan also includes: Get the number of physical page references; When the number of references to a physical page is greater than or equal to 1, the corresponding physical page cannot be overwritten or deleted; When a logical page is deleted or overwritten, the corresponding physical page is queried based on the corresponding logical page, and the number of references to the corresponding physical page is reduced by one.

[0013] This plan also includes: When a logical page is modified, if the number of references to the physical page currently mapped by the logical page is greater than one, a new physical page is allocated and the original data is copied; then the logical page is updated to map to the new physical page, and the number of references to the original physical page is reduced by one; If the number of references to the physical page currently mapped by the logical page is one, the logical page will be updated to map to the original physical page, and the hash value of the sub-data will be modified again; If the hash value of the re-modified sub-data is the same as any hash value in the preset hash value table, the physical page of the sub-data storage corresponding to the same hash value is extracted; The logical page is mapped to the physical page of the sub-data storage corresponding to the same hash value, the reference count of the corresponding physical page is increased by one, and the original physical page is set as a redundant physical page.

[0014] The present invention discloses a method and system for storing data on a solid-state drive (SSD). The method stores identical sub-data on the same physical page, avoiding duplicate data storage and saving the capacity of the SSD, thereby improving the storage capacity of the SSD. In addition, the method slows down the decay of the SSD's lifespan by balancing the number of erases. BRIEF DESCRIPTION OF THE DRAWINGS

[0015] Figure 1 A flow chart showing a method for storing data in a solid state drive according to the present invention is shown; Figure 2 A block diagram of a data storage system for a solid state hard disk of the present invention is shown. DETAILED DESCRIPTION

[0016] In order to more clearly understand the above-mentioned objects, features and advantages of the present invention, the present invention is further described in detail below in conjunction with the accompanying drawings and specific embodiments. It should be noted that, in the absence of conflict, the embodiments of the present application and the features therein can be combined with each other.

[0017] In the following description, many specific details are set forth to facilitate a full understanding of the present invention. However, the present invention may also be implemented in other ways different from those described herein. Therefore, the scope of protection of the present invention is not limited to the specific embodiments disclosed below.

[0018] Figure 1 A flow chart of a method for storing data in a solid state drive according to the present invention is shown.

[0019] like Figure 1 As shown, the present invention discloses a method for storing data in a solid-state hard disk, comprising: S101, obtaining data to be saved; S102, dividing the data to be saved into multiple sub-data and calculating the hash value of the sub-data; S103, comparing and analyzing the hash value of the sub-data with the preset hash value table, and if the same hash value exists, finding the corresponding physical page according to the same hash value; S104: If the same hash value does not exist, the corresponding sub-data is written to a blank physical page.

[0020] According to an embodiment of the present invention, when the same data file is modified multiple times and each modified data file needs to be saved, there may be a large amount of duplicate sub-data corresponding to the multiple modified data files. If all the modified data files are saved each time, a large amount of storage space will be wasted, thereby reducing the storage capacity of the solid-state drive; the preset hash value table contains hash values corresponding to all sub-data in the solid-state drive, and can find the physical page where the corresponding sub-data is stored according to the hash value; when the same hash value exists, the corresponding sub-data is stored in a logical page, and the corresponding logical page is mapped to the physical page corresponding to the same hash value, thereby realizing that multiple logical pages share the same physical page and reducing storage space; when the same hash value does not exist, the corresponding hash value is recorded in the preset hash value table, and the physical page of the sub-data corresponding to the hash value is also recorded in the hash value table.

[0021] According to an embodiment of the present invention, the further embodiment includes: Get the number of physical page references; When the number of references to a physical page is greater than or equal to 1, the corresponding physical page cannot be overwritten or deleted; When a logical page is deleted or overwritten, the corresponding physical page is queried based on the corresponding logical page, and the number of references to the corresponding physical page is reduced by one.

[0022] It should be noted that when the number of references to a physical page is greater than or equal to 1, it indicates that a logical page references the corresponding physical page, and therefore the corresponding physical page cannot be overwritten or deleted.

[0023] According to an embodiment of the present invention, the further embodiment includes: When a logical page is modified, if the number of references to the physical page currently mapped by the logical page is greater than one, a new physical page is allocated and the original data is copied; then the logical page is updated to map to the new physical page, and the number of references to the original physical page is reduced by one; If the number of references to the physical page currently mapped by the logical page is one, the logical page will be updated to map to the original physical page, and the hash value of the sub-data will be modified again; If the hash value of the re-modified sub-data is the same as any hash value in the preset hash value table, the physical page of the sub-data storage corresponding to the same hash value is extracted; The logical page is mapped to the physical page of the sub-data storage corresponding to the same hash value, the reference count of the corresponding physical page is increased by one, and the original physical page is set as a redundant physical page.

[0024] It should be noted that when a logical page is modified, it indicates that the sub-data in the logical page has been changed. Therefore, a new physical page is reallocated, and the modified logical page is mapped to the new physical page, and the number of references to the previous physical page is reduced by one. When the number of references to the physical page currently mapped by the logical page is one, the number of references to the original physical page will be zero after the logical page is updated. Therefore, the original physical page is set as a redundant physical page.

[0025] According to an embodiment of the present invention, the present invention includes: Get the time when redundant physical pages were last cleared and set it as the first time; Get the current time, set it as the second time, and subtract the first time from the second time to get the time difference; Get the current free capacity of the solid-state drive and the total capacity of the solid-state drive; Set the scanning period to T, and the formula is ,in Expressed as coefficients, is the current free capacity of the solid-state drive. Indicates the total capacity of the solid-state drive; When the scanning period is less than or equal to the time difference, the redundant physical pages in the entire solid state drive are scanned, and the data in the redundant physical pages are deleted to obtain blank physical pages.

[0026] It should be noted that the scanning cycle of the solid-state drive is dynamically adjusted according to the idle capacity of the solid-state drive, and redundant data in the solid-state drive is irregularly cleared through the dynamic scanning cycle, thereby improving the storage capacity of the solid-state drive.

[0027] According to an embodiment of the present invention, the further embodiment includes: Based on a preset environmental sensor, obtain environmental data information of the solid state drive, wherein the environmental data includes at least temperature data and humidity data; According to the environmental data information, the environmental index of the corresponding solid state drive is determined. The formula is: , where j represents the environmental factor, n represents the set of all environmental factors, represents the value of the environmental factor j, represents the weight coefficient of environmental factor j, and H represents the environmental index; When the environmental index is greater than a preset environmental index threshold, the environmental index is divided by the preset environmental index threshold to obtain a scanning period revision coefficient, and the scanning period revision coefficient is multiplied by the scanning period to obtain a revised scanning period.

[0028] It should be noted that the scanning cycle is optimized by combining the environmental data of the solid state drive; the environment includes multiple environmental factors, such as temperature factor and humidity factor; the data corresponding to the temperature factor is temperature data, and the data corresponding to the humidity factor is humidity data.

[0029] Furthermore, when a power failure of the solid-state drive is detected, emergency clearing of redundant data information is triggered, and based on the emergency clearing of redundant data information, the maximum energy for emergency clearing is obtained, and the maximum energy for emergency clearing is equal to the total capacitance of the solid-state drive minus the safety reserved energy; the redundant data includes redundant physical pages.

[0030] According to an embodiment of the present invention, the further embodiment includes: When the free capacity of the solid-state hard disk is less than a preset capacity threshold, the last access time and the number of accesses of the data stored in the solid-state hard disk are obtained; According to the last access time and access times of the data stored in the solid-state drive, the clearing index Q of the corresponding stored data is obtained, and its formula is: ,in 、 Represents the corresponding weight coefficient, Indicates the last access time of the corresponding stored data. Indicates the number of visits; When the purge index is greater than or equal to the preset purge index threshold, the data corresponding to the purge index is sent to the preset purge list for display.

[0031] It should be noted that the preset purge list will display the purge indexes greater than or equal to the preset purge index threshold, and query the corresponding data based on the purge index, thereby improving the efficiency of clearing redundant data; further, the preset purge list is arranged in descending order of the purge index, where the larger the purge index, the higher the corresponding ranking.

[0032] According to an embodiment of the present invention, the further embodiment includes: Get the number of times each blank physical page has been erased; According to the number of times each blank physical page is erased, the wear index of each blank physical page is determined. The formula is: ,in represents the wear index of blank physical page i, Indicates the number of times blank physical page i is erased, Indicates the average number of erase times for all physical pages, is the smoothing factor; The blank physical pages are sorted in ascending order according to the wear index of the corresponding blank physical pages, so as to obtain the order in which the blank physical pages are selected to store the sub-data.

[0033] It should be noted that wear leveling can comprehensively extend the life of the solid-state drive. When the wear index of a blank physical page is small, the corresponding blank physical page will be used first.

[0034] Figure 2 A block diagram of a data storage system for a solid state hard disk of the present invention is shown.

[0035] like Figure 2 As shown, the second aspect of the present invention provides a solid state drive data storage system 2, including a memory 21 and a processor 22. The memory stores a solid state drive data storage method program, and when the solid state drive data storage method program is executed by the processor, the following steps are implemented: Get the data to be saved; Divide the data to be saved into multiple sub-data and calculate the hash value of the sub-data; Compare and analyze the hash value of the sub-data with the preset hash value table. If the same hash value exists, find the corresponding physical page based on the same hash value. If the same hash value does not exist, the corresponding sub-data is written to a blank physical page.

[0036] This plan also includes: Get the number of physical page references; When the number of references to a physical page is greater than or equal to 1, the corresponding physical page cannot be overwritten or deleted; When a logical page is deleted or overwritten, the corresponding physical page is queried based on the corresponding logical page, and the number of references to the corresponding physical page is reduced by one.

[0037] This plan also includes: When a logical page is modified, if the number of references to the physical page currently mapped by the logical page is greater than one, a new physical page is allocated and the original data is copied; then the logical page is updated to map to the new physical page, and the number of references to the original physical page is reduced by one; If the number of references to the physical page currently mapped by the logical page is one, the logical page will be updated to map to the original physical page, and the hash value of the sub-data will be modified again; If the hash value of the re-modified sub-data is the same as any hash value in the preset hash value table, the physical page of the sub-data storage corresponding to the same hash value is extracted; The logical page is mapped to the physical page of the sub-data storage corresponding to the same hash value, the reference count of the corresponding physical page is increased by one, and the original physical page is set as a redundant physical page.

[0038] The present invention discloses a method and system for storing data on a solid-state drive (SSD). The method stores identical sub-data on the same physical page, avoiding duplicate data storage and saving the capacity of the SSD, thereby improving the storage capacity of the SSD. In addition, the method slows down the decay of the SSD's lifespan by balancing the number of erases.

[0039] In the several embodiments provided in this application, it should be understood that the disclosed devices and methods can be implemented in other ways. The device embodiments described above are merely schematic. For example, the division of the units is merely a logical function division. In actual implementation, there may be other division methods, such as: multiple units or components can be combined, or can be integrated into another system, or some features can be ignored or not executed. In addition, the coupling, direct coupling, or communication connection between the components shown or discussed can be through some interfaces, and the indirect coupling or communication connection of the devices or units can be electrical, mechanical or other forms.

[0040] The units described above as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units; they may be located in one place or distributed across multiple network units; some or all of the units may be selected according to actual needs to achieve the purpose of the scheme of this embodiment.

[0041] In addition, all functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may be separately used as a unit, or two or more units may be integrated into one unit; the above-mentioned integrated units may be implemented in the form of hardware or in the form of hardware plus software functional units.

[0042] Those skilled in the art will appreciate that all or part of the steps of the above-mentioned method embodiments may be implemented by hardware associated with program instructions, and the aforementioned program may be stored in a computer-readable storage medium. When the program is executed, the program executes the steps of the above-mentioned method embodiments. The aforementioned storage medium includes various media that can store program codes, such as mobile storage devices, read-only memories (ROMs), random access memories (RAMs), magnetic disks, or optical disks.

[0043] Alternatively, if the integrated units described above are implemented as software modules and sold or used as standalone products, they can also be stored on a computer-readable storage medium. Based on this understanding, the technical solutions of the embodiments of the present invention, or the portion that contributes to the prior art, can be embodied in the form of a software product. This computer software product, stored on a storage medium, includes instructions for enabling a computer device (such as a personal computer, server, or network device) to execute all or part of the methods described in various embodiments of the present invention. The aforementioned storage media include various media capable of storing program code, such as removable storage devices, ROM, RAM, magnetic disks, or optical disks.

Claims

1. A method for storing data in a solid state drive, characterized in that: include: Get the data to be saved; Divide the data to be saved into multiple sub-data and calculate the hash value of the sub-data; Compare and analyze the hash value of the sub-data with the preset hash value table. If the same hash value exists, find the corresponding physical page based on the same hash value. If the same hash value does not exist, the corresponding sub-data is written to a blank physical page.

2. The method for storing data in a solid state drive according to claim 1, wherein: Also includes: Get the number of physical page references; When the number of references to a physical page is greater than or equal to 1, the corresponding physical page cannot be overwritten or deleted; When a logical page is deleted or overwritten, the corresponding physical page is queried based on the corresponding logical page, and the number of references to the corresponding physical page is reduced by one.

3. The method for storing data in a solid state drive according to claim 2, wherein: Also includes: When a logical page is modified, if the number of references to the physical page currently mapped by the logical page is greater than one, a new physical page is allocated and the original data is copied; Then update the logical page mapping to the new physical page, and reduce the number of references to the original physical page by one; If the number of references to the physical page currently mapped by the logical page is one, the logical page will be updated to map to the original physical page, and the hash value of the sub-data will be modified again; If the hash value of the re-modified sub-data is the same as any hash value in the preset hash value table, the physical page of the sub-data storage corresponding to the same hash value is extracted; The logical page is mapped to the physical page of the sub-data storage corresponding to the same hash value, the reference count of the corresponding physical page is increased by one, and the original physical page is set as a redundant physical page.

4. The method for storing data in a solid state drive according to claim 3, wherein: include: Get the time when redundant physical pages were last cleared and set it as the first time; Get the current time, set it as the second time, and subtract the first time from the second time to get the time difference; Get the current free capacity of the solid-state drive and the total capacity of the solid-state drive; Set the scanning period to T, and the formula is ,in Expressed as coefficients, is the current free capacity of the solid-state drive. Indicates the total capacity of the solid-state drive; When the scanning period is less than or equal to the time difference, the redundant physical pages in the entire solid state drive are scanned, and the data in the redundant physical pages are deleted to obtain blank physical pages.

5. The method for storing data in a solid state drive according to claim 4, wherein: Also includes: Based on a preset environmental sensor, obtain environmental data information of the solid-state drive, wherein the environmental data includes at least temperature data and humidity data; According to the environmental data information, the environmental index of the corresponding solid state drive is determined. The formula is: , where j represents the environmental factor, n represents the set of all environmental factors, represents the value of the environmental factor j, represents the weight coefficient of environmental factor j, and H represents the environmental index; When the environmental index is greater than a preset environmental index threshold, the environmental index is divided by the preset environmental index threshold to obtain a scanning period revision coefficient, and the scanning period revision coefficient is multiplied by the scanning period to obtain a revised scanning period.

6. The method for storing data in a solid state drive according to claim 4, wherein: Also includes: When the free capacity of the solid-state hard disk is less than a preset capacity threshold, the last access time and the number of accesses of the data stored in the solid-state hard disk are obtained; According to the last access time and access times of the data stored in the solid-state drive, the clearing index Q of the corresponding stored data is obtained, and its formula is: ,in 、 Represents the corresponding weight coefficient, Indicates the last access time of the corresponding stored data. Indicates the number of visits; When the purge index is greater than or equal to the preset purge index threshold, the data corresponding to the purge index is sent to the preset purge list for display.

7. The method for storing data in a solid state drive according to claim 1, wherein: Also includes: Get the number of times each blank physical page has been erased; According to the number of times each blank physical page is erased, the wear index of each blank physical page is determined. The formula is: ,in represents the wear index of blank physical page i, Indicates the number of times blank physical page i is erased, Indicates the average number of erase times for all physical pages, is the smoothing factor; The blank physical pages are sorted in ascending order according to the wear index of the corresponding blank physical pages, so as to obtain the order in which the blank physical pages are selected to store the sub-data.

8. A data storage system for a solid state hard disk, characterized in that: The system comprises a memory and a processor, wherein the memory stores a data storage method program for a solid-state hard disk, and when the data storage method program for the solid-state hard disk is executed by the processor, the following steps are implemented: Get the data to be saved; Divide the data to be saved into multiple sub-data and calculate the hash value of the sub-data; Compare and analyze the hash value of the sub-data with the preset hash value table. If the same hash value exists, find the corresponding physical page based on the same hash value. If the same hash value does not exist, the corresponding sub-data is written to a blank physical page.

9. The data storage system of a solid state hard disk according to claim 8, characterized in that: Also includes: Get the number of physical page references; When the number of references to a physical page is greater than or equal to 1, the corresponding physical page cannot be overwritten or deleted; When a logical page is deleted or overwritten, the corresponding physical page is queried based on the corresponding logical page, and the number of references to the corresponding physical page is reduced by one.

10. The data storage system of a solid state hard disk according to claim 9, characterized in that: Also includes: When a logical page is modified, if the number of references to the physical page currently mapped by the logical page is greater than one, a new physical page is allocated and the original data is copied; Then update the logical page mapping to the new physical page, and reduce the number of references to the original physical page by one; If the number of references to the physical page currently mapped by the logical page is one, the logical page will be updated to map to the original physical page, and the hash value of the sub-data will be modified again; If the hash value of the re-modified sub-data is the same as any hash value in the preset hash value table, the physical page of the sub-data storage corresponding to the same hash value is extracted; The logical page is mapped to the physical page of the sub-data storage corresponding to the same hash value, the reference count of the corresponding physical page is increased by one, and the original physical page is set as a redundant physical page.

Images