CN101714391B - Data storage method and device - Google Patents
Data storage method and device Download PDFInfo
- Publication number
- CN101714391B CN101714391B CN2009102378540A CN200910237854A CN101714391B CN 101714391 B CN101714391 B CN 101714391B CN 2009102378540 A CN2009102378540 A CN 2009102378540A CN 200910237854 A CN200910237854 A CN 200910237854A CN 101714391 B CN101714391 B CN 101714391B
- Authority
- CN
- China
- Prior art keywords
- storage area
- information
- packet
- stored
- 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
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a data storage method and device. The method comprises the following steps: receiving a data pack which is needed to be stored and transmitted from a data channel, judging whether enough residual space for storing the data pack to be stored is in a storage area corresponding to the data channel; if so, determining the storage information of the data pack, storing the data pack in the storage place of the storage area according to the indication of the storage information; if not, determining the number of data packs needed to deleted according to preset conditions, deleting the same number of data packs with earliest storage time in the storage area, and then executing the judgment operation. The data storage method and device can not generate fragment during the data storage process and increase the stability and efficiency of the data storage.
Description
Technical field
The present invention relates to data processing field, more particularly, relate to a kind of date storage method and device.
Background technology
When existing video recording system is stored data, the shared same storage area of a plurality of recording channels.Described storage area is realized by physical disk or disk array, the packet that receives is carried out sequential storage.When specifically carrying out the storage of each recording channel corresponding data bag, according to the time of each recording channel request storage packet, the packet with a plurality of recording channels is stored in described storage area successively.
Because the position of the pairing data of each recording channel in storage area is also discontinuous, therefore, when deleting the data of a certain recording channel, will produce fragment in storage area.Especially have a plurality of recording channels, carried out repeatedly data deletion after, the number of tiles that forms in the storage area will be very huge.And when storage area sequential storage packet to the end the time, just need the packet that storage newly receives in the described fragment that deletion is before produced again, because the size of each packet is unfixing, therefore, can occur covering fragment, or the situation of a certain packet of a plurality of fragment stored in association.And the generation of above-mentioned situation will have a strong impact on the stability and the storage efficiency of data storage.For example, suppose that the newly-generated packet of certain recording channel is less, and current fragment can data quantity stored greater than the size of this packet, the packet that this is less is stored in this fragment position, then fragment still exists; Perhaps, newly-generated packet is bigger, and current fragment can data quantity stored less than the size of this packet, then need to use at least two fragments that comprise this fragment to store this packet.
There is such shortcoming in therefore existing video recording system data storing method: owing to the generation of fragment described in the storage area, had a strong impact on the stability and the storage efficiency of data storage.
Summary of the invention
In view of this, the invention provides a kind of date storage method and device, can improve data storage stability and storage efficiency.
The embodiment of the invention provides a kind of date storage method, may further comprise the steps:
The packet to be stored that reception comes by the data channel transmission;
Judge whether this data channel corresponding storage territory exists enough remaining spaces to store described packet to be stored;
If, determine the canned data of described packet to be stored, described packet to be stored is stored in the memory location of canned data indication in the described storage area;
Otherwise, according to default deletion condition, determine the data packet number of required deletion, from described storage area, delete the most forward described number of data bag storage time, afterwards, carry out described decision operation.
Wherein, described canned data comprises: index information and temporal information, wherein, described index information is used for the absolute position that identification data wraps in described storage area.
Described packet to be stored is stored in after the memory location of canned data indication in the described storage area, also comprises:
Upgrade the first storage area information or the second storage area information of described storage area correspondence; The information of the storage area when the bigger storage area information of serial number is used to write down described packet to be stored and has stored in the described first storage area information after the renewal and the second storage area information, the information of the storage area that the less storage area information of serial number is used to write down described packet to be stored when not storing.
After the described deletion storage time the most forward described number of data bag, also comprise:
Upgrade the first storage area information or the second storage area information of described storage area correspondence; The bigger storage area information of serial number is used for the information of the storage area after the record data bag deletion in the described first storage area information after the renewal and the second storage area information, the information of the storage area that the less storage area information of serial number is used for the record data bag when not deleting.
The storage area of described data channel correspondence comprises: information storage area and packet memory block;
Accordingly, describedly judge whether this data channel corresponding storage territory exists enough remaining spaces to store described packet to be stored and be specially:
Judge whether information storage area exists enough remaining spaces to store the information of described packet to be stored, and, judge whether described packet memory block exists enough remaining spaces to store described packet to be stored.
Described information storage area comprises:
The index information district is used to preserve the index information of each packet that described storage area stores;
The temporal information district is used to preserve the temporal information of each packet that described storage area stores, and the time period information of all packets of storing of storage area;
The storage area block of information is used to store the described first storage area information and the second storage area information.
The described canned data of judging whether information storage area exists enough remaining spaces to store described packet to be stored is specially:
Judge whether the remaining space in index information district enough stores the index information of packet to be stored; And, the temporal information whether remaining space of judgement time block of information enough stores packet to be stored.
The default deletion condition of described basis determines that the data packet number of required deletion is specially:
Determine that temporal information in the storage area is positioned at first quantity of the packet of Preset Time section, with described first quantity and default second quantity relatively, select the data packet number of the little described quantity of numerical value as required deletion;
Wherein, the start time of the most forward temporal information is identical in the start time of described Preset Time section and the storage area.
The embodiment of the invention also provides a kind of data storage device, comprising:
Receiving element is used to receive the packet to be stored that the data channel transmission comes;
Judging unit is used to judge whether this data channel corresponding storage territory exists enough remaining spaces to store the packet to be stored that described receiving element receives;
Storage unit, the judged result that is used for judging unit are determined the canned data of described packet to be stored when being, described packet to be stored are stored in the memory location of canned data indication in the described storage area;
Delete cells, the judged result that is used for judging unit according to default deletion condition, are determined the data packet number of required deletion for not the time, from described storage area deletion storage time the most forward described number of data bag.
Wherein, also comprise: updating block, upgrade the first storage area information or the second storage area information of described storage area correspondence.
From above-mentioned technical scheme as can be seen, in the embodiment of the present application, the packet of each data channel is stored in the storage area of this data channel correspondence successively, be linear distribution, write fashionablely once more, the most forward packet of time in the deletion corresponding stored zone is stored new packet more successively.Circulation storage like this no matter how the packet size changes, can not produce fragment, thereby make that the storage of packet is more stable, and improve data storage efficiency.
The first storage area information in the storage area block of information and the second storage area information are used to store the storage area information after packet to be stored writes preceding storage area information and packet to be stored storage in addition, like this when system when submitting data to if break down, have the information of a complete newer storage area at least, thereby can recover the data of storage area effectively.
Description of drawings
In order to be illustrated more clearly in the embodiment of the invention or technical scheme of the prior art, the accompanying drawing of required use is done to introduce simply in will describing embodiment below, apparently, accompanying drawing in describing below only is some embodiments of the present invention, for those of ordinary skills, under the prerequisite of not paying creative work, can also obtain other accompanying drawing according to these accompanying drawings.
The structural drawing of a kind of storage area of Fig. 1 embodiment of the invention;
The structural drawing of the another kind of storage area of Fig. 2 embodiment of the invention;
A kind of date storage method process flow diagram that Fig. 3 embodiment of the invention provides;
The another kind of date storage method process flow diagram that Fig. 4 embodiment of the invention provides;
The structural drawing of a kind of data storage device that Fig. 5 embodiment of the invention provides;
The concrete structure figure of judging unit in Fig. 6 embodiment of the invention data storage device.
Embodiment
When having the data storage of many recording channels now, the data of each passage of being stored are disperseed, and when the operation of a certain channel data is deleted in follow-up execution, can produce fragment on storage area, behind the video recording system long-play, the number of tiles of generation also will constantly increase thereupon.In case and the storage space in the storage area is taken, and when need using the packet that each recording channel of described fragment store produces, the storage stability and the storage efficiency of data will be had a strong impact on.
Therefore, the embodiment of the invention provides a solution, and its basic thought is: divide a storage area for different recording channels, each recording channel is in the circulation storage of the enterprising line data of storage area of correspondence.
After disk formatting, set up the storage area of a correspondence for each recording channel, a storage area can be a disk partition or several disk partition.A kind of structure of storage area as shown in Figure 1, it comprises information storage area and packet memory block, information storage area is at the head of storage area.
Information storage area can comprise: fix information piece, storage area block of information, canned data district and packet memory block.The fix information piece comprises the total length of storage area, the fix information piece takies length, the temporal information district takies length, the index information district takies length, the time period maximum permissible value, can allow maximum time cavity/overlapping in the single time period between the packet, the Slice of packet inside allows maximum time difference, the suggestion packet mean size value of appointment during format, the average Slice number of each packet of appointment during format, fix information block message sign length, fixed block identification information and fix information block check and wait a read message, these information write when formaing.The first storage area information and the second storage area information are stored in the storage area block of information, the first storage area information and the second storage area information are respectively applied for the information of the storage area before and after the record packet storage to be stored, as shown in Figure 1, can divide different memory locations with the second storage area information for the first storage area information, correspondence is stored, but do not limit here, as long as stored in the storage area block of information after upgrading before and after the packet storage to be stored, two kinds of storage area information of storage area correspondence get final product.The canned data district comprises index information district and temporal information district, and the index information district is used to preserve the index information of all packets of storage area storage; The temporal information district is used to preserve the temporal information of all packets of storage area storage, and the time period information of all packets of storage, and time period information is meant the time that all packets begin and the time of end.The packet memory block is used for storing packet.
In addition, memory area configuration can also be other form, and perhaps, described information storage area can also be positioned at the afterbody of described storage area, as shown in Figure 2.
Understand technical scheme of the present invention for those skilled in the art can be known, technical scheme of the present invention is described in detail below in conjunction with drawings and Examples.
See also Fig. 3, the process flow diagram of a kind of date storage method that provides for the embodiment of the invention.As shown in Figure 3, comprising:
Step S310: receive the packet to be stored that comes by the data channel transmission.
Wherein, described data channel can be described recording channel in video recording system.Described quantity of data packets to be stored does not limit, and it also can be a plurality of can being one.
Step S320: judge whether this data channel corresponding storage territory has enough remaining spaces to store packet to be stored, if, execution in step S330; Otherwise execution in step S340.
Wherein, storage area distributes for each data channel is corresponding in the present invention.
Step S330: determine the canned data of packet to be stored, described packet to be stored is stored in the memory location of canned data indication in the described storage area.
Step S340: according to default deletion condition, determine the data packet number of required deletion, from described storage area, delete the most forward described number of data bag storage time, return step S320.
In the embodiment of the invention shown in Figure 3, the packet of each data channel is stored in the corresponding storage area successively, be linear distribution, to write fashionablely once more, forward packet of date in the deletion corresponding stored zone is stored new packet more successively.Circulation storage like this no matter how the packet size changes, can not produce fragment, thereby make that the storage of packet is more stable, and improve data storage efficiency.
See also Fig. 4, the process flow diagram of the another kind of date storage method that provides for the embodiment of the invention.As shown in Figure 4, comprising:
Step S410: receive the packet to be stored that comes by the data channel transmission.
Step S420: judge whether this data channel corresponding storage territory has enough remaining spaces to store packet to be stored, if, execution in step S430; Otherwise execution in step S440.
With storage area division methods illustrated in figures 1 and 2, the realization of this step can for:
Judge whether described packet memory block exists enough remaining spaces to store described packet to be stored, and, judge whether the remaining space in index information district enough stores the index information of packet to be stored, and, the temporal information whether remaining space of judgement time block of information enough stores packet to be stored is when the judged result of above-mentioned three judgements is when being execution in step S430, otherwise, execution in step S440.
More than the execution sequence of three determining steps can change, do not limit here, as long as one of them judged result judges then that for not there are not enough remaining spaces in storage area, carry out the deletion step of subsequent step S440.Opposite then illustrate that there are enough remaining spaces in storage area, the storing step of execution in step S430.
Step S430: determine the information of packet to be stored, store packet to be stored into the memory location that canned data is indicated in the described storage area, execution in step S460.
The canned data here can comprise: index information and temporal information.Wherein, index information, be used for the absolute position that identification data wraps in described storage area, also be that index information indicates subregion and the position in this subregion that described packets need to be stored stores into, when thereby packet to be stored is stored, can carry out data from this position and write, packet to be stored is stored in the storage area; Temporal information can be the storage time of packet correspondence, perhaps, when the data in the described packet are the video recording data, also can be the video recording initial time and the video recording duration of described video recording data.
Step S440: according to default deletion condition, need to determine the data packet number of deletion, from storage area, delete the packet of the most forward somes storage time, execution in step S450.
In the present embodiment, default deletion condition can independently be provided with according to actual application environment, for example:
The deletion condition is set is: default time period, the start time of this time period is identical with the start time of the most forward temporal information, and what guarantee deletion is the most historical packet, deletes the packet in this time period.As this time period can be the most forward 1 minute, then delete the packet in this most forward 1 minute.
Perhaps, the deletion condition being set is: preset a fixed qty, delete a described fixed qty packet from storage area, wherein, deleted packet is the most forward packet of temporal information.
Perhaps, the deletion condition is set is: a default time period and a fixed qty, the start time of the most forward temporal information is always identical in the start time of described Preset Time section and the current storage area, the size of numerical value is selected the quantity of less numerical value as the needs deletion between data packet number in the comparison Preset Time section and the default fixed qty.For example fixed qty is set to 72, and the historical time section is 1 minute, if the packet in 1 minute is then deleted 52 packets when being 52, returns step S420 again and judges; If when the packet in 1 minute is 92, then delete 72 packets, return step S420 again and judge.
Step S450: the corresponding first storage area information or the second storage area information in updated stored zone, return step S420.
Wherein, the bigger storage area information of serial number is used for the information of the storage area after the record data bag deletion in the described first storage area information after the renewal and the second storage area information, the information of the storage area that the less storage area information of serial number is used for the record data bag when not deleting.
Before upgrading, a less information of serial number in the first storage area information and the second storage area information for the storage area after the previous packet of record (stored packet before the deletion action) storage; The less record of serial number is the information of the storage area of previous packet when not storing in the first storage area information and the second storage area information, in this step, when the updated stored area information, select wherein a less storage area information of serial number to upgrade, be used for the information of the storage area after the deletion of record data bag.
This step is returned step S420 determining step after carrying out, if the storage area remaining space is not still enough stored packet to be stored, then continues step S440 deletion step, and the deleted data bag is enough stored packet to be stored until remaining space.
Step S460: the corresponding first storage area information or the second storage area information in updated stored zone.
Before upgrading, the information (information of the storage area after the packet storage before the also current packet to be stored) of the storage area when serial number bigger is not stored for the described packet to be stored of record in the first storage area information and the second storage area information is designated as the storage area information A; The less record of serial number is the information of packet before the current packet to be stored storage area when not storing in the first storage area information and the second storage area information, in this step, when the updated stored area information, select a less storage area information of serial number wherein upgrade (serial number less for before older information area, upgrade its serial number of back and become maximum, be up-to-date information), be used to write down the information of the storage area after described current packet to be stored is stored, be designated as storage area information B.And, when upgrading, need serial number+2 of the selected storage area information of upgrading, thereby make that the serial number in the first storage area information and the second storage area information always differs 1.
The structure of storage area information A and storage area information B is identical, can comprise: serial number, the circle queue lower label that the temporal information district is first, temporal information district index item number, the circle queue lower label that the index information district is first, the sequence number of first packet, the packet total amount, the packet starting position, the size of maximum data packet (statistical value), the data packet number that very first time section is deleted (only being used to revise first time period information), the byte total length of the packet that the very first time is deleted, the total length of time of the packet that the very first time is deleted and storing data information verification and etc. storage area information, serial number is identifying the number of times that packet writes.
Updated stored area information B is specially: the currency of determining each field respectively, for example, the serial number that serial number equals the storage area information A adds 1, determine the circle queue lower label in first in temporal information district, determine temporal information district index item number, determine the circle queue lower label in first in index information district, determine the sequence number of first packet, specified data bag total amount, specified data is unwrapped the beginning position, determine the size (statistical value) of maximum data packet, determine the data packet number that very first time section is deleted, determine the byte total length of the packet that the very first time is deleted, determine the total length of time of the packet that the very first time is deleted and definite storing data information verification and.
Instantiation as, when storing the 12nd to the 20th packet, suppose to store in the storage area information A be all packets of the 11st packet and storage before thereof the time storage area information, what store among the storage area information B is the storage area information of the 11st packet when not storing, then, to select storage area information B to upgrade in this step, make to upgrade store among the storage area information B of back be all packets of the 20th packet and storage before thereof the time storage area information; Also promptly, this storage only needs the information among the updated stored area information B.Afterwards, when storage was as the 21st to 30 packets again, then the information among the updated stored area information A also was that storage area information A and the always every submission of storage area information B once exchange the position one time, so circulation.
After step S460 finished, the flow process of this data storage finished, and begins data storage next time.
The embodiment of the invention is stored in the corresponding storage area by the packet of each recording channel, the packet of being stored is stored successively, be linear distribution, the data of each passage are unrelated like this, when the memory space inadequate of storage area, delete forward packet storage time, new packet is stored in the space after deletion more successively.Packet circulation storage like this, the data of new storage are linear distribution still, does not have blank fragment between each packet, can not produce fragment.
First, second storage area information in the storage area block of information is stored the information of new data packets storage front and back storage area respectively in addition, is similar to the mutually redundant relation that is equal to.And store after the data and behind the deleted data at every turn and all upgrade, guarantee that the first storage area information and the second storage area information have always write down current up-to-date storage area information and newer storage area information thereof respectively, work as the system failure like this, because synchronization, just one of them storage area information may be in the rewriting state, having guaranteed that another storage area information is always complete, can be user's restore data effectively.
In addition, the embodiment of the invention also provides a kind of device that can realize said method embodiment: data storage device.
Based on above-mentioned date storage method, see also Fig. 5, the structural representation of a kind of data storage device that provides for the embodiment of the invention.
This device comprises:
Receiving element 51 is used to receive the packet to be stored that the data channel transmission comes.
Judging unit 52 is used to judge whether this data channel corresponding storage territory exists enough remaining spaces to store the packet to be stored that described receiving element receives.
Wherein the concrete structure of judging unit 52 comprises as shown in Figure 6:
First judgment sub-unit 61, the remaining space of comparing data bag memory block and the data volume size of packet to be stored;
Second judgment sub-unit 62, relatively the data volume size of the temporal information of the remaining space in temporal information district and packet to be stored and new time period information;
The 3rd judgment sub-unit 63, relatively the data volume size of the index information of the remaining space in index information district and packet to be stored.
Can change arbitrarily with three judgment sub-unit order when working, not limit here.
Preferably, this data storage device can also comprise updating block, as shown in Figure 5,
Updating block 55 is used to upgrade the first storage area information or the second storage area information.Behind the storage unit 53 storages packet to be stored or behind the delete cells 54 deleted data bags, generally all need to upgrade the first storage area information or the second storage area information.
Embodiment of the invention data storage device shown in Figure 5, the packet that the data channel transmission is come is stored in the storage area of data channel correspondence successively, when the remaining space of storage area was not enough, the packet deletion that storage time is the most forward was stored data successively in the position of deletion again.Do not have blank fragment like this between Cun Chu the data, do not produce fragment, thereby can increase the stability and the storage efficiency of data storage.
One of ordinary skill in the art will appreciate that, the software module that the step of embodiment of the invention date storage method can directly use hardware, processor to carry out, perhaps the combination of the two is implemented.Software module can place the storage medium of any other form known in random access memory (RAM), internal memory, ROM (read-only memory) (ROM), electrically programmable ROM, electrically erasable ROM, register, hard disk, moveable magnetic disc, CD-ROM or the technical field.
The above only is a preferred implementation of the present invention, makes those skilled in the art can understand or realize the present invention.Multiple modification to these embodiment will be conspicuous to one skilled in the art, and defined herein General Principle can realize under the situation that does not break away from the spirit or scope of the present invention in other embodiments.Therefore, the present invention will can not be restricted to these embodiment shown in this article, but will meet and principle disclosed herein and features of novelty the wideest corresponding to scope.
Claims (8)
1. a date storage method is characterized in that, may further comprise the steps:
The packet to be stored that reception comes by the data channel transmission;
Judge whether this data channel corresponding storage territory exists enough remaining spaces to store described packet to be stored;
If, determine the canned data of described packet to be stored, described packet to be stored is stored in the memory location of canned data indication in the described storage area;
Otherwise, according to default deletion condition, determine the data packet number of required deletion, from described storage area, delete the most forward described number of data bag storage time, afterwards, carry out described decision operation;
Described packet to be stored is stored in after the memory location of canned data indication in the described storage area, also comprises:
Upgrade the first storage area information or the second storage area information of described storage area correspondence; The information of the storage area when the bigger storage area information of serial number is used to write down described packet to be stored and has stored in the described first storage area information after the renewal and the second storage area information, the information of the storage area that the less storage area information of serial number is used to write down described packet to be stored when not storing.
2. method according to claim 1 is characterized in that, described canned data comprises: index information and temporal information, wherein, described index information is used for the absolute position that identification data wraps in described storage area.
3. method according to claim 1 is characterized in that, after the described deletion storage time the most forward described number of data bag, also comprises:
Upgrade the first storage area information or the second storage area information of described storage area correspondence; The bigger storage area information of serial number is used for the information of the storage area after the record data bag deletion in the described first storage area information after the renewal and the second storage area information, the information of the storage area that the less storage area information of serial number is used for the record data bag when not deleting.
4. method according to claim 1 is characterized in that, the storage area of described data channel correspondence comprises: information storage area and packet memory block;
Accordingly, describedly judge whether this data channel corresponding storage territory exists enough remaining spaces to store described packet to be stored and be specially:
Judge whether information storage area exists enough remaining spaces to store the canned data of described packet to be stored, and, judge whether described packet memory block exists enough remaining spaces to store described packet to be stored.
5. method according to claim 4 is characterized in that, described information storage area comprises:
The index information district is used to preserve the index information of each packet that described storage area stores;
The temporal information district is used to preserve the temporal information of each packet that described storage area stores, and the time period information of all packets of storing of storage area; Time period information is meant the time that all packets begin and the time of end; Temporal information is meant the storage time of packet correspondence, perhaps, and the video recording initial time of video recording data and video recording duration in the packet;
The storage area block of information is used to store the described first storage area information and the second storage area information.
6. method according to claim 5 is characterized in that, the described canned data of judging whether information storage area exists enough remaining spaces to store described packet to be stored is specially:
Judge whether the remaining space in index information district enough stores the index information of packet to be stored; And, the temporal information whether remaining space of judgement time block of information enough stores packet to be stored.
7. according to each described method of claim 1 to 6, it is characterized in that the default deletion condition of described basis determines that the data packet number of required deletion is specially:
Determine that temporal information in the storage area is positioned at first quantity of the packet of Preset Time section, with described first quantity and default second quantity relatively, select the data packet number of the little described quantity of numerical value as required deletion;
Wherein, the start time of the most forward temporal information is identical in the start time of described Preset Time section and the storage area.
8. a data storage device is characterized in that, comprising:
Receiving element is used to receive the packet to be stored that the data channel transmission comes;
Judging unit is used to judge whether this data channel corresponding storage territory exists enough remaining spaces to store the packet to be stored that described receiving element receives;
Storage unit, the judged result that is used for judging unit are determined the canned data of described packet to be stored when being, described packet to be stored are stored in the memory location of canned data indication in the described storage area;
Delete cells, the judged result that is used for judging unit according to default deletion condition, are determined the data packet number of required deletion for not the time, from described storage area deletion storage time the most forward described number of data bag;
Updating block is used to upgrade the first storage area information or the second storage area information of described storage area correspondence; The information of the storage area when the bigger storage area information of serial number is used to write down described packet to be stored and has stored in the described first storage area information after the renewal and the second storage area information, the information of the storage area that the less storage area information of serial number is used to write down described packet to be stored when not storing.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009102378540A CN101714391B (en) | 2009-11-12 | 2009-11-12 | Data storage method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009102378540A CN101714391B (en) | 2009-11-12 | 2009-11-12 | Data storage method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101714391A CN101714391A (en) | 2010-05-26 |
| CN101714391B true CN101714391B (en) | 2011-09-28 |
Family
ID=42417934
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2009102378540A Active CN101714391B (en) | 2009-11-12 | 2009-11-12 | Data storage method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101714391B (en) |
Families Citing this family (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102760136B (en) * | 2011-04-29 | 2014-11-26 | 苏州科达科技股份有限公司 | File system control method based on rapid video data storage |
| CN104346561B (en) * | 2013-07-29 | 2017-12-29 | 联想(北京)有限公司 | A kind of method and device for protecting memory cell |
| CN103714137B (en) * | 2013-12-19 | 2017-11-21 | 大唐移动通信设备有限公司 | The delet method and system of a kind of data file |
| CN105518612A (en) * | 2015-07-29 | 2016-04-20 | 深圳市锐明技术股份有限公司 | Write-in method and apparatus for monitoring data |
| CN105306860B (en) * | 2015-10-12 | 2019-01-22 | 东方网力科技股份有限公司 | A kind of Video data storage method and device |
| CN106446111B (en) * | 2016-09-14 | 2020-01-14 | Oppo广东移动通信有限公司 | Data migration method and terminal |
| CN106897168A (en) * | 2017-01-11 | 2017-06-27 | 广东小天才科技有限公司 | The system recovery method and device of a kind of mobile device |
| CN107370787A (en) * | 2017-06-05 | 2017-11-21 | 广西英伟科技有限公司 | A kind of server management system |
| CN107302676A (en) * | 2017-07-28 | 2017-10-27 | 建荣半导体（深圳）有限公司 | A kind of videotape storage means, system, chip, storage device and drive recorder |
| CN107766007A (en) * | 2017-11-16 | 2018-03-06 | 郑州云海信息技术有限公司 | A kind of date storage method and device |
| CN108563404B (en) * | 2018-04-17 | 2021-07-27 | 四川神琥科技有限公司 | Data packet capturing and storing method and equipment |
| CN111405313B (en) * | 2019-06-28 | 2023-11-14 | 杭州海康威视系统技术有限公司 | Method and system for storing streaming media data |
| CN111025068B (en) * | 2019-12-24 | 2022-05-20 | 宁波三星医疗电气股份有限公司 | Ammeter load curve data reading method and device and electronic equipment |
| CN114697314A (en) * | 2022-03-25 | 2022-07-01 | 宁波全网云医疗科技股份有限公司 | Medical image downloading system and method |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1555532A (en) * | 2000-08-30 | 2004-12-15 | �Ҵ���˾ | Temporary directory management |
| CN1816877A (en) * | 2003-09-24 | 2006-08-09 | 索尼株式会社 | Data recording control apparatus |
| CN101140542A (en) * | 2007-10-19 | 2008-03-12 | 华中科技大学 | Method for copying snapshot writing response time in the time of shortening writing time |
-
2009
- 2009-11-12 CN CN2009102378540A patent/CN101714391B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1555532A (en) * | 2000-08-30 | 2004-12-15 | �Ҵ���˾ | Temporary directory management |
| CN1816877A (en) * | 2003-09-24 | 2006-08-09 | 索尼株式会社 | Data recording control apparatus |
| CN101140542A (en) * | 2007-10-19 | 2008-03-12 | 华中科技大学 | Method for copying snapshot writing response time in the time of shortening writing time |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101714391A (en) | 2010-05-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101714391B (en) | Data storage method and device | |
| US11853549B2 (en) | Index storage in shingled magnetic recording (SMR) storage system with non-shingled region | |
| CN1493026B (en) | Memory device and record regenerator using it | |
| CN100498796C (en) | Logic log generation method, database backup/ restoration method and system | |
| CN102016789A (en) | Data processing apparatus and method of processing data | |
| CN102253898B (en) | Memory management method and memory management device of image data | |
| CN103370691A (en) | Managing buffer overflow conditions | |
| CN1645516B (en) | Data recovery apparatus and method used for flash memory | |
| CN106503020B (en) | Log data processing method and device | |
| CN112947856B (en) | Memory data management method and device, computer equipment and storage medium | |
| CN102682012A (en) | Method and device for reading and writing data in file system | |
| CN102063943A (en) | Nand flash memory parameter automatic detecting system | |
| CN110673789B (en) | Metadata storage management method, device, equipment and storage medium of solid state disk | |
| US20030121030A1 (en) | Method for implementing dual link list structure to enable fast link-list pointer updates | |
| CN104346373A (en) | Partition log queue synchronization management method and device | |
| CN106407224A (en) | Method and device for file compaction in KV (Key-Value)-Store system | |
| CN101334756A (en) | Control device of nonvolatile memory and control method thereof, and storage device | |
| CN103778120B (en) | Global profile mark generating method, generating means and corresponding distributed file system | |
| CN103856516A (en) | Data storage and reading method and data storage and reading device | |
| CN106201778B (en) | Information processing method and storage equipment | |
| CN104978154A (en) | Cache operation-based flash rapid read-write method and system | |
| US20060095707A1 (en) | Bidirectional data storing method | |
| EP1540660B1 (en) | Method of and apparatus for detecting an error in writing to persistent memory | |
| US20020133683A1 (en) | Method and system for reducing fragmentation | |
| CN109658985B (en) | Redundancy removal optimization method and system for gene reference sequence |
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 | ||
| PP01 | Preservation of patent right |
Effective date of registration: 20220726 Granted publication date: 20110928 |
|
| PP01 | Preservation of patent right |