CN106886370B - data safe deletion method and system based on SSD (solid State disk) deduplication technology - Google Patents

data safe deletion method and system based on SSD (solid State disk) deduplication technology Download PDF

Info

Publication number
CN106886370B
CN106886370B CN201710059169.8A CN201710059169A CN106886370B CN 106886370 B CN106886370 B CN 106886370B CN 201710059169 A CN201710059169 A CN 201710059169A CN 106886370 B CN106886370 B CN 106886370B
Authority
CN
China
Prior art keywords
data
ppn
deleting
page
physical
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201710059169.8A
Other languages
Chinese (zh)
Other versions
CN106886370A (en
Inventor
童薇
刘景宁
冯丹
雷霞
方才华
魏学亮
高阳
蒋瑜
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huazhong University of Science and Technology
Original Assignee
Huazhong University of Science and Technology
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Huazhong University of Science and Technology filed Critical Huazhong University of Science and Technology
Priority to CN201710059169.8A priority Critical patent/CN106886370B/en
Publication of CN106886370A publication Critical patent/CN106886370A/en
Application granted granted Critical
Publication of CN106886370B publication Critical patent/CN106886370B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0602Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/0608Saving storage space on storage systems
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0628Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0638Organizing or formatting or addressing of data
    • G06F3/064Management of blocks
    • G06F3/0641De-duplication techniques
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0668Interfaces specially adapted for storage systems adopting a particular infrastructure
    • G06F3/0671In-line storage system
    • G06F3/0673Single storage device
    • G06F3/0679Non-volatile semiconductor memory device, e.g. flash memory, one time programmable memory [OTP]

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Human Computer Interaction (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The invention discloses a data safe deleting method and system based on an SSD (solid State disk) deduplication technology, and belongs to the field of SSD storage control. The method marks the original mapping relation as invalid for the write updating operation during the data writing, then writes based on the duplication-removing data, and simultaneously modifies the metadata of the written data; when deleting data, firstly, safely deleting the data, and deleting the PPN data and the mapping relation of the related physical page; and then, safely deleting the metadata to completely eliminate traces. The invention also provides a data safe deleting system based on the SSD deduplication technology. The invention reduces the overhead brought by safe deletion by using a data deduplication technology, solves the problem that the block is not safely deleted because of being quoted by other files by safely deleting the metadata, and ensures that the deleted file completely executes safe deletion.

Description

data safe deletion method and system based on SSD (solid State disk) deduplication technology
Technical Field
the invention belongs to the field of SSD storage control, and particularly relates to a data safe deletion method and system based on an SSD deduplication technology.
background
With the development of data recovery technology, the deletion of files by a computer operating system is no longer reliable at present, and by recovering and processing data remained on a storage medium, an attacker can steal the deleted confidential information, which becomes an important hidden danger threatening the information security of the storage system. A survey was reported by Blancco Technology Group in 2016, who purchased 200 second-hand hard disks (93% mechanical disks and the remainder SSD) from eBay and Craigslist, and found that there was residual data in over 78% of the second-hand hard disks, 67% of which recovered personal confidential information and 11% of which contained company sensitive data. In addition, investigation shows that 36% of the hard disks contain residual data, namely, data still remain after the user performs deletion operation; 40% of the hard disks are formatted, but still have data remaining in the hard disks; only 10% of the hard disks have taken the right means of securely erasing data. This fully explains that ordinary deletion and formatting operations cannot truly delete data, and users need correct safe deletion means to prevent data leakage.
The safe deletion of data means that the data in the storage carrier can not be recovered after being deleted by various technical means, and the equipment can be reused. At present, various safe deletion methods based on copying have been proposed for magnetic media, and the main idea is to rewrite the LBA space corresponding to a file when deleting the file, and overwrite the physical medium in which the original data of the file is stored, so as to delete the file safely. However, due to the characteristic of remote updating of the flash memory, when the LBA space corresponding to the file is rewritten, the physical page in which the original data of the file is stored becomes invalid, and the overwritten data is written into a new physical page, so that the effect of overwriting the original data of the file cannot be achieved. Meanwhile, after a large amount of reading and writing, each data page of the file may have a plurality of copies, the time for storing the data page copies in the storage medium is unpredictable, and only a part of the data page copies can be recycled during garbage collection, so that the space of the solid-state disk is occupied, and the information in the deleted file is leaked. Therefore, for the solid state disk based on the flash memory, a new secure erase technique needs to be introduced to change the dilemma.
On the other hand, in the big data era, blindly increasing the storage capacity is not an effective way to solve the problem of the surge in data size. Researchers have analyzed a variety of storage systems and found that duplicate data is widely present in these storage devices. For example, microsoft researchers have found that around 40% of the data is ubiquitous in personal computers; researchers at EMC find duplicate data of backup storage systems up to 90%; german researchers found that 15-30% of the duplicate data was present in the data center. These duplicate data not only increase storage costs, but also increase the amount of data transferred when writing. The utilization rate of the storage equipment can be effectively improved by reducing the storage of the repeated data, and for the SSD, the reduction of the repeated data also has the effect of prolonging the service life of the SSD.
the data deduplication technology is widely applied to a backup system, the flash memory safe deletion technology is widely researched, the data deduplication technology and the flash memory safe deletion technology are combined, the overhead caused by safe deletion is reduced by the data deduplication technology, and the performance and the safety of the solid-state storage device are further improved. In a storage system, the combination of deduplication and secure deletion may cause some problems, and one of the most important problems is whether the useless data is really securely deleted. Referring to fig. 1, when the deduplication technology is not used, safe deletion of a file a (4 data blocks a, b, c, d in total; note: the data block corresponds to a flash memory page) requires safe deletion of the 4 data blocks in sequence; if the deduplication technology is used, another file B (having 4 data blocks a, B1, c, d 1) shares two data blocks a and c with the file a, so that the two data blocks do not need to be processed when data is safely deleted, and the overhead is reduced. But this will bring the question of whether file a is really safely deleted.
disclosure of Invention
aiming at the defects or the improvement requirements of the prior art, the invention provides a data safe deletion method and a data safe deletion system based on an SSD (solid state disk) deduplication technology, aiming at realizing safe deletion of a file by a solid state disk on the basis of the deduplication technology by utilizing the characteristics of a flash memory and reducing the influence of safe deletion on the read-write performance as much as possible, thereby reducing the expenses of write amplification and safe deletion, solving the problem that a block is not safely deleted due to being quoted by other files by safely deleting metadata, and ensuring that the deleted file is completely safely deleted.
to achieve the above object, according to one aspect of the present invention, there is provided a data secure deletion method based on SSD deduplication technology, the method comprising the steps of:
(1) judging a user request, and if the user request is a write request, entering the step (2); if yes, entering the step (4);
(2) searching an address mapping table according to the logical address L of the write request, if the address mapping table is hit, keeping the mapping from the logical address L to the data block, marking the mapping relation as invalid, and entering the step (3); if not, directly entering the step (3);
(3) based on the de-duplicated data write, the write request ends;
(4) Searching an address mapping table according to the logical address R of the deletion request, and safely deleting the found data blocks;
(5) and safely deleting the metadata corresponding to the found data blocks.
further, the writing of the data based on deduplication in the step (3) specifically includes the following steps:
(21) Calculating a data fingerprint by adopting an SHA-1 algorithm according to the specific content to be written into the data block A to obtain a fingerprint a;
(22) Searching whether the fingerprint a exists in a fingerprint library, and if so, entering a step (23); if not, entering step (24);
(23) adding the physical data page P1 corresponding to the fingerprint a into the physical data page corresponding to the logical address L; adding 1 to the index times of the physical data page P1, and ending the writing of the data block A;
(24) allocating a free physical data page P2 to the data block A, and adding a physical data page P2 to a physical data page corresponding to the logical address L; and adding the fingerprint a into the fingerprint database, recording the index times of the physical data page P2 as 1, adding the logical address L into the logical address corresponding to the physical data page P2, and ending the writing of the data block A.
further, the step (4) of securely deleting the data block specifically includes the following steps:
(31) Obtaining a plurality of logical page numbers LPN according to the logical address R and the size of the deletion request, and inquiring an address mapping table according to the plurality of LPNs to obtain a plurality of corresponding physical data pages PPN;
(32) for each physical data page PPN, judging whether the physical data page PPN is shared by other files according to the index times of the physical data page PPN, and if so, entering a step (33); otherwise, entering a step (34);
(33) Deleting the mapping relation from the physical data page PPN to the logical address R, and subtracting 1 from the PPN index frequency of the physical data page; judging whether all the physical data pages PPN are processed or not, if so, turning to the step (35); otherwise go to step (32);
(34) Deleting the mapping relation from the physical data page PPN to the logical address, and directly carrying out safe deletion on the physical data page PPN by executing data block copying operation; judging whether all the physical data pages PPN are processed or not, if so, turning to the step (35); otherwise go to step (32);
(35) deleting the PPN nodes corresponding to the plurality of LPNs in the address mapping table; the deletion is completed.
further, the step (5) of securely deleting the metadata specifically includes the following steps:
(41) After the mapping relation in the memory is deleted, obtaining a physical page PPN corresponding to the modified metadata;
(42) Judging whether the PPN of the physical page is safely deleted, if not, entering a step (43); if yes, safely deleting the metadata;
(43) The physical page PPN is securely deleted and the page is marked as having been securely deleted.
further, the mapping table structure is an adjacency table structure.
according to another aspect of the present invention, there is provided a data secure deletion system based on SSD deduplication technology, the system comprising:
The user request judging module is used for judging a user request, and if the user request is a writing request, the user request enters the content updating judging module; if the request is a deletion request, entering a data security deletion module;
a content updating judgment module, which is used for searching an address mapping table according to the logical address L of the writing request, if the address mapping table is hit, the mapping from the logical address L to the data block is reserved, the mapping relation is marked as invalid, and the data block enters a duplication elimination writing module; if not, directly entering a deduplication writing module;
a deduplication write module, configured to write data based on deduplication and end a write request;
the data safety deleting module is used for searching an address mapping table according to the logical address R of the deleting request and safely deleting the found data blocks;
and the metadata safe deletion module is used for safely deleting the metadata corresponding to the found data block and ending the deletion request.
further, the de-rewrite module specifically includes the following units:
the data fingerprint calculation unit is used for calculating a data fingerprint according to specific content to be written into the data block A to obtain a fingerprint a;
The fingerprint judging unit is used for searching whether the fingerprint a exists in the fingerprint database, and if so, the fingerprint database enters the index adding unit; if the data does not exist, entering a data writing unit;
An adding index unit, configured to add the physical data page P1 corresponding to the fingerprint a to the physical data page corresponding to the logical address L; adding 1 to the index times of the physical data page P1, and ending the writing of the data block A;
a data writing unit, configured to allocate a free physical data page P2 to the data block a, and add the physical data page P2 to a physical data page corresponding to the logical address L; and adding the fingerprint a into the fingerprint database, recording the index times of the physical data page P2 as 1, adding the logical address L into the logical address corresponding to the physical data page P2, and ending the writing of the data block A.
further, the data security deletion module specifically includes the following units:
the PPN query unit is used for obtaining a plurality of logical page numbers LPN according to the logical address R and the size of the deletion request, and obtaining a plurality of corresponding physical data pages PPN according to a plurality of address mapping tables queried by the plurality of LPNs;
The sharing judgment unit is used for judging whether the PPN is shared by other files or not according to the index times of the PPN for each PPN, and if so, the PPN enters the mapping deletion unit; otherwise, entering a PPN copying unit;
a mapping deleting unit, configured to delete the mapping relationship from the physical data page PPN to the logical address R, where the PPN index number of the physical data page is reduced by 1; judging whether all the PPNs of the physical data page are processed or not, if so, turning to a node deleting unit; otherwise, the sharing judgment unit is switched;
The PPN copying unit is used for deleting the mapping relation from the PPN to the logical address of the physical data page and directly and safely deleting the data block copying operation performed on the PPN of the physical page; judging whether all the PPNs of the physical data page are processed or not, if so, turning to a node deleting unit; otherwise, the sharing judgment unit is switched;
a node deleting unit, configured to delete a PPN node corresponding to each of the plurality of LPNs in the address mapping table; the deletion is completed.
Further, the metadata security deletion module specifically includes the following units:
the physical page PPN searching unit is used for obtaining the physical page PPN corresponding to the mapping relation after the mapping relation in the memory is deleted;
a safe deletion judging unit, configured to judge whether the PPN of the physical page has been safely deleted, and if not, enter a safe deletion marking unit; if yes, safely deleting the metadata;
and the safe deletion marking unit is used for carrying out safe deletion on the physical page PPN and marking that the page is deleted safely.
further, characterized in that the mapping table structure is an adjacency table structure.
Generally, compared with the prior art, the technical scheme of the invention has the following technical characteristics and beneficial effects:
(1) the safe deletion of a single file based on the solid-state disk is realized;
(2) on the basis of realizing the safe deletion, the expense brought by the safe deletion is reduced by combining the deduplication technology, and the influence of the safe deletion on the read-write performance of the solid-state disk is further reduced.
drawings
FIG. 1 is a diagram comparing a normal system and a deduplication system performing secure deletion;
FIG. 2 is a flow chart of a method of an embodiment of the present invention;
FIG. 3 is a flow chart of a method for data writing based on deduplication in accordance with an aspect of the present invention;
FIG. 4 is a flow chart of a method for securely deleting data according to an embodiment of the present invention;
FIG. 5 is a flowchart of a method for securely deleting metadata according to an embodiment of the present invention;
fig. 6 is a diagram illustrating a mapping table structure according to an embodiment of the present invention.
Detailed Description
in order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention. In addition, the technical features involved in the embodiments of the present invention described below may be combined with each other as long as they do not conflict with each other.
as shown in fig. 2, the method of the present invention comprises the steps of:
(1) Judging a user request, and if the user request is a write request, entering the step (2); if yes, entering the step (4);
(2) searching an address mapping table according to the logical address L of the write request, if the address mapping table is hit, keeping the mapping from the logical address L to the data block, marking the mapping relation as invalid, and entering the step (3); if not, directly entering the step (3);
(3) based on the de-duplicated data write, the write request ends;
(4) searching an address mapping table according to the logical address R of the deletion request, and safely deleting the found data blocks;
(5) and safely deleting the metadata corresponding to the found data blocks.
As shown in fig. 3, the method for writing data based on deduplication in the technical solution of the present invention includes the following steps:
(21) calculating a data fingerprint by adopting an SHA-1 algorithm according to the specific content to be written into the data block A to obtain a fingerprint a;
(22) Searching whether the fingerprint a exists in a fingerprint library, and if so, entering a step (23); if not, entering step (24);
(23) adding the physical data page P1 corresponding to the fingerprint a into the physical data page corresponding to the logical address L; adding 1 to the index times of the physical data page P1, and ending the writing of the data block A;
(24) allocating a free physical data page P2 to the data block A, and adding a physical data page P2 to a physical data page corresponding to the logical address L; and adding the fingerprint a into the fingerprint database, recording the index times of the physical data page P2 as 1, adding the logical address L into the logical address corresponding to the physical data page P2, and ending the writing of the data block A.
as shown in fig. 4, the method for safely deleting data in the technical solution of the present invention includes the following steps:
(31) obtaining a plurality of logical page numbers LPN according to the logical address R and the size of the deletion request, and inquiring an address mapping table according to the plurality of LPNs to obtain a plurality of corresponding physical data pages PPN;
(32) for each physical data page PPN, judging whether the physical data page PPN is shared by other files according to the index times of the physical data page PPN, and if so, entering a step (33); otherwise, entering a step (34);
(33) deleting the mapping relation from the physical data page PPN to the logical address R, and subtracting 1 from the PPN index frequency of the physical data page; judging whether all the physical data pages PPN are processed or not, if so, turning to the step (35); otherwise go to step (32);
(34) deleting the mapping relation from the physical data page PPN to the logical address, and directly carrying out safe deletion on the physical data page PPN by executing data block copying operation; judging whether all the physical data pages PPN are processed or not, if so, turning to the step (35); otherwise go to step (32);
(35) deleting the PPN nodes corresponding to the plurality of LPNs in the address mapping table; the deletion is completed.
as shown in fig. 5, the method for safely deleting metadata in the technical solution of the present invention may include the following steps:
(41) after the mapping relation in the memory is deleted, obtaining a physical page PPN corresponding to the modified metadata;
(42) judging whether the PPN of the physical page is safely deleted, if not, entering a step (43); if yes, safely deleting the metadata;
(43) the physical page PPN is securely deleted and the page is marked as having been securely deleted.
as shown in fig. 6, the mapping table structure in the technical solution of the present invention is an adjacency table structure, and specifically, each head node of the adjacency table includes a logical page number LPN and a pointer pointing to a page node, and each page node includes a physical page number PPN and a pointer pointing to a next page node, where only the mapping relationship pointing to a tail page node is valid. When a read request comes, the physical page number in the tail page node is returned; when a write request comes, chaining a newly allocated physical page number PPN into the tail part of a corresponding LPN of the adjacency list; when a deletion request comes, all physical pages pointed by the LPN are safely deleted by the PPN.
the above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents and improvements made within the spirit and principle of the present invention are intended to be included within the scope of the present invention.

Claims (6)

1. A data security deleting method based on an SSD (solid State disk) deduplication technology is characterized by comprising the following steps:
(1) judging a user request, and if the user request is a write request, entering the step (2); if yes, entering the step (4);
(2) searching an address mapping table according to the logical address L of the write request, if the address mapping table is hit, keeping the mapping from the logical address L to the data block, marking the mapping as invalid, and entering the step (3); if not, directly entering the step (3);
(3) based on the de-duplicated data write, the write request ends;
(4) Searching an address mapping table according to the logical address R of the deletion request, and safely deleting the found data blocks;
The step (4) of safely deleting the data block specifically comprises the following steps:
(31) obtaining a plurality of logical page numbers LPN according to the logical address R and the size of the deletion request, and inquiring an address mapping table according to the plurality of LPNs to obtain a plurality of corresponding physical data pages PPN;
(32) for each physical data page PPN, judging whether the physical data page PPN is shared by other files according to the index times of the physical data page PPN, and if so, entering a step (33); otherwise, entering a step (34);
(33) Deleting the mapping relation from the physical data page PPN to the logical address R, and subtracting 1 from the PPN index frequency of the physical data page; judging whether all the physical data pages PPN are processed or not, if so, turning to the step (35); otherwise go to step (32);
(34) Deleting the mapping relation from the physical data page PPN to the logical address, and directly carrying out safe deletion on the physical data page PPN by executing data block copying operation; judging whether all the physical data pages PPN are processed or not, if so, turning to the step (35); otherwise go to step (32);
(35) Deleting the PPN nodes corresponding to the plurality of LPNs in the address mapping table; the deletion is completed;
(5) safely deleting the metadata corresponding to the found data block, and ending the deletion request; the step (5) of securely deleting the metadata specifically includes the following steps:
(41) after the mapping relation in the memory is deleted, obtaining a physical page PPN corresponding to the modified metadata;
(42) judging whether the PPN of the physical page is safely deleted, if not, entering a step (43); if yes, safely deleting the metadata;
(43) the physical page PPN is securely deleted and marked as having been securely deleted.
2. the method according to claim 1, wherein the step (3) of writing the data based on the deduplication specifically comprises the following steps:
(21) Calculating a data fingerprint according to specific content to be written into the data block A to obtain a fingerprint a;
(22) searching whether the fingerprint a exists in a fingerprint library, and if so, entering a step (23); if not, entering step (24);
(23) adding the physical data page P1 corresponding to the fingerprint a into the physical data page corresponding to the logical address L; adding 1 to the index times of the physical data page P1, and ending the writing of the data block A;
(24) allocating a free physical data page P2 to the data block A, and adding a physical data page P2 to a physical data page corresponding to the logical address L; and adding the fingerprint a into the fingerprint database, recording the index times of the physical data page P2 as 1, adding the logical address L into the logical address corresponding to the physical data page P2, and ending the writing of the data block A.
3. the method for safely deleting data based on the SSD deduplication technology as claimed in claim 1 or 2, wherein the structure of the mapping table is an adjacency table structure.
4. A data safe deleting system based on SSD deduplication technology is characterized by comprising the following parts:
the user request judging module is used for judging a user request, and if the user request is a writing request, the user request enters the content updating judging module; if the request is a deletion request, entering a data security deletion module;
a content updating judgment module, which is used for searching an address mapping table according to the logical address L of the writing request, if the address mapping table is hit, the mapping from the logical address L to the data block is reserved, the mapping is marked as invalid, and the data block enters a duplication elimination writing module; if not, directly entering a deduplication writing module;
A deduplication write module, configured to write data based on deduplication and end a write request;
the data safety deleting module is used for searching an address mapping table according to the logical address R of the deleting request and safely deleting the found data blocks; the data security deleting module specifically comprises the following units:
the PPN query unit is used for obtaining a plurality of logical page numbers LPN according to the logical address R and the size of the deletion request, and obtaining a plurality of corresponding physical data pages PPN according to a plurality of address mapping tables queried by the plurality of LPNs;
The sharing judgment unit is used for judging whether the PPN is shared by other files or not according to the index times of the PPN for each PPN, and if so, the PPN enters the mapping deletion unit; otherwise, entering a PPN copying unit;
a mapping deleting unit, configured to delete the mapping relationship from the physical data page PPN to the logical address R, where the PPN index number of the physical data page is reduced by 1; judging whether all the PPNs of the physical data page are processed or not, if so, turning to a node deleting unit; otherwise, the sharing judgment unit is switched;
The PPN copying unit is used for deleting the mapping relation from the PPN to the logical address of the physical data page and directly and safely deleting the data block copying operation performed on the PPN of the physical page; judging whether all the PPNs of the physical data page are processed or not, if so, turning to a node deleting unit; otherwise, the sharing judgment unit is switched;
A node deleting unit, configured to delete a PPN node corresponding to each of the plurality of LPNs in the address mapping table; the deletion is completed;
the metadata safety deleting module is used for safely deleting the metadata corresponding to the found data block and ending the deleting request; the metadata safe deleting module specifically comprises the following units:
the physical page PPN searching unit is used for obtaining the physical page PPN corresponding to the modified metadata after the mapping relation in the memory is deleted;
a safe deletion judging unit, configured to judge whether the PPN of the physical page has been safely deleted, and if not, enter a safe deletion marking unit; if yes, safely deleting the metadata;
And the safe deletion marking unit is used for safely deleting the PPN of the physical page and marking that the PPN of the physical page is safely deleted.
5. the system according to claim 4, wherein the de-rewrite module specifically includes the following units:
the data fingerprint calculation unit is used for calculating a data fingerprint according to specific content to be written into the data block A to obtain a fingerprint a;
The fingerprint judging unit is used for searching whether the fingerprint a exists in the fingerprint database, and if so, the fingerprint database enters the index adding unit; if the data does not exist, entering a data writing unit;
an adding index unit, configured to add the physical data page P1 corresponding to the fingerprint a to the physical data page corresponding to the logical address L; adding 1 to the index times of the physical data page P1, and ending the writing of the data block A;
a data writing unit, configured to allocate a free physical data page P2 to the data block a, and add the physical data page P2 to a physical data page corresponding to the logical address L; and adding the fingerprint a into the fingerprint database, recording the index times of the physical data page P2 as 1, adding the logical address L into the logical address corresponding to the physical data page P2, and ending the writing of the data block A.
6. the SSD deduplication technology-based data security deletion system of claim 4 or 5, wherein the structure of the mapping table is an adjacency table structure.
CN201710059169.8A 2017-01-24 2017-01-24 data safe deletion method and system based on SSD (solid State disk) deduplication technology Active CN106886370B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710059169.8A CN106886370B (en) 2017-01-24 2017-01-24 data safe deletion method and system based on SSD (solid State disk) deduplication technology

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710059169.8A CN106886370B (en) 2017-01-24 2017-01-24 data safe deletion method and system based on SSD (solid State disk) deduplication technology

Publications (2)

Publication Number Publication Date
CN106886370A CN106886370A (en) 2017-06-23
CN106886370B true CN106886370B (en) 2019-12-06

Family

ID=59175444

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710059169.8A Active CN106886370B (en) 2017-01-24 2017-01-24 data safe deletion method and system based on SSD (solid State disk) deduplication technology

Country Status (1)

Country Link
CN (1) CN106886370B (en)

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108121504B (en) * 2017-11-16 2021-01-29 成都华为技术有限公司 Data deleting method and device
CN108052644B (en) * 2017-12-22 2019-05-21 深圳大普微电子科技有限公司 The method for writing data and system of data pattern log file system
CN108197040A (en) * 2018-01-12 2018-06-22 江苏华存电子科技有限公司 A kind of provider location reflects the high-effect method of logical image position
CN109002400B (en) * 2018-06-01 2023-05-05 暨南大学 Content-aware computer cache management system and method
CN109284237B (en) * 2018-09-26 2021-10-29 郑州云海信息技术有限公司 Garbage recovery method and system in full flash memory array
CN110908610A (en) * 2019-11-24 2020-03-24 浪潮电子信息产业股份有限公司 Volume recovery station cleaning method, device, equipment and readable storage medium
CN113342758B (en) * 2021-08-06 2021-11-19 联想凌拓科技有限公司 Metadata management method, device, equipment and medium of file system

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102646069A (en) * 2012-02-23 2012-08-22 华中科技大学 Method for prolonging service life of solid-state disk
CN103150258A (en) * 2013-03-20 2013-06-12 中国科学院苏州纳米技术与纳米仿生研究所 Writing, reading and garbage collection method of solid-state memory system
CN105513640A (en) * 2015-12-03 2016-04-20 深圳佰维存储科技有限公司 Solid state disk data erasing method and system thereof
CN105608394A (en) * 2015-12-22 2016-05-25 华中科技大学 Secure deletion method for data in solid-state disk on basis of flash memory

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104808951B (en) * 2014-01-28 2018-02-09 国际商业机器公司 The method and apparatus for carrying out storing control

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102646069A (en) * 2012-02-23 2012-08-22 华中科技大学 Method for prolonging service life of solid-state disk
CN103150258A (en) * 2013-03-20 2013-06-12 中国科学院苏州纳米技术与纳米仿生研究所 Writing, reading and garbage collection method of solid-state memory system
CN105513640A (en) * 2015-12-03 2016-04-20 深圳佰维存储科技有限公司 Solid state disk data erasing method and system thereof
CN105608394A (en) * 2015-12-22 2016-05-25 华中科技大学 Secure deletion method for data in solid-state disk on basis of flash memory

Also Published As

Publication number Publication date
CN106886370A (en) 2017-06-23

Similar Documents

Publication Publication Date Title
CN106886370B (en) data safe deletion method and system based on SSD (solid State disk) deduplication technology
US10007468B2 (en) Method and apparatus for erasing data in data section in flash memory
US11226747B2 (en) System and method for copy on write on an SSD
US11301379B2 (en) Access request processing method and apparatus, and computer device
US11782632B2 (en) Selective erasure of data in a SSD
CN108604165B (en) Storage device
US11030092B2 (en) Access request processing method and apparatus, and computer system
US11144508B2 (en) Region-integrated data deduplication implementing a multi-lifetime duplicate finder
KR101473837B1 (en) An Invalid Data Recycling Method for Improving I/O Performance in SSD-based Storage System
CN103257928B (en) Flash memory device data managing method and system
US20110264848A1 (en) Data recording device
US11461225B2 (en) Storage device, control method of storage device, and storage medium
CN110389706B (en) Fingerprint recovery method and storage system
Yoo et al. Variable Block Scheme for Minimizing File I/O.
KR20220105612A (en) Hash based key value to block translation methods and systems
Munegowda et al. Adapting Endurance and Performance Optimization Strategies of ExFAT file system to FAT file system for embedded storage devices

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant