CN101692252A - Method for distributing and reclaiming idle blocks of file - Google Patents
Method for distributing and reclaiming idle blocks of file Download PDFInfo
- Publication number
- CN101692252A CN101692252A CN200910194886A CN200910194886A CN101692252A CN 101692252 A CN101692252 A CN 101692252A CN 200910194886 A CN200910194886 A CN 200910194886A CN 200910194886 A CN200910194886 A CN 200910194886A CN 101692252 A CN101692252 A CN 101692252A
- Authority
- CN
- China
- Prior art keywords
- block
- index block
- index
- sequence number
- blocks
- 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.)
- Granted
Links
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a method for distributing and reclaiming idle blocks of a file. The distributing method comprises the following steps: dividing the file into N file blocks according to the preset size, and numbering the file blocks; using K file blocks in the N file blocks as index blocks, and connecting the index blocks by adopting a bidirectional link table; storing a previous index block sequence number of the index block, a rear index block sequence number and the number of the idle blocks managed by the index block into the index blocks; and distributing the idle blocks managed by the index block in turn according to the order of the index blocks in the bidirectional link table, and correspondingly modifying information stored in the index blocks. The reclaiming method comprises the following steps: reclaiming the idle blocks in turn by the index blocks according to the order of the index blocks in the bidirectional link table, and correspondingly modifying the information stored in the index blocks. The method is particularly suitable for application situations with high real-time requirements. The method can save a large amount of storage space in the storage of mass historical data of the real-time database, and meanwhile can ensure the real-time response of the real-time database to the data due to extremely high idle block distribution speed.
Description
Technical field
The invention belongs to data storage and administrative skill field, particularly a kind of distribution of idle blocks of file and recovery method.
Background technology
At data storage and management domain, usually data are write file with a certain size piece, then data block is set up data directory, adopt B+ tree or Hash function to set up data directory to data block usually as operating system and database.Said process needs an idle blocks of file management system, and when will be when file writes data, the free block management system distributes a free block to give the user, and the user writes the free block of acquisition with data, and the address with piece adds data directory then; When the user will discharge a certain data block, the address of this data block to be extractd from data directory, the data block of excision is then given the free block management system and is reclaimed, and uses as free block, reaches recycling purpose.
Be similar to the real time mass data management field of real-time data base, in order to guarantee real-time, the storage of data must have very high speed, so the distribution of free block and reclaim and must meet with a response very soon; In order to store data as much as possible, also need to guarantee the high usage of file space simultaneously; When guaranteeing real-time and high file space utilization factor, must guarantee that also system takies the least possible internal memory.
Disclosing name on the China Intellectual Property Office website, to be called a kind of method of distributing free cluster and discharging bunch and its application number be 200710073581.1 application for a patent for invention, it adopts at top of file and vacates a continuum, the operating position of each (bit) corresponding relevant position, position data block in the zone.If as n bit in the zone is that 0 expression file n piece is a free block, can be assigned with, if n bit is the piece of 1 expression file n piece for having used, can not be assigned with.This method piece hereof through repeatedly discharge and batch operation after, 0 and 1 situation about mixing will appear, at this moment from the file continuum, to find the free block can be more time-consuming; Simultaneously along with file constantly is received in data, after free block appeared at position in the top of file continuum and leans on more, inquiry file head continuum obtains time of a free block will be long more; Moreover the method is applied to big file, because top of file continuum occupation space is bigger, corresponding meeting causes very big waste to disk space.
Summary of the invention
One of purpose of the present invention is, a kind of distribution method of idle blocks of file is provided, and when the user need store data, take under the situation of lacking internal memory as far as possible, distributes free block to the user fast.
Another object of the present invention is to, a kind of recovery method of idle blocks of file is provided, when the user discharges a certain data block or index block and uses, d/d data block or the index block that uses are reclaimed, to realize the high usage of file space.
Before describing method details of the present invention, provide the definition that the present invention adopts the part technical term earlier:
Free block: occupy a certain size and logically continuous file storage, its inside does not have useful data.In order to improve the access performance of disk, the integral multiple that the size of free block is generally bunch.
Index block: also be to occupy a certain size and logically continuous file storage, size is with the free block unanimity, and its storage inside has the numbering as the free block of index.Connect with doubly linked list between the index block, store the piece number (hereinafter to be referred as the piece number) of the free block of the preceding index block sequence number of this index block, back index block sequence number and this index block management (can distribute) at the head of index block respectively.
Data block: occupy a certain size and logically continuous file storage, size is consistent with free block, and there are data inside.
Reserved block is used to preserve the file global information, for example file size, index block chained list first address etc.
Blocks of files: reserved block, free block, index block and data block are referred to as blocks of files.
A kind of distribution method of idle blocks of file, file is divided into N blocks of files by default size, and blocks of files is numbered, K in N the blocks of files is individual as index block, index block adopts doubly linked list to connect, store the piece number of the free block of the preceding index block sequence number of this index block, back index block sequence number and the management of this index block in the index block, according to the free block of the management of the order of index block in doubly linked list allocation index piece successively, and canned data in the corresponding modify index block.
Further, be provided with a reserved block in the described N blocks of files, the sequence number that the back index block sequence number in the preceding index block sequence number in first index block in the described index block and last index block is a reserved block.
Further, when not having the free block of management in the described index block, this index block is assigned with as free block, and this index block in the deletion doubly linked list, revises the corresponding informance in the doubly linked list.
Further, described N blocks of files numbering is followed successively by 0,1,2 ..., N-1, the piece of described reserved block number is 0, the piece of described index block number is followed successively by 1 to K, each index block can be stored the numbering of m blocks of files at most, from sequence number is 1 index block, will begin to write successively this K index block to the integer of K+1 from N-1.
Further, when system start-up, obtaining the first place of index block chained list from the file reserved block puts, in chained list, travel through then, if the back index block sequence number in the index block is 0, this index block is read in internal memory as current index block, read the 3rd parameter in the current index block: piece is counted h, if h greater than 0, enters step 11); If h equals 0, then change step 12):
11) obtain the sequence number of the free block of current index block management by the piece number;
The sequence number of free block is distributed to the user to be used;
Piece number in the current index block subtracts 1;
12) if the preceding index block sequence number of current index block is not 0, then enter step 121); If the preceding index block sequence number of current index block is 0, then change step 122):
121) read preceding index block sequence number in the current index block;
Current index block as free block, is distributed to the user with its sequence number;
Back index block sequence number in the preceding index block is changed to 0;
122) with current index block as free block, its sequence number is distributed to the user;
Index block first-in-chain(FIC) sequence number in the reserved block is changed to 0.
The present invention also provides a kind of recovery method of idle blocks of file, file is divided into N blocks of files by default size, and blocks of files is numbered, K in N the blocks of files is individual as index block, index block adopts doubly linked list to connect, store the piece number of the free block of the preceding index block sequence number of this index block, back index block sequence number and the management of this index block in the index block, reclaim free block successively by index block according to the order of index block in doubly linked list, and canned data in the corresponding modify index block.
Further, be provided with a reserved block in the described N blocks of files, described index block adopts doubly linked list to connect, the sequence number that the back index block sequence number in the preceding index block sequence number in first index block in the described index block and last index block is a reserved block.
Further, when last index block in the described index block chained list is expired, the free block of this recovery is inserted in the doubly linked list as index block, and revise corresponding informance in the doubly linked list.
Further, described N blocks of files numbering is followed successively by 0,1,2 ..., N-1, the piece of described reserved block number is 0, the piece of described index block number is followed successively by 1 to K, each index block can be stored the numbering of m blocks of files at most, from sequence number is 1 index block, will begin to write successively this K index block to the integer of K+1 from N-1.
Further, when system start-up, from the file reserved block, obtain the first place of index block chained list and put, in chained list, travel through, judge whether index block chain heading sequence number is 0) if enter step 21; Otherwise change step 22);
21) the preceding index block sequence number of putting the free block that will discharge is 0, puts thereafter that the index block sequence number is 0, and putting its piece number is 0;
The index block chain heading sequence number of putting in the reserved block is the sequence number of the free block that will discharge;
22) travel through in the index block chained list, if the back index block sequence number in the index block is 0, this last index block is read in internal memory as current index block, read the 3rd parameter in the current index block: piece is counted h; If h less than m, then enters step 221); If h equals m, then change step 222);
221) sequence number of the free block that discharges is write the position of h+1 data block sequence number of current index block, the piece of current index block is counted h and is added 1;
222) free block that will discharge is used as index block, and the sequence number that to put its preceding index block sequence number be current index block puts thereafter that the index block sequence number is 0, and putting its piece number is 0; The back index block sequence number of putting current index block is the sequence number of the free block that will discharge.
The present invention has following beneficial effect:
1, the index part of free block is stored in the idle component of file, not the outer disk space of occupying volume.After an index block uses up, can discharge as common free block.Like this, index block and common free block can bumpless transfer.
2, the present invention does not need all index blocks all are placed on internal memory, but with a nearest group index block cache to internal memory, use for the storage administration of mass data like this and can save a large amount of internal memories.
3, disk read-write of the present invention can be read and write an index block, thus the sequence number of operating one group of free block, and such mode of operation is managed idle file space as much as possible with minimum disk operating.Because disk tracking and read-write are more consuming time, therefore this mode of operation is particularly suitable for the application scenario very high to real-time.It will save a large amount of storage spaces in the storage of real-time data base mass historical data, simultaneously because its high free block dispensing rate can guarantee the real-time response of real-time data base to data.
4, when system initialization, only need write seldom a part of index data, and needn't carry out the read-write operation of all files at top of file, make initialization procedure very fast.
Further specify the present invention below in conjunction with drawings and Examples.
Description of drawings
Fig. 1 is the structural representation of blocks of files in the embodiment of the invention;
Fig. 2 is the distribution method instantiation process flow diagram of idle blocks of file of the present invention;
Fig. 3 is the recovery method instantiation process flow diagram of idle blocks of file of the present invention.
Embodiment
Embodiment one
A kind of distribution method of idle blocks of file, file is divided into N blocks of files by default size, and blocks of files is numbered, K in N the blocks of files is individual as index block, index block adopts doubly linked list to connect, store the piece number of the free block of the preceding index block sequence number of this index block, back index block sequence number and the management of this index block in the index block, according to the free block of the management of the order of index block in doubly linked list allocation index piece successively, and canned data in the corresponding modify index block.
Wherein, be provided with a reserved block in the described N blocks of files, the sequence number that the back index block sequence number in the preceding index block sequence number in first index block in the described index block and last index block is a reserved block.
Wherein, when not having the free block of management in the described index block, this index block is assigned with as free block, and this index block in the deletion doubly linked list, revises the corresponding informance in the doubly linked list.
Wherein, described N blocks of files numbering is followed successively by 0,1,2 ..., N-1, numbering can adopt 32 integers, the piece of described reserved block number is 0, the piece of described index block number is followed successively by 1 to K, and each index block can be stored the numbering of m blocks of files at most, is 1 index block from sequence number, to begin to write successively this K index block to the integer of K+1 from N-1, soon the sequence number of free block writes in the index block successively in the mode of inverted order.
Particularly, as shown in Figure 2, when system start-up, obtain the first place of index block chained list and put from the file reserved block, travel through in chained list then, if the back index block sequence number in the index block is 0, then this index block is last index block of chained list; This index block is read in internal memory (current index block), and read the 3rd parameter in the current index block: piece is counted h, if h greater than 0, has the free block sequence number in the promptly current index block, enters step 11); If h equals 0, then change step 12):
11) obtain the sequence number of the free block of current index block management by the piece number;
The sequence number of free block is distributed to the user to be used;
Piece number in the current index block subtracts 1;
12) if the preceding index block sequence number of current index block is not 0, free block distributes in the promptly current index block, but the index block number is not 0, then enters step 121); If the preceding index block sequence number of current index block is to be 0, promptly only there is this current index block to can be used as free block, then change step 122):
121) read preceding index block sequence number in the current index block;
The sequence number of current index block is distributed to the user to be used as free block;
The back index block sequence number of preceding index block is changed to 0;
122) sequence number of current index block is distributed to the user;
Index block first-in-chain(FIC) sequence number in the reserved block is changed to 0; This moment, whole idle blocks of file distributed.
Embodiment two
A kind of recovery method of idle blocks of file, file is divided into N blocks of files by default size, and blocks of files is numbered, K in N the blocks of files is individual as index block, index block adopts doubly linked list to connect, store the piece number of the free block of the preceding index block sequence number of this index block, back index block sequence number and the management of this index block in the index block, reclaim free block successively by index block according to the order of index block in doubly linked list, and canned data in the corresponding modify index block.
Wherein, be provided with a reserved block in the described N blocks of files, described index block adopts doubly linked list to connect, the sequence number that the back index block sequence number in the preceding index block sequence number in first index block in the described index block and last index block is a reserved block.
Wherein, when described index block is expired, the free block of this recovery is inserted in the index block doubly linked list as index block, and revise corresponding informance in the doubly linked list.
Wherein, described N blocks of files numbering is followed successively by 0,1,2 ..., N-1, numbering can adopt 32 integers, the piece of described reserved block number is 0, the piece of described index block number is followed successively by 1 to K, and each index block can be stored the numbering of m blocks of files at most, is 1 index block from sequence number, to begin to write successively this K index block to the integer of K+1 from N-1, soon the sequence number of free block writes in the index block successively in the mode of inverted order.
Particularly, as shown in Figure 3, when system start-up, from the file reserved block, obtain the first place of index block chained list and put, in chained list, travel through, judge whether index block chain heading sequence number is 0, if, then show no free block, enter step 21); Otherwise change step 22);
21) the preceding index block sequence number of putting the free block that will discharge is 0, puts thereafter that the index block sequence number is 0, and putting its piece number is 0;
The index block chain heading sequence number of putting in the reserved block is the sequence number of the free block that will discharge.
22) travel through in the index block chained list, if the back index block sequence number in the index block is 0, then this index block is last index block of chained list; This last index block is read in internal memory (current index block), obtain the sequence number of the free block that will discharge, read the 3rd parameter in the current index block: piece is counted h; If h is less than m, promptly index block less than, then enter step 221); If h equals m, then change step 222);
221) sequence number of the free block that discharges is write the position of h+1 data block sequence number of current index block, the piece of current index block is counted h and is added 1;
222) the back index block sequence number of putting current index block is the sequence number of the free block that will discharge;
The free block that will discharge is as index block, and the sequence number that to put its preceding index block sequence number be current index block puts thereafter that the index block sequence number is 0, and putting its piece number is 0;
The file initialization:
Among above-mentioned two embodiment, the size of supposing the blocks of files that the user sets is blockSzie, and the size of the file that distribute is fileSize; Then this file can be divided into the N piece, that is:
N＝fileSize/blockSize。
With 0 sequence number to the integer identification document piece of (N-1), K in N the blocks of files is individual as index block, and wherein, K is the smallest positive integral more than or equal to 4 (N-1)/(blockSize-8).
The piece sequence number number m=(blockSize-12)/4 that wherein, can preserve in each index block.
K index block read in internal memory,, the integer from N-1 to K+1 is write in the index block from first index block.The piece numerical value of putting in the index block is m (number of the free block sequence number that can preserve when an index block fills up), but last index block not necessarily fills up, and putting its piece number is h=N-(K+1)-(K-1) * m.
Structure after the file initialization as shown in Figure 1.
Among the embodiment one, when distributing free block, if h＞0 obtains the data block sequence number of (h+2) * 4 positions in the current index block.In the free block assigning process, current index block all is in most cases under the state of h＞0, and it calculates by the piece number, directly obtains the sequence number of free block, than the high more than order of magnitude of dispensing rate of the traversal one by one that adopts the pointer form.The index block that uses among the present invention simultaneously also is assigned with away, and all pieces in the last whole file except reserved block all are assigned with away, have realized the high usage of file space.
Embodiment two, when free block reclaims, suppose that the data in the file j piece are released, if h＜m writes j the position of (h+3) * 4 among the current index block K; If h=m, the back index block sequence number of revising current index block is j; As index block, putting its preceding index block sequence number is K with the j piece, and back index block sequence number is 0, and the piece number is 0; At this moment the j piece is exactly last index block in the index block chained list.Special situation, when the All Files piece except reserved block all is assigned with away, if the user discharges data block j wherein, the index block first-in-chain(FIC) sequence number in the reserved block is 0 at this moment, it need be revised as j; Preceding index block sequence number and the back index block sequence number of j all are changed to 0, and the piece number among the j is changed to 0.
To sum up, the present invention is specially adapted to large file storage and management domain, when needs distribute free block, in last index block in the index block chained list (memory-resident usually), can directly calculate the position of free block sequence number in this index block that to distribute by the piece numerical value in the index block, from then on the position obtains the sequence number of free block, and this free block is dispensed, and revises the piece numerical value of index block then.Because the distribution of free block does not need to travel through the sequence number of searching free block one by one in this method, so have high dispensing rate.If all free blocks of a certain index block management all are assigned with away, then this index block also will be assigned with as free block, can realize the high usage of hard drive space like this.
In the time will carrying out the free block recovery, in last index block in the free block sequence number adding index block chained list that will reclaim, revise the piece numerical value in this index block then.Under the situation that last index block is full in the index block chained list, this free block will add index block chained list afterbody as an index block.In particular cases, after all index blocks were assigned with away, the free block that reclaim this moment will be as first index block.
Above-described embodiment only is used to illustrate technological thought of the present invention and characteristics, its purpose is to make those skilled in the art can understand content of the present invention and implements according to this, can not only limit claim of the present invention with present embodiment, be all equal variation or modifications of doing according to disclosed spirit, still drop in the claim of the present invention.
Claims (10)
1. the distribution method of an idle blocks of file is characterized in that:
File is divided into N blocks of files by default size, and blocks of files is numbered, K in N the blocks of files is individual as index block, index block adopts doubly linked list to connect, store the piece number of the free block of the preceding index block sequence number of this index block, back index block sequence number and the management of this index block in the index block, according to the free block of the management of the order of index block in doubly linked list allocation index piece successively, and canned data in the corresponding modify index block.
2. the distribution method of idle blocks of file according to claim 1 is characterized in that:
Be provided with a reserved block in the described N blocks of files, the sequence number that the back index block sequence number in the preceding index block sequence number in first index block in the described index block and last index block is a reserved block.
3. the distribution method of idle blocks of file according to claim 2 is characterized in that:
When not having the free block of management in the described index block, this index block is assigned with as free block, and this index block in the deletion doubly linked list, revises the corresponding informance in the doubly linked list.
4. the distribution method of idle blocks of file according to claim 3 is characterized in that:
Described N blocks of files numbering is followed successively by 0,1,2 ..., N-1, the piece of described reserved block number is 0, the piece of described index block number is followed successively by 1 to K, each index block can be stored the numbering of m blocks of files at most, from sequence number is 1 index block, will begin to write successively this K index block to the integer of K+1 from N-1.
5. the distribution method of idle blocks of file according to claim 4 is characterized in that:
When system start-up, obtaining the first place of index block chained list from the file reserved block puts, in chained list, travel through then, if the back index block sequence number in the index block is 0, this index block is read in internal memory as current index block, read the 3rd parameter in the current index block: piece is counted h, if h greater than 0, enters step 11); If h equals 0, then change step 12):
11) obtain the sequence number of the free block of current index block management by the piece number;
The sequence number of free block is distributed to the user to be used;
Piece number in the current index block subtracts 1;
12) if the preceding index block sequence number of current index block is not 0, then enter step 121); If the preceding index block sequence number of current index block is 0, then change step 122):
121) read preceding index block sequence number in the current index block;
Current index block as free block, is distributed to the user with its sequence number;
Back index block sequence number in the preceding index block is changed to 0;
122) with current index block as free block, its sequence number is distributed to the user;
Index block first-in-chain(FIC) sequence number in the reserved block is changed to 0.
6. the recovery method of an idle blocks of file is characterized in that:
File is divided into N blocks of files by default size, and blocks of files is numbered, K in N the blocks of files is individual as index block, index block adopts doubly linked list to connect, store the piece number of the free block of the preceding index block sequence number of this index block, back index block sequence number and the management of this index block in the index block, reclaim free block according to the order of index block in doubly linked list successively by index block, and canned data in the corresponding modify index block.
7. the recovery method of idle blocks of file according to claim 6 is characterized in that:
Be provided with a reserved block in the described N blocks of files, described index block adopts doubly linked list to connect, the sequence number that the back index block sequence number in the preceding index block sequence number in first index block in the described index block and last index block is a reserved block.
8. the recovery method of idle blocks of file according to claim 7 is characterized in that:
When last index block in the described index block chained list is expired, the free block of this recovery is inserted in the doubly linked list as index block, and revise corresponding informance in the doubly linked list.
9. the recovery method of idle blocks of file according to claim 8 is characterized in that:
Described N blocks of files numbering is followed successively by 0,1,2 ..., N-1, the piece of described reserved block number is 0, the piece of described index block number is followed successively by 1 to K, each index block can be stored the numbering of m blocks of files at most, from sequence number is 1 index block, will begin to write successively this K index block to the integer of K+1 from N-1.
10. the recovery method of idle blocks of file according to claim 9 is characterized in that:
When system start-up, from the file reserved block, obtain the first place of index block chained list and put, in chained list, travel through, judge whether index block chain heading sequence number is 0, if enter step 21); Otherwise change step 22);
21) the preceding index block sequence number of putting the free block that will discharge is 0, puts thereafter that the index block sequence number is 0, and putting its piece number is 0;
The index block chain heading sequence number of putting in the reserved block is the sequence number of the free block that will discharge;
22) travel through in the index block chained list, if the back index block sequence number in the index block is 0, this last index block is read in internal memory as current index block, read the 3rd parameter in the current index block: piece is counted h; If h less than m, then enters step 221); If h equals m, then change step 222);
221) sequence number of the free block that discharges is write the position of h+1 data block sequence number of current index block, the piece of current index block is counted h and is added 1;
222) free block that will discharge is used as index block, and the sequence number that to put its preceding index block sequence number be current index block puts thereafter that the index block sequence number is 0, and putting its piece number is 0; The back index block sequence number of putting current index block is the sequence number of the free block that will discharge.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200910194886.7A CN101692252B (en) | 2009-08-31 | 2009-08-31 | Method for distributing and reclaiming idle blocks of file |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200910194886.7A CN101692252B (en) | 2009-08-31 | 2009-08-31 | Method for distributing and reclaiming idle blocks of file |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101692252A true CN101692252A (en) | 2010-04-07 |
| CN101692252B CN101692252B (en) | 2014-03-26 |
Family
ID=42080935
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200910194886.7A Active CN101692252B (en) | 2009-08-31 | 2009-08-31 | Method for distributing and reclaiming idle blocks of file |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101692252B (en) |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102024060A (en) * | 2010-12-31 | 2011-04-20 | 山西奥克斯电子系统工程中心 | Method for memorizing files and restoring error deleted files |
| CN102446183A (en) * | 2010-10-12 | 2012-05-09 | 上海可鲁系统软件有限公司 | Industrial data storage method |
| CN102542029A (en) * | 2011-12-22 | 2012-07-04 | 沈阳中科博微自动化技术有限公司 | Block compressed storage method of industrial data |
| CN102737032A (en) * | 2011-04-06 | 2012-10-17 | 腾讯科技（深圳）有限公司 | Method and device for file recovery |
| CN102855327A (en) * | 2012-09-18 | 2013-01-02 | 中国石油天然气股份有限公司 | Small embedded file storage management system |
| CN103336828A (en) * | 2013-07-05 | 2013-10-02 | 深圳市康拓普信息技术有限公司 | Reading and writing-in method for real-time database |
| CN103514184A (en) * | 2012-06-25 | 2014-01-15 | 浙江大华技术股份有限公司 | Editing and backup method and device for recorded file |
| CN103544203A (en) * | 2013-07-11 | 2014-01-29 | 盛科网络（苏州）有限公司 | Method and device for distributing indexes based on linked list |
| CN105988715A (en) * | 2015-02-05 | 2016-10-05 | 深圳市腾讯计算机系统有限公司 | Data storage method and device |
| CN106503260A (en) * | 2016-11-18 | 2017-03-15 | 北京奇虎科技有限公司 | A kind of method and apparatus of the effective memory space for improving data base |
| CN109947700A (en) * | 2019-01-30 | 2019-06-28 | 上海卫星工程研究所 | Spaceborne imaging data management method based on multistage file symbol |
| CN113568868A (en) * | 2021-07-28 | 2021-10-29 | 重庆紫光华山智安科技有限公司 | File system management method, system, electronic device and medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1517906A (en) * | 2003-01-14 | 2004-08-04 | 联想(北京)有限公司 | Document system and document management method |
| CN1536509A (en) * | 2003-04-11 | 2004-10-13 | �Ҵ���˾ | Inverted index storage method, inverted index mechanism and on-line updating method |
| CN101094179A (en) * | 2007-07-16 | 2007-12-26 | 中兴通讯股份有限公司 | Method and device for looking up route indexed in multiple stages |
| WO2008009995A2 (en) * | 2006-07-19 | 2008-01-24 | Chronicle Solutions (Uk) Limited | System and method for indexing stored electronic data using a b-tree |
| CN101169628A (en) * | 2007-11-14 | 2008-04-30 | 中控科技集团有限公司 | Data storage method and device |
-
2009
- 2009-08-31 CN CN200910194886.7A patent/CN101692252B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1517906A (en) * | 2003-01-14 | 2004-08-04 | 联想(北京)有限公司 | Document system and document management method |
| CN1536509A (en) * | 2003-04-11 | 2004-10-13 | �Ҵ���˾ | Inverted index storage method, inverted index mechanism and on-line updating method |
| WO2008009995A2 (en) * | 2006-07-19 | 2008-01-24 | Chronicle Solutions (Uk) Limited | System and method for indexing stored electronic data using a b-tree |
| CN101094179A (en) * | 2007-07-16 | 2007-12-26 | 中兴通讯股份有限公司 | Method and device for looking up route indexed in multiple stages |
| CN101169628A (en) * | 2007-11-14 | 2008-04-30 | 中控科技集团有限公司 | Data storage method and device |
Cited By (19)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102446183A (en) * | 2010-10-12 | 2012-05-09 | 上海可鲁系统软件有限公司 | Industrial data storage method |
| CN102024060B (en) * | 2010-12-31 | 2012-10-24 | 山西奥克斯电子系统工程中心 | Method for memorizing files and restoring error deleted files |
| CN102024060A (en) * | 2010-12-31 | 2011-04-20 | 山西奥克斯电子系统工程中心 | Method for memorizing files and restoring error deleted files |
| CN102737032A (en) * | 2011-04-06 | 2012-10-17 | 腾讯科技（深圳）有限公司 | Method and device for file recovery |
| CN102737032B (en) * | 2011-04-06 | 2016-06-08 | 腾讯科技（深圳）有限公司 | The method of file access pattern and device |
| CN102542029A (en) * | 2011-12-22 | 2012-07-04 | 沈阳中科博微自动化技术有限公司 | Block compressed storage method of industrial data |
| CN103514184B (en) * | 2012-06-25 | 2017-05-10 | 浙江大华技术股份有限公司 | Editing and backup method and device for recorded file |
| CN103514184A (en) * | 2012-06-25 | 2014-01-15 | 浙江大华技术股份有限公司 | Editing and backup method and device for recorded file |
| CN102855327A (en) * | 2012-09-18 | 2013-01-02 | 中国石油天然气股份有限公司 | Small embedded file storage management system |
| CN102855327B (en) * | 2012-09-18 | 2015-12-02 | 中国石油天然气股份有限公司 | Small embedded file storage management system |
| CN103336828A (en) * | 2013-07-05 | 2013-10-02 | 深圳市康拓普信息技术有限公司 | Reading and writing-in method for real-time database |
| CN103336828B (en) * | 2013-07-05 | 2017-10-03 | 深圳市康拓普信息技术有限公司 | Real-time data base is read and wiring method |
| CN103544203A (en) * | 2013-07-11 | 2014-01-29 | 盛科网络（苏州）有限公司 | Method and device for distributing indexes based on linked list |
| CN105988715A (en) * | 2015-02-05 | 2016-10-05 | 深圳市腾讯计算机系统有限公司 | Data storage method and device |
| CN106503260A (en) * | 2016-11-18 | 2017-03-15 | 北京奇虎科技有限公司 | A kind of method and apparatus of the effective memory space for improving data base |
| CN106503260B (en) * | 2016-11-18 | 2020-04-28 | 北京奇虎科技有限公司 | Method and device for improving effective storage space of database |
| CN109947700A (en) * | 2019-01-30 | 2019-06-28 | 上海卫星工程研究所 | Spaceborne imaging data management method based on multistage file symbol |
| CN113568868A (en) * | 2021-07-28 | 2021-10-29 | 重庆紫光华山智安科技有限公司 | File system management method, system, electronic device and medium |
| CN113568868B (en) * | 2021-07-28 | 2024-02-06 | 重庆紫光华山智安科技有限公司 | File system management method, system, electronic equipment and medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101692252B (en) | 2014-03-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101692252B (en) | Method for distributing and reclaiming idle blocks of file | |
| JP6025149B2 (en) | System and method for managing data | |
| CN100468402C (en) | Sort data storage and split catalog inquiry method based on catalog tree | |
| CN101315628B (en) | Internal memory database system and method and device for implementing internal memory data base | |
| CN105378687B (en) | Access the method and relevant device of file | |
| CN102985909B (en) | Object for good lattice provides the method and apparatus of the high scalability network storage | |
| CN105389264B (en) | The method and system of garbage collection in storage system | |
| CN103838853B (en) | Mixed file system based on different storage media | |
| US10503692B2 (en) | Filter file system with inode number as primary database key | |
| CN101763415B (en) | Method and device for generating B tree index of database | |
| CN100424699C (en) | Attribute extensible object file system | |
| CN101373445B (en) | Method and apparatus for scheduling memory | |
| CN103823865A (en) | Database primary memory indexing method | |
| CN102402602A (en) | B+ tree indexing method and device of real-time database | |
| CN105045850B (en) | Junk data recovery method in cloud storage log file system | |
| CN107239526A (en) | File system implementation method, scrap cleaning method, operating position localization method | |
| CN111522507B (en) | Low-delay file system address space management method, system and medium | |
| CN102411632B (en) | Chain table-based memory database page type storage method | |
| CN103885887A (en) | User data storage method, reading method and system | |
| CN102779138A (en) | Hard disk access method of real time data | |
| CN104750432B (en) | A kind of date storage method and device | |
| CN101271429A (en) | Data storage method and device | |
| CN105468541A (en) | Cache management method for transparent-computing-oriented intelligent terminal | |
| CN101226553A (en) | Method and device for storing length-various field of embedded database | |
| CN106354890A (en) | Implementation method of random access file system based on N-ary tree structure |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| DD01 | Delivery of document by public notice |
Addressee: Luo Dachen Document name: Notification of Passing Preliminary Examination of the Application for Invention |
|
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |