CN104750858A - Network-based data storage method - Google Patents
Network-based data storage method Download PDFInfo
- Publication number
- CN104750858A CN104750858A CN201510180753.XA CN201510180753A CN104750858A CN 104750858 A CN104750858 A CN 104750858A CN 201510180753 A CN201510180753 A CN 201510180753A CN 104750858 A CN104750858 A CN 104750858A
- Authority
- CN
- China
- Prior art keywords
- file
- memory device
- video
- data
- frame
- 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
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides a network-based data storage method which includes the steps: designing a video frame coding and video frame storage process into two processes, and building two memory sharing areas for caching according to paths predefined by the two processes; creating a file pool comprising initial null files with specified sizes, distributing a group of clusters with fixed sizes in a continuous physical space, and scheduling storage among a plurality of storage devices based on accessed frequency and the residual space of the storage devices; recording a file index table of each file information by a preset time unit, and retrieving a video file. The network-based data storage method realizes stable storage and rapid accurate retrieval under high data volume, and has practicability and reliability.
Description
Technical field
The present invention relates to the network storage, particularly a kind of video data storage method.
Background technology
In recent years, along with the development of video compression technology and the lifting of the network bandwidth, video monitoring system is little, integrated, workable, customizable with its volume, easy care, accessible feature, receives the very big welcome of protection and monitor field.Except monitoring in real time field condition, scene, the front end of unsupervised period or burst alert event etc. can also be carried out real-time video, for carrying out reading and assay afterwards.Existing multiple storage system supports video monitoring system at present.Wherein DAS is applicable to the situation that server disperses in geographic distribution very much, is directly connected on server by memory device by scsi interface or optical-fibre channel.Data block is transferred to storage networking by optical-fibre channel by SAN, and file is carried out multi-protocols by IP tunnel to share by NAS, is applicable to the integration of file server, and CAS is applicable to long integrality and preserves fixed data.Various framework all provides good system support to video monitoring above, but the stability of video storage and sharpness are the important guarantees of quality monitoring, and the storage of current video monitoring system has following deficiency usually: coded format is comparatively fixing; Traditional file systems adopts the data model storage based on multilevel-pointer, there is when storage frame data I/O operational ton and produce the problems such as storage fragmentation greatly and easily, thus cause video storage efficiency low poor with retrieval performance, become the bottleneck of system performance and scale lifting.
Summary of the invention
For solving the problem existing for above-mentioned prior art, the present invention proposes a kind of network date storage method, comprising:
Coding video frames and frame of video storing process are designed to two processes, set up two internal memory shared regions for buffer memory by two predefined paths of process;
Create by the File Pool of specifying the initial null file of size to form, and when creating each file, distribute one group of continuous physical fixed size spatially bunch, between multiple memory device, carry out memory scheduling based on accessed frequency and memory device remaining space size;
Utilize file index mode, with the File Index Table of each fileinfo of schedule time unit record, to retrieve video file.
Preferably, described coding video frames and frame of video storing process are designed to two processes, set up two internal memory shared regions for buffer memory by two predefined paths of process, comprise further:
2 pieces of internal memory shared region CACHE1 and CACHE2 are opened up respectively by above-mentioned two predefined paths of process, when cataloged procedure is at every turn 1 frame data write CACHE1, CACHE1 is applied exclusive lock, and storing process now can only read 1 frame data of CACHE2, and CACHE2 is applied shared lock simultaneously; Unlocked when cataloged procedure writes CACHE1, then write CACHE2, now, if detect, CACHE2 adds shared lock, then idle waiting, until CACHE2 writes data again after being stored process releasing shared lock and adds exclusive lock; Cataloged procedure is write CACHE1 and CACHE2 alternately, and storing process alternately reads CACHE2 and CACHE1, thus make all stream of video frames data that storing process reading cataloged procedure exports.
Preferably, create by the File Pool of specifying the initial null file of size to form, and when creating each file, distribute one group of continuous physical fixed size spatially bunch, between multiple memory device, carry out memory scheduling based on accessed frequency and memory device remaining space size, comprise further:
Supervisory system after the power-up, create initial null file pond, the write that handle completes data is obtained as required from this File Pool, define the information in the first initial null file pond of structural array record, this structural array arranges three attribute fields: initial null file integrity flag, initial null file sequence number, initial null file taken up space;
Define the information of the second structural array record current storage devices, comprise following field: memory device title, memory device validity flag, there is mark in file, memory device remaining space and gross space, current accessed Thread Count, carries out hyperchannel scheduling according to following steps:
1) each memory device remaining space number percent k is calculated, i.e. the ratio of equipment remaining space and gross space;
2) calculate the maximum access number of threads Vn=k × ThreadSm of each memory device, wherein, ThreadSm is the current port number needing store video;
3) by the size of remaining space to the descending sequence of above-mentioned second structural array element;
4) according to step 3) ranking results, current thread access number is not reached first memory device in the structural array element of Vn/2, namely the equipment in maximum residual space distributes to current storage thread, if access number reaches Vn/2, select the maximum and access line number of passes of all the other remaining spaces not reach the memory device of Vn/2, distribute to the storage thread request of access that this memory device is nearest;
5) when the thread accesses number of all memory devices has all reached Vn/2, remaining space is large and access the memory device that number of threads do not reach Vn and distribute to up-to-date storage thread request of access;
6) if last memory device sorted in the second structural array reaches Vn, then return nonstorage device can information, now then start to apply overlay strategy, time video file at most deleted, obtains more memory device space.
Preferably, describedly utilize file index mode, with the File Index Table of each fileinfo of schedule time unit record, to retrieve video file, comprise further:
For video sets up file, one is comprised for recording the File Index Table of each fileinfo on the same day in each file, described fileinfo comprises the type of video, beginning and ending time, index ID, Data Position and length, 3rd structural array defined file index structure, to record all videos frame fileinfo stored, the following attribute field of this array record: file availability mark, the starting and ending time of file, data segment starting and ending position, picture format, video channel number, video type.
The present invention compared to existing technology, has the following advantages:
The present invention proposes a kind of network storage means, under higher data volume, achieve stable storage and retrieve fast and accurately, there is practicality and reliability.
Accompanying drawing explanation
Fig. 1 is the process flow diagram of the network date storage method according to the embodiment of the present invention.
Embodiment
Detailed description to one or more embodiment of the present invention is hereafter provided together with the accompanying drawing of the diagram principle of the invention.Describe the present invention in conjunction with such embodiment, but the invention is not restricted to any embodiment.Scope of the present invention is only defined by the claims, and the present invention contain many substitute, amendment and equivalent.Set forth many details in the following description to provide thorough understanding of the present invention.These details are provided for exemplary purposes, and also can realize the present invention according to claims without some in these details or all details.
An aspect of of the present present invention provides a kind of network date storage method.Fig. 1 is the network date storage method process flow diagram according to the embodiment of the present invention.
Video monitoring system of the present invention is made up of coding video frames, frame of video storage, real-time Transmission, human-machine interface module.Coding video frames process obtains after frame data are encoded to be needed to send these data to frame of video storing process, the present invention proposes a kind of Double buffer internal memory sharing method, coding video frames process and frame of video storing process are designed to two processes, CACHE1 and CACHE2 is 2 pieces of internal memory shared regions of opening up by two predefined paths of process respectively.When cataloged procedure is at every turn 1 frame data write CACHE1, CACHE1 is applied exclusive lock, and storing process now can only read 1 frame data of CACHE2, and CACHE2 is applied shared lock simultaneously; Unlocked when cataloged procedure writes CACHE1, then write CACHE2, now, if detect, CACHE2 adds shared lock, then idle waiting is until CACHE2 writes data again after being stored process releasing shared lock and adds exclusive lock.So cataloged procedure is write CACHE1 and CACHE2 alternately, and storing process alternately reads CACHE2 and CACHE1, so circulates, thus ensure that storing process can read all stream of video frames data of cataloged procedure output, avoid frame losing phenomenon occurs.
Supervisory system after the power-up, creates an initial null file pond be made up of the initial null file of multiple appointment sizes.From this initial null file pond, obtain the write that handle completes data as required, before write data, a bunch chained list for each initial null file is known.So write memory device only can rewrite the content in bunch chained list and the structure that can not have influence on itself.When there is the exception as power-off, the just current data write of loss, do not cause the damage of file itself.
The empty data file data structure of design predistribution is as follows, define the information in an initial null file pond of structural array record, three attribute fields are set: initial null file integrity flag, initial null file sequence number, an initial null file taken up space.
When creating each file, for its distribute fixed size in one group of continuous print physical space bunch, this can have and prevents storage fragmentation from producing, shortens memory device seek time, improves the advantages such as memory device read or write speed.Prevent the generation of storage fragmentation from being because its continuity in physical space, and cluster storages that adjacent time has frame data of same nature can improve efficiency that memory device reads and writes and reduce the response time of retrieve data.In addition, size should be fixed when memory device initialization and the establishment of continuous print file to raise the efficiency.
Present invention improves over memory scheduling method, the efficiency of hyperchannel memory access can be improved.Take accessed frequency into consideration and memory device remaining space size carries out memory scheduling, ensure that memory device current residual space is maintaining a predetermined threshold value as far as possible, avoid multichannel video stream be centrally stored in some memory devices and cause the bottleneck that memory device I/O accesses, as much as possible multichannel video stream is evenly stored in each memory device.
First define the information of a structural array record current storage devices: comprise following field, memory device title, memory device validity flag, there is mark in file, memory device remaining space and gross space, current accessed Thread Count.
The concrete dispatching method step of multichannel video stream is:
1) each memory device remaining space number percent k is calculated, i.e. the ratio of equipment remaining space and gross space;
2) calculate the maximum access number of threads Vn=k × ThreadSm of each memory device, wherein, ThreadSm is the current port number needing store video;
3) by the size of remaining space to the descending sequence of said structure array element;
4) according to step 3) ranking results, current thread access number is not reached first memory device in the structural array element of Vn/2, namely the equipment in maximum residual space distributes to current storage thread.If access number reaches Vn/2, select the maximum and access line number of passes of all the other remaining spaces not reach the memory device of Vn/2, distribute to the storage thread request of access that this memory device is nearest.
5) when the thread accesses number of all memory devices has all reached Vn/2, remaining space is large and access the memory device that number of threads do not reach Vn and distribute to up-to-date storage thread request of access;
6) if last memory device sorted in structural array reaches Vn, then return nonstorage device can information.Now then start to apply overlay strategy, time video file is at most deleted, thus saves more memory device space.Adopt hyperchannel assigned storage strategy, make video flowing be stored in each memory device more equably, improve the efficiency that memory device I/O accesses, and improve the utilization factor of memory device.
In index construct, preferred embodiment of the present invention adopts file index mode, corresponding to every day, set up the file that take date as title, comprising one in each file for recording the File Index Table of each fileinfo on the same day (as the type of video, beginning and ending time, index ID, Data Position and length etc.), quick-searching can be carried out to the file on all memory devices like this.
FILE_INFO is as follows for defined file index structure: define a structural array record, the all videos frame fileinfo that every day stores: the following attribute field of this array record: file availability mark, the starting and ending time of file, data segment starting and ending position, picture format, video channel number, video type, wherein concrete value condition automatic video frequency, warning video, the manual video of video type.Can different video type be corresponded to one piece of data, thus ensure that on memory device, all data can not by repeat replication.So not only can save storage space, also make to relate to minimum object when carrying out data retrieval thus improve search efficiency.
Alternatively, another preferred embodiment of the present invention can adopt frame index mode, original video stream is after coding, form the coded frame of two types: I frame and P frame, wherein I frame (intracoded frame) is a kind of independent frame carrying full detail, just can independently need not decode with reference to other images.So carry out index stores to record the information such as its position, length, time to the key frame of these frame data of I frame, thus accurately can must locate, control and read frame data.
Definition I frame index structure FRAM_INDEX for: define whole I frame index information that structural array record frame of video file comprises, comprise I frame validity flag, the side-play amount of present frame relative file reference position, frame length, be respectively the data length of each I frame, the time of arrival of present frame.When complete I frame data are received, create frame index on the one hand, fill other regions except validity flag, the opposing party's data-oriented storage process sends message, if be successfully written with data, be then 1 by validity flag assignment, if because of the reasons such as power-off or memory device insufficient space make data write unsuccessful time, then validity flag remains 0, until a complete I frame is successfully written to.
According to the further preferred embodiment of the present invention, memory device is logically being divided on the basis of index area and data field, frame buffer and indexed cache are set, when video storage, frame data and index information thereof are first kept in frame buffer and indexed cache, when buffer area is fully written, adopt the mechanism of first data, rear index by the data one-time write memory device in buffer memory, video segment information node corresponding in index tree is upgraded simultaneously.Owing to adopting the network storage equipment to carry out data storage in network video monitor and control system, therefore the program can reduce the quantity of Internet Transmission and memory device I/O effectively, thus improves video storage efficiency.
The present invention adopts index tree to carry out organization and administration to video information, therefore the deep search process of video segment information renewal and video frequency searching process and index tree.The retrieval cost of this process is the tree degree of depth, is obviously better than the cost of file system file traversal, effectively improves video frequency searching performance.
In this preferred embodiment, memory device is logically divided into overall block, one-level index area and 3, data field part.It is specific as follows that it stores content:
(1) overall block: the overall management information that have recorded system, comprises creation-time, data block size, the root node position of one-level index tree and segmentation duration etc., writes when memory device formats.
(2) one-level index area: be made up of a group index node, all nodes are organized by index tree structure.Tree node is made up of multiple one-level index information, and each one-level index represents a video segment.Have recorded the information such as the code stream type of video segment, start memory location, video segment start time and end time in one-level index.
(3) data field: be divided into the data block that multiple size is 64MB, end retains less than the part of a data block need not.Each data block is made up of the data cell of 4 × 1024 16KB sizes, is divided into secondary index district and data cell district, all secondary index is evenly distributed in each data block, for the storage information in minute book data chunk.Each secondary index have recorded the information such as starting block numbering, number of blocks and the timestamp of data in memory device.
Based on storage organization of the present invention, the storage of video is described below with reading flow process.Video storage flow process:
Frame data are pressed block alignment write data field by step 1;
Step 2 writes corresponding secondary index;
Step 3 upgrades the one-level index of corresponding video segment;
Step 4 upgrades overall block message.
It is as follows that video reads flow process:
Step 1 search index tree obtains the one-level index of video segment;
The secondary index that step 2 orients video segment by one-level index is interval;
The frame data storage block that step 3 finds out video segment according to secondary index is interval;
Step 4 reads the frame data of video segment.
For index tree structure, degree of depth is the maximum key word quantity of the m rank index tree of L is mL, and each internal node in tree can comprise at most m stalk tree, and subtree quantity is equal with key word quantity, and node searching time complexity is O (L).
The pointer of the corresponding sensing child node of each key word, leaf node contains whole keyword message in tree.Index tree of the present invention is used for organizing all one-level index informations, and its root node position is recorded in overall block, and using the start time of video segment as index key assignments, all one-level index informations all can obtain from leaf node, to provide the quick-searching of video.
Each node in tree forms by with lower part, comprises keyNum, the actual one-level index quantity in record node, and maximum occurrences is 25; Main_index and child_pointer, preserves the child node pointer of one-level index information and correspondence thereof respectively.
When retrieving beginning, from overall block, first obtain the root node position of index tree, a searching route meeting condition retrieval time from root node to leaf node is found out by traversal key word, be positioned to the quick-searching of secondary index achieve frame data by one-level index, obtain corresponding video segment.Compared to file system, the present invention program obviously improves video frequency searching performance.
Because data buffer storage is divided into frame buffer and indexed cache two parts, frame buffer is used for caching frame data, and indexed cache is used for index information corresponding to buffered video.Rear one-time write memory device has been set up in frame buffer, be made up of an I frame and multiple P frame, for ensureing the independence between the integrality of each frame and consecutive frame, each zone bit (MH and MT) adding 2 byte-sized before and after every frame, while reaching data check effect, also provide implementation method for extracting separately frame of video.
Frame buffer is made up of frame head (Head), frame data (Frame) and zone bit (MH and MT) 3 part.The frame buffer size set up in internal memory is the integral multiple of block size, and its computing method are as follows:
Wherein, BR is video code rate; ML is zone bit length; HS is frame of video head size; FR is frame per second; BS is the size of data cell in memory device.Except BR unit is bps, the unit of all the other parameters is byte.
The present invention, on the basis ensureing video storage reliability, can reduce the quantity of Internet Transmission and memory device I/O effectively, obtains the raising of storage efficiency.Meanwhile, also maintain an indexed cache be made up of n secondary index corresponding with frame buffer, and adopt first data, rear index, the write-in policy of first secondary index, rear stage index carries out video storage.Based on this write-in policy, the present invention have also been devised a kind of video reconstruction mechanism.When system occurs abnormal; as scrambler abnormal power-down or network interruption etc.; this re-establishment mechanism can after abnormal restoring; rebuild secondary index according to frame data, rebuild one-level index according to secondary index; reduce video-losing to greatest extent; the nonuniformity problem of the data that elimination data buffer storage brings and index, the fault-tolerance of elevator system.
In sum, the present invention proposes a kind of network storage means, under higher data volume, achieve stable storage and retrieve fast and accurately, there is practicality and reliability.
Obviously, it should be appreciated by those skilled in the art, above-mentioned of the present invention each module or each step can realize with general computing system, they can concentrate on single computing system, or be distributed on network that multiple computing system forms, alternatively, they can realize with the executable program code of computing system, thus, they can be stored and be performed by computing system within the storage system.Like this, the present invention is not restricted to any specific hardware and software combination.
Should be understood that, above-mentioned embodiment of the present invention only for exemplary illustration or explain principle of the present invention, and is not construed as limiting the invention.Therefore, any amendment made when without departing from the spirit and scope of the present invention, equivalent replacement, improvement etc., all should be included within protection scope of the present invention.In addition, claims of the present invention be intended to contain fall into claims scope and border or this scope and border equivalents in whole change and modification.
Claims (4)
1. a network date storage method, is characterized in that, comprising:
Coding video frames and frame of video storing process are designed to two processes, set up two internal memory shared regions for buffer memory by two predefined paths of process;
Create by the File Pool of specifying the initial null file of size to form, and when creating each file, distribute one group of continuous physical fixed size spatially bunch, between multiple memory device, carry out memory scheduling based on accessed frequency and memory device remaining space size;
Utilize file index mode, with the File Index Table of each fileinfo of schedule time unit record, to retrieve video file.
2. method according to claim 1, is characterized in that, described coding video frames and frame of video storing process is designed to two processes, sets up two internal memory shared regions for buffer memory, comprise further by two predefined paths of process:
2 pieces of internal memory shared region CACHE1 and CACHE2 are opened up respectively by above-mentioned two predefined paths of process, when cataloged procedure is at every turn 1 frame data write CACHE1, CACHE1 is applied exclusive lock, and storing process now can only read 1 frame data of CACHE2, and CACHE2 is applied shared lock simultaneously; Unlocked when cataloged procedure writes CACHE1, then write CACHE2, now, if detect, CACHE2 adds shared lock, then idle waiting, until CACHE2 writes data again after being stored process releasing shared lock and adds exclusive lock; Cataloged procedure is write CACHE1 and CACHE2 alternately, and storing process alternately reads CACHE2 and CACHE1, thus make all stream of video frames data that storing process reading cataloged procedure exports.
3. method according to claim 2, it is characterized in that, create by the File Pool of specifying the initial null file of size to form, and when creating each file, distribute one group of continuous physical fixed size spatially bunch, between multiple memory device, carry out memory scheduling based on accessed frequency and memory device remaining space size, comprise further:
Supervisory system after the power-up, create initial null file pond, the write that handle completes data is obtained as required from this File Pool, define the information in the first initial null file pond of structural array record, this structural array arranges three attribute fields: initial null file integrity flag, initial null file sequence number, initial null file taken up space;
Define the information of the second structural array record current storage devices, comprise following field: memory device title, memory device validity flag, there is mark in file, memory device remaining space and gross space, current accessed Thread Count, carries out hyperchannel scheduling according to following steps:
1) each memory device remaining space number percent k is calculated, i.e. the ratio of equipment remaining space and gross space;
2) calculate the maximum access number of threads Vn=k × ThreadSm of each memory device, wherein, ThreadSm is the current port number needing store video;
3) by the size of remaining space to the descending sequence of above-mentioned second structural array element;
4) according to step 3) ranking results, current thread access number is not reached first memory device in the structural array element of Vn/2, namely the equipment in maximum residual space distributes to current storage thread, if access number reaches Vn/2, select the maximum and access line number of passes of all the other remaining spaces not reach the memory device of Vn/2, distribute to the storage thread request of access that this memory device is nearest;
5) when the thread accesses number of all memory devices has all reached Vn/2, remaining space is large and access the memory device that number of threads do not reach Vn and distribute to up-to-date storage thread request of access;
6) if last memory device sorted in the second structural array reaches Vn, then return nonstorage device can information, now then start to apply overlay strategy, time video file at most deleted, obtains more memory device space.
4. method according to claim 3, is characterized in that, describedly utilizes file index mode, with the File Index Table of each fileinfo of schedule time unit record, to retrieve video file, comprises further:
For video sets up file, one is comprised for recording the File Index Table of each fileinfo on the same day in each file, described fileinfo comprises the type of video, beginning and ending time, index ID, Data Position and length, 3rd structural array defined file index structure, to record all videos frame fileinfo stored, the following attribute field of this array record: file availability mark, the starting and ending time of file, data segment starting and ending position, picture format, video channel number, video type.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510180753.XA CN104750858A (en) | 2015-04-16 | 2015-04-16 | Network-based data storage method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510180753.XA CN104750858A (en) | 2015-04-16 | 2015-04-16 | Network-based data storage method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN104750858A true CN104750858A (en) | 2015-07-01 |
Family
ID=53590542
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510180753.XA Pending CN104750858A (en) | 2015-04-16 | 2015-04-16 | Network-based data storage method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104750858A (en) |
Cited By (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105930504A (en) * | 2016-05-10 | 2016-09-07 | 烽火通信科技股份有限公司 | Network management time sequence file concurrent processing system and concurrent processing method |
| CN106204414A (en) * | 2016-08-05 | 2016-12-07 | 蓝普金睛（北京）科技有限公司 | A kind of method and system of dynamic image caching |
| CN106485088A (en) * | 2016-10-20 | 2017-03-08 | 上海览海在线健康管理有限公司 | The method and system that online inquiring record is preserved |
| CN106604043A (en) * | 2016-12-30 | 2017-04-26 | Ut斯达康(深圳)技术有限公司 | Internet-based live broadcast method and live broadcast server |
| CN106713465A (en) * | 2016-12-27 | 2017-05-24 | 北京锐安科技有限公司 | Distributed storage system |
| CN106970827A (en) * | 2017-03-27 | 2017-07-21 | 联想(北京)有限公司 | Information processing method, information processor, electronic equipment |
| CN108965807A (en) * | 2018-07-17 | 2018-12-07 | 深圳市共进电子股份有限公司 | Control method for playing back, device, terminal and the storage medium of real-time video |
| CN109918017A (en) * | 2017-12-12 | 2019-06-21 | 北京机电工程研究所 | Data dispatching method and device |
| CN109976675A (en) * | 2019-04-01 | 2019-07-05 | 广州市百果园信息技术有限公司 | A kind of data update, read method, device, equipment and storage medium |
| CN110825697A (en) * | 2019-11-07 | 2020-02-21 | 珠海研果科技有限公司 | Method and apparatus for formatting a storage device |
| CN111026890A (en) * | 2019-11-28 | 2020-04-17 | 天脉聚源(杭州)传媒科技有限公司 | Picture data storage method, system, device and storage medium based on index table |
| CN111400258A (en) * | 2020-03-20 | 2020-07-10 | 深圳市凯沃尔电子有限公司 | Data file storage method and device |
| CN111954082A (en) * | 2019-05-17 | 2020-11-17 | 上海哔哩哔哩科技有限公司 | Mask file structure, mask file reading method, computer device and readable storage medium |
| CN112291292A (en) * | 2019-07-26 | 2021-01-29 | 浙江宇视科技有限公司 | Data storage method, device, equipment and medium |
| CN113473039A (en) * | 2021-06-18 | 2021-10-01 | 苏州浪潮智能科技有限公司 | Multi-channel video storage method and system |
| CN113703689A (en) * | 2021-10-26 | 2021-11-26 | 深圳金正方科技股份有限公司 | Data storage method and device for intelligent electric meter, intelligent electric meter and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6201902B1 (en) * | 1994-09-05 | 2001-03-13 | Hiroshi Sasaki | Information reproducing device for reproducing multimedia information recorded in the form of optically readable code pattern, and information recording medium storing multimedia information in the same form |
| CN1487451A (en) * | 2003-08-12 | 2004-04-07 | 上海交通大学 | Flow media search system in teleteaching domain based on MPEG-7 |
| CN101427246A (en) * | 2005-04-20 | 2009-05-06 | 微软公司 | Systems and methods for providing distributed, decentralized data storage and retrieval |
-
2015
- 2015-04-16 CN CN201510180753.XA patent/CN104750858A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6201902B1 (en) * | 1994-09-05 | 2001-03-13 | Hiroshi Sasaki | Information reproducing device for reproducing multimedia information recorded in the form of optically readable code pattern, and information recording medium storing multimedia information in the same form |
| CN1487451A (en) * | 2003-08-12 | 2004-04-07 | 上海交通大学 | Flow media search system in teleteaching domain based on MPEG-7 |
| CN101427246A (en) * | 2005-04-20 | 2009-05-06 | 微软公司 | Systems and methods for providing distributed, decentralized data storage and retrieval |
Non-Patent Citations (2)
| Title |
|---|
| 欧阳甸: "嵌入式数字视频监控系统中的媒体存储研究", 《视频应用与工程》 * |
| 汤家兴: "网络视频监控存储子系统软件设计", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
Cited By (24)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105930504A (en) * | 2016-05-10 | 2016-09-07 | 烽火通信科技股份有限公司 | Network management time sequence file concurrent processing system and concurrent processing method |
| CN105930504B (en) * | 2016-05-10 | 2019-04-16 | 烽火通信科技股份有限公司 | A kind of network management timing file cocurrent processing system and concurrent processing method |
| CN106204414A (en) * | 2016-08-05 | 2016-12-07 | 蓝普金睛（北京）科技有限公司 | A kind of method and system of dynamic image caching |
| CN106485088B (en) * | 2016-10-20 | 2019-02-12 | 上海览海在线健康管理有限公司 | The method and system saved are recorded to online interrogation |
| CN106485088A (en) * | 2016-10-20 | 2017-03-08 | 上海览海在线健康管理有限公司 | The method and system that online inquiring record is preserved |
| CN106713465B (en) * | 2016-12-27 | 2020-11-17 | 北京锐安科技有限公司 | Distributed storage system |
| CN106713465A (en) * | 2016-12-27 | 2017-05-24 | 北京锐安科技有限公司 | Distributed storage system |
| CN106604043A (en) * | 2016-12-30 | 2017-04-26 | Ut斯达康(深圳)技术有限公司 | Internet-based live broadcast method and live broadcast server |
| CN106970827A (en) * | 2017-03-27 | 2017-07-21 | 联想(北京)有限公司 | Information processing method, information processor, electronic equipment |
| CN109918017A (en) * | 2017-12-12 | 2019-06-21 | 北京机电工程研究所 | Data dispatching method and device |
| CN108965807A (en) * | 2018-07-17 | 2018-12-07 | 深圳市共进电子股份有限公司 | Control method for playing back, device, terminal and the storage medium of real-time video |
| CN109976675B (en) * | 2019-04-01 | 2023-02-03 | 广州市百果园信息技术有限公司 | Data updating and reading method, device, equipment and storage medium |
| CN109976675A (en) * | 2019-04-01 | 2019-07-05 | 广州市百果园信息技术有限公司 | A kind of data update, read method, device, equipment and storage medium |
| CN111954082A (en) * | 2019-05-17 | 2020-11-17 | 上海哔哩哔哩科技有限公司 | Mask file structure, mask file reading method, computer device and readable storage medium |
| CN111954082B (en) * | 2019-05-17 | 2023-03-24 | 上海哔哩哔哩科技有限公司 | Mask file structure, mask file reading method, computer device and readable storage medium |
| CN112291292B (en) * | 2019-07-26 | 2023-04-07 | 浙江宇视科技有限公司 | Data storage method, device, equipment and medium |
| CN112291292A (en) * | 2019-07-26 | 2021-01-29 | 浙江宇视科技有限公司 | Data storage method, device, equipment and medium |
| CN110825697B (en) * | 2019-11-07 | 2022-12-20 | 珠海研果科技有限公司 | Method and apparatus for formatting a storage device |
| CN110825697A (en) * | 2019-11-07 | 2020-02-21 | 珠海研果科技有限公司 | Method and apparatus for formatting a storage device |
| CN111026890A (en) * | 2019-11-28 | 2020-04-17 | 天脉聚源(杭州)传媒科技有限公司 | Picture data storage method, system, device and storage medium based on index table |
| CN111400258A (en) * | 2020-03-20 | 2020-07-10 | 深圳市凯沃尔电子有限公司 | Data file storage method and device |
| CN113473039B (en) * | 2021-06-18 | 2022-12-02 | 苏州浪潮智能科技有限公司 | Multi-channel video storage method and system |
| CN113473039A (en) * | 2021-06-18 | 2021-10-01 | 苏州浪潮智能科技有限公司 | Multi-channel video storage method and system |
| CN113703689A (en) * | 2021-10-26 | 2021-11-26 | 深圳金正方科技股份有限公司 | Data storage method and device for intelligent electric meter, intelligent electric meter and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104750858A (en) | Network-based data storage method | |
| CN104750859A (en) | Network storing method | |
| CN109783438B (en) | Distributed NFS system based on librados and construction method thereof | |
| US10459898B2 (en) | Configurable-capacity time-series tables | |
| CN107870973B (en) | File storage system capable of accelerating simultaneous playback of multiple paths of monitoring | |
| US9792344B2 (en) | Asynchronous namespace maintenance | |
| EP2740041B1 (en) | Cloud-based distributed persistence and cache data model | |
| CN103812939B (en) | Big data storage system | |
| US9183153B2 (en) | Method and system for managing power grid data | |
| CN108881942B (en) | Super-fusion normal state recorded broadcast system based on distributed object storage | |
| CN105100716B (en) | A kind of secure storage unit and its system for Network Video Surveillance | |
| CN105190623A (en) | Log record management | |
| CN105190533A (en) | In place snapshots | |
| CN107832423B (en) | File reading and writing method for distributed file system | |
| CN104239234B (en) | The management of a kind of local cache efficiently and reading/writing method | |
| CN105828017B (en) | A kind of cloud storage access system and method towards video conference | |
| CN103455577A (en) | Multi-backup nearby storage and reading method and system of cloud host mirror image file | |
| CN108108476A (en) | The method of work of highly reliable distributed information log system | |
| CN102968422A (en) | System and method for controlling streaming data storage | |
| CN104050248A (en) | File storage system and storage method | |
| CN108399050B (en) | Data processing method and device | |
| CN111159176A (en) | Method and system for storing and reading mass stream data | |
| CN110442646A (en) | A kind of ceph data simultaneous module main side write performance optimization system and method | |
| CN105653720A (en) | Database hierarchical storage optimization method capable of achieving flexible configuration | |
| CN106991190A (en) | A kind of database automatically creates subdata base 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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20150701 |
|
| RJ01 | Rejection of invention patent application after publication |