CN112040283B - Method and system for splitting video mass selection list - Google Patents
Method and system for splitting video mass selection list Download PDFInfo
- Publication number
- CN112040283B CN112040283B CN202011213653.XA CN202011213653A CN112040283B CN 112040283 B CN112040283 B CN 112040283B CN 202011213653 A CN202011213653 A CN 202011213653A CN 112040283 B CN112040283 B CN 112040283B
- Authority
- CN
- China
- Prior art keywords
- program
- year
- offset
- album
- information
- 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/23—Processing of content or additional data; Elementary server operations; Server middleware
- H04N21/232—Content retrieval operation locally within server, e.g. reading video streams from disk arrays
-
- 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/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
- H04N21/47—End-user applications
- H04N21/475—End-user interface for inputting end-user data, e.g. personal identification number [PIN], preference data
- H04N21/4756—End-user interface for inputting end-user data, e.g. personal identification number [PIN], preference data for rating content, e.g. scoring a recommended movie
-
- 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/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
- H04N21/47—End-user applications
- H04N21/482—End-user interface for program selection
- H04N21/4825—End-user interface for program selection using a list of items to be played back in a given order, e.g. playlists
Abstract
The invention discloses a method and a system for splitting a video mass selection list, wherein the method comprises the following steps: acquiring program change information; forming different types of granularity messages according to the program change information, and distributing the granularity messages; consuming the granularity message, and processing the message according to the processing logic corresponding to the granularity message type; storing the synchronous data obtained after synchronization; and acquiring and analyzing paging query request information of the user side, constructing a query request route by utilizing a routing algorithm, querying and aggregating the stored data, and returning the data to the user side. Compared with the prior art, the technical scheme of the invention can realize a fine-grained selection list of annual dimension level, reduce the time delay generated by data change, reduce the resource consumption and ensure the transparency of the query interface and the correctness of the data.
Description
Technical Field
The invention relates to the technical field of information processing, in particular to a method and a system for splitting a video mass selection list.
Background
With the increase of the demand of people on video resources, various video resources and comprehensive programs on the platform are increasingly abundant, the information of a selection list is gradually huge, and challenges are provided for performance resources and query accuracy.
However, the prior art adopts a non-splitting scheme for the selection list, but in this case, the following three problems are caused:
firstly, when a user searches the selection list in a paging manner, the selection list is too large in quantity, and the performance is affected when the selection list is turned backwards, such as delay in data change and small navigation of resources;
secondly, the information of the album list can be changed along with the data change of each single video corresponding to the list, when the number of the album list is huge, the information of a certain video is changed, so that the information of all the album lists needs to be changed, and at the moment, the CPU resource consumption, the memory resource consumption and the bandwidth cost are enlarged by N times due to the massive information change operation of the album list;
thirdly, when the single video information is changed, massive episode list information under the album needs to be updated in a cascading mode, time is consumed, and the time delay of the change of the data of the episode list is enhanced.
In summary, in the prior art, the problem of resource shortage, data change delay and the like exists due to the fact that the selection list is not split, and therefore a solution is urgently needed.
Disclosure of Invention
In view of this, the embodiment of the present invention provides a method and a system for splitting a video massive collection list.
An embodiment of the present invention provides a method for splitting a video massive collection list, including:
acquiring program change information, wherein the program change information comprises album program change information and single video program change information;
forming different types of granularity messages according to the album program change information and the single video program change information, and distributing the granularity messages;
consuming the granularity message and processing the message according to the processing logic corresponding to the granularity message type;
storing the synchronous data obtained after synchronization;
and acquiring and analyzing paging query request information of a user side, constructing a query request route by utilizing a routing algorithm, querying and aggregating the stored data, and returning the data to the user side.
Further, in the method for splitting the massive video album list, the granular messages include a first type of update message, a second type of update message, and a third type of update message, where the first type of update message is a message for updating the album list of the entire album, the second type of update message is a message for updating the album list assigned to the current album for one year, and the third type of update message is a message for updating the album list assigned to the current album for one video program.
Further, in the method for splitting the video massive collection list, the forming different types of granularity messages according to the album program change information and the single video program change information, and distributing the granularity messages includes:
forming an album list according to the album program change information and the single video program change information, and splitting the album list to obtain public meta information of the album program information and album list set information with the year as a dimension;
and forming the first type of updating message, the second type of updating message and the third type of updating message according to the album program changing information and the single video program changing information, and distributing various types of granularity messages.
Further, in the method for splitting the video massive collection list, the collection list includes album program information and single video program information, where the album program information is a program having a plurality of play subsets, and the single video program information is each play subset under the album program information.
Further, in the method for splitting the video massive collection list, the public meta-information includes an album program identifier ID, a total number of videos in all the individual programs of the album program, an album program type, and meta-data, where the meta-data is a plurality of sets of data pairs consisting of a year and a number of programs in the year; the collection information of the selected set list is document data formed by aggregating all single video program information with the year as a dividing basis since the on-line of the special editing program.
Further, in the method for splitting the video massive collection list, the step of acquiring and analyzing paging query request information of the user side, constructing a query request route by using a routing algorithm to query and aggregate the stored data, and returning the query request route to the user side includes:
acquiring paging query request information sent by a user in playing a video and clicking the option list;
analyzing the paging inquiry request information, and extracting effective parameters to obtain a must-pass parameter and a non-must-pass parameter, wherein the must-pass parameter comprises an album program ID, a current page number and the size of each page, and the non-must-pass parameter is the year;
calculating an offset starting position and an offset ending position according to the current page number and the size of each page;
judging whether the year exists or not;
if the year exists, directly routing to a storage service of a designated year to query data according to the album program ID, the starting offset, the ending offset and the year, and returning to the user side;
if the year does not exist, calculating according to the album program ID, the current page number and the size of each page to obtain the program offset of the beginning year and the program offset of the last year, inquiring and aggregating a corresponding selection list according to the quantity relation of the program offset of the beginning year and the program offset of the last year, and returning to the user side.
Further, in the method for splitting the video massive album list, the step of calculating according to the album program ID, the current page number and the size of each page to obtain the program offset of the beginning year and the program offset of the ending year, and querying and aggregating the corresponding album list according to the quantity relationship between the program offset of the beginning year and the program offset of the ending year includes:
inquiring the metadata of the program according to the album program ID, wherein the metadata comprises a plurality of data pairs which are arranged in a reverse order according to the year;
calculating the total number of programs, the starting year of the current page program and the final year of the current page program by using the offset starting position, the offset ending position and the metadata;
calculating the program offset of the starting year and the program offset of the final year according to the total number of the programs, the starting year of the current page program and the final year of the current page program;
judging whether the program offset of the starting year is the same as the program offset of the final year;
if the two are the same, routing to a specified year query selection list;
if the two requests are different, the two requests are constructed and respectively routed to the query selection list in the appointed year.
Further, in the method for splitting the video massive collection list, the "calculating the total number of programs, the starting year of the current page program, and the final year of the current page program by using the offset start position, the offset end position, and the metadata" includes:
initializing the total number of programs, the variable quantity of the total number of the programs, the starting year of the current page program and the ending year of the current page program;
traversing the reverse order sequence of the metadata, and updating the total number of the programs in a numerical mode when a group of metadata is traversed, and calculating corresponding metadata starting offset and metadata ending offset;
and obtaining the starting year and the final year of the current page program according to the quantity relationship between the offset starting position and the offset ending position and the metadata starting offset and the metadata ending offset.
Further, in the method for splitting the video massive collection list, the step of numerically updating the total number of the programs each time a set of metadata is traversed, and the step of calculating the corresponding metadata start offset and the corresponding metadata end offset includes:
and assigning the program total variation to the metadata initial offset every time a group of metadata is traversed, and adding the current program total amount to the program total variation to obtain the updated program total amount.
Another embodiment of the present invention provides a system for splitting a massive video selection list, including:
the system comprises a message service unit, a program change information acquisition unit and a program change information processing unit, wherein the message service unit is used for acquiring the program change information, and the program change information comprises album program change information and single video program change information; forming different types of granularity messages according to the album program change information and the single video program change information, and distributing the granularity messages;
the synchronous service unit is used for consuming the granularity message and processing the message according to the processing logic corresponding to the granularity message type;
the storage service unit is used for storing the synchronous data obtained after synchronization;
and the query service unit is used for acquiring and analyzing paging query request information of the user side, constructing a query request route by utilizing a routing algorithm, querying and aggregating the stored data, and returning the data to the user side.
Another embodiment of the present invention provides a terminal, including: a processor and a memory, the memory storing a computer program for execution by the processor to implement the plurality of IMU time synchronization methods described above.
Yet another embodiment of the present invention provides a computer-readable storage medium storing a computer program, which when executed, implements the method for supporting multi-dimensional content aggregation display for a VR all-in-one machine.
The method provided by the embodiment of the invention is based on a new data structure, and splits the data into a metadata part and a specific information part split according to the online year of the video when the data of the selection list is synchronously updated, so that the fine-grained selection list of the annual dimensionality level is realized, and the delay caused by overlarge data of the selection list is favorably reduced when a user queries the data of the selection list by turning pages; the produced three-granularity information corresponds to data change of three granularities, so that the data can be timely and accurately changed, the time delay of data updating is reduced, and the resource consumption of a CPU (central processing unit) and network bandwidth during data updating is reduced; the routing algorithm involved in the query of the list interface can effectively bond the split data of the selected set list, thereby ensuring the correctness of the data. Compared with the prior art, the method provided by the embodiment of the invention can reduce the time delay generated by data change, reduce the resource consumption, ensure the transparency of the query interface and the correctness of the data, and has strong application value.
Drawings
In order to more clearly illustrate the technical solution of the present invention, the drawings required to be used in the embodiments will be briefly described below, and it should be understood that the following drawings only illustrate some embodiments of the present invention, and therefore should not be considered as limiting the scope of the present invention. Like components are numbered similarly in the various figures.
Fig. 1 shows a first flowchart of a method for splitting a video massive collection list according to an embodiment of the present invention;
FIG. 2 is a second flowchart of step S102 according to the embodiment of the present invention;
FIG. 3 is a schematic diagram of a third flow chart of step S105 according to the embodiment of the present invention;
FIG. 4 is a fourth flowchart illustrating step S3052 according to an embodiment of the present invention;
FIG. 5 is a fifth flowchart illustrating step S402 according to an embodiment of the present invention;
FIG. 6 is a sixth flowchart of a routing algorithm according to an embodiment of the present invention;
fig. 7 is a schematic diagram of a system structure for splitting a video massive collection list according to an embodiment of the present invention.
Description of the main element symbols:
10-a message service unit; 20-a synchronization service unit; 30-storage service unit; 40-query service Unit.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments.
Example 1
Referring to fig. 1, the present embodiment provides a method for splitting a massive video selection list, which is suitable for a scene with abundant video resources and a huge data volume of the selection list. The method of the embodiment is based on a new data structure, when the data of the selection list is synchronously updated, the data is split into a metadata part and a specific information part split according to online years of the video, the fine-grained selection list of the annual dimensionality level is realized, and meanwhile, the routing algorithm is designed in the query list interface to bond the split selection list data, so that the transparency of the query interface of the user list and the correctness of the data are ensured.
As shown in fig. 1, the following describes the method for splitting the video massive collection list in detail.
Step S101, acquiring program change information, wherein the program change information comprises album program change information and single video program change information;
step S102, forming different types of granularity messages according to the album program change information and the single video program change information, and distributing the granularity messages;
step S103, consuming the granularity message and processing the message according to the processing logic corresponding to the granularity message type;
step S104, storing the synchronous data obtained after synchronization;
step S105, obtaining and analyzing paging query request information of the user side, constructing a query request route by utilizing a routing algorithm, querying and aggregating the stored data, and returning the data to the user side.
Specifically, the granularity message type is defined by a developer according to a service model and includes a first type update message, a second type update message and a third type update message, wherein the first type update message is a message for updating an album list of the entire album, the second type update message is a message for updating an album list of a current album specified for one year, and the third type update message is a message for updating a single video program specified for the current album. Each type has corresponding logic processing, a self-defined message manager is started when the program is started each time, all defined message types and message processing services corresponding to the types are stored in a data structure of the Map, and the services comprise the logic processing flow of the business. When the synchronization service pulls and consumes a message (granularity message) from the message server, because the message body contains the type of the message, the corresponding message processing service can be acquired from the message manager and the business logic can be executed.
Referring to fig. 2, step S102 includes the following sub-steps:
the substep S201 is that an album program change information and a single video program change information are formed into an album list, and the album list is split to obtain public meta information of the album program information and album list set information with the year as the dimension;
and a substep S202, forming a first type of updating message, a second type of updating message and a third type of updating message according to the album program changing information and the single video program changing information, and distributing various types of granularity messages.
Specifically, the selection list includes album program information and single video program information, where the album program information is a program having a plurality of play subsets; the single video program information is each broadcast subset under the album program information. The common meta information includes an album program identifier ID, a total number of videos in all the videos of the album program, a type of the album program, and meta data, where the meta data is a plurality of sets of data pairs consisting of a year and a number of programs in the year, for example, a general art program is online for 500 th in 2018, a 600 th in 2019, and a 500 th in 2020. There will be three pieces of data, each piece of data having a year value and a total number of videos corresponding thereto; the information of the collection list set is document data formed by aggregating all single video program information divided according to the year since the on-line of the special program, for example, if a 500-stage program is on-line in 2020, there is a corresponding document data aggregation of the 50-stage program, and if a 600-stage program is on-line in 2019, there is a new document data aggregation of the 60-stage program information.
It is understood that the album program information refers to a series of tv programs similar to tv dramas, anarchy, partially homemade works, etc. having playable subset videos, and the data integration between the tv programs and the single video program constitutes an album list. In order to split the massive selection list, the embodiment divides the previous selection list information into two parts: one is common meta-information of album program information, and the other is album list set information with the year as the dimension. When the album program information or the single video program information is changed, three types of messages, namely the first type of update message, the second type of update message and the third type of update message, are correspondingly generated according to the current environment, wherein the granularity is divided according to the situation that when the information in the album program or the single video program is changed, the album list needs to be synchronously changed. If a single video program is changed from being available for VIP to being available for free, the corresponding single video in the album list information also needs to be changed from being available for VIP to being available for free. The granularity is the cost of computing resources including a CPU, a memory and a network bandwidth, which need to be paid to ensure that the data of the selection list is consistent with the information of the album program and the single video program, and three types of information are correspondingly formed according to the order from high to low of the cost.
By splitting the collection list of the album type program into two parts, namely one part is metadata information of the album type program and the other part is collection list data with year as dimension, the delay of the user for inquiring the collection list data when turning the page is favorable for not becoming longer along with the enlargement of the collection list data. And the data change of three granularities of the whole album program collection list, the album program collection list in a certain year and a certain single video program information of the album program is supported, so that the data can be timely and accurately changed, the time delay of data update is reduced, and the resource consumption of a CPU (central processing unit) and network bandwidth during the data update is reduced.
Referring to fig. 3, step S105 includes the following sub-steps:
step S301, obtaining paging inquiry request information sent by a user in the starting video and the click selection list;
substep S302, analyzing the paging inquiry request information, and extracting effective parameters to obtain a compulsory transmission parameter and a non-compulsory transmission parameter, wherein the compulsory transmission parameter comprises an album program ID, a current page number and the size of each page, and the non-compulsory transmission parameter is the year;
step S303, calculating an offset initial position and an offset end position according to the current page number and the size of each page;
substep S304, judging whether the year exists;
if the year exists, executing a substep S3051, directly routing to a storage service of a specified year to query data according to the album program ID, the starting offset, the ending offset and the year, and returning to the user side;
if the year does not exist, executing a substep S3052, calculating to obtain a program offset of the beginning year and a program offset of the last year according to the program ID of the album, the current page number and the size of each page, inquiring and aggregating a corresponding selection list according to the quantity relationship of the program offset of the beginning year and the program offset of the last year, and returning the corresponding selection list to the user side.
Referring to fig. 4, the sub-step S3052 includes the following sub-steps:
substep S401, inquiring the metadata of the program according to the ID of the album program, wherein the metadata comprises a plurality of data pairs which are arranged in a reverse order according to the year;
a substep S402 of calculating the total number of programs, the starting year of the program on the current page and the final year of the program on the current page by using the offset starting position, the offset ending position and the metadata;
a substep S403, calculating the program offset of the starting year and the program offset of the final year according to the total number of programs, the starting year of the program on the current page and the program offset of the final year of the program on the current page;
a substep S404, judging whether the program offset of the starting year is the same as the program offset of the final year;
if the two are the same, executing a substep S4051, and routing to a specified year query selection list;
if not, then sub-step S4052 is performed to construct two requests to be routed to the query selection list in the specified year.
Referring to fig. 5, the substep S402 includes the substeps of:
the substep S501, initializing the total number of programs, the variation of the total number of programs, the starting year of the current page program and the ending year of the current page program;
substep S502, traverse the reverse order sequence of the metadata, and each traverse a group of metadata updates the total number of the programs, and calculates the corresponding metadata initial offset and metadata termination offset;
specifically, each time a set of metadata is traversed, the total program amount variation is assigned to the metadata starting offset, and the updated total program amount is obtained by adding the total program amount variation to the current total program amount.
And a substep S503, obtaining the starting year of the program on the current page and the final year of the program on the current page according to the offset starting position and the offset ending position and the quantity relationship between the metadata starting offset and the metadata ending offset.
Fig. 6 is a flow chart of a routing algorithm process according to an embodiment of the present invention. In order to better understand the processing flow of the routing algorithm provided by the embodiment of the present invention, a certain variety program is taken as an example for description.
Suppose that the comprehensive program is online from 2011 until 2018, a new program is online. Wherein 2011 has 38 th, 2012 has 56 th, 2014 has 3 rd, 2015 has 94 th, 2016 has 133 th, 2017 has 181 th and 2018 has 166 th. The paging inquiry request information of the user has only four parameters, namely, the unique ID identification of the album program, the current page number, the size of each page and the inquiry year (non-necessary parameters). In the database, data is stored by year, that is, a year is a piece of document data, and a piece of document data includes program data of all the periods of the year. The routing algorithm provided by the embodiment of the invention aims to ensure that a user obtains a correct and ordered selection list according to the four parameters.
After the request query and analysis of the VR all-in-one machine every time, the starting offset and the ending offset of a user for a program full-scale episode list data request can be obtained. Since the server splits the episode list data, the full-scale episode list data of the program is physically split, and in order to provide correct data to the user, it is necessary to ensure that the physically split data are logically integrated. When a user clicks a selection list of a certain variety program, page turning is started, the size of a known default page number is 4, year parameters are not transmitted, and the current page number is the first page. And starting to request data from the server, and analyzing the request and extracting parameters by the query service of the server. First, a start offset 0 and a stop offset 3 of the requested data are calculated based on the current page number 1 and the number of pages 4. If the year 2018 is transmitted in the request, the document data which contains the program information of the general art program 2018 in the 166 th period can be located in the database according to the album ID and the year, the program information of the previous 4 th period of the document and the total amount 166 are obtained according to the initial offset position 0 and the number 4 of each page and returned to the user, the user can calculate all the programs in the 2018 according to the total amount and can divide the programs into 42 pages, and the user can turn pages in turn to obtain all the collection list information of the general art program 2018.
If the year is not imported, the metadata of the variety program is inquired according to the ID of the album program, the metadata document comprises 7 selection set metadata which are sorted inversely according to the year, and each piece of metadata has two values, namely the year and the number of programs. The year and the number of programs of the 7 selection set metadata are respectively: 2018, 166; 2017,181, respectively; 2016,133, respectively; 2015, 94; 2014, 3; 2012, 56; 2011, 38; starting to traverse 7 pieces of metadata, setting a variable totalAmount (total number of programs) to be 0 before entering the traversal, starting year startmean of a current page program, and ending year endmean of the current page program. And starting traversal, assigning totalAmount to the offset initial position of the metadata every time one piece of metadata is traversed, adding a variable totalAmount to the total program amount in the piece of data, and assigning the totalAmount again. For example, when traversing the first piece of data, the variable totalAmount would be 166, the start offset value of the piece of metadata would be 0, and the end offset value would be 165. The start offset position and the end offset position of the remaining 6 pieces of metadata can be calculated by analogy. So finally totalAmount equals 671 and 7 pieces of metadata correspond to start and end offsets of 0,165, respectively; 166, 346; 347, 479; 480, 573; 574, 576; 577, 632; 633, 670. When a user accesses the first page of data, the start offset startNo is equal to 0 and the end offset endNo is equal to 3, in the process of traversing 7 pieces of metadata, the startNo is equal to 0 and is between the start position and the end position of the offset of the metadata corresponding to the 2018 year, the year 2018 of the piece of data can be assigned to the variable startmean, the endNo is equal to 3 and is less than the end position of the offset corresponding to the 2018 year, and the year 2018 of the piece of data can be assigned to the variable endmean. Finally, values of the three variables of totalAmount, startmean and endmean are 671, 2018 and 2018 respectively.
After the beginning year and the last year corresponding to the episode list information data of the current page required by the user are obtained, firstly, whether endYear has a value or whether startYear of the beginning year is equal to the last year is judged, and then whether all data required by the user fall in the episode list data corresponding to the beginning year is determined. If endmean has no value or startmean is equal to endmean, it indicates that the data required by the user corresponds to the same year of the program. For example, the data required by the users on pages 1 to 41 are in the document data corresponding to 2018 years of the anarchic program. The start offset and the end offset may be calculated according to equations (1) (2):
the initial offset is the initial offset obtained by analyzing the user request, namely the initial offset of the episode list data corresponding to the beginning year; (1)
terminating offset-starting offset + number of each page in user request; (2)
if the starting year is not equal to the final year, it indicates that a part of the data required by the user falls in the episode list data corresponding to the starting year, and a part of the data required by the user falls in the episode list data corresponding to the ending year, that is, a part of the data required by the user corresponds to data on startmean and a part of the data corresponds to data on endmean, so that a starting offset and an ending offset of the episode list data corresponding to the starting year and the ending year need to be calculated respectively. The calculation formula of each variable is shown in formulas (3) to (4):
start offset of start year-start offset of episode list data of year requested by user; (3)
the termination offset of the beginning year is the termination offset of the list data of the year; (4)
the starting offset of the end year is 0; (5)
the ending offset of the ending year is the ending offset requested by the user-the starting offset of the ending year list data + 1; (6)
returning to the present example, according to the starting offset position of the metadata corresponding to startmean subtracted by the starting offset position of the metadata corresponding to startmean as the starting offset position of the startmean document data query, the total number of the selection lists required in the startmean document data is calculated by subtracting the starting no plus 1 from the ending offset position of the metadata corresponding to startmean, 0 is also used as the starting offset position of the document data corresponding to endmean, and the total number of the selection data required in the endmean is calculated by subtracting the starting no plus 1 from the endNo corresponding to endmean from the end. If the user requests the data of page 42, it calculates startNo equal to 164 and endNo equal to 167, according to the above calculation method, it can calculate startmean equal to 2018 and endmean equal to 2017, and judge that it is necessary to query the program 2018 to query 3 episodes from 164, query the program 2017 document data to query 1 episode from 0, and finally aggregate the two results and return them to the user. The routing algorithm provided by the embodiment of the invention can ensure that the data can be correct in the integration process of querying any page of list data by a user.
The method for splitting the video massive collection list provided by the embodiment comprises the steps of firstly obtaining program change information, forming different types of granularity messages according to the program change information, and distributing the granularity messages; then consuming the granularity message, processing the message according to the processing logic corresponding to the granularity message type, and storing the synchronous data obtained after synchronization; and finally, acquiring and analyzing paging query request information of the user side, constructing a query request route by utilizing a routing algorithm, querying and aggregating the stored data, and finally returning to the user side. In the process, when the data of the selection list is updated, the data is divided into the metadata part and the specific information part divided according to the online year of the video, so that the fine-grained selection list of the annual dimensionality level is realized, and the delay caused by overlarge data of the selection list is reduced when a user queries the selection list by turning pages; the produced three-granularity information corresponds to data change of three granularities, so that the data can be timely and accurately changed, the time delay of data updating is reduced, and the resource consumption of a CPU (central processing unit) and network bandwidth during data updating is reduced; the routing algorithm involved in the query of the list interface can effectively bond the split option list data, thereby ensuring the transparency of the query interface and the correctness of the data.
Example 2
Referring to fig. 7, based on the method for splitting a video massive selection list in embodiment 1, this embodiment provides a system for splitting a video massive selection list, including:
a message service unit 10, configured to acquire program change information, where the program change information includes album program change information and single video program change information; forming different types of granularity messages according to the album program change information and the single video program change information, and distributing the granularity messages;
the synchronization service unit 20 is configured to consume the granularity message and process the message according to a processing logic corresponding to the granularity message type;
a storage service unit 30, configured to store the synchronized data obtained after synchronization;
and the query service unit 40 is configured to obtain and analyze the paging query request information of the user side, construct a query request route by using a routing algorithm, query and aggregate the stored data, and return the query request route to the user side.
Specifically, the message service unit 10 is responsible for distributing the message to the specified synchronization service unit 20, and the synchronization service unit 20 consumes the message, processes the message according to the processing logic corresponding to the specified message type, and stores the data obtained after synchronization in the storage service unit 30. The all-in-one client sends a request to the query service unit 40 when initiating a video play and clicking on the playlist. The query service unit 40 parses the request, constructs a new query request route to the corresponding storage service unit 40 query data according to the routing algorithm, and returns the query data to the client.
It can be understood that the above system for splitting a video massive selection list corresponds to the method for splitting a video massive selection list in embodiment 1. Any of the options in embodiment 1 are also applicable to this embodiment, and will not be described in detail here.
The above description is only for the specific embodiments of the present invention, but the scope of the present invention is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present invention, and all the changes or substitutions should be covered within the scope of the present invention.
Claims (10)
1. A method for splitting a video massive selection list is characterized by comprising the following steps:
acquiring program change information, wherein the program change information comprises album program change information and single video program change information;
forming different types of granularity messages according to the album program change information and the single video program change information, and distributing the granularity messages;
consuming the granularity message and processing the message according to the processing logic corresponding to the granularity message type;
storing the synchronous data obtained after synchronization;
and acquiring and analyzing paging query request information of a user side, constructing a query request route by utilizing a routing algorithm, querying and aggregating the stored data, and returning the data to the user side.
2. The method as claimed in claim 1, wherein the granular messages include a first type of update message, a second type of update message, and a third type of update message, the first type of update message is a message that updates the album selection list of the entire album, the second type of update message is a message that updates the album selection list of the current album by a year, and the third type of update message is a message that updates the album by a single video program.
3. The method as claimed in claim 2, wherein the step of forming different types of granularity messages according to the album program change information and the single video program change information and distributing the granularity messages comprises:
forming an album list according to the album program change information and the single video program change information, and splitting the album list to obtain public meta information of the album program information and album list set information with the year as a dimension;
and forming the first type of updating message, the second type of updating message and the third type of updating message according to the album program changing information and the single video program changing information, and distributing various types of granularity messages.
4. The method as claimed in claim 3, wherein the album list includes album program information and single video program information, wherein the album program information is a program having a plurality of play subsets, and the single video program information is each play subset under the album program information.
5. The method of claim 4, wherein the common meta-information comprises an album program identifier ID, a total number of videos in all units of the album program, an album program type, and meta-data, wherein the meta-data is a plurality of sets of data pairs consisting of a year and a program number in the year; the collection information of the selected set list is document data formed by aggregating all single video program information with the year as a dividing basis since the on-line of the special editing program.
6. The method of claim 5, wherein the step of obtaining and analyzing paging query request information of a user side, constructing a query request route by using a routing algorithm to query and aggregate stored data, and returning the query request route to the user side comprises:
acquiring paging query request information sent by a user in playing a video and clicking the option list;
analyzing the paging inquiry request information, and extracting effective parameters to obtain a must-pass parameter and a non-must-pass parameter, wherein the must-pass parameter comprises an album program ID, a current page number and the size of each page, and the non-must-pass parameter is the year;
calculating an offset starting position and an offset ending position according to the current page number and the size of each page;
judging whether the year exists or not;
if the year exists, directly routing to a storage service of a designated year to query data according to the album program ID, the starting offset, the ending offset and the year, and returning to the user side;
if the year does not exist, calculating according to the album program ID, the current page number and the size of each page to obtain the program offset of the beginning year and the program offset of the last year, inquiring and aggregating a corresponding selection list according to the quantity relation of the program offset of the beginning year and the program offset of the last year, and returning to the user side.
7. The method as claimed in claim 6, wherein the step of calculating the program offset of the beginning year and the program offset of the ending year according to the album program ID, the current page number and the size of each page, and querying and aggregating the corresponding album list according to the quantitative relationship between the program offset of the beginning year and the program offset of the ending year comprises:
inquiring the metadata of the program according to the album program ID, wherein the metadata comprises a plurality of data pairs which are arranged in a reverse order according to the year;
calculating the total number of programs, the starting year of the current page program and the final year of the current page program by using the offset starting position, the offset ending position and the metadata;
calculating the program offset of the starting year and the program offset of the final year according to the total number of the programs, the starting year of the current page program and the final year of the current page program;
judging whether the program offset of the starting year is the same as the program offset of the final year;
if the two are the same, routing to a specified year query selection list;
if the two requests are different, the two requests are constructed and respectively routed to the query selection list in the appointed year.
8. The method of claim 7, wherein said calculating the total number of programs, the starting year of the current page program, and the final year of the current page program using the offset start position, the offset end position, and the metadata comprises:
initializing the total number of programs, the variable quantity of the total number of the programs, the starting year of the current page program and the ending year of the current page program;
traversing the reverse order sequence of the metadata, and updating the total number of the programs in a numerical mode when a group of metadata is traversed, and calculating corresponding metadata starting offset and metadata ending offset;
and obtaining the starting year and the final year of the current page program according to the quantity relationship between the offset starting position and the offset ending position and the metadata starting offset and the metadata ending offset.
9. The method of claim 8, wherein said numerically updating the total number of programs for each traversal of a set of metadata and calculating the corresponding metadata start offset and metadata end offset comprises:
and assigning the program total variation to the metadata initial offset every time a group of metadata is traversed, and adding the current program total amount to the program total variation to obtain the updated program total amount.
10. A system for splitting a video mass collection list is characterized by comprising:
the system comprises a message service unit, a program change information acquisition unit and a program change information processing unit, wherein the message service unit is used for acquiring the program change information, and the program change information comprises album program change information and single video program change information; forming different types of granularity messages according to the album program change information and the single video program change information, and distributing the granularity messages;
the synchronous service unit is used for consuming the granularity message and processing the message according to the processing logic corresponding to the granularity message type;
the storage service unit is used for storing the synchronous data obtained after synchronization;
and the query service unit is used for acquiring and analyzing paging query request information of the user side, constructing a query request route by utilizing a routing algorithm, querying and aggregating the stored data, and returning the data to the user side.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011213653.XA CN112040283B (en) | 2020-11-04 | 2020-11-04 | Method and system for splitting video mass selection list |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011213653.XA CN112040283B (en) | 2020-11-04 | 2020-11-04 | Method and system for splitting video mass selection list |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112040283A CN112040283A (en) | 2020-12-04 |
| CN112040283B true CN112040283B (en) | 2021-02-05 |
Family
ID=73572942
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011213653.XA Active CN112040283B (en) | 2020-11-04 | 2020-11-04 | Method and system for splitting video mass selection list |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112040283B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102480520A (en) * | 2010-11-26 | 2012-05-30 | 中国科学院声学研究所 | Media data synchronism method based on differential metadata description structure |
| JP2016213709A (en) * | 2015-05-11 | 2016-12-15 | 株式会社Ｎｔｔドコモ | Moving image reproduction system, client device, server device, and program |
| CN106604068A (en) * | 2016-12-30 | 2017-04-26 | 中广热点云科技有限公司 | Method and system for updating media program |
| CN106790549A (en) * | 2016-12-23 | 2017-05-31 | 北京奇虎科技有限公司 | A kind of data-updating method and device |
| CN107801058A (en) * | 2016-09-05 | 2018-03-13 | 中兴通讯股份有限公司 | The management method of video management information, apparatus and system |
| CN109804637A (en) * | 2016-08-30 | 2019-05-24 | 乐威指南公司 | System and method according to the acute record of storage management series can be used |
-
2020
- 2020-11-04 CN CN202011213653.XA patent/CN112040283B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102480520A (en) * | 2010-11-26 | 2012-05-30 | 中国科学院声学研究所 | Media data synchronism method based on differential metadata description structure |
| JP2016213709A (en) * | 2015-05-11 | 2016-12-15 | 株式会社Ｎｔｔドコモ | Moving image reproduction system, client device, server device, and program |
| CN109804637A (en) * | 2016-08-30 | 2019-05-24 | 乐威指南公司 | System and method according to the acute record of storage management series can be used |
| CN107801058A (en) * | 2016-09-05 | 2018-03-13 | 中兴通讯股份有限公司 | The management method of video management information, apparatus and system |
| CN106790549A (en) * | 2016-12-23 | 2017-05-31 | 北京奇虎科技有限公司 | A kind of data-updating method and device |
| CN106604068A (en) * | 2016-12-30 | 2017-04-26 | 中广热点云科技有限公司 | Method and system for updating media program |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112040283A (en) | 2020-12-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110688382B (en) | Data storage query method and device, computer equipment and storage medium | |
| CN111859132A (en) | Data processing method and device, intelligent equipment and storage medium | |
| CN107944063A (en) | It is a kind of that method and system are recommended based on the news of topic model and groups of users | |
| CN111488377A (en) | Data query method and device, electronic equipment and storage medium | |
| CN111782134A (en) | Data processing method, device, system and computer readable storage medium | |
| CN115587118A (en) | Task data dimension table association processing method and device and electronic equipment | |
| CN110737432A (en) | script aided design method and device based on root list | |
| CN112040283B (en) | Method and system for splitting video mass selection list | |
| US9870402B2 (en) | Distributed storage device, storage node, data providing method, and medium | |
| CN113568923A (en) | Method and device for querying data in database, storage medium and electronic equipment | |
| CN108345699B (en) | Method, device and storage medium for acquiring multimedia data | |
| CN112035559B (en) | Thermodynamic diagram display method, server and system | |
| CN110708361A (en) | System, method and device for determining grade of digital content publishing user and server | |
| CN111008071A (en) | Task scheduling system, method and server | |
| CN113905252B (en) | Data storage method and device for live broadcasting room, electronic equipment and storage medium | |
| CN113704267A (en) | Data query method, system, equipment and storage medium based on elastic search | |
| CN113760983A (en) | Data processing method, system and non-transitory computer readable storage medium | |
| CN109063201B (en) | Impala online interactive query method based on mixed storage scheme | |
| CN110928954A (en) | HBase index synchronization method, HBase index synchronization device, computer equipment and storage medium | |
| CN115373831A (en) | Data processing method, device and computer readable storage medium | |
| US11327937B1 (en) | Determining indexing progress for a table in a distributed data store | |
| CN114328604B (en) | Method, device and medium for improving cluster data acquisition capacity | |
| CN113377831B (en) | Resource data query method and device, electronic equipment and storage medium | |
| CN114253951B (en) | Data processing method, system and second server | |
| CN114116827B (en) | Query system and method for user portrait data |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | 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 | ||
| CP01 | Change in the name or title of a patent holder | ||
| CP01 | Change in the name or title of a patent holder |
Address after: Room a-0550, 2 / F, building 3, yard 30, Shixing street, Shijingshan District, Beijing Patentee after: Beijing dream blooming Technology Co.,Ltd. Address before: Room a-0550, 2 / F, building 3, yard 30, Shixing street, Shijingshan District, Beijing Patentee before: Beijing iqiyi Intelligent Technology Co.,Ltd. |