CN119356948B - A hard disk data backup method - Google Patents
A hard disk data backup method Download PDFInfo
- Publication number
- CN119356948B CN119356948B CN202411932951.2A CN202411932951A CN119356948B CN 119356948 B CN119356948 B CN 119356948B CN 202411932951 A CN202411932951 A CN 202411932951A CN 119356948 B CN119356948 B CN 119356948B
- Authority
- CN
- China
- Prior art keywords
- data
- compressed
- repeated
- packets
- backed
- 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
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/14—Error detection or correction of the data by redundancy in operation
- G06F11/1402—Saving, restoring, recovering or retrying
- G06F11/1446—Point-in-time backing up or restoration of persistent data
- G06F11/1448—Management of the data involved in backup or backup restore
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/14—Error detection or correction of the data by redundancy in operation
- G06F11/1402—Saving, restoring, recovering or retrying
- G06F11/1446—Point-in-time backing up or restoration of persistent data
- G06F11/1458—Management of the backup or restore process
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/602—Providing cryptographic facilities or services
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/70—Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer
- G06F21/78—Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer to assure secure storage of data
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computer Security & Cryptography (AREA)
- Computer Hardware Design (AREA)
- Software Systems (AREA)
- Quality & Reliability (AREA)
- Health & Medical Sciences (AREA)
- Bioethics (AREA)
- General Health & Medical Sciences (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a hard disk data backup method, which relates to the technical field of data backup, solves the technical problems of low efficiency in the backup process caused by insufficient consideration of diversity and complexity of data and lack of effective screening and optimizing mechanisms, can rapidly locate and process different types of data by carefully classifying the data to be backed up according to data types and time, is favorable for preferentially backing up important or recent data by time sequencing the data of the same type, the efficiency of data management is improved, the repeated data is accurately identified by adopting a hash value calculation mode, the latest data is reserved according to the data time, the rest repeated data is stored in a replacement template, a large amount of storage space is saved, the data can be restored according to the replacement template when needed, the traceability and the integrity of the data are ensured, the data capacity is combined for segmentation, recombination and encryption storage, the hard disk storage space can be fully utilized, and the safety of data backup is improved.
Description
Technical Field
The invention relates to the technical field of data backup, in particular to a hard disk data backup method.
Background
With the rapid development of information technology, the amount of data generated by enterprises and individuals is increased explosively, and hard disks are used as main data storage devices, so that the safety and efficient management of data are increasingly important. In the data backup process, many challenges are faced.
The patent with the publication number of CN114546723A discloses a data backup method of a mobile solid state disk and the mobile solid state disk, wherein the data backup method of the mobile solid state disk sets mode switching, under a conventional storage mode, the backup function of a backup area is not started, and only a storage area is used for operating data, so that the data access operation efficiency of the storage area is improved, and under the backup mode, the backup area is started, the storage area is matched with the backup area, and the backup of incremental data of the storage area, the data recovery of the backup area and the deletion of related data of the backup area are realized.
Traditional data backup methods tend to simply copy or compress the whole disk of data for storage, and the diversity and complexity of the data are not fully considered. For example, a large amount of repeated data occupies excessive storage space when backed up, and the utilization rate of storage resources is reduced. Different types of data have different importance and frequency of use, and existing backup approaches fail to address pertinence. In addition, for some special types of data, such as data formats which are difficult to identify by a system or redundant compressed files generated in a backup process, an effective screening and optimizing mechanism is lacked, so that the backup process is low in efficiency and the storage structure is disordered, and the subsequent data recovery and management are not facilitated.
Disclosure of Invention
Aiming at the defects of the prior art, the invention provides a hard disk data backup method, which solves the problem of low efficiency in the backup process caused by lack of effective screening and optimizing mechanisms because of insufficient consideration of diversity and complexity of data.
The invention is realized by the following technical scheme that the hard disk data backup method comprises the following steps:
Step one, acquiring all data to be backed up, classifying the data to be backed up to obtain classification information, wherein the data to be backed up comprises the data type and the data time of the data to be backed up;
step two, processing the obtained classified information, identifying repeated data by calculating a hash value, and secondarily classifying non-repeated data according to the data type to obtain conventional data and non-conventional data;
Removing the obtained non-conventional data, analyzing the obtained conventional data, and identifying and binding the compressed data in the conventional data to obtain a compressed binding package;
Step four, carrying out backup storage analysis on the obtained repeated data, classifying the repeated data, replacing the same repeated data to generate a replacement template, and storing the replacement template to generate backup storage information;
And fifthly, carrying out backup storage analysis on the obtained compressed bundle package and conventional data, analyzing and sectionally processing the data time, sectioning according to the corresponding data capacity, inserting and encrypting the sectionalized data package, and carrying out encryption storage by combining the corresponding data capacity to generate backup storage information.
As a further aspect of the present invention, the specific manner of obtaining the classification information in the first step is:
And marking all data to be backed up as i, wherein i=1, 2, i, j represents the quantity of the data to be backed up, then classifying the data to be backed up according to the data types, marking the classified data of the same type as n, and n=1, 2, i, m, wherein m represents the data types of the data of the same type, and sequencing the data to be backed up in the data of the same type from far to near according to the data time to generate classification information.
As a further aspect of the present invention, the specific manner of processing the classification information in the second step is:
obtaining classification information, simultaneously obtaining any group of classification information as an analysis target, marking corresponding data to be backed up in the analysis target as a, wherein a=1, 2, & gt, b represents the quantity of the data to be backed up in the same type, calculating the hash value of the data to be backed up a, screening the data to be backed up with the same hash value, marking the data as repeated data, and marking the remaining data to be backed up as non-repeated data;
And acquiring all the non-repeated data, acquiring the data type of the non-repeated data, identifying the data type, judging whether the system can identify the data type, marking the corresponding non-repeated data as regular data if the system can identify the data type, and marking the corresponding non-repeated data as irregular data if the system cannot identify the data type.
As a further scheme of the present invention, the specific way of analyzing the conventional data in the third step is as follows:
Acquiring all the non-conventional data, directly deleting the non-conventional data, acquiring all the conventional data, analyzing whether the compressed data exists in the conventional data, classifying the corresponding conventional data as conventional compressed data if the compressed data exists in the conventional data, and classifying the corresponding conventional data as conventional non-compressed data if the compressed data does not exist in the conventional data;
And then analyzing the conventional compressed data, judging whether the compressed data in the conventional compressed data has corresponding decompressed data, if so, deleting the corresponding compressed data, and if not, reserving the corresponding compressed data, so as to push all the conventional compressed data for analysis, obtaining all the compressed data, and binding the compressed data to obtain a compression binding package.
As a further scheme of the invention, the specific mode of carrying out backup storage analysis on the repeated data in the fourth step is as follows:
And acquiring all the repeated data, acquiring part of storage space of the hard disk, simultaneously acquiring the data types of the repeated data, marking the data types as k, wherein k=1, 2, & gt, h represents the number of the types of the repeated data, then acquiring any group of data types as an analysis target, acquiring all the corresponding repeated data in the analysis target, acquiring the data time corresponding to the repeated data, simultaneously taking the latest data time as a storage standard, generating marks from the rest of the repeated data according to the data time from far to near, storing the generated marks as replacement data, and generating backup storage information.
As a further scheme of the invention, the specific mode of carrying out backup storage analysis on the compression bundle and the conventional data in the fifth step is as follows:
Obtaining a compression bundle and conventional data, obtaining a residual storage space of a hard disk, marking the compression bundle as N, and n=1, 2, and..the conventional data as M, and m=1, 2, and then obtaining data time corresponding to the compression bundle N and the conventional data M, and simultaneously segmenting the data time according to a time T;
Then, any time period is segmented into a target time period, then, corresponding compression binding packages and conventional data in the target time period are acquired, all the compression binding packages and the conventional data are respectively combined to obtain compression combination packages and conventional data packages, data capacities corresponding to the compression combination packages and the conventional data packages are acquired, meanwhile, the compression combination packages and the conventional data packages are equally divided according to the data capacities to obtain equally divided compression combination packages and equally divided conventional data packages, and storage analysis is carried out on the equally divided compression combination packages and the equally divided conventional data packages.
As a further scheme of the invention, in the fifth step, the specific mode of carrying out storage analysis on the equally divided compressed combination packet and the equally divided conventional data packet is as follows:
calculating the sum of the numbers of the equal-dividing compressed combination packets and the equal-dividing conventional data packets, judging the numerical property of the sum, if the numerical property is odd, selecting two equal-dividing compressed combination packets according to the sequence from small to large, selecting two equal-dividing conventional data packets according to the sequence from large to small, recombining the two selected equal-dividing compressed combination packets and the equal-dividing conventional data packets to obtain an equal-dividing recombination packet, and backing up and storing the equal-dividing recombination packet to generate backup storage information;
And if the numerical property is even, selecting two groups of equipartition compression combination packets according to the sequence from large to small, selecting two groups of equipartition conventional data packets according to the sequence from small to large, recombining the selected two groups of equipartition compression combination packets and the equipartition conventional data packets to obtain an equipartition recombination packet, and simultaneously carrying out backup storage to generate backup storage information.
The invention provides a hard disk data backup method. Compared with the prior art, the method has the following beneficial effects:
The invention can rapidly locate and process different types of data by finely classifying the data to be backed up according to the data types and time, such as sorting the data of the same type according to time, thereby being beneficial to backing up important or recent data preferentially, improving the efficiency of data management, accurately identifying repeated data by adopting a Hash value calculation mode, reserving the latest data according to the data time, generating a replacement template for storage by the rest repeated data, saving a large amount of storage space, restoring the data according to the replacement template when needed, and ensuring the traceability and integrity of the data;
The method comprises the steps of respectively processing conventional data and non-conventional data, eliminating the non-conventional data which cannot be identified by a system, further analyzing and decompressing the compressed data in the conventional data, comparing the compressed data with the decompressed data, only reserving and binding the compressed data without corresponding decompressed data, reducing the backup data quantity, improving the standardability of the data, processing the compressed binding package and the conventional data according to the data time section, and combining the data capacity for segmentation, recombination and encryption storage. The method not only can fully utilize the storage space of the hard disk, but also improves the safety of data backup.
Drawings
FIG. 1 is a process diagram of the present invention.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
Referring to fig. 1, the present application provides a hard disk data backup method, which specifically includes the following steps:
Step one, acquiring all data to be backed up, classifying the data to be backed up to obtain classification information, wherein the data to be backed up comprises the data type and the data time of the data to be backed up.
And marking all data to be backed up as i, wherein i=1, 2, i, j represents the quantity of the data to be backed up, then classifying the data to be backed up according to the data types, marking the classified data of the same type as n, and n=1, 2, i, m, wherein m represents the data types of the data of the same type, and sequencing the data to be backed up in the data of the same type from far to near according to the data time to generate classification information.
For example, in a file backup scenario for an enterprise, the data types may include office documents (such as Word, excel, powerPoint files, etc.), project design classes (such as CAD drawings, photoshop source files, etc.), mail data classes, etc., where a contract document is created on1 st 3 in 2018, a report document is created on 10 th 5 in 2020, and a meeting era is created on 15 th 9 in 2022, then after sorting, the contract document is top ranked, and the meeting era is last ranked.
And secondly, processing the obtained classified information, identifying repeated data by calculating a hash value, and secondarily classifying non-repeated data according to the data type to obtain regular data and non-regular data.
The method comprises the steps of obtaining classification information, obtaining any group of classification information as an analysis target, marking corresponding data to be backed up in the analysis target as a, and calculating a=1, 2, & gt, b, wherein b represents the number of the data to be backed up in the same type, then calculating hash values of the data to be backed up a, calculating a plurality of hash values through a multiplication hash method, screening the data to be backed up with the same hash values, marking the data to be backed up as repeated data, and marking the remaining data to be backed up as non-repeated data, for example, for a group of image file classification information, wherein three scenic pictures are respectively numbered as a=1, a=2 and a=3, calculating hash values of the three pictures, wherein the hash values of the picture 1 and the picture 3 are the same, indicating that the picture 1 and the picture 3 are repeated data, and the hash value of the picture 2 is different from the hash values of the two, and marking the picture 2 as non-repeated data.
And acquiring all the non-repeated data, acquiring the data type of the non-repeated data, identifying the data type, judging whether the system can identify the data type, marking the corresponding non-repeated data as regular data if the system can identify the data type, and marking the corresponding non-repeated data as irregular data if the system cannot identify the data type. Specifically, for example, when drawing is performed by using CAD, a corresponding BAK file is generated after the CAD drawing is saved, and the generated BAK file system cannot be identified, so that the generated BAK file system is further marked as irregular data.
And thirdly, eliminating the obtained non-conventional data, analyzing the obtained conventional data, and obtaining the compressed bundle package by identifying and binding the compressed data in the conventional data.
All the non-conventional data are obtained, the deleting operation is directly carried out on the non-conventional data, all the conventional data are obtained, meanwhile, whether the compressed data exist in the conventional data or not is analyzed, specifically, the compressed data specifically refer to a compressed package, if the compressed data exist in the conventional data, the corresponding conventional data are classified into the conventional compressed data, if the compressed data do not exist in the conventional data, the corresponding conventional data are classified into the conventional non-compressed data, specifically, if five groups of data exist in the conventional data, two groups of data are the compressed data, the data types of the compressed data comprise ZIP, RAR, 7Z, TAR, GZ and the like, and if the corresponding data are the end, the corresponding data are expressed as the compressed data, the corresponding data are classified into the conventional compressed data.
And then analyzing the conventional compressed data, judging whether the compressed data in the conventional compressed data has corresponding decompressed data, if so, deleting the corresponding compressed data, and if not, reserving the corresponding compressed data, so as to push all the conventional compressed data for analysis, obtaining all the compressed data, and binding the compressed data to obtain a compression binding package.
And fourthly, carrying out backup storage analysis on the obtained repeated data, classifying the repeated data, replacing the same repeated data to generate a replacement template, and storing the replacement template to generate backup storage information.
Acquiring all repeated data, acquiring part of storage space of a hard disk, setting the size of the part of storage space by an operator, acquiring and marking the data types of the repeated data as k, wherein k=1, 2, & gt and h, h represents the types and the number of the repeated data, the specific data types of the same type comprise a plurality of repeated data, then acquiring any group of data types as analysis targets, acquiring all the repeated data corresponding to the analysis targets, acquiring the data time corresponding to the repeated data, simultaneously taking the latest data time as a storage standard, generating marks from far to near according to the data time, storing the generated marks as replacement data, and generating backup storage information, and the specific replacement data represents that the data time corresponding to the repeated data is marked as 1, 2 and the like from far to near.
For example, five groups of repeated data exist in the analysis target, and the corresponding time is 1 month 5 day, 4 month 12 day, 5 month 3 day, 8 month 18 day and 11 month 20 day respectively, then the latest time, that is, 11 month 20 day is selected as the storage standard to store, and for the rest of the repeated data, the labels are generated according to the time sequence, the specific labels corresponding to 1 month 5 day are 1, the labels corresponding to 4 month 12 day are 2, the labels corresponding to 5 month 3 day are 3, the labels corresponding to 8 month 18 day are 4, and the corresponding labels are further stored.
And fifthly, carrying out backup storage analysis on the obtained compressed bundle package and conventional data, analyzing and sectionally processing the data time, sectioning according to the corresponding data capacity, inserting and encrypting the sectionalized data package, and carrying out encryption storage by combining the corresponding data capacity to generate backup storage information.
Obtaining a compression bundle and conventional data, and obtaining a remaining storage space of a hard disk, wherein the remaining storage space is the remaining storage space in the step four, and meanwhile, the compression bundle is marked as N, and n=1, 2, & gt, the conventional data is marked as M, and m=1, 2, & gt, then, data time corresponding to the compression bundle N and the conventional data M is obtained, and meanwhile, the data time is segmented according to time T, and the specific value of the time T is set by an operator;
Then, obtaining any time period segment as a target time period, obtaining a compression binding packet and conventional data corresponding to the target time period, respectively combining all the compression binding packets and the conventional data to obtain a compression combination packet and a conventional data packet, obtaining data capacity corresponding to the compression combination packet and the conventional data packet, equally dividing the compression combination packet and the conventional data packet according to the data capacity to obtain an equally divided compression combination packet and an equally divided conventional data packet, wherein the equally divided quantity is determined by the maximum common factor of the data capacity of the corresponding compression combination packet and the conventional data packet, for example, if the maximum common factor of the compression combination packet is 7, the quantity of the compression combination packet is 7 groups, and the maximum common factor of the conventional data packet is 8, and the quantity of the conventional data packet is 8 groups;
Calculating the sum of the numbers of the equally divided compressed combination packets and the equally divided conventional data packets, wherein the sum of the numbers is expressed as the sum of the numbers after the equally divided, judging the numerical property of the sum of the numbers, selecting two groups of equally divided compressed combination packets according to the sequence from small to large if the numerical property is odd, selecting two groups of equally divided conventional data packets according to the sequence from large to small, recombining the two groups of selected equally divided compressed combination packets and the equally divided conventional data packets to obtain equally divided recombination packets, backing up the equally divided recombination packets, storing the equally divided recombination packets to generate backup storage information, selecting two groups of equally divided compressed combination packets according to the sequence from large to small if the numerical property is even, selecting two groups of equally divided conventional data packets according to the sequence from small to large, recombining the two groups of selected equally divided compressed combination packets and the equally divided conventional data packets to obtain equally divided recombination packets, and simultaneously carrying out backup storage to generate the backup storage information.
Embodiment II as embodiment II of the present invention, which is implemented on the basis of embodiment I, is different from embodiment I in that:
the division of the hard disk storage space is different from the embodiment in which the division is performed by analyzing the data capacity ratio of the repeated data to the non-repeated data, and the non-repeated data herein mainly includes the compressed data and the normal data.
Embodiment III As embodiment III of the present invention, the emphasis is on combining the implementation procedures of embodiment I and embodiment II.
Some of the data in the above formulas are numerical calculated by removing their dimensionality, and the contents not described in detail in the present specification are all well known in the prior art.
The above embodiments are only for illustrating the technical method of the present invention and not for limiting the same, and it should be understood by those skilled in the art that the technical method of the present invention may be modified or substituted without departing from the spirit and scope of the technical method of the present invention.
Claims (3)
1. A hard disk data backup method is characterized by comprising the following steps:
Step one, acquiring all data to be backed up, classifying the data to be backed up to obtain classification information, wherein the data to be backed up comprises the data type and the data time of the data to be backed up;
Step two, processing the obtained classified information, identifying repeated data by calculating a hash value, and secondarily classifying non-repeated data according to data types to obtain conventional data and non-conventional data, wherein the specific processing mode is as follows:
obtaining classification information, simultaneously obtaining any group of classification information as an analysis target, marking corresponding data to be backed up in the analysis target as a, wherein a=1, 2, & gt, b represents the quantity of the data to be backed up in the same type, calculating the hash value of the data to be backed up a, screening the data to be backed up with the same hash value, marking the data as repeated data, and marking the remaining data to be backed up as non-repeated data;
Acquiring all non-repeated data, acquiring the data type of the non-repeated data, identifying the data type, judging whether the system can identify the data type, marking the corresponding non-repeated data as conventional data if the system can identify the data type, and marking the corresponding non-repeated data as the non-conventional data if the system cannot identify the data type;
Acquiring all the non-conventional data, directly deleting the non-conventional data, acquiring all the conventional data, analyzing whether the compressed data exists in the conventional data, classifying the corresponding conventional data as conventional compressed data if the compressed data exists in the conventional data, and classifying the corresponding conventional data as conventional non-compressed data if the compressed data does not exist in the conventional data;
Then analyzing the conventional compressed data, judging whether the compressed data in the conventional compressed data has corresponding decompressed data, if so, deleting the corresponding compressed data, if not, reserving the corresponding compressed data, analyzing all the conventional compressed data by pushing the same, obtaining all the compressed data, and binding the compressed data to obtain a compression binding package;
Removing the obtained non-conventional data, analyzing the obtained conventional data, and identifying and binding the compressed data in the conventional data to obtain a compressed binding package;
Step four, carrying out backup storage analysis on the obtained repeated data, classifying the repeated data, replacing the same repeated data to generate a replacement template, and storing the replacement template to generate backup storage information;
And fifthly, carrying out backup storage analysis on the obtained compressed bundle and conventional data, analyzing and sectionally processing the data time, simultaneously sectioning according to the corresponding data capacity, inserting and encrypting the sectionalized data packet, and carrying out encryption storage by combining the corresponding data capacity to generate backup storage information, wherein the specific processing mode is as follows:
Obtaining a compression bundle and conventional data, obtaining a residual storage space of a hard disk, marking the compression bundle as N, and n=1, 2, and..the conventional data as M, and m=1, 2, and then obtaining data time corresponding to the compression bundle N and the conventional data M, and simultaneously segmenting the data time according to a time T;
Then, acquiring any time period segment as a target time period, acquiring corresponding compression binding packets and conventional data in the target time period, respectively combining all the compression binding packets and the conventional data to obtain compression combination packets and conventional data packets, acquiring data capacities corresponding to the compression combination packets and the conventional data packets, equally dividing the compression combination packets and the conventional data packets according to the data capacities to obtain equally divided compression combination packets and equally divided conventional data packets, and carrying out storage analysis on the equally divided compression combination packets and the equally divided conventional data packets;
calculating the sum of the numbers of the equal-dividing compressed combination packets and the equal-dividing conventional data packets, judging the numerical property of the sum, if the numerical property is odd, selecting two equal-dividing compressed combination packets according to the sequence from small to large, selecting two equal-dividing conventional data packets according to the sequence from large to small, recombining the two selected equal-dividing compressed combination packets and the equal-dividing conventional data packets to obtain an equal-dividing recombination packet, and backing up and storing the equal-dividing recombination packet to generate backup storage information;
And if the numerical property is even, selecting two groups of equipartition compression combination packets according to the sequence from large to small, selecting two groups of equipartition conventional data packets according to the sequence from small to large, recombining the selected two groups of equipartition compression combination packets and the equipartition conventional data packets to obtain an equipartition recombination packet, and simultaneously carrying out backup storage to generate backup storage information.
2. The method for backing up hard disk data according to claim 1, wherein the specific manner of obtaining the classification information in the first step is:
And marking all data to be backed up as i, wherein i=1, 2, i, j represents the quantity of the data to be backed up, then classifying the data to be backed up according to the data types, marking the classified data of the same type as n, and n=1, 2, i, m, wherein m represents the data types of the data of the same type, and sequencing the data to be backed up in the data of the same type from far to near according to the data time to generate classification information.
3. The method for backing up hard disk data according to claim 1, wherein the specific way of backing up, storing and analyzing the repeated data in the fourth step is as follows:
And acquiring all the repeated data, acquiring part of storage space of the hard disk, simultaneously acquiring the data types of the repeated data, marking the data types as k, wherein k=1, 2, & gt, h represents the number of the types of the repeated data, then acquiring any group of data types as an analysis target, acquiring all the corresponding repeated data in the analysis target, acquiring the data time corresponding to the repeated data, simultaneously taking the latest data time as a storage standard, generating marks from the rest of the repeated data according to the data time from far to near, storing the generated marks as replacement data, and generating backup storage information.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202411932951.2A CN119356948B (en) | 2024-12-26 | 2024-12-26 | A hard disk data backup method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202411932951.2A CN119356948B (en) | 2024-12-26 | 2024-12-26 | A hard disk data backup method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN119356948A CN119356948A (en) | 2025-01-24 |
| CN119356948B true CN119356948B (en) | 2025-03-21 |
Family
ID=94317333
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202411932951.2A Active CN119356948B (en) | 2024-12-26 | 2024-12-26 | A hard disk data backup method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN119356948B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN120067051A (en) * | 2025-04-27 | 2025-05-30 | 中国人民解放军总医院第一医学中心 | Hemodialysis management system and method |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN118885545A (en) * | 2024-09-30 | 2024-11-01 | 兰陵县城乡测绘院 | A three-dimensional model data management system and method for engineering surveying and mapping |
| CN119089281A (en) * | 2024-11-08 | 2024-12-06 | 杭州叉车钣焊有限公司 | A data management method and system for workshop production |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116483287B (en) * | 2023-06-21 | 2024-02-06 | 宝德计算机系统股份有限公司 | Data security storage method and system for Internet users |
| CN118260782A (en) * | 2024-04-10 | 2024-06-28 | 国网江苏省电力有限公司信息通信分公司 | A method and system for encrypting and storing private data |
-
2024
- 2024-12-26 CN CN202411932951.2A patent/CN119356948B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN118885545A (en) * | 2024-09-30 | 2024-11-01 | 兰陵县城乡测绘院 | A three-dimensional model data management system and method for engineering surveying and mapping |
| CN119089281A (en) * | 2024-11-08 | 2024-12-06 | 杭州叉车钣焊有限公司 | A data management method and system for workshop production |
Also Published As
| Publication number | Publication date |
|---|---|
| CN119356948A (en) | 2025-01-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7401080B2 (en) | Storage reports duplicate file detection | |
| US7478113B1 (en) | Boundaries | |
| US8244767B2 (en) | Composite locality sensitive hash based processing of documents | |
| US7860843B2 (en) | Data compression and storage techniques | |
| US7117294B1 (en) | Method and system for archiving and compacting data in a data storage array | |
| US7587401B2 (en) | Methods and apparatus to compress datasets using proxies | |
| US8799238B2 (en) | Data deduplication | |
| US20120310890A1 (en) | Data compression and storage techniques | |
| US20050203864A1 (en) | System and method for data management | |
| KR20170054299A (en) | Reference block aggregating into a reference set for deduplication in memory management | |
| CN110716739B (en) | Code change information statistical method, system and readable storage medium | |
| CN113590594B (en) | Bank database migration method and device | |
| CN114115734B (en) | Data deduplication method, device, equipment and storage medium | |
| US10496612B2 (en) | Method for reliable and efficient filesystem metadata conversion | |
| CN112380071B (en) | Method for quickly backing up NTFS file system | |
| CN119356948B (en) | A hard disk data backup method | |
| CN114153690B (en) | Program memory monitoring method, device, computer equipment and storage medium | |
| CN115630343A (en) | Electronic document information processing method, device and equipment | |
| CN109947730A (en) | Metadata restoration methods, device, distributed file system and readable storage medium storing program for executing | |
| CN118233454A (en) | File batch uploading method and medium | |
| US11789639B1 (en) | Method and apparatus for screening TB-scale incremental data | |
| CN104156420B (en) | The management method and device of transaction journal | |
| CN119046247A (en) | Method and device for processing error correction of bidding document information and computer equipment | |
| US20130218851A1 (en) | Storage system, data management device, method and program | |
| CN118012656A (en) | Damaged PDF document repairing method, device, equipment and storage medium |
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 |