CN103809915B - The reading/writing method of a kind of disk file and device - Google Patents
The reading/writing method of a kind of disk file and device Download PDFInfo
- Publication number
- CN103809915B CN103809915B CN201210436250.0A CN201210436250A CN103809915B CN 103809915 B CN103809915 B CN 103809915B CN 201210436250 A CN201210436250 A CN 201210436250A CN 103809915 B CN103809915 B CN 103809915B
- Authority
- CN
- China
- Prior art keywords
- disk file
- keyword
- internal storage
- data queue
- data
- 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
Abstract
This application provides reading/writing method and the device of a kind of disk file, the method includes: the read-write process of preprocessing process and disk file, preprocessing process includes: when starting a certain computer software first, the disk file that described computer software is required in startup and running is resolved according to form, and set up internal storage data queue, internal storage data queue is saved as binary file；The read-write process of disk file includes: when follow-up startup current computer software, obtains the current binary file that current computer software is uniquely corresponding from disk；It is loaded onto current binary file in internal memory to generate current memory data queue；According to the keyword that current computer software is to be read and write, from current memory data queue, read target disk file data, or, target disk file data is write in current memory data queue.Use the method or apparatus of the embodiment of the present application, the speed of read-write disk file can be improved.
Description
Technical field
The application relates to the data processing field of computer system, particularly to the reading of a kind of disk file
Write method and device.
Background technology
Existing computer software, when starting and run, has some attribute datas or use
The contents such as file are stored in disk, typically by these computer softwares use and be stored in magnetic
Data in dish or file etc. are referred to as disk file.The form of disk file is varied, such as
XML (extensible markup language, Extensible Markup Language) formatted file, JASON
Formatted file, database file or picture file etc..And computer software is reading different-format
File time be required for according to analytic method corresponding to different-format to the data obtaining in disk file
In internal memory.
Prior art has a kind of reading/writing method carrying out disk file, any computer software each time
After running, it needs to read and write disk file when, further according to the disk to be read and write with this
The analytic method that the form of file is corresponding, such as, XML file has the analytic method of XML, number
SQL method is needed to read and write according to library file, in the digital independent in disk file to internal memory.Its
In, the speed of read-write disk file depends on the computer software resolution speed to disk file.
Inventor finds in research process, uses the scheme of prior art, computer can be made soft
Because being required for the form according to disk file each time and first solving the when of part read-write disk file
Analysis, and make the speed reading and writing disk file slower so that the efficiency comparison of read-write disk file is low
Under.Further, when PC software needs frequently to access some disk file, and these disk files are again
Need to be will also result in when digital independent to internal memory uses frequently by various analytic methods
The phenomenon of the data in parsing disk file, so can waste the most unnecessary systematic function.
In a word, a technical problem that those skilled in the art urgently solve is presently required is exactly: as
The reading/writing method proposing a kind of disk file what can be innovated, to solve to read and write in prior art magnetic
The problem that the efficiency comparison of dish file is low, and then promote the readwrite performance of disk file, reduce system
The expense of system performance.
Summary of the invention
Technical problems to be solved in this application are to provide the reading/writing method of a kind of disk file, in order to
Solution prior art is read and write the problem that the efficiency comparison of disk file is low, and then promotes disk literary composition
The readwrite performance of part, reduces the expense of systematic function.
Present invention also provides the read-write equipment of a kind of disk file, in order to ensure that said method is in reality
In realization and application.
In order to solve the problems referred to above, this application discloses the reading/writing method of a kind of disk file, the method
Including the read-write process of preprocessing process and disk file, wherein,
Described preprocessing process includes:
When starting a certain computer software, described computer software is being started and institute in running
The disk file needed resolves according to corresponding disk file form, and the disk literary composition after resolving
Part reads the internal storage data queue that in internal memory, foundation is corresponding with described disk file, by described internal memory
Data queue saves as the binary file the most corresponding with described computer software and stores to disk
In；Keyword and disk file data one to one are preserved in described internal storage data queue；
The read-write process of described disk file includes:
When follow-up startup current computer software, from disk, obtain described current computer software only
The current binary file of one correspondence；
It is loaded onto described current binary file in internal memory to generate current memory data queue；
According to the keyword that described current computer software is to be read and write, from described current memory data queue
The target disk file data that middle reading is corresponding with described keyword, or, by described keyword pair
The target disk file data answered writes in described current memory data queue.
Preferably, the described keyword to be read and write according to described current computer software, from described currently
Internal storage data queue is read the target disk file data corresponding with described keyword, including:
Judge whether described internal storage data queue exists the mesh corresponding with described keyword to be read and write
Mark disk file data, if it is, directly read described target disk file data；
If it is not, then obtain the target disk file corresponding with described keyword, according to described target magnetic
Described target disk file is resolved by the form of dish file, and reads the described target disk of parsing
The target disk file data that file obtains, and described keyword and target disk file data are added
Add in described internal storage data queue.
Preferably, described directly read described target disk file data after, also include: by institute
State keyword and move the first place to described internal storage data queue with target disk file data；
Accordingly, described described keyword and target disk file data are added to described internal storage data
Particularly as follows: described keyword and target disk file data are inserted into described internal storage data in queue
The first place of queue；
And, described, described keyword and target disk file data are inserted into described internal storage data
After the first place of queue, also include:
Judge that the last position keyword in described internal storage data queue is corresponding with position, end disk file data
Marker bit indicates whether that described end position keyword and position, end disk file data are updated, if it does not,
Then remove described end position keyword and position, end disk file data, if it is, by position, described end magnetic
Dish file data is updated in original disk file remove described end position keyword and position, end disk literary composition again
Number of packages evidence.
Preferably, the described keyword to be read and write according to described current computer software, by described key
The target disk file data that word is corresponding writes in described current memory data queue, including:
Judge whether described internal storage data queue exists the mesh corresponding with described keyword to be read and write
Mark disk file data, if it is, directly update described target disk file data；
If it is not, then the target disk file data of described keyword and correspondence is inserted into described internal memory
In data queue.
Preferably, after described direct renewal described target disk file data, also include: by described
Keyword moves the first place to described internal storage data queue with corresponding target disk file data；
Accordingly, described the target disk file data of described keyword and correspondence is inserted into described in
In deposit data queue, particularly as follows: the target disk file data of described keyword and correspondence is inserted
First place to described internal storage data queue；
And, described the target disk file data of described keyword and correspondence is inserted into described in
After the first place of deposit data queue, also include:
Judge that the last position keyword in described internal storage data queue is corresponding with position, end disk file data
Marker bit indicates whether that described end position keyword and position, end disk file data are updated, if it does not,
Then the last position keyword in described internal storage data queue and position, end disk file data are removed, if
It is then to be updated in original disk file remove position, described end again by position, described end disk file data
Keyword and position, end disk file data.
Preferably, also include:
When the update cycle arrives, update binary system corresponding in disk according to current memory data queue
File.
This application discloses the read-write equipment of a kind of disk file, including: pretreatment unit and disk literary composition
The read-write cell of part, wherein,
Described pretreatment unit includes:
Parsing module, for when starting a certain computer software, is starting described computer software
Resolve according to corresponding disk file form with disk file required in running；
Setting up Queue module, the disk file after resolving reads in internal memory to be set up and described magnetic
The internal storage data queue that dish file is corresponding；Described internal storage data queue is preserved crucial one to one
Word and disk file data；
Memory module is the most right with described computer software for described internal storage data queue being saved as
The binary file answered stores to disk；
The read-write cell of described disk file includes:
Acquisition module, for when follow-up startup current computer software, obtains described working as from disk
The current binary file that front computer software is uniquely corresponding；
Load-on module, for being loaded onto in internal memory to generate current memory by described current binary file
Data queue；
Read module, for the keyword to be read and write according to described current computer software, works as from described
Front internal storage data queue is read the target disk file data corresponding with described keyword；
Writing module, for the keyword to be read and write according to described current computer software, by described pass
The target disk file data that key word is corresponding writes in described current memory data queue.
Preferably, described read module includes:
Whether first judges submodule, be used for judging to exist in described internal storage data queue to continue with described
The target disk file data that the keyword write is corresponding；
First reading submodule, in the case of judging that the result of submodule is as being described first,
Directly read described target disk file data；
Obtain submodule, in the case of judging that the result of submodule is no described first, acquisition
The target disk file corresponding with described keyword；
Analyzing sub-module, for the form according to described target disk file to described target disk file
Resolve；
Second reading submodule, resolves, for reading, the target disk literary composition that described target disk file obtains
Number of packages evidence；
First adds submodule, for adding described keyword and target disk file data to described
In internal storage data queue.
Preferably, described read module also includes:
First mover module, for moving described keyword to described with target disk file data
The first place of internal storage data queue；
Second judges submodule, for judging the last position keyword in described internal storage data queue and position, end
Marker bit corresponding to disk file data indicates whether described end position keyword and position, end disk file number
According to being updated；
First updates submodule, in the case of judging that the result of submodule is as being described second,
Position, described end disk file data are updated in original disk file；
First removes submodule, in the case of judging that the result of submodule is no described second,
Or, after described first updates submodule triggering, by the last position in described internal storage data queue
Keyword and position, end disk file data remove；
Described first adds submodule, specifically for: by described keyword and target disk file data
It is inserted into the first place of described internal storage data queue.
Preferably, said write module includes:
Whether the 3rd judges submodule, be used for judging to exist in described internal storage data queue to continue with described
The target disk file data that the keyword write is corresponding；
Second updates submodule, in the case of judging that the described 3rd the result of submodule is, directly
Connect the described target disk file data of renewal；
Intron module, in the case of judging that the result of submodule is no the described 3rd, by institute
The target disk file data stating keyword and correspondence is inserted in described internal storage data queue.
Preferably, said write module also includes:
Second mover module, for moving described keyword with corresponding target disk file data
First place to described internal storage data queue；
4th judges submodule, for judging the last position keyword in described internal storage data queue and position, end
Marker bit corresponding to disk file data indicates whether described end position keyword and position, end disk file number
According to being updated；
3rd updates submodule, in the case of judging that the result of submodule is as being the described 4th,
Position, described end disk file data are updated in original disk file；
Second removes submodule, in the case of judging that the result of submodule is no the described 4th,
Or it is after triggering described 3rd renewal submodule, the last position in described internal storage data queue is crucial
Word and position, end disk file data remove；
Described intron module, specifically for: by the target disk number of files of described keyword and correspondence
According to the first place being inserted into described internal storage data queue.
Preferably, also include:
Updating block, for when the update cycle arrives, updates magnetic according to current memory data queue
Binary file corresponding in dish.
Compared with prior art, the application includes advantages below:
In this application, by pretreatment mode, this computer software of follow-up startup when, just
The binary file the most corresponding with it can be loaded from disk, and this binary file is because being
Each disk file parsed, it is possible to be directly written and read, and be no longer necessary to each
It is required for after secondary startup computer software reading and writing disk file when disk file is solved
Analysis.Visible the application as the L2 cache of disk file, i.e. improves meter by binary file
The speed of calculation machine software read-write disk file, improves the efficiency of computer software read-write disk file,
Also solve and frequently access disk I/O (input/output, Input/Output) and to resolve disk literary composition
The problem of the data of part, reduces the expense of system-computed performance.
Implementing the application is transparent to computer software so that computer software read-write disk file
Data are simpler.And the data in internal storage data queue can be according to computer software to data
Use frequency generate, so computer software need most data can be directly from internal memory
Data queue reads, the most also can greatly reduce the access to disk I/O, improve a lot of disk literary composition
The readwrite performance of part, promotes the read-write efficiency of disk file.Additionally, due to internal storage data queue and
The data of binary file have been set up the data structure of a set of (key value), so upper strata industry
When computer software in business layer needs to call data, it is only necessary to input key (keyword) is the most permissible
Obtain corresponding value (target disk file data), the position of disk file, concrete need not be concerned about
Structure and analysis mode so that very convenient and transparent to the data call in disk file, simplify
Upper-layer service calls the process of data.
Certainly, the arbitrary product implementing the application it is not absolutely required to reach all the above simultaneously
Advantage.
Accompanying drawing explanation
For the technical scheme being illustrated more clearly that in the embodiment of the present application, embodiment will be described below
The accompanying drawing used required in is briefly described, it should be apparent that, the accompanying drawing in describing below is only
It is only some embodiments of the application, for those of ordinary skill in the art, is not paying wound
On the premise of the property made is laborious, it is also possible to obtain other accompanying drawing according to these accompanying drawings.
Fig. 1 is the flow chart of the reading/writing method embodiment 1 of a kind of disk file of the application；
Fig. 2 is the flow chart of reading disk file in the embodiment of the present application 1；
Fig. 3 is the flow chart writing disk file in the embodiment of the present application 1；
Fig. 4 is the flow chart of the reading/writing method embodiment 2 of a kind of disk file of the application；
Fig. 5 is the flow chart of the reading/writing method embodiment 3 of a kind of disk file of the application；
Fig. 6 is the structured flowchart of the read-write equipment embodiment 1 of a kind of disk file of the application；
Fig. 7 is the structured flowchart of read module 606 in the application device embodiment 1；
Fig. 8 is the structured flowchart of writing module 607 in the application device embodiment 1
Fig. 9 is the structured flowchart of the read-write equipment embodiment 2 of a kind of disk file of the application；
Figure 10 is the structured flowchart of the read-write equipment embodiment 3 of a kind of disk file of the application.
Detailed description of the invention
Below in conjunction with the accompanying drawing in the embodiment of the present application, to the technical scheme in the embodiment of the present application
It is clearly and completely described, it is clear that described embodiment is only that the application part is real
Execute example rather than whole embodiments.Based on the embodiment in the application, ordinary skill
The every other embodiment that personnel are obtained under not making creative work premise, broadly falls into this
The scope of application protection.
The application can be used in numerous general or special purpose calculating device context or configuration.Such as: individual
People's computer, server computer, handheld device or portable set, laptop device, many places
Reason device device, the distributed computing environment including any of the above device or equipment etc..
The application can retouch in the general context of computer executable instructions
State, such as program module.Usually, program module includes performing particular task or realizing specific taking out
The routine of image data type, program, object, assembly, data structure etc..Can also be in distribution
Formula computing environment puts into practice the application, in these distributed computing environment, by passing through communication network
And connected remote processing devices performs task.In a distributed computing environment, program module
May be located in the local and remote computer-readable storage medium including storage device.
One of main thought of the application can include, computer software starts first when,
Just this computer software is being started each disk file required with in running according to correspondence
Each disk file form resolves, and will resolve after each disk file read in internal memory
Set up the internal storage data queue corresponding with each disk file described, then by described internal storage data queue
Save as the binary file the most corresponding with described any computer software to store to disk, its
Keyword and disk file data one to one are preserved in middle internal storage data queue.By above-mentioned
Pretreatment mode, upper once start this computer software when, it is possible to from disk load
The binary file uniquely the most corresponding with it, and this binary file is because of being each that parsed
Disk file, it is possible to be directly written and read, and it is no longer necessary to start each time computer software
It is required for afterwards reading and writing disk file when disk file is resolved.Visible the application is led to
Cross the binary file L2 cache as disk file, i.e. improve computer software read-write disk
The speed of file, improves the efficiency of computer software read-write disk file, also solves frequently visit
Ask disk I/O (input/output, Input/Output) and to resolve the problem of the data of disk file,
Reduce the expense of system-computed performance.
With reference to Fig. 1, it is shown that the flow chart of the reading/writing method embodiment 1 of a kind of disk file of the application,
The present embodiment includes the read-write process of preprocessing process and disk file, and wherein, preprocessing process is
Step 101～step 103, the read-write process of disk file includes step 104～step 106, this reality
Execute example may comprise steps of:
Step 101: when starting a certain computer software first, is starting described computer software
Resolve according to corresponding disk file form with disk file required in running.
In the present embodiment, if being mounted with certain software on computer, then should starting for the first time
The when of computer software, the disk file needing the data place used in its start-up course can quilt
Resolve in advance, and behind during reforwarding row so that it is data institute that can be properly functioning
Disk file in also could normally can be read by carrying out parsing in advance.Therefore, the present embodiment structure
The read-write equipment of the disk file built, it is possible to achieve the when that each computer software starting first,
This computer software is started each disk file required with in running according to correspondence at this
Each disk file form carry out the purpose that resolves.The embodiment of the present application is to a certain computer software
Starting or required disk file is being resolved by running, be not offered as being to all of
Disk file all resolves, it will be understood by those skilled in the art that can only to therein certain
Individual/some disk file resolves, or only enters certain or some data in a certain disk file
Row resolves, and this is not limited by the application.
Such as, from the point of view of this instant communication software of Ali Wang Wang, start Ali Wang Wang for the first time
When, have some configuration informations and be saved in disk file, such as operation circle of Ali Wang Wang
The attribute datas such as face, display size, and during Ali's spell of good luck row, between client
The information such as instant messaging record are also required to be saved in disk file, and these disk files the most all can be
It is resolved by this step.
Step 102: the disk file after resolving reads in internal memory to be set up and described disk file pair
The internal storage data queue answered.
Each disk file required in computer software startup and running is according to correspondence
After each disk file form resolves, each disk file after resolving reads internal memory
In, to set up the internal storage data queue corresponding with each disk file in internal memory.Wherein, this is interior
Keyword and disk file data one to one are preserved in deposit data queue, are i.e. with key-value
The frame mode of (keyword-disk file data) preserves keyword and the disk after corresponding parsing
File data.Wherein, keyword can be understood as current disk file data and is different from other disks
Unique mark of file data, needed for the current disk file data of correspondence are then computer software
Content to be read and write, has had key word, can find the current disk file data of correspondence.
When setting up this internal storage data queue, can according to a certain particular order to keyword therein-
Disk file data are to being ranked up, and such as, are being currently up according to disk file data and running
During use frequency be ranked up, be i.e. the disk file data using frequency high are placed in
The first place of deposit data queue, and generate keyword-disk file number according to the size using frequency successively
According to right, the disk file data using frequency minimum are then placed on the last position of internal storage data queue.Certainly,
Those skilled in the art can also according to demand according to other parameters in internal storage data queue
Key-value is to being ranked up.
It is understood that the length of this internal storage data queue can also pre-set, such as, will
The preset length of key and value is respectively set to 4 bytes, then long shared by a pair key and value
Degree is i.e. 8 bytes.But, although the length of key and value can be in advance in internal storage data queue
Arranging, but length scale is adjustable in, those skilled in the art still can be according to demand
It is independently arranged.
Step 103: described internal storage data queue is saved as the most corresponding with described computer software
Binary file stores to disk.
After setting up internal storage data queue, then it is saved as a binary file and stores to disk
In, because from the point of view of for any one computer software, only an internal storage data queue can be set up, because of
This, the computer software also the most unique corresponding binary file.Concrete, by internal memory
When data queue saves as with computer software binary file one to one, can be according to internal memory
The length of key and value of data queue generates binary file, is i.e. according to internal storage data queue
In order successively using key and value to according to its regular length as in binary file
Hold.
The regular length assuming key and value pair in internal storage data queue is 8 bytes, then after
Continue reading internal storage data queue when, be also read out for unit length with 8 bytes, so
Ensure that the data that can read each time in a disk file corresponding to keyword.Wherein,
The readability of binary file, ease for use ratio are relatively low, owing to the data content of binary file is root
Write direct according to the data structure of the internal storage data queue needed for user, if so follow-up reading
Binary file then need not resolve again, directly binary file can be read in internal memory.
The when of it should be noted that again internal storage data queue is saved as binary file, Ke Yixuan
Take N before internal storage data queue (value of N can according to computer software use disk file number
Autonomous arranging, the most first 50) key and value of position be to directly generating a binary file.
Wherein, step 101～step 103 are pre-treatment step, from the point of view of a computer software,
Only at it after the pre-treatment step of step 101～step 103, just can carry out step 104～
The read-write process of the disk file of step 106, but for same computer software from the point of view of, step
Rapid 101～the preprocessing process of step 103 perform once, follow-up can be civilian to binary system in real time
Part is updated.
Step 104: when follow-up startup current computer software, obtain described current meter from disk
The current binary file that calculation machine software is uniquely corresponding.
For having generated the current computer software of binary file, when its second time or follow-up often
During one-shot, from disk, directly obtain the binary system literary composition that this current computer software is uniquely corresponding
Part.
Step 105: be loaded onto described current binary file in internal memory to generate current memory data
Queue.
Directly the binary file got in step 104 being loaded is i.e. direct copying in internal memory,
The current memory data queue corresponding with current computer software can be generated.Concrete, by two
The when of the internal storage data queue that binary file is loaded as in internal memory, can be according to set in advance interior
The regular length of key and value pair of deposit data queue loads, such as, according to 8 bytes
Unit length using the data in binary file successively as key and value in internal storage data queue
Right.It should be noted that because of the when of generating binary file, be according to internal storage data queue
Order carry out, so now have only to be successively read according to the regular length of key and value pair
Binary file, sets up internal storage data queue according still further to the order read, will generate and pretreatment
During the same content of internal storage data queue set up.
Step 106: according to the keyword that described current computer software is to be read and write, from described current in
Deposit data queue is read the target disk file data corresponding with described keyword, or, by institute
State target disk file data corresponding to keyword to write in described current memory data queue.
For the key word that current computer software is to be read and write, if read operation, the most permissible
From the internal storage data queue that step 105 loads, directly read the target disk corresponding with this keyword
File data (being i.e. value value), if write operation, then can be by corresponding for this keyword
Target disk file data writes direct in described current memory data queue.
In actual applications, with reference to shown in Fig. 2, according to the keyword that current computer software is to be read,
The target disk number of files corresponding with described keyword is read from described current memory data queue
According to, specifically may include that
Step 201: judge whether exist in described internal storage data queue and described keyword to be read
Corresponding target disk file data, if it is, enter step 202, if it is not, then enter step
Rapid 203；
Fig. 2 is the flow chart of reading disk file.First judge whether internal storage data queue exists and treats
Target disk file data corresponding to keyword read, if it is present explanation internal storage data team
Row there is computer software need the data read, then can perform step 202, and if not
Exist, then in explanation internal storage data queue, computer software does not needs the data read, then hold
Row step 203～step 206.
Step 202: directly read described target disk file data；
From internal storage data queue, directly read the target disk file data corresponding with keyword, then return
Back to computer software；
Step 203: obtain the target disk file corresponding with described keyword；
First obtain the target disk file in disk corresponding with this keyword；
Step 204: described target disk file is solved according to the form of described target disk file
Analysis；
Because target disk file data is not in internal storage data queue, then this target disk literary composition is described
Part also resolves, and now needs the form according to target disk file to this target disk file
Resolve；
Step 205: read and resolve the target disk file data that described target disk file obtains；
Can read after target disk document analysis and resolve the target magnetic that target disk file obtains
Dish file data, then it is returned to computer software；
Step 206: described keyword and target disk file data are added to described internal storage data team
In row.
The target disk file data finally also needing to obtain keyword and parsing is as one
Key-value is to adding to internal storage data queue.So guarantee needs to read to be somebody's turn to do the most again
The when of target disk file data, it is not necessary to resolve this target disk file again, thus realize carrying
The purpose of the read or write speed of high disk file.
With reference to shown in Fig. 3, according to the keyword that current computer software is to be written, by described keyword
Corresponding target disk file data writes in described current memory data queue, may include that
Step 301: judge whether exist in described internal storage data queue and described keyword to be written
Corresponding target disk file data, if it is, enter step 302, if it is not, then enter step
Rapid 303；
Fig. 3 is the flow chart of write disk file.First judge whether internal storage data queue exists and treats
The target disk file data corresponding to keyword of write, if it is present explanation internal storage data team
Row there is computer software need the data of write, then can perform step 302, and if not
Exist, then in explanation internal storage data queue, computer software does not needs the data read, then hold
Row step 303～step 203.
Step 302: directly update described target disk file data；
Directly update the target disk file data existed in internal storage data queue, it is achieved by data
The purpose of write disk file；
Step 303: the target disk file data of described keyword and correspondence is inserted into described internal memory
In data queue.
Keyword is inserted in internal storage data queue with corresponding target disk file data.
Use the embodiment of the present application, first by disk file by corresponding analytic method, by disk file
In digital independent to the internal storage data team of internal memory the frame mode setting up (key-value)
Row, it is also possible to adjust the order of internal storage data queue according to preset rules, and by internal storage data queue
Save as the binary file corresponding with computer software, upper once start computer software time,
Need to copy the data of binary file to internal memory directly generates internal storage data queue, now count
Calculation machine software, when needs read-write disk file, is directly read from internal storage data queue by the application
Write, it is no longer necessary to be required for after starting computer software each time in read-write disk file
Time disk file is resolved.Visible the application passes through binary file as disk file
L2 cache, i.e. improves the speed of computer software read-write disk file, improves computer soft
The efficiency of part read-write disk file.
Further, can be according to the use frequency of computer software due to the data in binary file
Generating, the disk file that so most computer softwares use can directly read, pole
The big speed that must accelerate computer software reading disk file.
With reference to Fig. 4, it is shown that the flow chart of the reading/writing method embodiment 2 of a kind of disk file of the application,
The present embodiment is after preprocessing process, it is achieved disk file is read out by computer software
Method, the present embodiment may comprise steps of:
Step 401: when follow-up startup current computer software, obtain described current meter from disk
The current binary file that calculation machine software is uniquely corresponding.
Step 402: be loaded onto described current binary file in internal memory to generate current memory data
Queue.
Step 401～implementing of step 402 are referred to embodiment 1, do not repeat them here.
Step 403: judge whether exist in described internal storage data queue and described keyword to be read
Corresponding target disk file data, if it is, enter step 404, if it is not, then enter step
Rapid 405.
When computer software needs to read disk file data corresponding to certain keyword, can first remove internal memory
Data queue reads, then needs first to judge whether internal storage data queue exists to be read with described
Target disk file data corresponding to keyword.
Step 404: directly read described target disk file data, by described keyword and target magnetic
Dish file data moves the first place to described internal storage data queue.
If internal storage data queue has, just directly read described target disk file data and return to
Computer software.
The present embodiment difference from Example 1 is, is reading the target disk literary composition that keyword is corresponding
This keyword and target disk file data, according to afterwards, are moved to the head of internal storage data queue by number of packages
Position.Because currently performing once to this keyword and the read operation of target disk file data,
Then illustrate that the reading times of this keyword and target disk file data adds once, therefore, will
The first place moving to internal storage data queue of its correspondence, to facilitate reading next time.
Step 405: obtain the target disk file corresponding with described keyword, according to described target magnetic
Described target disk file is resolved by the form of dish file.
If internal storage data queue does not has, then need first to obtain this keyword preserved on disk corresponding
Disk file, then this disk file is carried out the parsing of corresponding format.
Step 406: read and resolve the target disk file data that described target disk file obtains.
Step 407: described keyword and target disk file data are inserted into described internal storage data team
The first place of row.
The present embodiment is with the difference of embodiment 1, resolves described target disk file reading
After the target disk file data obtained returns to computer software, also by this keyword and target
Disk file data are inserted into the first place of described internal storage data queue, to facilitate reading next time.
Step 408: judge the last position keyword in described internal storage data queue and position, end disk file number
Indicate whether that described end position keyword and position, end disk file data are updated according to corresponding marker bit
Cross, if it is not, then enter step 410, if it is, enter step 409.
In the present embodiment, the keyword in internal storage data queue and disk file data are to arranging
Corresponding marker bit, this marker bit be used for representing a keyword and disk file data to whether by
Updated, renewal here can be understood as data and the internal storage data team stored in disk file
Disk file data in row are the most consistent.Such as, by the data correspondence establishment in disk file
The when of deposit data queue, first marker bit correspondence is set to 0, the data in internal storage data queue are described
It is i.e. the data in original disk file, and follow-up data in internal storage data queue is carried out
Have updated, the most now because of the internal storage data queue only updated, so the number in original disk file
According to the most non-synchronized update, therefore, if these data need to remove internal storage data queue, just
First judged whether to renewal.
Step 409: position, described end disk file data are updated in original disk file, enter step
Rapid 410.
If the marker bit of the last position disk file data in internal storage data queue is 1, then can illustrate
It was updated, and the most first position, end disk file data was updated in original disk file,
Again it is removed from internal storage data queue.
Step 410: by the last position keyword in described internal storage data queue and position, end disk file data
Remove.
If the marker bit of position, end disk file data is 0, then illustrate that it did not carried out renewal, was i.e.
With the data consistent preserved in original disk file, the most directly by position, internal storage data queue end
Data (end position keyword and position, end disk file data) are taken out and are removed.In so can ensure that
The total length of deposit data queue is constant, the real-time of disk file data, and disk file and interior
Deposit data queue consistent.
Step 411: when the update cycle arrives, it is right to update in disk according to current memory data queue
The binary file answered.
Can also include the renewal to binary file in the present embodiment, such as arranging the update cycle is half
Hour, then every half an hour, then new two that current memory data queue generates can be entered
Old binary file corresponding in file Replace Disk and Press Anykey To Reboot processed, in order to next time can directly read interior
In depositing.
In the present embodiment, it is possible not only to ensure that the length of internal storage data queue is constant, and can be by up-to-date
The target disk file data once read moves the first place to internal storage data queue, so that
What closely the target disk file data of reading can be the fastest reads from internal storage data queue, and,
According to the default update cycle, binary file can also be updated, it is ensured that binary system literary composition
The real-time of part.
With reference to Fig. 5, it is shown that the flow chart of the reading/writing method embodiment 3 of a kind of disk file of the application,
The present embodiment is after preprocessing process, it is achieved disk file is write by computer software
Method, in the present embodiment, may comprise steps of:
Step 501: when follow-up startup current computer software, obtain described current meter from disk
The current binary file that calculation machine software is uniquely corresponding.
Step 502: be loaded onto described current binary file in internal memory to generate current memory data
Queue.
Step 501～implementing of step 502 are referred to embodiment 1, do not repeat them here.
Step 503: judge whether exist in described internal storage data queue and described keyword to be written
Corresponding target disk file data, if it is, enter step 504, if it is not, then enter step
Rapid 505.
When computer software needs to write disk file data corresponding to certain keyword, in first judging
Whether deposit data queue exists the target disk file data that the keyword to be written with this is corresponding,
Step 504: directly update described target disk file data, by described keyword with corresponding
Target disk file data moves the first place to described internal storage data queue.
If internal storage data queue has, the just the most direct described target disk file data of renewal, be i.e. by
Target disk file data to be written directly replaces target disk present in former internal storage data queue
File data.
The present embodiment difference from Example 1 is, update described target disk file data it
After, this keyword and target disk file data are moved to the first place of internal storage data queue.Because
Currently perform once to this keyword and the write operation of target disk file data, then explanation should
The write number of times of keyword and target disk file data adds once, therefore, by its correspondence
Move to the first place of internal storage data queue, to facilitate write next time.
Step 505: the target disk file data of described keyword and correspondence is inserted into described internal memory
The first place of data queue.
The present embodiment is with the difference of embodiment 1, if do not had in internal storage data queue, then
Need to be inserted into this keyword and target disk file data the first place of data queue, under facilitating
Write once.
Step 506: judge the last position keyword in described internal storage data queue and position, end disk file pair
The marker bit answered indicates whether that described end position keyword and position, end disk file data are updated, as
The most no, then enter step 508, if it is, enter step 507.
Step 507: position, described end disk file data are updated in original disk file.
Step 508: by the last position keyword in described internal storage data queue and position, end disk file data
Remove.
The present embodiment is with the difference of embodiment 1, at write keyword and the target magnetic of correspondence
After dish file data, if position, end disk file data did not carried out renewal, then the most then will
The data (end position keyword and position, end disk file data) of position, internal storage data queue end are taken out and are moved
Remove, if position, end disk file data carried out renewal, the most first the data of position, end are updated to original
Disk file removes it again.So can ensure that the total length of internal storage data queue is constant, magnetic
The real-time of dish file data, and disk file is consistent with internal storage data queue.
Step 509: when the update cycle arrives, it is right to update in disk according to current memory data queue
The binary file answered.
Step 509 is referred to the description of embodiment 2, does not repeats them here.
In the present embodiment, it is possible not only to ensure that the length of internal storage data queue is constant, and can be by
The target disk file data of new write-once moves the first place to internal storage data queue, so that
What the target disk file data of reading can be the fastest recently writes from internal storage data queue, and,
According to the default update cycle, binary file can also be updated, it is ensured that binary system literary composition
The real-time of part.
For aforesaid each method embodiment, in order to be briefly described, therefore it is all expressed as a series of
Combination of actions, but those skilled in the art should know, the application is not by described dynamic
The restriction of work order, because according to the application, some step can use other orders or simultaneously
Carry out.Secondly, those skilled in the art also should know, embodiment described in this description is equal
Belong to preferred embodiment, necessary to involved action and module not necessarily the application.
The method that the reading/writing method embodiment 1 of disk file a kind of with above-mentioned the application is provided is relative
Should, see Fig. 6, present invention also provides the read-write equipment embodiment 1 of a kind of disk file, at this
In embodiment, this device may include that the read-write cell 61 of pretreatment unit 60 and disk file,
Wherein, described pretreatment unit 60 may include that
Parsing module 601, for when starting a certain computer software first, by soft for described computer
Part is starting and disk file required in running solves according to corresponding disk file form
Analysis.
Setting up Queue module 602, the disk file after resolving reads in internal memory to be set up and institute
State the internal storage data queue that disk file is corresponding；Described internal storage data queue is preserved one to one
Keyword and disk file data.
Memory module 603, for saving as described internal storage data queue with described computer software only
The binary file of one correspondence stores to disk.
The read-write cell 61 of described disk file may include that
Acquisition module 611, for when follow-up startup current computer software, obtains institute from disk
State the current binary file that current computer software is uniquely corresponding.
Load-on module 612, current for described current binary file being loaded onto in internal memory to generate
Internal storage data queue.
Read module 613, for the keyword to be read and write according to described current computer software, from institute
State the target disk file data that in current memory data queue, reading is corresponding with described keyword.
With reference to shown in Fig. 7, Fig. 7 is the structured flowchart of described read module 606, described read module
606 specifically may include that
First judges submodule 701, is used for judging whether exist with described in described internal storage data queue
The target disk file data that keyword to be read and write is corresponding；
First reading submodule 702, for judging, described first, the situation that the result of submodule is yes
Under, directly read described target disk file data；
Obtain submodule 703, in the case of judging that the result of submodule is no described first,
Obtain the target disk file corresponding with described keyword；
Analyzing sub-module 704, for the form according to described target disk file to described target disk
File resolves；
Second reading submodule 705, resolves, for reading, the target magnetic that described target disk file obtains
Dish file data；
First adds submodule 706, for described keyword and target disk file data being added extremely
In described internal storage data queue.
Writing module 607, for the keyword to be read and write according to described current computer software, by institute
State target disk file data corresponding to keyword to write in described current memory data queue.
With reference to shown in Fig. 8, Fig. 8 is the structured flowchart of said write module 607, said write module
607 specifically may include that
Second judges submodule 801, is used for judging whether exist with described in described internal storage data queue
The target disk file data that keyword to be read and write is corresponding；
Update submodule 802, in the case of judging that described second the result of submodule is, directly
Connect the described target disk file data of renewal；
Intron module 803, in the case of judging that the result of submodule is no described second,
The target disk file data of described keyword and correspondence is inserted in described internal storage data queue.
Use the embodiment of the present application, first by disk file by corresponding analytic method, by disk file
In digital independent to the internal storage data team of internal memory the frame mode setting up (key-value)
Row, it is also possible to adjust the order of internal storage data queue according to preset rules, and by internal storage data queue
Save as the binary file corresponding with computer software, upper once start computer software time,
Need to copy the data of binary file to internal memory directly generates internal storage data queue, now count
Calculation machine software, when needs read-write disk file, is directly read from internal storage data queue by the application
Write, it is no longer necessary to be required for after starting computer software each time in read-write disk file
Time disk file is resolved.Visible the application passes through binary file as disk file
L2 cache, i.e. improves the speed of computer software read-write disk file, improves computer soft
The efficiency of part read-write disk file.
Further, can be according to the use frequency of computer software due to the data in binary file
Generating, the disk file that so most computer softwares use can directly read, pole
The big speed that must accelerate computer software reading disk file.
The method that the reading/writing method embodiment 2 of disk file a kind of with above-mentioned the application is provided is relative
Should, see Fig. 9, present invention also provides the read-write equipment embodiment 2 of a kind of disk file, this reality
Execute the read-write cell 61 of the pretreatment unit 60 included by device disclosed in example and disk file, at this
In embodiment, the read-write cell 61 of disk file may include that
Acquisition module 604, for when follow-up startup current computer software, obtains institute from disk
State the current binary file that current computer software is uniquely corresponding.
Load-on module 605, current for described current binary file being loaded onto in internal memory to generate
Internal storage data queue.
Read module 606, for the keyword to be read and write according to described current computer software, from institute
State the target disk file data that in current memory data queue, reading is corresponding with described keyword.
Wherein, described read module 606 specifically may include that
First judges submodule 701, is used for judging whether exist with described in described internal storage data queue
The target disk file data that keyword to be read and write is corresponding；
First reading submodule 702, for judging, described first, the situation that the result of submodule is yes
Under, directly read described target disk file data；
Obtain submodule 703, in the case of judging that the result of submodule is no described first,
Obtain the target disk file corresponding with described keyword；
Analyzing sub-module 704, for the form according to described target disk file to described target disk
File resolves；
Second reading submodule 705, resolves, for reading, the target magnetic that described target disk file obtains
Dish file data；
First adds submodule 706, described keyword and target disk file data is inserted into described
The first place of internal storage data queue.
First mover module 901, for described keyword and target disk file data are moved to
The first place of described internal storage data queue；
Second judges submodule 902, for judge last position keyword in described internal storage data queue and
Marker bit corresponding to end position disk file data indicates whether described end position keyword and position, end disk literary composition
Number of packages is according to being updated；
First updates submodule 903, for judging, described second, the situation that the result of submodule is yes
Under, position, described end disk file data are updated in original disk file；
First removes submodule 904, for judging, described second, the situation that the result of submodule is no
Under, or, after described first updates submodule triggering, by described internal storage data queue
End position keyword and position, end disk file data remove；
Sub module stored 905, for depositing position, described end disk file data to disk.
Described device can also include:
Updating block 906, for when the update cycle arrives, updates according to current memory data queue
Binary file corresponding in disk.
In the present embodiment, it is possible not only to ensure that the length of internal storage data queue is constant, and can be by up-to-date
The target disk file data once read moves the first place to internal storage data queue, so that
What closely the target disk file data of reading can be the fastest reads from internal storage data queue, and,
According to the default update cycle, binary file can also be updated, it is ensured that binary system literary composition
The real-time of part.
The method that the reading/writing method embodiment 3 of disk file a kind of with above-mentioned the application is provided is relative
Should, see Figure 10, present invention also provides the read-write equipment embodiment 3 of a kind of disk file, this
Pretreatment unit 60 included by device disclosed in embodiment and the read-write cell 61 of disk file,
In the present embodiment, the read-write cell 61 of disk file may include that
Acquisition module 604, for when follow-up startup current computer software, obtains institute from disk
State the current binary file that current computer software is uniquely corresponding.
Load-on module 605, current for described current binary file being loaded onto in internal memory to generate
Internal storage data queue.
Writing module 607, for the keyword to be read and write according to described current computer software, by institute
State target disk file data corresponding to keyword to write in described current memory data queue.
Said write module 607 specifically may include that
Second judges submodule 801, is used for judging whether exist with described in described internal storage data queue
The target disk file data that keyword to be read and write is corresponding；
Update submodule 802, in the case of judging that described second the result of submodule is, directly
Connect the described target disk file data of renewal；
Described intron module 803, specifically for: by the target disk literary composition of described keyword and correspondence
Number of packages is according to the first place being inserted into described internal storage data queue.
Second mover module 1001, for by described keyword and corresponding target disk number of files
According to the mobile first place to described internal storage data queue；
4th judges submodule 1002, for judging the last position keyword in described internal storage data queue
The marker bit corresponding with position, end disk file data indicates whether described end position keyword and position, end disk
File data is updated；
3rd updates submodule 1003, for judging, the described 4th, the feelings that the result of submodule is yes
Under condition, position, described end disk file data are updated in original disk file；
Second removes submodule 1004, for judging, the described 4th, the feelings that the result of submodule is no
Under condition, or trigger the described 3rd and update after submodule, by the end in described internal storage data queue
Position keyword and position, end disk file data remove；
Described device can also include:
Updating block 906, for when the update cycle arrives, updates according to current memory data queue
Binary file corresponding in disk.
In the present embodiment, it is possible not only to ensure that the length of internal storage data queue is constant, and can be by up-to-date
The target disk file data of write-once moves the first place to internal storage data queue, so that
What closely the target disk file data of reading can be the fastest writes from internal storage data queue, and,
According to the default update cycle, binary file can also be updated, it is ensured that binary system literary composition
The real-time of part.
It should be noted that each embodiment in this specification all uses the mode gone forward one by one to describe,
What each embodiment stressed is the difference with other embodiments, between each embodiment
Identical similar part sees mutually.For device class embodiment, due to itself and method
Embodiment basic simlarity, so describe is fairly simple, relevant part sees the portion of embodiment of the method
Defend oneself bright.
Finally, in addition it is also necessary to explanation, in this article, the relation of such as first and second or the like
Term is used merely to separate an entity or operation with another entity or operating space, and not
Necessarily require or imply and there is the relation of any this reality or suitable between these entities or operation
Sequence.And, term " includes ", " comprising " or its any other variant are intended to non-exclusive
Comprising, so that include the process of a series of key element, method, article or equipment not only of property
Including those key elements, but also include other key elements being not expressly set out, or also include for
The key element that this process, method, article or equipment are intrinsic.In the situation not having more restriction
Under, statement " including ... " key element limited, it is not excluded that including described key element
Process, method, article or equipment there is also other identical element.
Reading/writing method and device to a kind of disk file provided herein have been carried out in detail above
Introducing, principle and the embodiment of the application are set forth by specific case used herein,
The explanation of above example is only intended to help and understands the present processes and core concept thereof；Meanwhile,
For one of ordinary skill in the art, according to the thought of the application, in detailed description of the invention and should
All will change with in scope, in sum, this specification content should not be construed as this Shen
Restriction please.
Claims (12)
1. the reading/writing method of a disk file, it is characterised in that the method includes preprocessing process
With the read-write process of disk file, wherein,
Described preprocessing process includes:
When starting a certain computer software, described computer software is being started and institute in running
The disk file needed resolves according to corresponding disk file form, and the disk literary composition after resolving
Part reads the internal storage data queue that in internal memory, foundation is corresponding with described disk file, by described internal memory
Data queue saves as the binary file the most corresponding with described computer software and stores to disk
In；Described internal storage data queue preserve keyword and with described keyword disk one to one literary composition
Number of packages evidence；
The read-write process of described disk file includes:
When follow-up startup current computer software, from disk, obtain described current computer software only
The current binary file of one correspondence；
It is loaded onto described current binary file in internal memory to generate current memory data queue；
According to the keyword that described current computer software is to be read and write, from described current memory data queue
The target disk file data that middle reading is corresponding with described keyword, or, by described keyword pair
The target disk file data answered writes in described current memory data queue.
Method the most according to claim 1, it is characterised in that described according to described current meter
The keyword that calculation machine software is to be read and write, reads and described key from described current memory data queue
The target disk file data that word is corresponding, including:
Judge whether described internal storage data queue exists the mesh corresponding with described keyword to be read and write
Mark disk file data, if it is, directly read described target disk file data；
If it is not, then obtain the target disk file corresponding with described keyword, according to described target magnetic
Described target disk file is resolved by the form of dish file, and reads the described target disk of parsing
The target disk file data that file obtains, and described keyword and target disk file data are added
Add in described internal storage data queue.
Method the most according to claim 2, it is characterised in that described in described directly reading
After target disk file data, also include: described keyword is moved with target disk file data
Move the first place to described internal storage data queue；
Accordingly, described described keyword and target disk file data are added to described internal storage data
Particularly as follows: described keyword and target disk file data are inserted into described internal storage data in queue
The first place of queue；
And, described, described keyword and target disk file data are inserted into described internal storage data
After the first place of queue, also include:
Judge that the last position keyword in described internal storage data queue is corresponding with position, end disk file data
Marker bit indicates whether that described end position keyword and position, end disk file data are updated, if it does not,
Then remove described end position keyword and position, end disk file data, if it is, by position, described end magnetic
Dish file data is updated in original disk file remove described end position keyword and position, end disk literary composition again
Number of packages evidence.
Method the most according to claim 1, it is characterised in that described according to described current meter
The keyword that calculation machine software is to be read and write, by target disk file data write corresponding for described keyword
In described current memory data queue, including:
Judge whether described internal storage data queue exists the mesh corresponding with described keyword to be read and write
Mark disk file data, if it is, directly update described target disk file data；
If it is not, then the target disk file data of described keyword and correspondence is inserted into described internal memory
In data queue.
Method the most according to claim 4, it is characterised in that the described described mesh of direct renewal
After mark disk file data, also include: by described keyword and corresponding target disk number of files
According to the mobile first place to described internal storage data queue；
Accordingly, described the target disk file data of described keyword and correspondence is inserted into described in
In deposit data queue, particularly as follows: the target disk file data of described keyword and correspondence is inserted
First place to described internal storage data queue；
And, described the target disk file data of described keyword and correspondence is inserted into described in
After the first place of deposit data queue, also include:
Judge that the last position keyword in described internal storage data queue is corresponding with position, end disk file data
Marker bit indicates whether that described end position keyword and position, end disk file data are updated, if it does not,
Then the last position keyword in described internal storage data queue and position, end disk file data are removed, if
It is then to be updated in original disk file remove position, described end again by position, described end disk file data
Keyword and position, end disk file data.
6. according to the method described in any one of Claims 1 to 5, it is characterised in that also include:
When the update cycle arrives, update binary system corresponding in disk according to current memory data queue
File.
7. the read-write equipment of a disk file, it is characterised in that this device includes: pretreatment list
Unit and the read-write cell of disk file, wherein,
Described pretreatment unit includes:
Parsing module, for when starting a certain computer software, is starting described computer software
Resolve according to corresponding disk file form with disk file required in running；
Setting up Queue module, the disk file after resolving reads in internal memory to be set up and described magnetic
The internal storage data queue that dish file is corresponding；Described internal storage data queue preserves keyword and with described
Keyword disk file data one to one；
Memory module is the most right with described computer software for described internal storage data queue being saved as
The binary file answered stores to disk；
The read-write cell of described disk file includes:
Acquisition module, for when follow-up startup current computer software, obtains described working as from disk
The current binary file that front computer software is uniquely corresponding；
Load-on module, for being loaded onto in internal memory to generate current memory by described current binary file
Data queue；
Read module, for the keyword to be read and write according to described current computer software, works as from described
Front internal storage data queue is read the target disk file data corresponding with described keyword；
Writing module, for the keyword to be read and write according to described current computer software, by described pass
The target disk file data that key word is corresponding writes in described current memory data queue.
Device the most according to claim 7, it is characterised in that described read module includes:
Whether first judges submodule, be used for judging to exist in described internal storage data queue to continue with described
The target disk file data that the keyword write is corresponding；
First reading submodule, in the case of judging that the result of submodule is as being described first,
Directly read described target disk file data；
Obtain submodule, in the case of judging that the result of submodule is no described first, acquisition
The target disk file corresponding with described keyword；
Analyzing sub-module, for the form according to described target disk file to described target disk file
Resolve；
Second reading submodule, resolves, for reading, the target disk literary composition that described target disk file obtains
Number of packages evidence；
First adds submodule, for adding described keyword and target disk file data to described
In internal storage data queue.
Device the most according to claim 8, it is characterised in that described read module also includes:
First mover module, for moving described keyword to described with target disk file data
The first place of internal storage data queue；
Second judges submodule, for judging the last position keyword in described internal storage data queue and position, end
Marker bit corresponding to disk file data indicates whether described end position keyword and position, end disk file number
According to being updated；
First updates submodule, in the case of judging that the result of submodule is as being described second,
Position, described end disk file data are updated in original disk file；
First removes submodule, in the case of judging that the result of submodule is no described second,
Or, after described first updates submodule triggering, by the last position in described internal storage data queue
Keyword and position, end disk file data remove；
Described first adds submodule, specifically for: by described keyword and target disk file data
It is inserted into the first place of described internal storage data queue.
Device the most according to claim 7, it is characterised in that said write module includes:
Whether the 3rd judges submodule, be used for judging to exist in described internal storage data queue to continue with described
The target disk file data that the keyword write is corresponding；
Second updates submodule, in the case of judging that the described 3rd the result of submodule is, directly
Connect the described target disk file data of renewal；
Intron module, in the case of judging that the result of submodule is no the described 3rd, by institute
The target disk file data stating keyword and correspondence is inserted in described internal storage data queue.
11. devices according to claim 10, it is characterised in that said write module is also wrapped
Include:
Second mover module, for moving described keyword with corresponding target disk file data
First place to described internal storage data queue；
4th judges submodule, for judging the last position keyword in described internal storage data queue and position, end
Marker bit corresponding to disk file data indicates whether described end position keyword and position, end disk file number
According to being updated；
3rd updates submodule, in the case of judging that the result of submodule is as being the described 4th,
Position, described end disk file data are updated in original disk file；
Second removes submodule, in the case of judging that the result of submodule is no the described 4th,
Or it is after triggering described 3rd renewal submodule, the last position in described internal storage data queue is crucial
Word and position, end disk file data remove；
Described intron module, specifically for: by the target disk number of files of described keyword and correspondence
According to the first place being inserted into described internal storage data queue.
12. according to the device described in any one of claim 7～10, it is characterised in that also include:
Updating block, for when the update cycle arrives, updates disk according to current memory data queue
The binary file of middle correspondence.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210436250.0A CN103809915B (en) | 2012-11-05 | 2012-11-05 | The reading/writing method of a kind of disk file and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210436250.0A CN103809915B (en) | 2012-11-05 | 2012-11-05 | The reading/writing method of a kind of disk file and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103809915A CN103809915A (en) | 2014-05-21 |
| CN103809915B true CN103809915B (en) | 2016-12-21 |
Family
ID=50706762
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210436250.0A Active CN103809915B (en) | 2012-11-05 | 2012-11-05 | The reading/writing method of a kind of disk file and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103809915B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106886471A (en) * | 2017-02-22 | 2017-06-23 | 郑州云海信息技术有限公司 | A kind of read-write fault detection method and system based on disk in linux |
| CN107491526A (en) * | 2017-08-18 | 2017-12-19 | 国云科技股份有限公司 | A kind of system and method for Achieve Database Synchronization |
| CN111831691B (en) * | 2019-05-29 | 2024-05-03 | 北京嘀嘀无限科技发展有限公司 | Data reading and writing method and device, electronic equipment and storage medium |
| CN111045604B (en) * | 2019-12-11 | 2022-11-01 | 苏州浪潮智能科技有限公司 | Small file read-write acceleration method and device based on NVRAM |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101329685A (en) * | 2008-07-30 | 2008-12-24 | 烽火通信科技股份有限公司 | Implementing method of memory database on household gateway |
| CN101510838A (en) * | 2009-02-26 | 2009-08-19 | 北京北纬点易信息技术有限公司 | Method for implementing perdurable data queue |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7457831B2 (en) * | 2003-03-31 | 2008-11-25 | Microsoft Corporation | Peripheral device driver maintenance scheme for networked peripheral device clients |
-
2012
- 2012-11-05 CN CN201210436250.0A patent/CN103809915B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101329685A (en) * | 2008-07-30 | 2008-12-24 | 烽火通信科技股份有限公司 | Implementing method of memory database on household gateway |
| CN101510838A (en) * | 2009-02-26 | 2009-08-19 | 北京北纬点易信息技术有限公司 | Method for implementing perdurable data queue |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103809915A (en) | 2014-05-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108536761B (en) | Report data query method and server | |
| US10180992B2 (en) | Atomic updating of graph database index structures | |
| US9477786B2 (en) | System for metadata management | |
| CN110647579A (en) | Data synchronization method and device, computer equipment and readable medium | |
| CN102129425B (en) | The access method of big object set table and device in data warehouse | |
| CN109074383B (en) | Document search with visualization within the context of a document | |
| CN112036736A (en) | Workflow creating method and device | |
| CN111324610A (en) | Data synchronization method and device | |
| CN103678494A (en) | Method and device for client side and server side data synchronization | |
| US20170255708A1 (en) | Index structures for graph databases | |
| CN111651519B (en) | Data synchronization method, data synchronization device, electronic equipment and storage medium | |
| CN103809915B (en) | The reading/writing method of a kind of disk file and device | |
| CN112182004B (en) | Method, device, computer equipment and storage medium for checking data in real time | |
| Vajk et al. | Automatic NoSQL schema development: A case study | |
| CN103235811A (en) | Data storage method and device | |
| CN110110072A (en) | A kind of method, system, terminal and storage medium generating interactive electronic handbook | |
| CN107391528B (en) | Front-end component dependent information searching method and equipment | |
| CN114556317A (en) | Document tracking through version hash link graphs | |
| US10635672B2 (en) | Method and system for merging data | |
| CN113962597A (en) | Data analysis method and device, electronic equipment and storage medium | |
| CN104866508B (en) | The method and apparatus of file is managed under cloud environment | |
| US20120310893A1 (en) | Systems and methods for manipulating and archiving web content | |
| US9286349B2 (en) | Dynamic search system | |
| EP3306492A1 (en) | Rdb system | |
| JP2018109898A (en) | Data migration system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |