CN100337220C - Real-time dynamic data protecting method for Linux system hard disc - Google Patents
Real-time dynamic data protecting method for Linux system hard disc Download PDFInfo
- Publication number
- CN100337220C CN100337220C CNB031144918A CN03114491A CN100337220C CN 100337220 C CN100337220 C CN 100337220C CN B031144918 A CNB031144918 A CN B031144918A CN 03114491 A CN03114491 A CN 03114491A CN 100337220 C CN100337220 C CN 100337220C
- Authority
- CN
- China
- Prior art keywords
- block
- piece
- data
- type
- hard disc
- 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.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 18
- 238000013507 mapping Methods 0.000 claims description 30
- 239000012467 final product Substances 0.000 claims description 3
- 230000006378 damage Effects 0.000 abstract description 8
- 238000010367 cloning Methods 0.000 abstract 1
- 238000013506 data mapping Methods 0.000 abstract 1
- 230000003287 optical effect Effects 0.000 abstract 1
- 238000011084 recovery Methods 0.000 description 6
- 206010033799 Paralysis Diseases 0.000 description 5
- 241000700605 Viruses Species 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 230000000694 effects Effects 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 238000005192 partition Methods 0.000 description 2
- 238000004321 preservation Methods 0.000 description 2
- 238000011282 treatment Methods 0.000 description 2
- 101100226366 Arabidopsis thaliana EXT3 gene Proteins 0.000 description 1
- 102100029074 Exostosin-2 Human genes 0.000 description 1
- 101000918275 Homo sapiens Exostosin-2 Proteins 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000009434 installation Methods 0.000 description 1
- 230000003211 malignant effect Effects 0.000 description 1
- 208000034420 multiple type III exostoses Diseases 0.000 description 1
- 239000002574 poison Substances 0.000 description 1
- 231100000614 poison Toxicity 0.000 description 1
- 230000002265 prevention Effects 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Images
Abstract
The present invention relates to a real-time dynamic data protecting method for a Linux system hard disc based on a BIOS layer, which uses an operating system layer as an application and achieves the real-time monitor and the dynamic protection of the data of the hard disc under Linux environment, and the real-time dynamic data protecting method for a Linux system hard disc rapidly archives a normal system. Under the conditions of the damage, the collapse and the data loss of the system, the system can be instantaneously recovered. The present invention aims at the disadvantages of low efficiency and large hard disc space occupation existing in a file backup or cloning storage method, a mirroring storage method, etc. adopted by the traditional Linux system hard disc data safety protection measures. The present invention protects by a hard disc data mapping mode and enhances the efficiency, and the present invention occupies micro hard disc space and overcomes the disadvantages of the traditional technique. A program of the present invention can be carried in a flexible disc, an optical disc or a read only storage RON for guiding the starting process of a computer and executing the program. The present invention is suitable for any safety field using Linux as an operating system.
Description
Technical field
The present invention relates to the Computer Data Security field, be at the linux system hard disc data monitor in real time, fast dynamically a kind of linux system hard disc data Real-time and Dynamic guard method of instantaneous recovery under the situation of preservation and system damage, paralysis even collapse and obliterated data.
Background technology
Because distinctive opening of (SuSE) Linux OS itself and stability are accepted (SuSE) Linux OS gradually by more user.Along with it is used widely, to the also corresponding raising of the requirement of user's technical merit, the linux system user a large amount of problems can occur in application process, as maloperation, hacker and artificial destruction, and cause phenomenons such as computing machine paralysis, loss of data that linux system can't normally be moved, also can cause catastrophic destruction to the data that hard disc of computer is stored.Given this; Various types of data protection safety practice is arisen at the historic moment; traditional safeguard measure is that the data in the hard disk are carried out file backup or linux system is cloned preservation, and the original system to the clone when reduction backup file or system damage when loss of data recovers.Though these methods possess safe effect, efficient is low and take the waste that a large amount of hard drive space forms computer resource.
Summary of the invention
The present invention is based on the BIOS layer; with the operating system layer is application; a kind of method of linux system hard disc data Real-time and Dynamic protection is provided; normal system state is carried out qsave, instantaneous recovery under system damage, paralysis even linux system that collapses and situation at obliterated data.
The objective of the invention is to realize in the following manner: the guard method of a kind of linux system hard disc data Real-time and Dynamic, it adopts Real-time and Dynamic protection algorithm, realizes as follows:
1. be fixed size with the DISK to Image space with M sector, be divided into the N piece;
2. set up the type list of piece, block type comprises: free block, need totally 6 kinds of protected data pieces, non-protected data piece, mapping block, original block, former mapping block; And according to the type under first three each piece of kind starting type definition hard disk;
3. set up the pointer gauge of piece, the piece of expression current block mapped transfer number:
When its list item numerical value is 0～N-1, be expressed as effective value, point to piece that mapping shifts number;
When its list item numerical value is OFFFFFFH, the expression invalid value;
4. get the request package of linux system reading writing harddisk, change its parameter to adapt to following read-write rule:
Read operation: attribute is free block, when needing protected data piece, non-protected data piece, mapping block, can directly reads; Attribute is that original block, former mapping block then read according to the sensing of pointer gauge.
Write operation: when attribute is free block, non-protected data piece, can directly write; Attribute is when needing protected data piece, mapping block, to write after applying for a free block and changing mapping block into; When attribute is original block, former mapping block, then carry out write operation according to the sensing of pointer gauge;
When 5. filing, search the piece of type in the block type table for " original block ", according to the formed pointer chain of transfer piece pointer in its relevant block pointer gauge, begin chain piece pointed is an original block, last-of-chain piece pointed is a mapping block, copy blocks of data from the beginning to the end successively, and initialization and backup block type list;
6. when the system failure or obliterated data need recover, the type list of backup is covered the current type table get final product.
The present invention adopts the mapping mode of hard disc data piece is protected, improved efficient and occupied the small space of hard disk, when system during by catastrophic destructions the present invention can recover normally in moment.Software with this method exploitation, various computer viruses there is the initiatively function of prevention, for operating personnel's operation error, hacker or artificial destruction and fault such as the computing machine paralysis that causes, loss of data, need not to back up in advance or clone, all can recover as before in second at 1-2, the guarantee of data security is provided for the user of linux system.
Beneficial effect of the present invention is embodied in the following aspects:
1, can carry out the Real-time and Dynamic protection for the computing machine of using linux system;
2, for the computing machine of using linux system, if system break down or collapse, phenomenon such as paralysis, the normal state of system in the time of can filing instantaneous recovery to last time.
3, for the computing machine of using linux system, if the phenomenon of loss of data takes place, the data of can instantaneous recovery losing.
4, owing to simplicity and practicality that linux system is safeguarded, help popularization and the application of Linux.
5, can initiatively prevent all kinds of malignant viruses, make the normal condition that can return to immediately after the various virus of computer infected before the poison of not catching an illness.
6, compatible DOS, Windows series operating system and hard disk form.
7, to take ratio only be 1/100000 to the hard disk of using this method.
Description of drawings
Fig. 1 is the hard disk partition synoptic diagram, illustrates the signal that core algorithm of the present invention is divided hard disk.Column is a DISK to Image space synoptic diagram.B wherein
0~ B
N-1Represent piece number, be about to hard drive space and be divided into the n piece; SECTOR 0 ~ SECTOR N*M-1 represents whole sectors of hard disk.
Fig. 2 is the file algorithm synoptic diagram of Real-time and Dynamic protection, illustrated the type of hard disk piece before file with file after attribute change, the variation of this attribute has just realized the Real-time and Dynamic protection of hard disk.First half A among the figure: expression original block; B～F: represent former mapping block; G: expression mapping block; Lower Half A～F: expression protected data piece; G: expression free block.
Embodiment
The present invention will be further described below in conjunction with accompanying drawing.
The present invention is used for the safeguard protection of linux system data.Concrete implementation step: the Real-time and Dynamic defence program of operating system bottom is solidified in " read only memory ROM "; " read only memory ROM " comes the startup of vectoring computer; it is stated from the printed circuit board (PCB) with PC series mini computing machine external bus insert row; also can directly be stated from computer motherboard; when computer starting; at first carry out the software program that solidifies in " read only memory ROM ", start the operating system.Program of the present invention also can be deposited in computer format floppy or the CD, when starting computing machine, starts and carries out this program with floppy disk or CD vectoring computer.Empirical tests, the present invention has realized its intended purposes and effect.
The know-why that realizes this function has adopted " Real-time and Dynamic protection algorithm ", and its particular content and main thought are as follows:
1, be N piece (BLOCK) with the DISK to Image spatial division earlier, every M sector (SECTOR), promptly whole hard drive spaces are by B
0~ B
N-1Constitute, wherein M initial sector of hard disk is BX
0, the M at an end sector is B
N-1, the DISK to Image space is the N*M sector, and is as shown in table 1:
Table 1: hard disk partition signal table
| Logic sector number | (0，1，2，…，M-1) | (M，…2M-1) | (2M，…，3M-1) | 3M，…… | (N-1)*M，…，N*M-1 |
| Piece number | B 0 | B 1 | B 2 | …… | B N-1 |
2, set up the type list BLOCK_TYPE_TABLE of piece, be used for defining the type of each piece of hard disk, all types of as shown in table 2:
Table 2: block type table
| BLOCK_TYPE_TABLE | ||
| Class1 | FREE_BLOCK | Free block, all sectors of this piece correspondence all are not written into valid data in the hard disk. |
| Type 2 | PROTECT_DATA_BLOCK (needing the protected data piece) | Data are arranged, and the piece that needs protection. |
| Type 3 | NOT_PROTECT_DATA_BLOCK (non-protected data piece) | Data are arranged, but the piece that does not need protection. |
| Type 4 | SHADOW_BLOCK (mapping block) | When the piece A of PROTECT_DATA_BLOCK type write operation; for protecting this data block not to be destroyed; thereby the piece B that applies for a FREE_BLOCK type deposits the data that will write this data block originally; the piece B of this FREE_BLOCK type will be modified to the SHADOW_BLOCK type, represent that it is the mapping body (SHADOW) of the piece A of corresponding former PROTECT_DATA_BLOCK type. |
| Type 5 | 1SHADOWED_BLOCK (original block) | When the piece A of PROTECT_DATA_BLOCK type write operation, write the in fact mapped piece B (type of B will be modified to SHADOW_BLOCK) that writes a FREE_BLOCK type of data, in order to keep the consistance of data, to be mapped to piece B to the read and write access of piece A is also corresponding then, therefore the type with piece A is revised as 1SHADOWED_BLOCK. |
| Type 6 | NSHADOWED_BLOCK (former mapping block) | When the piece A of a SHADOW_BLOCK type runs into write operation, because wherein legacy data is the mapping body of other data blocks, can not be destroyed, so need the piece B of a FREE_BLOCK type of application to deposit the data that will write this data block originally, the piece B of this FREE_BLOCK type will be modified to the SHADOW_BLOCK type, represent that it is the mapping body (SHADOW) of corresponding blocks A, and the type of piece A is revised as NSHADOWED_BLOCK, represent that himself was the SHADOW_BLOCK type originally, but be mapped to other pieces once more. |
Listed six kinds of block types in the table 2, preceding 3 types is initial value.
The big or small M that supposes piece is 63 sectors, and above-mentioned 6 types can be adopted 3 binary digits to express (2
3=8＞6), also promptly 3 bit can represent 63 sectors, then can calculate this table with this and in the shared space ratio of hard disk be: (3/8) ÷ (63 * 512) ≈ 1/100,000, promptly the shared space ratio of this table be 100,000 of hard disk total volume/.
3, set up block pointer table BLOCK_POINT_TABLE, be used for representing the piece number of the mapped transfer of current block.When its list item numerical value is 0～N-1, be expressed as effective value, point to piece that mapping shifts number, when its list item numerical value is 0FFFFFFH, the expression invalid value.
Suppose that block size M is 63, and adopt 3 bytes, then can calculate this table with this and be in the shared space ratio of hard disk as pointer: 3 ÷ (63 * 512) ≈ 1/10,000, promptly the shared space ratio of this table be ten thousand of hard disk total volume/.
The maximum hard-disk capacity that can express is calculated as follows: (3 * 8=24)
2
24×(63×512)≈504GB
When 4, hard disk being carried out read operation, the different rules that reads is arranged, handles according to read operation rule as shown in table 3 according to all kinds of piece:
Table 3: the read operation rule list of piece
| Block type | Pointer gauge | The read operation result | |
| Class1 | FREE_BLOCK | - | Directly read |
| Type 2 | PROTECT_DATA_BLOCK | - | Directly read |
| Type 3 | NOT_PROTECT_DATA_BLOCK | - | Directly read |
| Type 4 | SHADOW_BLOCK | - | Directly read |
| Type 5 | 1SHADOWED_BLOCK | As A → B | Turn to when reading piece A and read piece B |
| Type 6 | NSHADOWED_BLOCK | As A → B | Turn to when reading piece A and read piece B |
When 5, hard disk being carried out write operation, different write operation rules is arranged, handles according to write operation rule as shown in table 4 according to all kinds of piece:
Table 4: the write operation rule list of piece
| Block type | Pointer gauge | Type list | The write operation result | |
| Class1 | FREE_BLOCK | - | - | Directly write |
| Type 2 | PROTECT_DATA_BLOCK | - | Search | The piece B of a FREF_BLOCK type of application when 1, writing piece A; 2, the type with A changes 1SHADOWED_BLOCK into; 3, the type with B is revised as SHADOW_BLOCK; 4, the content of A is read internal memory, revising wherein, the respective sectors data write B then |
| Type 3 | NOT_PROTECT_DATA_BLOCK | - | - | Directly write |
| Type 4 | SHADOW_BLOCK | - | | 1, the piece B of a FREE_BLOCK type of application; 2, the type with A changes NSHADOWED_BLOCK into; 3, the type with B is revised as SHADOW_BLOCK; 4, the content of A is read internal memory, revise wherein respective sectors data, write B then |
| Type 5 | 1SHADOWED_BLOCK | As A → B | - | Turn to when writing piece A and write piece B |
| Type 6 | NSHADOWED_BLOCK | As A → B | - | Turn to when writing piece A and write piece B |
6, file and recovery algorithms
1) files: current hard disc data state is filed, when recovering later on the protected location data are returned to this state.
Algorithm:
1. searching block type is the piece A of 1SHADOWED_BLOCK, as
A→B→C→D→…→G
Wherein A is 1SHADOWED_BLOCK,
B ~ F is NSHADOWED_BLOCK,
G is SHADOW_BLOCK
2. at first the content of COPY piece B is to piece A, and the type that changes A is PROTECT_DATA_BLOCK
3. secondly, the content of COPY piece C is to piece B, and the type that changes piece B is PROTECT_DATA_BLOCK, C → B, and D → C ..., F → E.
4. last, COPY piece G content is to piece F, and to change the F type be PROTECT_DATA_BLOCK, and the type that changes G is FREE_BLOCK.
The concrete implementation procedure of data archiving is as follows:
Searching block type is the piece A of 1SHADOWED_BLOCK, as
A→B→C→D→…→G
Wherein A is 1SHADOWED_BLOCK, when the original block write operation of a PROTECT_DATA_BLOCK type, write the in fact mapped piece b (type of b will be modified to SHADOW_BLOCK) that writes a FREE_BLOCK type of data, in order to keep the consistance of data, to be mapped to piece b to the read and write access of piece A is also corresponding then, therefore the type with piece A is revised as 1SHADOWED_BLOCK.
B ~ F is NSHADOWED_BLOCK, when the piece a of SHADOW_BLOCK type write operation, because wherein legacy data is the mapping body of other data block, can not be destroyed, so need the piece b of a FREE_BLOCK type of application to deposit the data that will write this data block originally, the piece b of this FREE_BLOCK type will be modified to the SHADOW_BLOCK type, represent that it is the mapping body (SHADOW) of corresponding blocks SHADOW_BLOCK, and the type of piece SHADOW_BLOCK is revised as NSHADOWED_BLOCK, represent that himself was the SHADOW_BLOCK type originally, but be mapped to other piece once more.
G is that SHADOW_BLOCK is when the piece a of PROTECT_DATA_BLOCK type write operation; for protecting this data block not to be destroyed; thereby the piece b that applies for a FREE_BLOCK type deposits the data that will write this data block originally; the piece b of this FREE_BLOCK type will be modified to the SHADOW_BLOCK type, represent that it is the mapping body (SHADOW) of the piece a of corresponding former PROTECT_DATA_BLOCK type.
At first, the content of COPY piece B is to piece A, and the type that changes A is PROTECT_DATA_BLOCK;
Secondly, the content of COPY piece C is to piece B, and the type that changes piece B is PROTECT_DATA_BLOCK, C → B, and D → C ..., F → E;
At last, COPY piece G content is to piece F, and to change the F type be PROTECT_DATA_BLOCK, and the type that changes G is FREE_BLOCK.
2) recovery algorithms: hard disk protection district data are returned to installation or the last state that files.
Algorithm:
When initial form BLOCK_TYPE_TABLE is done a backup, recover only to need to cover current BLOCK_TYPE_TABLE and get final product with backup.
Main thought: the mode according to above-mentioned steps 1 is divided into the N piece with hard drive space; and adopt step 2,3 described data structures according to two forms of initialization such as LINUX system file form EXT2, EXT3; specifically realize the hard disk accessing operation by relevant LINUX hard drive program, can realize the dynamic protection of hard disc data according to step 4,5,6 described algorithms.
Under the Linux environment, realize above-mentioned " Real-time and Dynamic protection algorithm ", need realize the access process of hard disk by intercepting and capturing linux system.Linux system is divided into several request package with the data of access hard disk, and the content of each request package is a series of read-write parameter, mainly comprises: the start address of read-write sector, sector number, read write command, hard reel number, the buffer zone that reads and writes data etc.These request package are connected to each other forms a request queue, and condition writes hard disk after satisfying again by the time.In order to realize the dynamic protection to linux system, the former request that these need be truncated to is lined up to change into the new request of following " Real-time and Dynamic protection algorithm " rule and is lined up, and its former request is lined up as shown in table 5:
Table is lined up in the former request of table 5:Linux system access hard disk data
If linux system carries out the operation of reading writing harddisk according to the rule of " Real-time and Dynamic protection algorithm "; so just must change the parameter of each read-write requests; again because each request package often is not the read-write of single sector, so will cut apart them in addition sometimes.Like this, become similar state as shown in table 6 through the new request queue meeting after the rule treatments:
Table 6: table is lined up in the new request after the rule treatments
Handle through the request of linux system access hard disk being lined up regularization, " Real-time and Dynamic protection algorithm " is achieved under the (SuSE) Linux OS environment.
Claims (1)
1, a kind of linux system hard disc data Real-time and Dynamic guard method is characterized in that: adopt Real-time and Dynamic protection algorithm, realize as follows:
1. be fixed size with the DISK to Image space with M sector, be divided into the N piece;
2. set up the type list of piece, block type comprises: free block, need totally 6 kinds of protected data pieces, non-protected data piece, mapping block, original block, former mapping block; And according to the type under first three each piece of kind starting type definition hard disk;
3. set up the pointer gauge of piece, the piece of expression current block mapped transfer number:
When its list item numerical value is 0～N-1, be expressed as effective value, point to piece that mapping shifts number;
When its list item numerical value is 0FFFFFFH, the expression invalid value;
4. get the request package of linux system reading writing harddisk, change its parameter to adapt to following read-write rule:
Read operation: attribute is free block, when needing protected data piece, non-protected data piece, mapping block, can directly reads; Attribute is that original block, former mapping block then read according to the sensing of pointer gauge.
Write operation: when attribute is free block, non-protected data piece, can directly write; Attribute is when needing protected data piece, mapping block, to write after applying for a free block and changing mapping block into; When attribute is original block, former mapping block, then carry out write operation according to the sensing of pointer gauge;
When 5. filing, search the piece of type in the block type table for " original block ", according to the formed pointer chain of transfer piece pointer in its relevant block pointer gauge, begin chain piece pointed is an original block, last-of-chain piece pointed is a mapping block, copy blocks of data from the beginning to the end successively, and initialization and backup block type list;
6. when the system failure or obliterated data need recover, the type list of backup is covered the current type table get final product.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB031144918A CN100337220C (en) | 2003-02-17 | 2003-02-17 | Real-time dynamic data protecting method for Linux system hard disc |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB031144918A CN100337220C (en) | 2003-02-17 | 2003-02-17 | Real-time dynamic data protecting method for Linux system hard disc |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1637726A CN1637726A (en) | 2005-07-13 |
| CN100337220C true CN100337220C (en) | 2007-09-12 |
Family
ID=34842665
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB031144918A Expired - Fee Related CN100337220C (en) | 2003-02-17 | 2003-02-17 | Real-time dynamic data protecting method for Linux system hard disc |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100337220C (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105824879A (en) * | 2015-12-17 | 2016-08-03 | 深圳市华讯方舟软件技术有限公司 | Migration method based on PostgreSQL block storage equipment |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100426247C (en) * | 2006-01-12 | 2008-10-15 | 上海洲信信息技术有限公司 | Data recovery method |
| CN101187887B (en) * | 2006-11-15 | 2012-05-16 | 鸿富锦精密工业（深圳）有限公司 | Storage device with temporary data protection function and the method |
| CN105095300A (en) * | 2014-05-16 | 2015-11-25 | 阿里巴巴集团控股有限公司 | Method and system for database backup |
| CN104133742A (en) * | 2014-08-07 | 2014-11-05 | 浪潮(北京)电子信息产业有限公司 | Data protection method and device |
| CN105825877A (en) * | 2016-03-30 | 2016-08-03 | 朱光波 | Data storing and reading method and apparatus |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1225476A (en) * | 1999-01-12 | 1999-08-11 | 李增胜 | Method for quick protection and recovery for hard disc data of computer |
| US6192488B1 (en) * | 1998-07-13 | 2001-02-20 | Chung-Ping Li | Restoring method for hard disk |
| US20020023225A1 (en) * | 2000-08-08 | 2002-02-21 | Lomnes Randy Keith | Method and system for automatically preserving persistent storage |
-
2003
- 2003-02-17 CN CNB031144918A patent/CN100337220C/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6192488B1 (en) * | 1998-07-13 | 2001-02-20 | Chung-Ping Li | Restoring method for hard disk |
| CN1225476A (en) * | 1999-01-12 | 1999-08-11 | 李增胜 | Method for quick protection and recovery for hard disc data of computer |
| US20020023225A1 (en) * | 2000-08-08 | 2002-02-21 | Lomnes Randy Keith | Method and system for automatically preserving persistent storage |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105824879A (en) * | 2015-12-17 | 2016-08-03 | 深圳市华讯方舟软件技术有限公司 | Migration method based on PostgreSQL block storage equipment |
| CN105824879B (en) * | 2015-12-17 | 2019-06-28 | 深圳市华讯方舟软件技术有限公司 | A kind of moving method based on PostgreSQL block storage equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1637726A (en) | 2005-07-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9584312B2 (en) | Methods and systems for storing and retrieving data | |
| US10073656B2 (en) | Systems and methods for storage virtualization | |
| US8713267B2 (en) | Method and system for dynamic storage tiering using allocate-on-write snapshots | |
| US8069317B2 (en) | Providing and utilizing high performance block storage metadata | |
| US9400741B1 (en) | Reclaiming space from file system hosting many primary storage objects and their snapshots | |
| US20190146881A1 (en) | Data storage and retrieval mediation system and methods for using same | |
| US8694563B1 (en) | Space recovery for thin-provisioned storage volumes | |
| US10387066B1 (en) | Providing data deduplication in a data storage system with parallelized computation of crypto-digests for blocks of host I/O data | |
| CN1417689A (en) | Fixed disk data enciphering back-up and restoring method | |
| WO2013153581A1 (en) | Storage apparatus and data management method | |
| US9378152B2 (en) | Systems and methods for I/O processing using out-of-band hinting to block driver or storage controller | |
| JP2011192259A (en) | I/o conversion method and apparatus for storage system | |
| US11226774B2 (en) | Deep data-compression | |
| CN1766845A (en) | Method for realizing high security and recoverable file system | |
| CN100337220C (en) | Real-time dynamic data protecting method for Linux system hard disc | |
| Wu et al. | Selfie: co-locating metadata and data to enable fast virtual block devices | |
| Chang et al. | A driver-layer caching policy for removable storage devices | |
| CN1109979C (en) | Method for quick protection and recovery for hard disc data of computer | |
| Zeng et al. | CosaFS: A cooperative shingle-aware file system | |
| US10628317B1 (en) | System and method for caching data in a virtual storage environment based on the clustering of related data blocks | |
| Bhat et al. | Review of FAT Data Structure of FAT32 file system | |
| TWI564803B (en) | Systems and methods for storage virtualization | |
| US20230123478A1 (en) | Two-level logical to physical mapping mechanism in a log-structured file system | |
| US11947799B1 (en) | Systems and methods for using the TRIM command with solid state devices | |
| JP4520139B2 (en) | Cache control device hit / miss determination method and apparatus |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| ASS | Succession or assignment of patent right |
Owner name: XI'AN SANMING TECHNOLOGY CO., LTD. Free format text: FORMER OWNER: ZHANG YOUCHENG Effective date: 20070511 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20070511 Address after: Two Xi'an Road, No. 77 Xi'an 710075 Shaanxi province science and Technology Park A311 photoelectric Applicant after: Xi'an Saming Technology Co., Ltd. Address before: 710068 No. 356 Youyi West Road, Shaanxi, Xi'an Applicant before: Zhang Youcheng |
|
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| PE01 | Entry into force of the registration of the contract for pledge of patent right |
Denomination of invention: Real-time dynamic data protecting method for Linux system hard disc Effective date of registration: 20110415 Granted publication date: 20070912 Pledgee: Pudong Development Bank of Shanghai, Limited by Share Ltd, Xi'an branch Pledgor: Li Zengsheng|Xi'an saming Technology Co Ltd Registration number: 2011990000065 |
|
| PC01 | Cancellation of the registration of the contract for pledge of patent right |
Date of cancellation: 20120814 Granted publication date: 20070912 Pledgee: Pudong Development Bank of Shanghai, Limited by Share Ltd, Xi'an branch Pledgor: Li Zengsheng|Xi'an saming Technology Co Ltd Registration number: 2011990000065 |
|
| PE01 | Entry into force of the registration of the contract for pledge of patent right |
Denomination of invention: Real-time dynamic data protecting method for Linux system hard disc Effective date of registration: 20120914 Granted publication date: 20070912 Pledgee: Pudong Development Bank of Shanghai, Limited by Share Ltd, Xi'an branch Pledgor: Xi'an saming Technology Co Ltd|Li Zengsheng Registration number: 2012990000528 |
|
| PLDC | Enforcement, change and cancellation of contracts on pledge of patent right or utility model | ||
| PC01 | Cancellation of the registration of the contract for pledge of patent right |
Date of cancellation: 20150528 Granted publication date: 20070912 Pledgee: Pudong Development Bank of Shanghai, Limited by Share Ltd, Xi'an branch Pledgor: Xi'an saming Technology Co Ltd|Li Zengsheng Registration number: 2012990000528 |
|
| PLDC | Enforcement, change and cancellation of contracts on pledge of patent right or utility model | ||
| CP03 | Change of name, title or address | ||
| CP03 | Change of name, title or address |
Address after: 710075 floor 6, Fung Hui International D, 18 Fenghui South Road, Xi'an high tech Zone, Shaanxi Patentee after: Xi'an Sanming Polytron Technologies Inc Address before: 710075 Xi'an photoelectric Park, No. 77, science and technology two road, Xi'an, Shaanxi A-311 Patentee before: Xi'an Saming Technology Co., Ltd. |
|
| CP03 | Change of name, title or address | ||
| CP03 | Change of name, title or address |
Address after: 710075 Tang Feng International D block 18, Fenghui South Road, Xi'an High-tech Zone, Shaanxi, China 601, 602, 603, 604 Patentee after: Xi'an Sanming Polytron Technologies Inc Address before: 710075 Xi'an photoelectric Park, No. 77, science and technology two road, Xi'an, Shaanxi A-311 Patentee before: Xi'an Saming Technology Co., Ltd. |
|
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20070912 Termination date: 20200217 |