CN101211338A - Rapid file predistribution and file box dynamic management process - Google Patents
Rapid file predistribution and file box dynamic management process Download PDFInfo
- Publication number
- CN101211338A CN101211338A CNA2006101483391A CN200610148339A CN101211338A CN 101211338 A CN101211338 A CN 101211338A CN A2006101483391 A CNA2006101483391 A CN A2006101483391A CN 200610148339 A CN200610148339 A CN 200610148339A CN 101211338 A CN101211338 A CN 101211338A
- Authority
- CN
- China
- Prior art keywords
- data
- address
- file
- sequence number
- video recording
- 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.)
- Pending
Links
Images
Abstract
The invention relates to providing a method for accessing video records in high performances. The invention is characterized in fulfilling the target in the software mode on a stream media server. The software is compiled with C++ Language and installed in Windows Operation System. The software can provide an abstract file system service layer through the fitting of NTFS File System with Windows API; the file system service layer provides a basic interface for video record operation; meanwhile, use the interfaces to continuously fulfill high-efficiency and safe access for video data, and besides, no file fragment can be produced in the file system. The invention has the advantages of simple and clear structure, so that it is only necessary to invest a few reconstruction technologies before long-period, stable and high-efficiency running is fulfilled for the stream media server.
Description
Technical field
The present invention relates to a kind of rapid file predistribution and deedbox dynamic management approach, the file system interface that can utilize operating system to provide by the method generates the file of a super large in advance, in this file, realize a miniature file system again, and one deck file service interface externally is provided.Utilize the file service interface can finish operations such as " increasing newly ", " deletion ", " modification " efficiently, reach the purpose that does not produce file fragmentation to reach RAD (rapid access data) at last, belong to multimedia technology field.
Background technology
Along with making rapid progress of science and technology, video monitoring market has also obtained develop rapidly.Video monitoring is widely used in many occasions so that it is directly perceived, convenient, the information content is abundant.In recent years, along with popularizing on a large scale of internet, and the develop rapidly of computing machine, network and Flame Image Process, transmission technology, the video monitoring technology also has significant progress.Video monitoring has been penetrated into multiple fields such as education, government, public place of entertainment, hospital, hotel, sports buildings, urban public security.
The hardware and software equipment of video monitoring generally as shown in Figure 1.
In an in-house network of disposing video monitoring system, streaming media server, video acquisition point and videoconference client have all been disposed usually.Video acquisition point is responsible for the video data of collection site, and is compressed into the form of appointment, sends to the backstage streaming media server as the data of MPEG-4.Streaming media server is mainly born 3 tasks: 1, the broadcast of real-time video, and videoconference client is watched real-time video by connecting streaming media server, this moment, streaming media server was responsible for video data is distributed to each client; 2, the video recording of real-time video, when video record, streaming media server is responsible for the avi file of the video data standard of preserving into that will collect.And document storage in the file system of this locality; 3, the playback of video, when the video record playback, streaming media server is responsible for taking out avi file from local file system, resolution file obtains the information such as start address of frame per second, totalframes and every frame, and regularly frame data are sent to client software according to frame per second, play by client software.Videoconference client software is commonly used to carry out the Centralized Monitoring of multi-screen real-time video, functions such as the customization of video recording plan and playing back videos.
Because all video files all leave in the local file system, can so just be there there a problem: how distribute the video recording data space fast? how can when needing the playback video recording, the client find video file fast? how can when playback and video recording, read fast and preserve? be directly to carry out accessing operation at present by the interface that file system provides, promptly directly a file is all preserved in each video recording, also only needed to read file of the same name during reading and recording and get final product according to the video recording numbering.But being video file, the shortcoming of this method need the people to safeguard, the maintainer can be regularly with unwanted video file cleaning deletion, the increase deletion that will cause file not stop like this, because streaming media server is based on WINDOWS operating system, and the main now file system patterns such as NTFS and FAT32 of using of WINDOWS operating system, and based on the framework reason of file system, so frequent operation finally can cause a large amount of file fragmentations in file system, the performance of the great limiting server performance of these file fragmentations meetings, special performance for file operation, streaming media server makes in this way and records a video, and the performance when having used that server is in video recording and playback a period of time of after has a very big downslide.
Summary of the invention
The purpose of this invention is to provide a kind of rapid file predistribution and deedbox dynamic management approach, the various operations that this method provides are the accessing video video record efficiently, also can in file system, not produce any file fragmentation when using this method operation note, and the performance of the various operations that also can not provide this method of the file fragmentation in the file system produces any influence.
For realizing above purpose, technical scheme of the present invention provides a kind of rapid file predistribution and deedbox dynamic management approach, it is characterized in that, on streaming media server, realize with software mode, software is to write with C Plus Plus, be installed on the Windows operating system, software passes through the cooperation with new technology file system and WindowsAPI, to on provide one deck abstract file system service layer, the file system service layer provides the basic interface of video record operation, use the access video recording data that these interfaces can be efficient and safe all the time, and can not produce file fragmentation in file system, its method is:
Step 1. generates the DLL of a Windows, and output is as minor function Init, AddNew, Update, Delete, Find in DLL, and wherein, Init is an initial method, i.e. the initialization files case; The newly-increased record of AddNew representative; A record is upgraded in the Update representative; Record of Delete representative deletion; A record is searched in the Find representative;
Step 2. at first realizes initial method Init, finishes following work when calling initial method:
(1) file that to generate a size in advance be 4GB, concrete grammar generates a null file for calling the fopen function earlier;
(2) in the file that generates in advance, produce at least one deedbox
Each file is made of index area and data field two large divisions, size is 2M, the address is 0～200000H, the index area is made up of indexing head and concordance list, the indexing head size is 100 BYTE-, the address is 0～64H, preceding 9 BYTE of indexing head are that leader is known, and value is ASC sign indicating number " INDEXHEAD ", and 4 BYTE are current video record sum, remaining space is all as keeping the position, the concordance list size is 2097052BYTE, and the address is 65H～200000H, and concordance list has been deposited every index in the mode of continuation address, and the character string according to records series number sorts in the ascending order mode, and whole concordance list can be deposited 41941 index altogether;
Is the data field after the concordance list, address data area is 200001H～100000000H, and the data field is divided into the data block of a plurality of fixed length, each data block energy and can only preserve a video record.The length of each data block is 5M, and form is as follows: service marking+records series number+data length+data, " service marking " be the sign that whether is used of blocks of data for this reason, accounts for 1BYTE, is 0 as not using, and having used is 1; " records series number " is exactly the sequence number of video recording, " data length " is the total length of video recording data, accounts for 4 BYTE, and data are exactly the real data of video recording, whole data field begins depositing continuously a plurality of data blocks by first address, can deposit 800 above video records;
Step 3. carry out " inquiry ", " increasing newly ", " renewal ", " deletion ",
(1) inquiry Find method is achieved as follows:
At first utilize binary chop in concordance list, to search corresponding video recording sequence number, if find the video recording sequence number, then obtain the actual address that writes down, again from the record the address read-outing data head, actual video recording data have just finally been found according to operating position and data length, if in concordance list, do not find the video recording sequence number, then search failure, return sky:
The basic thought of binary chop is: establish R[low..high] be between current seek area
A) at first determine this interval point midway;
B) K value and R[mid that then will be to be looked into] .key relatively: if equate, then search success and return this position, otherwise must determine between new seek area, the continuation binary chop, concrete grammar is as follows:
1. if R[mid] .key＞K, then by the order R[mid..n as can be known of table] .keys is all greater than K, therefore if exist key word to equal the node of K in the table, then this node must be the sublist R[1..mid-1 on the mid left side, position] in, so be left sublist R[1..mid-1 between new seek area];
2. similarly, if R[mid] .key＜K, then the K that will search must be at the right sublist R[mid+1..n of mid] in, be right sublist R[mid+1..n between promptly new seek area], search is at carrying out between new seek area next time;
(2) newly-increased AddNew method is achieved as follows::
At first utilize binary chop in concordance list, to search corresponding video recording sequence number.If find the video recording sequence number, then return newly-increased failure, if do not find sequence number, just calculate this sequence number in concordance list can storage addresses, be made as X, follow the ergodic data section, the operating position of data query section is up to finding a untapped data segment, find the data of will recording a video after not using data segment to be kept at the data division of data segment, rewrite data head part again, rewrite user mode for using, rewrite records series number and data length field, follow, rewrite concordance list, at first with the mobile backward 50Byte of all index datas behind the address X that obtains previously, insert the index of new record again at place, X address, fill in the records series number and the recording address of index, revise indexing head at last, will write down sum and add 1;
(3) upgrading the Update method is achieved as follows:
At first utilize binary chop in concordance list, to search corresponding video recording sequence number, if do not find the video recording sequence number, then return and upgrade failure, if find sequence number, obtain the recording address in the index again, more the data segment of change of address and data head have just been finished and have been upgraded operation;
(4) deletion Delete method is achieved as follows:
Utilize binary chop in concordance list, to search corresponding video recording sequence number earlier, if do not find the video recording sequence number, then return the deletion failure, if find sequence number, obtain recording address and the address of index, the more data head of the data segment of change of address correspondence in the index again, do not change service marking into use, again all the concordance list data behind index address+50Byte are all moved 50Byte forward, revise indexing head at last, will write down sum and subtract 1.
The present invention provides a cover abstract file service layer in addition, and the file service layer provides all methods of file operation, promptly " increases newly ", the operation of " modification ", " deletion ", " reading "; Can not produce a large amount of file fragmentations under frequent newly-increased deletion and long-play, being applicable to needs the frequent operation file in file system, and the server unmanned, and performance decline situation can not occur after the operation for a long time.
Advantage of the present invention is that framework is simple and clear, only needs to drop into a spot of technological transformation and just can make that streaming media server can steady in a long-term, operation efficiently.
Description of drawings
Fig. 1 is the real-time video monitoring system network chart;
Fig. 2 is predistribution file structure figure;
Fig. 3 is a binary chop program circuit synoptic diagram;
Fig. 4 is newly-increased video record program circuit synoptic diagram;
Fig. 5 is deletion video record program circuit synoptic diagram.
Embodiment
The invention will be further described below in conjunction with drawings and Examples.
Embodiment
In force, the operating system that we set enforcement is Windows operating system, uses single file as deedbox, and the length of file is 4GB, mainly used some Windows api functions in the implementation process and carried out file processing, mainly contained fopen and open or generate a file; Fclose closes a file; The mobile hereof current address of fseek; Fwrite is write data hereof; Fread is read data hereof;
In addition, our video record is to preserve in the mode of MPEG-4 compression, generally preserves 352*288, and frame per second is that 12.5 video recording took the 5M space in 10 minutes at most.Our each bar video record all has a video recording sequence number corresponding with it, and the video recording sequence number is that maximum length is 40 character string.In all video records, the video recording sequence number must guarantee unique existence.
Describe the specific implementation method below in detail:
Step 1. generates the DLL of a Windows, and output is as minor function Init, AddNew, Update, Delete, Find in DLL, and wherein, Init is an initial method, i.e. the initialization files case; The newly-increased record of AddNew representative; A record is upgraded in the Update representative; Record of Delete representative deletion; A record is searched in the Find representative;
Step 2. at first realizes initial method Init, finishes following work when calling initial method:
(1) generate the file of a super large in advance, concrete grammar generates a null file for calling the fopen function earlier, calls fseek function move pointer again to address 100000000H.Like this, we have just obtained a file that size is 4GB;
(2) because we need produce a deedbox in newly-generated file, so we need come formatted file with the form of being scheduled to, the form of file as shown in Figure 2:
As shown in Figure 2, be predistribution file structure figure, file mainly is made of index area and data field two large divisions, the index area mainly exists for the speed of accelerating query note, size is 2M, and the address is 0～200000H, shown in figure two, the index area is made up of two parts, indexing head and concordance list, indexing head size are 100 BYTE, and the address is 0～64H, preceding 9 BYTE of indexing head are that leader is known, value is ASC sign indicating number " INDEXHEAD ", and then 4 BYTE are current video record sum, and remaining space is all as keeping the position, the concordance list size is 2097052BYTE, the address is 65H～200000H, and concordance list has been deposited every index in the mode of continuation address, and the form of index is as follows: records series number+recording address+reservation position, length is 50BYTE, records series number is the sequence number of relevant alarm record, length 40BYTE, and type is character types, like this, sequence number just is that the mode of the character string of 40BYTE is used with the maximum length.Recording address length 4BYTE, Ji Lu data segment start address hereof for this reason, all the other 6BYTE are for keeping the position, and concordance list is deposited the mode of index for depositing continuously, and the character string according to records series number sorts in the ascending order mode, and whole concordance list can be deposited 41941 index altogether.
After the concordance list is the data field, and address data area is 200001H～100000000H, considers that the singularity of video record reaches in order to prevent the appearance of fragment, and we are divided into the data field data block of a plurality of fixed length.Each data block energy and can only preserve a video record.If the long data block of just can't using of video record is preserved, even and the very short monoblock data block that also can take of video record.The length of each data block is 5M, and form is as follows: service marking+records series number+data length+data, " service marking " be the sign that whether is used of blocks of data for this reason, accounts for 1BYTE, is 0 as not using, and having used is 1." records series number " is exactly the sequence number of video recording, and " data length " is the total length of video recording data, accounts for 4 BYTE.Data are exactly the real data of video recording.Whole data field begins depositing continuously a plurality of data blocks by first address, and the file of 4G can be deposited 800 video records approximately like this.
Also can consider to use extended mode in addition, the file consolidation management that promptly generates a plurality of 4G is a deedbox in logic, the concordance list of deedbox is placed in first data file, and the data field is arranged in a plurality of files, the label that so only need increase a data file in each index again can index the actual address of data block, in this way, we just can utilize the more video record of a plurality of document storages.
Step 3. carry out " inquiry ", " increasing newly ", " renewal ", " deletion ",
(1) the Find method is achieved as follows:
As shown in Figure 3, be binary chop program circuit synoptic diagram, at first utilize binary chop in concordance list, to search corresponding video recording sequence number.If find the video recording sequence number, then obtain the actual address that writes down, from the address read-outing data head of record, just finally found actual video recording data again according to operating position and data length.If in concordance list, do not find the video recording sequence number, then search failure, return sky.：
The basic thought of binary chop is: establish R[low..high] be between current seek area
(3) at first determine this interval point midway.
(4) K value and R[mid that then will be to be looked into] .key relatively: if equate, then search success and return this position, otherwise must determine between new seek area, the continuation binary chop, concrete grammar is as follows:
1. if R[mid] .key＞K, then by the order R[mid..n as can be known of table] .keys is all greater than K, therefore if exist key word to equal the node of K in the table, then this node must be the sublist R[1..mid-1 on the mid left side, position] in, so be left sublist R[1..mid-1 between new seek area].
2. similarly, if R[mid] .key＜K, then the K that will search must be at the right sublist R[mid+1..n of mid] in, be right sublist R[mid+1..n between promptly new seek area].Search is at carrying out between new seek area next time.
Therefore, from R[1..n between initial seek area], every through once and the comparison of the node key word on the point midway between current seek area, just can determine to search whether success, just dwindle half between unsuccessful then current seek area.It is the node of K that this process repeats until finding key word, perhaps be empty until between current seek area, promptly search when failing till.
(2) realization of AddNew method:
As shown in Figure 4, be newly-increased video record program circuit synoptic diagram, at first utilize binary chop in concordance list, to search corresponding video recording sequence number.If find the video recording sequence number, then return newly-increased failure.If do not find sequence number, just calculate this sequence number in concordance list can storage addresses, be made as X.Follow the ergodic data section, the operating position of data query section is up to finding a untapped data segment.Find the data division that does not use the data of will recording a video behind the data segment to be kept at data segment, rewrite data head part is again rewritten user mode for using, rewriting records series number and data length field.Then, rewrite concordance list.At first with the mobile backward 50Byte of all index datas behind the address X that obtains previously, insert the index of new record again at place, X address, fill in the records series number and the recording address of index.Revise indexing head at last, will write down sum and add 1.So just finished new work;
(3) realization of Update method:
At first utilize binary chop in concordance list, to search corresponding video recording sequence number.If do not find the video recording sequence number, then return and upgrade failure, if find sequence number, obtain the recording address in the index again, more the data segment of change of address and data head have just been finished and have been upgraded operation;
(4) realization of Delete method:
As shown in Figure 5, for deletion video record program circuit synoptic diagram, utilize binary chop in concordance list, to search corresponding video recording sequence number earlier.If do not find the video recording sequence number, then return the deletion failure.If find sequence number, obtain the recording address in the index and the address of index again, the data head of the data segment of change of address correspondence does not more change service marking into and to use.Again all the concordance list data behind index address+50Byte are all moved 50Byte forward.Revise indexing head at last, will write down sum and subtract 1.Just finished the deletion action of record;
Because the query manipulation of record is based on concordance list and binary chop, so record can be inquired about in high performance mode all the time.And operations such as the renewal, deletion of record are all at first based on query manipulation, but direct index is to the start address of data segment under high performance query manipulation basis, so record data also can be by access efficiently.And, therefore in operating process, can not produce the fragment space because video record is to leave in the data block of fixed length, so even long-time frequent newly-increased, deletion record can not cause performance impact to system more yet.Used the server of deedbox system just can keep operating efficiently data in magnetic disk for a long time like this.
Claims (1)
1. rapid file predistribution and deedbox dynamic management approach, it is characterized in that, on streaming media server, realize with software mode, software is to write with C Plus Plus, be installed on the Windows operating system, software passes through the cooperation with new technology file system and Windows API, to on provide one deck abstract file system service layer, the file system service layer provides the basic interface of video record operation, use the access video recording data that these interfaces can be efficient and safe all the time, and can not produce file fragmentation in file system, its method is:
Step 1. generates the DLL of a Windows, and output is as minor function Init, AddNew, Update, Delete, Find in DLL, and wherein, Init is an initial method, i.e. the initialization files case; The newly-increased record of AddNew representative; A record is upgraded in the Update representative; Record of Delete representative deletion; A record is searched in the Find representative;
Step 2. at first realizes initial method Init, finishes following work when calling initial method:
A) generate the file of one 4 GB in advance, concrete grammar generates a null file for calling the fopen function earlier;
B) in the file that generates in advance, produce at least one deedbox
Each file is made of index area and data field two large divisions, size is 2M, the address is 0～200000H, the index area is made up of indexing head and concordance list, the indexing head size is 100 BYTE, the address is 0～64H, preceding 9 BYTE of indexing head are that leader is known, and value is ASC sign indicating number " INDEXHEAD ", and 4 BYTE are current video record sum, remaining space is all as keeping the position, the concordance list size is 2097052BYTE, and the address is 65H～200000H, and concordance list has been deposited every index in the mode of continuation address, and the character string according to records series number sorts in the ascending order mode, and whole concordance list can be deposited 41941 index altogether;
Is the data field after the concordance list, address data area is 200001H～100000000H, and the data field is divided into the data block of a plurality of fixed length, each data block energy and can only preserve a video record.The length of each data block is 5M, and form is as follows: service marking+records series number+data length+data, " service marking " be the sign that whether is used of blocks of data for this reason, accounts for 1 BYTE, is 0 as not using, and having used is 1; " records series number " is exactly the sequence number of video recording, " data length " is the total length of video recording data, accounts for 4 BYTE, and data are exactly the real data of video recording, whole data field begins depositing continuously a plurality of data blocks by first address, can deposit 800 above video records;
Step 3. carry out " inquiry ", " increasing newly ", " renewal ", " deletion ",
(1) inquiry Find method is achieved as follows:
At first utilize binary chop in concordance list, to search corresponding video recording sequence number, if find the video recording sequence number, then obtain the actual address that writes down, again from the record the address read-outing data head, actual video recording data have just finally been found according to operating position and data length, if in concordance list, do not find the video recording sequence number, then search failure, return sky:
The basic thought of binary chop is: establish R[low..high] be between current seek area
A) at first determine this interval point midway;
B) K value and R[mid that then will be to be looked into] .key relatively: if equate, then search success and return this position, otherwise must determine between new seek area, the continuation binary chop, concrete grammar is as follows:
1. if R[mid] .key＞K, then by the order R[mid..n as can be known of table] .keys is all greater than K, therefore if exist key word to equal the node of K in the table, then this node must be the sublist R[1..mid-1 on the mid left side, position] in, so be left sublist R[1..mid-1 between new seek area];
2. similarly, if R[mid] .key＜K, then the K that will search must be at the right sublist R[mid+1..n of mid] in, be right sublist R[mid+1..n between promptly new seek area], search is at carrying out between new seek area next time;
(2) newly-increased AddNew method is achieved as follows:
At first utilize binary chop in concordance list, to search corresponding video recording sequence number.If find the video recording sequence number, then return newly-increased failure, if do not find sequence number, just calculate this sequence number in concordance list can storage addresses, be made as X, follow the ergodic data section, the operating position of data query section is up to finding a untapped data segment, find the data of will recording a video after not using data segment to be kept at the data division of data segment, rewrite data head part again, rewrite user mode for using, rewrite records series number and data length field, follow, rewrite concordance list, at first all index datas behind the address X that obtains are previously moved 50 Byte backward, insert the index of new record again at place, X address, fill in the records series number and the recording address of index, revise indexing head at last, will write down sum and add 1;
(3) upgrading the Update method is achieved as follows:
At first utilize binary chop in concordance list, to search corresponding video recording sequence number, if do not find the video recording sequence number, then return and upgrade failure, if find sequence number, obtain the recording address in the index again, more the data segment of change of address and data head have just been finished and have been upgraded operation;
(4) deletion Delete method is achieved as follows:
Utilize binary chop in concordance list, to search corresponding video recording sequence number earlier, if do not find the video recording sequence number, then return the deletion failure, if find sequence number, obtain recording address and the address of index, the more data head of the data segment of change of address correspondence in the index again, do not change service marking into use, again all the concordance list data behind index address+50 Byte are all moved 50 Byte forward, revise indexing head at last, will write down sum and subtract 1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2006101483391A CN101211338A (en) | 2006-12-29 | 2006-12-29 | Rapid file predistribution and file box dynamic management process |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2006101483391A CN101211338A (en) | 2006-12-29 | 2006-12-29 | Rapid file predistribution and file box dynamic management process |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101211338A true CN101211338A (en) | 2008-07-02 |
Family
ID=39611370
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNA2006101483391A Pending CN101211338A (en) | 2006-12-29 | 2006-12-29 | Rapid file predistribution and file box dynamic management process |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101211338A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106951183A (en) * | 2017-02-27 | 2017-07-14 | 南京杰迈视讯科技有限公司 | A kind of web camera date storage method of high efficient and reliable |
| US11507533B2 (en) | 2018-02-05 | 2022-11-22 | Huawei Technologies Co., Ltd. | Data query method and apparatus |
-
2006
- 2006-12-29 CN CNA2006101483391A patent/CN101211338A/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106951183A (en) * | 2017-02-27 | 2017-07-14 | 南京杰迈视讯科技有限公司 | A kind of web camera date storage method of high efficient and reliable |
| US11507533B2 (en) | 2018-02-05 | 2022-11-22 | Huawei Technologies Co., Ltd. | Data query method and apparatus |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102713901B (en) | Storage replication systems and methods | |
| Gemmell et al. | Multimedia storage servers: A tutorial | |
| CN100476710C (en) | System and method for maintaining temporal data in data storage | |
| US7236992B2 (en) | Storage system | |
| US9183153B2 (en) | Method and system for managing power grid data | |
| KR20200027413A (en) | Method, device and system for storing data | |
| US20090037495A1 (en) | Method and system for state maintenance of a large object | |
| CN102591986B (en) | System and method for realizing video and audio editing based on BS (browser/server) mode | |
| CN104050216B (en) | For customizing the file system manager of resource allocation | |
| JP2015518223A (en) | Memory search, real-time search system and method, and computer storage medium | |
| JP2011517816A (en) | Distributed media fingerprint repository | |
| CN102541990A (en) | Database redistribution method and system utilizing virtual partitions | |
| CN103650483A (en) | Generation device, distribution server, generation method, playback device, playback method, playback system, generation program, playback program, recording medium and data structure | |
| US8401370B2 (en) | Application tracks in audio/video containers | |
| CN103838830A (en) | Data management method and system of HBase database | |
| CN102902709B (en) | The document storage system of a kind of fixed space distribution and implementation method | |
| CN104978330A (en) | Data storage method and device | |
| US20190377827A1 (en) | Method and system for scalable search using microservice and cloud based search with records indexes | |
| CN102722405A (en) | Counting method in high concurrent and multithreaded application and system | |
| US20070016548A1 (en) | Implementing storage management functions using a data store system | |
| CN103020236A (en) | Method, system and distributed database system for retrieving recorded video | |
| CN103853612A (en) | Method for reading data based on digital family content under distributed storage | |
| CN101237547B (en) | Recording apparatus and recording method for data and file system information | |
| CN101794306A (en) | Multi-type video file block storage system and method | |
| CN101211338A (en) | Rapid file predistribution and file box dynamic management process |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Open date: 20080702 |