CN106507152B - Method and device for preparing and deleting program files - Google Patents
Method and device for preparing and deleting program files Download PDFInfo
- Publication number
- CN106507152B CN106507152B CN201610915111.4A CN201610915111A CN106507152B CN 106507152 B CN106507152 B CN 106507152B CN 201610915111 A CN201610915111 A CN 201610915111A CN 106507152 B CN106507152 B CN 106507152B
- Authority
- CN
- China
- Prior art keywords
- time
- storage
- program file
- deletion
- broadcasting
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
- H04N21/25—Management operations performed by the server for facilitating the content distribution or administrating data related to end-users or client devices, e.g. end-user or client device authentication, learning user preferences for recommending movies
- H04N21/262—Content or additional data distribution scheduling, e.g. sending additional data at off-peak times, updating software modules, calculating the carousel transmission frequency, delaying a video stream transmission, generating play-lists
- H04N21/26258—Content or additional data distribution scheduling, e.g. sending additional data at off-peak times, updating software modules, calculating the carousel transmission frequency, delaying a video stream transmission, generating play-lists for generating a list of items to be played back in a given order, e.g. playlist, or scheduling item distribution according to such list
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
- H04N21/25—Management operations performed by the server for facilitating the content distribution or administrating data related to end-users or client devices, e.g. end-user or client device authentication, learning user preferences for recommending movies
- H04N21/262—Content or additional data distribution scheduling, e.g. sending additional data at off-peak times, updating software modules, calculating the carousel transmission frequency, delaying a video stream transmission, generating play-lists
- H04N21/26283—Content or additional data distribution scheduling, e.g. sending additional data at off-peak times, updating software modules, calculating the carousel transmission frequency, delaying a video stream transmission, generating play-lists for associating distribution time parameters to content, e.g. to generate electronic program guide data
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Multimedia (AREA)
- Signal Processing (AREA)
- Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)
Abstract
The application provides a method and a device for preparing and deleting program files, which comprise the following steps: determining an earliest broadcast channel and earliest broadcast time according to the broadcast time of the program file on each channel; determining the file preparation time of the program file according to the earliest broadcasting time and the preset preparation door opening time of the earliest broadcasting channel; migrating the program file to a secondary storage of a broadcasting system, and performing reorganization; determining the latest broadcasting time according to the broadcasting time of the program file on each channel; determining the deletion time of the storage system according to the latest broadcasting time and the retention time of each preset channel in the storage system; and after the program file is played at the latest, deleting the program file in the storage system according to the deletion time of the storage system and the preset deletion execution time of the storage system. The method and the system can realize the management of the whole life cycle of the program file in the broadcasting system.
Description
Technical Field
The application relates to the technical field of broadcast television, in particular to a method and a device for preparing and deleting program files.
Background
At present, the management of the life cycle of a program file of a television station broadcasting system is mainly the management of migration and deletion of the file on each storage, for example: and carrying out file migration according to the program list, carrying out file deletion according to the storage deletion time if the program is not in the program list which is broadcast or not broadcast, and the like.
Since different broadcast channels have different programming characteristics, the file lifecycle initiation and deletion of each channel is personalized, whereas in the prior art there is a lack of management of the generation of broadcast system files and the management of individual storage lifecycles based on channel attributes.
The defects of the prior art are as follows:
there is a lack of management of the entire life cycle of program files based on channel attributes.
Disclosure of Invention
The embodiment of the application provides a method and a device for preparing and deleting a program file, and aims to solve the technical problem that the whole life cycle of the program file is not managed based on channel attributes in the prior art.
In a first aspect, an embodiment of the present application provides a program file preparation method, including the following steps:
determining the earliest broadcast channel and the earliest broadcast time T according to the broadcast time of the program file in each channelB1；
According to the earliest broadcasting time TB1And the preset prepared door opening time T of the earliest broadcasting channelcDetermining a file staging time T for the program filep；
And migrating the program file to a secondary storage of a broadcasting system, and executing the preparation.
In a second aspect, an embodiment of the present application provides a program file preparation apparatus, including:
a first determining module for determining the earliest broadcasting channel and the earliest broadcasting time T according to the broadcasting time of the program file on each channelB1；
A second determining module for determining the earliest broadcasting time TB1And the preset prepared door opening time T of the earliest broadcasting channelcDetermining a file staging time T for the program filep；
The migration module is used for migrating the program file to secondary storage of a broadcasting system;
and the preparation module is used for executing preparation.
In a third aspect, an embodiment of the present application provides a method for deleting a program file, including the following steps:
determining the latest broadcasting time according to the broadcasting time of the program file on each channel;
determining the deletion time of the storage system according to the latest broadcasting time and the retention time of each preset channel in the storage system; the deletion time of the storage system is the sum of the latest broadcasting time and the maximum value of the retention time of each channel in the storage system;
and after the program file is played at the latest, deleting the program file in the storage system according to the deletion time of the storage system and the preset deletion execution time of the storage system.
In a fourth aspect, an embodiment of the present application provides a program file deleting device, including:
the third determining module is used for determining the latest broadcasting time according to the broadcasting time of the program file on each channel;
a fourth determining module, configured to determine the deletion time of the storage system according to the latest broadcast time and the retention time of each pre-configured channel in the storage system; the deletion time of the storage system is the sum of the latest broadcasting time and the maximum value of the retention time of each channel in the storage system;
and the deleting module is used for deleting the program files in the storage system according to the deleting time of the storage system and the preset deleting execution time of the storage system after the program files are broadcasted at the latest.
The beneficial effects are as follows:
the method and the device for preparing and deleting the program files are based on channel management and determine the opening time of the prepared program files and the deletion time of the deleted program files according to the earliest broadcasting time and the latest broadcasting time of a program list, can flexibly carry out service peak staggering treatment through the configurable execution time of each channel, and execute the preparation or the deletion according to the finally determined time, thereby realizing the management of the whole life cycle of the program files in a broadcasting system.
Drawings
Specific embodiments of the present application will be described below with reference to the accompanying drawings, in which:
FIG. 1 is a schematic flow chart illustrating an implementation of a program file preparation method in an embodiment of the present application;
fig. 2 is a schematic flow chart illustrating implementation of a program file deletion method in an embodiment of the present application;
fig. 3 is a schematic diagram illustrating a program file flow of a broadcast system in an embodiment of the present application;
FIG. 4 is a schematic structural diagram of a program file preparation device in an embodiment of the present application;
fig. 5 shows a schematic structural diagram of a program file deleting device in the embodiment of the present application.
Detailed Description
In order to make the technical solutions and advantages of the present application more apparent, the following further detailed description of the exemplary embodiments of the present application with reference to the accompanying drawings makes it clear that the described embodiments are only a part of the embodiments of the present application, and not an exhaustive list of all embodiments. And the embodiments and features of the embodiments in the present description may be combined with each other without conflict.
Aiming at the defects of the prior art, the application provides a method and a device for preparing and deleting program files, which utilize an information management means, are based on channelization management, flexibly set generation and deletion strategies of the program files stored in a broadcasting system according to the attributes of broadcasting program lists or program files, and realize the life cycle management of the program files in the broadcasting system.
The following describes a method and an apparatus for preparing and deleting a program file provided by the present application with reference to a specific embodiment.
The first embodiment,
Fig. 1 shows a schematic flow chart of an implementation of a program file preparation method in an embodiment of the present application, and as shown in the figure, the program file preparation method may include:
102, according to the earliest broadcasting time TB1And the preset prepared door opening time T of the earliest broadcasting channelcDetermining a file staging time T for the program filep；
And 103, transferring the program file to a secondary storage of a broadcasting system, and performing reorganization.
In specific implementation, the setup door opening time of the file in each channel generated in the broadcasting system may be configured in advance, which may be specifically as shown in table 1.1 below:
| channel with a plurality of channels | Servicing of door opening times |
| CH1 | Tc1 |
| CH2 | Tc2 |
| … | … |
| CHi | Tci |
| CH(i+1) | Tc(i+1) |
| … | … |
The method for preparing the program file determines the door opening time of the preparation of the program file based on channel management and according to the earliest broadcasting time of a program list, flexibly processes service peak staggering through the configurable execution time of each channel, and performs the preparation according to the finally determined time, thereby realizing the management of the program file in the broadcasting system in the early stage.
In practice, the method may further comprise:
and migrating the program file from the secondary storage to the tertiary storage according to the broadcast execution list.
In specific implementation, the playing sequence of each program file can be determined according to the playing execution list, and the program files can be transferred from the secondary storage to the tertiary storage according to the playing execution list to wait for playing.
In practice, the file preparation time Tp-the earliest broadcast time T of said program fileB1-a scheduled open time T for said earliest broadcast channelc。
In specific implementation, the file preparation time T of secondary storagePEarliest presentation time T of fileB1Time to open door Tc；
When a file is played in a plurality of program lists, the file is recalculated into the preparation time according to the earliest playing time, if the obtained preparation time is later than the existing preparation time, the preparation time of the file is unchanged, and if the obtained preparation time is earlier than the existing preparation time, the calculated preparation time is used as the new file preparation time.
The preparation time of the program files in the embodiment of the application can be calculated according to the earliest broadcasting time of the program files and the preparation door opening time of the earliest broadcasting channel of the program, so that the preparation time of each program file can be different and is suitable for the self condition, better preparation management is realized, the preparation operations of the program files can be staggered, and the problems of larger service volume and the like caused by simultaneous preparation are avoided.
In the implementation, the execution servicing may specifically be: and when the file preparation time is more than or equal to the preparation execution time, performing preparation, wherein the preparation execution time is determined according to the preparation required time obtained by the preparation thread calculation and the running period of the thread.
In specific implementation, the file preparation time T of the secondary storage is calculated by the formulaPEarliest presentation time T of fileB1Time to open door Tc) The calculated file preparation time is theoretical preparation time, and the actual real execution time is determined by the preparation thread according to the calculated preparation execution time and the running period of the thread.
In specific implementation, before the preparation thread performs preparation, whether the file preparation time is greater than or equal to the preparation execution time may be determined, and if so, the preparation is executed.
In practice, the method may further comprise:
determining the latest broadcasting time according to the broadcasting time of the program file on each channel;
determining the deletion time of the storage system according to the latest broadcasting time and the retention time of each preset channel in the storage system; the deletion time of the storage system is the sum of the latest broadcasting time and the maximum value of the retention time of each channel in the storage system;
and after the program file is played at the latest, deleting the program file in the storage system according to the deletion time of the storage system and the preset deletion execution time of the storage system.
In specific implementation, after a program file is played at the latest, the program file begins to fade out, the embodiment of the application can determine the latest playing time according to the playing time of the program file on each channel, then determine the deleting time of a storage system according to the latest playing time and the preset retention time of each channel in the storage system, and finally delete the program file in the storage system according to the deleting time of the storage system and the preset deleting execution time of the storage system after the program file is played at the latest.
In the embodiment of the application, the deletion time of the storage system is calculated according to the latest broadcasting time of the program files and the maximum value of the retention time of each channel in the storage system, and is determined by the calculated deletion time of the storage system and the preset deletion execution time of the storage system when deletion is executed, so that the final deletion operation of each program file can be executed according to the self condition, and the deletion and the extinction of different program files can be different and staggered, thereby better realizing the management of the later broadcasting period.
In implementation, the determining the deletion time of the storage system according to the latest broadcast time of the program file on each channel may specifically be: determining the third-level storage deletion time, the second-level storage deletion time and the near-line storage deletion time according to the latest broadcasting time of the program file on each channel;
the deleting the program file in the storage system according to the deleting time of the storage system and the deleting execution time of the pre-configured storage system may specifically be:
deleting the program files stored in the third level according to the deletion time of the third level storage and the deletion execution time of the third level storage; deleting the program files on the secondary storage according to the secondary storage deletion time and the deletion execution time of the secondary storage; and deleting the program file stored on the near line according to the near line storage deletion time and the near line storage deletion execution time.
In specific implementation, the storage system can comprise a multi-level storage mode such as three-level storage, two-level storage, near line storage and the like, and after the latest broadcasting time is determined, the three-level storage deleting time, the two-level storage deleting time and the near line storage deleting time can be respectively determined according to the latest broadcasting time; after determining the deletion time, the execution time of the deletion may be further determined, that is: deleting the program files stored in the third level according to the deletion time of the third level storage and the deletion execution time of the third level storage; deleting the program files on the secondary storage according to the secondary storage deletion time and the deletion execution time of the secondary storage; and deleting the program file stored on the near line according to the near line storage deletion time and the near line storage deletion execution time.
According to the embodiment of the application, the deleting time of different program files on each level of storage can be determined, and the deleting operation is performed according to the deleting execution time of each level of storage, so that the extinction time of the program files on different levels of storage is suitable for the self condition rather than the unified deletion in the prior art.
In implementation, the three-level storage deletion time TdeoThe latest broadcasting time T of the program fileB2+To，To＝MAX(To1，To2，...Toi，...)，Toi is the retention time of the pre-configured ith channel on the tertiary storage; the secondary storage deletion time TdesThe latest broadcasting time T of the program fileB2+Ts，Ts＝MAX(Ts1，Ts2，...Tsi，...)，Tsi is the retention time of the pre-configured ith channel on the secondary storage; the near line memory delete time TdeaThe latest broadcasting time T of the program fileB2+Ta，Ta＝MAX(Ta1，Ta2，...Tai，...)，Tai is the retention time of the pre-configured ith channel on the near-line storage.
In a specific implementation, the deletion time of each level of storage may be the sum of the latest broadcast time of the program file and the maximum value of the retention time of each channel in the level of storage configured in advance.
According to the method and the device, the service gathering time period is dispersed to carry out file preparation and deletion in each level of storage domain through the flexibly configurable program file life cycle management strategy, so that the intelligent management of the file flow of the broadcasting system is embodied, the use efficiency of the system is improved, and the management of file preparation and deletion is in accordance, in accordance with the file preparation and deletion, flexibly configured and the like.
Example II,
Fig. 2 shows a schematic flowchart of a program file deleting method implemented in an embodiment of the present application, and as shown in the figure, the program file deleting method may include the following steps:
and 203, deleting the program files in the storage system according to the deletion time of the storage system and the preset deletion execution time of the storage system after the program files are broadcasted at the latest.
In specific implementation, the retention time of the program file stored at each level may be configured in advance, for example: the secondary storage is reserved for 3 days, the tertiary storage is reserved for 1 day, and the near-line storage is reserved for 60 days.
When a file is broadcast in a plurality of program lists, the deletion time of the file is recalculated according to the latest broadcast time, if the obtained deletion time is earlier than the existing deletion time, the deletion time of the file is not changed, and if the deletion time is later, the calculated deletion time is used as the new file deletion time.
In implementation, the determining the deletion time of the storage system according to the latest broadcast time of the program file on each channel may specifically be: determining the third-level storage deletion time, the second-level storage deletion time and the near-line storage deletion time according to the latest broadcasting time of the program file on each channel;
the deleting the program file in the storage system according to the deleting time of the storage system and the deleting execution time of the pre-configured storage system may specifically be:
deleting the program files stored in the third level according to the deletion time of the third level storage and the deletion execution time of the third level storage; deleting the program files on the secondary storage according to the secondary storage deletion time and the deletion execution time of the secondary storage; and deleting the program file stored on the near line according to the near line storage deletion time and the near line storage deletion execution time.
In specific implementation, the deletion execution time of each level of storage may be configured in advance, for example: the deletion execution time of the secondary storage is 2:00 per day, the deletion execution time of the tertiary storage is 5:00 per day, and the deletion execution time of the near-line storage is 1:00 per day.
Specifically, the delete execution time may be as shown in table 2.1 below:
due to the above formula (file deletion time T)DLast playing time T of fileB2+ retention time TK) The program file A is only the calculated theoretical deletion time, and the actual deletion execution time is determined by the deletion thread according to the set deletion execution time plus the running period of the thread. So the thread is actually deleted when it reaches the execution time set by the second level.
For example: suppose that the deletion of program file A on secondary storage takes time TDES2A, if TDA＜＝TDES2A performs the action of deleting file a.
In implementation, the three-level storage deletion time TdeoBijia (institute)The latest broadcasting time T of the program fileB2+To，To＝MAX(To1，To2，...Toi，...)，Toi is the retention time of the pre-configured ith channel on the tertiary storage; the secondary storage deletion time TdesThe latest broadcasting time T of the program fileB2+Ts，Ts＝MAX(Ts1，Ts2，...Tsi，...)，Tsi is the retention time of the pre-configured ith channel on the secondary storage; the near line memory delete time TdeaThe latest broadcasting time T of the program fileB2+Ta，Ta＝MAX(Ta1，Ta2，...Tai，...)，Tai is the retention time of the pre-configured ith channel on the near-line storage.
In specific implementation, the retention time of the file of each channel in the storage system may be configured in advance, which may be specifically as shown in table 2.2 below:
| channel with a plurality of channels | Secondary storage | Three-level storage | Near line memory |
| CH1 | Ts1 | To1 | Ta1 |
| CH2 | Ts2 | To2 | Ta2 |
| … | … | … | … |
| CHi | Tsi | Toi | Tai |
| … | … | … | … |
Time T for deleting files of each memory bankDThe last broadcast time T of the program fileB2+ retention time TK；
Retention time is the retention time of the program file referenced by the program guide:
secondary storage retention time TSK＝MAX(TS1，TS2，TS3，...，TSi，TS(i+1)，...)；
Three-level storage retention time TOK＝MAX(TO1，TO2，TO3，...，TOi，TO(i+1)，...)；
Near line memory retention time TAK＝MAX(TA1，TA2，TA3，...，TAi，TA(i+1)，...)；
For example: if there is program file A stored on the secondary storage and played out by channels CH1, CH3, and the last playing time is TB2A, then the program file A is stored on the secondary storageDeletion time T ofDA may be:
retention time T of the program file A on secondary storageSKA＝MAX(TSA1，TSA3)；
The deletion time T of the program file A on the secondary storageDA＝TB2A+TSKA。
In an implementation, before determining the latest broadcast time according to the broadcast time of the program file on each channel, the method may further include:
determining the earliest broadcast channel and the earliest broadcast time T according to the broadcast time of the program file in each channelB1；
According to the earliest broadcasting time TB1And the preset prepared door opening time T of the earliest broadcasting channelcDetermining a file staging time T for the program filep；
And migrating the program file to a secondary storage of a broadcasting system, and executing the preparation.
In practice, the file preparation time Tp-the earliest broadcast time T of said program fileB1-a scheduled open time T for said earliest broadcast channelc。
In an implementation, after the performing the preparation, before the determining a latest broadcast time according to the broadcast time of the program file on each channel, the method may further include:
and migrating the program file from the secondary storage to the tertiary storage according to the broadcast execution list.
In the implementation, the execution servicing may specifically be: and when the file preparation time is more than or equal to the preparation execution time, performing preparation, wherein the preparation execution time is determined according to the preparation required time obtained by the preparation thread calculation and the running period of the thread.
Example III,
To facilitate the practice of the present application, a specific example is described below.
Fig. 3 is a schematic diagram illustrating a program file flow of a broadcast system in an embodiment of the present application, where as shown in the drawing, a storage domain of the broadcast system according to the embodiment of the present application includes: two playout secondary stores (shown as playout system secondary stores S1, S2), multiple playout server stores (i.e., tertiary stores, e.g., playout system tertiary stores O1, O2, O3, O4 as shown), and one near-line storage system (shown as playout system near-line store a 1).
Each program file has an overall life cycle in the broadcasting domain, and has an independent life cycle in different storage domains, and the processes from the generation of the program file in storage to the extinction are carried out. The life cycle management of the broadcast system program file may include the following:
first, configuration of program file life cycle
The document driving conditions for transferring the configuration program file from the external system or the near-line storage to the broadcasting secondary storage are as follows: program scheduling list and program change list;
the method comprises the following steps of configuring the integral door opening time of a program file transferred from an external system or near-line storage to broadcasting secondary storage, for example: 72 hours before sowing.
The document driving conditions for migrating the program file from the broadcasting secondary storage to the broadcasting tertiary storage are as follows: broadcasting an execution list;
other conditions for transferring the configuration program file from the secondary storage to the broadcasting tertiary storage are as follows: and the program file is in a pass state.
Second, information management of program files
The main information of the program file information management table (CLIPINFO) of the broadcasting system may include the following table 3.1:
STORAGEID: a 10-bit integer value, which may indicate the existence of program files in 10 memory banks, has an initial value of 0x00, and if a certain memory bank exists in a program file, the corresponding position is 1. In the present system, the memory banks include 7 in total: secondary storage S1, S2, tertiary storage O1, O2, O3, O4, and near-line storage N.
For example: for a program file:
presence of S1, STORAGEID ═ 0x1
Presence of S2, STORAGEID ═ 0x2
Presence of O1, STORAGEEID ═ 0x4
…
S1 and S2, STORAGEID ═ S1| S2 ═ 0x3
There are S1, S2 and O1, O2, STORAGEEID ═ 0xF
…
Third, program file life cycle of each memory bank
1. Program file generation and extinction for broadcast systems
1) Generating
And starting the secondary preparation by the broadcast program file preparation software according to the program document and the set door opening time (such as 72 hours before broadcasting) of the secondary preparation. If the program file does not have the storage in the broadcasting, the preparation software requests the program file from an external media resource system (primary storage), the media resource system carries out a migration task under the condition of preparing the program file until the program file and the attached related information, such as a program file technical examination list, a quality inspection report and the like, are migrated simultaneously, and the related information of the file is recorded in a program file information management table (CLIPINFO), at the moment, the program file starts in the life cycle of the broadcasting system, and then, the program file subsequently starts to migrate in all levels of storage bodies in the broadcasting system.
2) Death and death
The broadcast system file program extinction can be divided into manual deletion and automatic deletion.
The manual deletion may be performed by retrieving a file to be deleted from a file manager in the file filing management software, deleting all the banks of the broadcasting system, and deleting the file information of the program file information management table (CLIPINFO).
Automatic deletion is divided into natural extinction and non-broadcast single-drive deletion. The natural casualties may be deleted according to the system deletion policy provided in the embodiments of the present application. The deletion by the unplayable list driver means that the broadcast system deletes the file information of the program file information management table (CLIPINFO) from each broadcast storage after receiving the program unplayable notice from the program production management system.
2. Program file generation and extinction in secondary storage
1) Generating
And starting the secondary preparation by the broadcast program file preparation software according to the program document and the set door opening time (such as 72 hours before broadcasting) of the secondary preparation. If the program file does not have broadcasting secondary storage, the reorganizing and preparing software requests the program file from broadcasting near-line storage, if the program file does not have near-line storage, the reorganizing and preparing software requests the file from a medium resource system, when the migration to the secondary storage is completed, file related information is recorded in a program file information management table (CLIPINFO), and the program file is generated in the secondary.
2) Death and death
The second-level file program extinction can be divided into manual deletion and automatic deletion.
The manual deletion may be performed by retrieving a file to be deleted in file management in the file filing management software, and marking the STORAGEID value of the program file information management table (CLIPINFO).
The automatic deletion is performed according to the system deletion policy provided by the embodiment of the application.
3. Program file generation and extinction in three-level storage
1) Generating
And the broadcast program file preparation software starts three-level preparation according to the manual review state and the broadcast execution list of the files in the secondary storage. If the program file of the secondary storage passes the audit, the HUMANCHECK field in the program file information management table (CLIPINFO) is modified.
Through the program files which are checked and are in the broadcast execution list, the reorganizing software can generate a task of migrating to the third level, when the migration is completed, when the files are migrated to the third level for storage, the related information of the files is recorded in a program file information management table (CLIPINFO), and at the moment, the program files are generated in the third level. The program files existing on the tertiary storage are played out through the play out execution list.
2) Death and death
The three-level stored file program extinction can be divided into manual deletion and automatic deletion.
Manually, the file to be deleted can be deleted after being retrieved in the file management in the file filing management software, and the STORAGEEID value of the program file information management table (CLIPINFO) in the database is marked.
The automatic deletion is performed according to the system deletion policy provided by the embodiment of the application.
4. Program file generation and extinction in near-line storage
1) Generating
The generation of near-line storage is completed before the automatic deletion of the program file stored in the secondary storage.
2) Death and death
The program extinction of the near-line storage file can be divided into manual deletion and automatic deletion.
Manually, the file to be deleted is retrieved from the file management in the file filing management software, and then deleted, and the STORAGEID value of the program file information management table (CLIPINFO) is marked.
The automatic deletion is performed according to the system deletion policy provided by the embodiment of the application.
The generation and extinction of the program file a on the three banks are described in detail below.
Suppose that: program a was aired on CH1 and CH4 with the air times on the air program being 6 months, 16 days, 12:30 and 6 months, 17 days, 17:40, respectively.
Retention time Table 3.2
The delete execution time table 3.3 may be as follows:
assuming that a broadcasting system does not exist in the program file A, the earliest broadcasting time is 6 months, 16 days, 12:30, and the time of migration from a medium resource system (external system) is 6 months, 13 days, 12:30 minutes (the migration is carried out 72 hours in advance); after the migration is completed, the information is recorded in the program file information management table (CLIPINFO).
And after the manual review, modifying the HUMANCHECK, starting migration from the secondary storage to the tertiary storage according to an operation rule of HUMANCHECK | ═ STORAGEID ═ 0x2, and modifying STORAGEID according to the broadcast execution single file, wherein the file A is migrated and waits for broadcast in 16 months and 16 days, 12:30 CH1, and broadcast in 17:40 in 17 months and 46, and the file A reaches the decline period after the broadcast is completed.
The program file information management table 3.4 can be as follows:
the deletion time of the tertiary storage is the latest use date + MAX (2, 1), that is, 2016 year 6, month 17 plus the longest retention time of 1 channel and 4 channels on the tertiary storage for 2 days.
The deletion time of the secondary storage is the latest use date + MAX (4, 5), i.e. 2016 year 6, month 17 plus the longest retention time of 1 channel and 4 channels on the secondary storage for 5 days.
The deletion time of the near-line storage is the latest usage date + MAX (30, 30), that is, 2016, 6, 17 th day plus the maximum retention time of 1 channel and 4 channels on the near-line storage for 30 days.
After the broadcasting is finished, the deleting strategy is effective, the file manager always detects whether the decline period of the program file A reaches a death point, and according to the set length of the storage retention time at each level: t isOi＜TSi＜TAi：
Three levels of storage 1, 2, will be deleted earlier, at 2016/6/19 at 3: 23.
It is then secondary storage 1, 2 that executes at 2016/6/22 in 4:30 minutes.
Finally, the near line store is executed at 2016/7/16 in 4:32 minutes.
After the near-line storage is deleted, the life cycle of the file A is ended, and all the related accompanying information is deleted.
The embodiment of the application is based on channel management, calculates the door opening time of program file preparation and the deletion time of program file extinction according to a program list, and carries out flexible service peak staggering processing through configurable execution time, and provides a management method for the beginning and the end of the life cycle of a broadcasting system of the program file.
In addition, a detailed execution scheme is provided for the life cycle management of the program files of the broadcasting system and the life cycle management of the program files stored at all levels of the broadcasting system.
Based on the same inventive concept, the embodiment of the application also provides a device for preparing and deleting the program files, and as the principle of solving the problems of the devices is similar to a method for preparing and deleting the program files, the implementation of the devices can be referred to the implementation of the method, and repeated parts are not described again.
Example four,
Fig. 4 shows a schematic structural diagram of a program file preparation apparatus in an embodiment of the present application, and as shown in the drawing, the program file preparation apparatus may include:
a first determining module 401, configured to determine an earliest broadcast channel and an earliest broadcast time T according to the broadcast time of the program file on each channelB1；
A second determining module 402, configured to determine the earliest broadcasting time T according to the earliest broadcasting time TB1And the preset prepared door opening time T of the earliest broadcasting channelcDetermining a file staging time T for the program filep；
A migration module 403, configured to migrate the program file to a secondary storage of a broadcast system;
a staging module 404 for performing the staging.
In an implementation, the migration module may be further configured to migrate the program file from the secondary storage to the tertiary storage according to a broadcast execution list.
In practice, the file preparation time Tp-the earliest broadcast time T of said program fileB1-a scheduled open time T for said earliest broadcast channelc。
In implementation, the preparation module may be specifically configured to execute preparation when the file preparation time is greater than or equal to a preparation execution time, where the preparation execution time is determined according to the preparation required time calculated by the preparation thread and a running period of the thread itself.
Example V,
Fig. 5 is a schematic structural diagram of a program file deleting device in an embodiment of the present application, and as shown in the drawing, the program file deleting device may include:
a third determining module 501, configured to determine the latest broadcast time according to the broadcast time of the program file on each channel;
a fourth determining module 502, configured to determine the deletion time of the storage system according to the latest broadcast time and the retention time of each preconfigured channel in the storage system; the deletion time of the storage system is the sum of the latest broadcasting time and the maximum value of the retention time of each channel in the storage system;
a deleting module 503, configured to delete the program file in the storage system according to the deletion time of the storage system and a preset deletion execution time of the storage system after the program file is played at the latest.
In implementation, the fourth determining module may be specifically configured to determine the third-level storage deletion time, the second-level storage deletion time, and the near-line storage deletion time according to the latest broadcast time of the program file on each channel;
the deleting module may be specifically configured to delete the program file on the tertiary storage according to the tertiary storage deletion time and the tertiary storage deletion execution time, delete the program file on the secondary storage according to the secondary storage deletion time and the secondary storage deletion execution time, and delete the program file on the near-line storage according to the near-line storage deletion time and the near-line storage deletion execution time.
In implementation, the three-level storage deletion time TdeoThe latest broadcasting time T of the program fileB2+To，To＝MAX(To1，To2，...Toi，...)，Toi is the retention time of the pre-configured ith channel on the tertiary storage; the secondary storage deletion time TdesThe latest broadcasting time T of the program fileB2+Ts，Ts＝MAX(Ts1，Ts2，...Tsi，...)，Tsi is the retention time of the pre-configured ith channel on the secondary storage; the near line memory delete time TdeaThe latest broadcasting time T of the program fileB2+Ta，Ta＝MAX(Ta1，Ta2，...Tai，...)，Tai is the retention time of the pre-configured ith channel on the near-line storage.
For convenience of description, each part of the above-described apparatus is separately described as being functionally divided into various modules or units. Of course, the functionality of the various modules or units may be implemented in the same one or more pieces of software or hardware when implementing the present application.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
While the preferred embodiments of the present application have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including preferred embodiments and all alterations and modifications as fall within the scope of the application.
Claims (14)
1. A method for reorganizing program files is characterized by comprising the following steps:
determining the earliest broadcast channel and the earliest broadcast time T according to the broadcast time of the program file in each channelB1；
According to the earliest broadcasting time TB1And the preset prepared door opening time T of the earliest broadcasting channelcDetermining a file staging time T for the program filep；
And migrating the program file to a secondary storage of a broadcasting system, and executing the preparation.
2. The method of claim 1, further comprising: and migrating the program file from the secondary storage to the tertiary storage according to the broadcast execution list.
3. The method of claim 1, wherein the file staging time Tp-the earliest broadcast time T of said program fileB1-a scheduled open time T for said earliest broadcast channelc。
4. The method according to claim 1, wherein the performing servicing is in particular: and when the file preparation time is more than or equal to the preparation execution time, performing preparation, wherein the preparation execution time is determined according to the preparation required time obtained by the preparation thread calculation and the running period of the thread.
5. A method for deleting a program file is characterized by comprising the following steps:
determining the latest broadcasting time according to the broadcasting time of the program file on each channel;
determining the deletion time of the storage system according to the latest broadcasting time and the retention time of each preset channel in the storage system; the deletion time of the storage system is the sum of the latest broadcasting time and the maximum value of the retention time of each channel in the storage system;
and after the program file is played at the latest, deleting the program file in the storage system according to the deletion time of the storage system and the preset deletion execution time of the storage system.
6. The method according to claim 5, wherein the determining the deletion time of the storage system according to the latest broadcasting time of the program file on each channel comprises: determining the third-level storage deletion time, the second-level storage deletion time and the near-line storage deletion time according to the latest broadcasting time of the program file on each channel;
the deleting the program file in the storage system according to the deleting time of the storage system and the deleting execution time of the pre-configured storage system specifically comprises:
deleting the program files stored in the third level according to the deletion time of the third level storage and the deletion execution time of the third level storage; deleting the program files on the secondary storage according to the secondary storage deletion time and the deletion execution time of the secondary storage; and deleting the program file stored on the near line according to the near line storage deletion time and the near line storage deletion execution time.
7. The method of claim 6, wherein the tertiary storage delete time TdeoThe latest broadcasting time T of the program fileB2+To，To＝MAX(To1，To2，...Toi，...)，Toi is the retention time of the pre-configured ith channel on the tertiary storage; the secondary storage deletion time TdesThe latest broadcasting time T of the program fileB2+Ts，Ts＝MAX(Ts1，Ts2，...Tsi，...)，Tsi is the retention time of the pre-configured ith channel on the secondary storage; the near line memory delete time TdeaThe latest broadcasting time T of the program fileB2+Ta，Ta＝MAX(Ta1，Ta2，...Tai，...)，Tai is the retention time of the pre-configured ith channel on the near-line storage.
8. A program file preparation apparatus, comprising:
first of allA determining module for determining the earliest broadcasting channel and the earliest broadcasting time T according to the broadcasting time of the program file in each channelB1；
A second determining module for determining the earliest broadcasting time TB1And the preset prepared door opening time T of the earliest broadcasting channelcDetermining a file staging time T for the program filep；
The migration module is used for migrating the program file to secondary storage of a broadcasting system;
and the preparation module is used for executing preparation.
9. The apparatus of claim 8, wherein the migration module is further for migrating the program file from secondary storage to tertiary storage according to a playout execution list.
10. The apparatus of claim 8, wherein the file staging time Tp-the earliest broadcast time T of said program fileB1-a scheduled open time T for said earliest broadcast channelc。
11. The apparatus of claim 8, wherein the preparation module is specifically configured to perform preparation when the file preparation time is greater than or equal to a preparation execution time, and the preparation execution time is determined according to a preparation thread calculation-derived preparation required time and a thread running cycle.
12. A program file deleting apparatus, comprising:
the third determining module is used for determining the latest broadcasting time according to the broadcasting time of the program file on each channel;
a fourth determining module, configured to determine the deletion time of the storage system according to the latest broadcast time and the retention time of each pre-configured channel in the storage system; the deletion time of the storage system is the sum of the latest broadcasting time and the maximum value of the retention time of each channel in the storage system;
and the deleting module is used for deleting the program files in the storage system according to the deleting time of the storage system and the preset deleting execution time of the storage system after the program files are broadcasted at the latest.
13. The apparatus according to claim 12, wherein the fourth determining module is specifically configured to determine a tertiary storage deletion time, a secondary storage deletion time, and a near-line storage deletion time according to a latest broadcast time of the program file on each channel; the deleting module is specifically configured to delete the program file on the tertiary storage according to the tertiary storage deletion time and the tertiary storage deletion execution time, delete the program file on the secondary storage according to the secondary storage deletion time and the secondary storage deletion execution time, and delete the program file on the near-line storage according to the near-line storage deletion time and the near-line storage deletion execution time.
14. The apparatus of claim 13, in which the tertiary storage delete time TdeoThe latest broadcasting time T of the program fileB2+To，To＝MAX(To1，To2，...Toi，...)，Toi is the retention time of the pre-configured ith channel on the tertiary storage; the secondary storage deletion time TdesThe latest broadcasting time T of the program fileB2+Ts，Ts＝MAX(Ts1，Ts2，...Tsi，...)，Tsi is the retention time of the pre-configured ith channel on the secondary storage; the near line memory delete time TdeaThe latest broadcasting time T of the program fileB2+Ta，Ta＝MAX(Ta1，Ta2，...Tai，...)，Tai is the retention time of the pre-configured ith channel on the near-line storage.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610915111.4A CN106507152B (en) | 2016-10-20 | 2016-10-20 | Method and device for preparing and deleting program files |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610915111.4A CN106507152B (en) | 2016-10-20 | 2016-10-20 | Method and device for preparing and deleting program files |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106507152A CN106507152A (en) | 2017-03-15 |
| CN106507152B true CN106507152B (en) | 2020-01-03 |
Family
ID=58318038
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610915111.4A Active CN106507152B (en) | 2016-10-20 | 2016-10-20 | Method and device for preparing and deleting program files |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106507152B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109819275B (en) * | 2019-01-16 | 2021-03-16 | 中央电视台 | 4K ultra-high-definition video server playing channel multiplexing method, workstation and system |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103067744A (en) * | 2012-12-28 | 2013-04-24 | 中央电视台 | Media file hostling method capable of regulating priority level dynamically and in real time |
| CN103095968A (en) * | 2012-12-28 | 2013-05-08 | 中央电视台 | Multi-scene self-adapting emergency handling method for broadcast system |
| CN103596022A (en) * | 2013-10-08 | 2014-02-19 | 深圳创维数字技术股份有限公司 | Method, device and system for content matching |
| CN103747281A (en) * | 2013-12-27 | 2014-04-23 | 乐视网信息技术（北京）股份有限公司 | Broadcasting method and broadcasting channel equipment |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7433946B2 (en) * | 2004-08-12 | 2008-10-07 | Microsoft Corporation | Mechanism for transmitting elementary streams in a broadcast environment |
-
2016
- 2016-10-20 CN CN201610915111.4A patent/CN106507152B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103067744A (en) * | 2012-12-28 | 2013-04-24 | 中央电视台 | Media file hostling method capable of regulating priority level dynamically and in real time |
| CN103095968A (en) * | 2012-12-28 | 2013-05-08 | 中央电视台 | Multi-scene self-adapting emergency handling method for broadcast system |
| CN103596022A (en) * | 2013-10-08 | 2014-02-19 | 深圳创维数字技术股份有限公司 | Method, device and system for content matching |
| CN103747281A (en) * | 2013-12-27 | 2014-04-23 | 乐视网信息技术（北京）股份有限公司 | Broadcasting method and broadcasting channel equipment |
Non-Patent Citations (1)
| Title |
|---|
| 温州广播电视总台播总控准备系统设计及实现;潘雨凯;《中国有线电视》;20110112(第11期);第2.,2节 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106507152A (en) | 2017-03-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103970833B (en) | The solution of bi-directional synchronization datacycle in a kind of heterogeneous database synchronization system based on daily record | |
| CN104065906B (en) | Video recording method and device of digital video recording equipment | |
| US8782053B2 (en) | Data streaming for interactive decision-oriented software applications | |
| CN110209728A (en) | A kind of Distributed Heterogeneous Database synchronous method, electronic equipment and storage medium | |
| US20130013648A1 (en) | Method for database storage of a table with plural schemas | |
| CN106648897A (en) | SOLR cluster extension method and system supporting resource balancing | |
| CN103246549B (en) | A kind of method and system of data conversion storage | |
| CN103474087A (en) | Video recording file management method and device for easily preventing disk fragments from being generated | |
| CN106507152B (en) | Method and device for preparing and deleting program files | |
| CN1218520C (en) | Material supplying system and material supplying method | |
| CN102209204A (en) | Programme layout method based on template and system thereof | |
| EP3391222A1 (en) | Log fragmentation method and apparatus | |
| CN106682021A (en) | Database migration method and device | |
| US8958684B2 (en) | Screening management system, screening management method and program product | |
| CN109446268A (en) | A kind of method of data synchronization and device | |
| CN111159020B (en) | Method and device applied to synchronous software test | |
| CN108959456A (en) | A kind of method of automatic recovery completion data | |
| CN104376055A (en) | Large-scale data comparison method based on fragmentation technology | |
| CN104461915A (en) | Method and device for dynamically allocating internal storage in online class system | |
| CN104077409A (en) | Method for quickly splitting and merging file on basis of restructured file metadata | |
| CN104268013B (en) | Fast system-wide simulator certainty replaying method | |
| CN105045885B (en) | The method of quality control and device of mixed source excitation cross-line beam auxiliary data | |
| TWI303058B (en) | A recording media for video file storage and a method for video file editing | |
| CN102376325A (en) | Mixed play system for multiple audio files and control method for mixed play system | |
| CN104935972B (en) | One kind broadcasting single edit methods and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |