CN113343023A - Method and system for rapidly inquiring channel ranking in time period - Google Patents

Method and system for rapidly inquiring channel ranking in time period Download PDF

Info

Publication number
CN113343023A
CN113343023A CN202110608193.9A CN202110608193A CN113343023A CN 113343023 A CN113343023 A CN 113343023A CN 202110608193 A CN202110608193 A CN 202110608193A CN 113343023 A CN113343023 A CN 113343023A
Authority
CN
China
Prior art keywords
data
channel
ranking
channel ranking
data table
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202110608193.9A
Other languages
Chinese (zh)
Inventor
张康
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Guangdong Huanwang Technology Co Ltd
Original Assignee
Guangdong Huanwang Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Guangdong Huanwang Technology Co Ltd filed Critical Guangdong Huanwang Technology Co Ltd
Priority to CN202110608193.9A priority Critical patent/CN113343023A/en
Publication of CN113343023A publication Critical patent/CN113343023A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/70Information retrieval; Database structures therefor; File system structures therefor of video data
    • G06F16/71Indexing; Data structures therefor; Storage structures
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/70Information retrieval; Database structures therefor; File system structures therefor of video data
    • G06F16/74Browsing; Visualisation therefor
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/40Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
    • H04N21/47End-user applications
    • H04N21/482End-user interface for program selection
    • H04N21/4825End-user interface for program selection using a list of items to be played back in a given order, e.g. playlists
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/40Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
    • H04N21/47End-user applications
    • H04N21/482End-user interface for program selection
    • H04N21/4826End-user interface for program selection using recommendation lists, e.g. of programs or channels sorted out according to their score

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Theoretical Computer Science (AREA)
  • Human Computer Interaction (AREA)
  • Software Systems (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Signal Processing (AREA)
  • User Interface Of Digital Computer (AREA)

Abstract

The invention relates to a method and a system for quickly inquiring channel ranking in a time interval, wherein the method comprises the steps of pulling channel playing data from kafka in a preset mode; storing all channel playing data into a historical data table; reading channel ranking data of preset time in a historical data table, and storing the channel ranking data of the preset time in an updating data table; and adding the field index into the update data table to enable the update data table to directly return all channel ranking data corresponding to the preset time of the channel, and storing the data by arranging the historical data table and the update data table, so that the data query speed can be ensured, and the audience rating and ranking query efficiency of the background system is effectively improved.

Description

Method and system for rapidly inquiring channel ranking in time period
Technical Field
The invention belongs to the technical field of television channel ranking, and particularly relates to a method and a system for quickly inquiring channel ranking in a time period.
Background
The television audience rating is the percentage of the number of people watching a certain television channel in a certain period of time to the total number of television audiences, is used as an important quantitative index in the 'attention economy' era, is a scientific basis for deeply analyzing a television audience market, is an important reference for program making, arrangement and adjustment, is a main index for program evaluation, and is a powerful tool for making and evaluating a medium plan and improving advertisement putting benefits. Generally, in a background system for counting audience rating, the data volume is typically extremely large and real-time audience rating, ranking information and the like are observed, and the data presentation is affected because the interface is slow to react when querying database data due to the large data volume. At present, the method of adding indexes on the table is mostly adopted, so as to accelerate the speed of data query.
However, indexing on the table is relatively inefficient in querying the background system for ratings and rankings.
Disclosure of Invention
In order to solve at least the above problems in the prior art, the present invention provides a method and a system for quickly querying a channel rank within a time period, so as to improve the efficiency of a background system for querying the channel rank and the audience rating.
The technical scheme provided by the invention is as follows:
in one aspect, a method for channel ranking within a fast query period includes:
pulling channel playing data from the kafka in a preset mode;
storing all the channel playing data into a historical data table;
reading channel ranking data of preset time in the historical data table, and storing the channel ranking data of the preset time into an updating data table;
and adding fields to the updating data table in an indexing manner, so that the updating data table directly returns all the channel ranking data of the corresponding channels in the preset time.
Optionally, after the adding the field index to the update data table, the method further includes:
and storing all the channel ranking data of the preset time into a browser so as to read the channel ranking data through the browser.
Optionally, before the reading of the channel ranking data by the browser, the method further includes:
receiving a data query instruction, wherein the data query instruction comprises a mouse cursor instruction;
and determining channel ranking data of the target time in the browser according to the mouse cursor instruction.
Optionally, the reading, by the browser, the channel ranking data includes:
and displaying the channel ranking data in the target time to a display interface according to a mouse cursor instruction.
In another aspect, a system for channel ranking within a fast query period, includes:
the pulling module is used for pulling the channel playing data from the kafka in a preset mode;
the storage module is used for storing all the channel playing data into a historical data table;
the reading module is used for reading the channel ranking data of the preset time in the historical data table and storing the channel ranking data of the preset time into an updating data table;
and the query module is used for adding a field index to the update data table so as to enable the update data table to directly return all the channel ranking data of the corresponding channel in the preset time.
Optionally, the system for ranking channels in the fast query period further includes a ranking module, which is specifically configured to:
and storing all the channel ranking data of the preset time into a browser so as to read the channel ranking data through the browser.
Optionally, the ranking module is further specifically configured to:
receiving a data query instruction, wherein the data query instruction comprises a mouse cursor instruction;
and determining channel ranking data of the target time in the browser according to the mouse cursor instruction.
Optionally, the ranking module is further specifically configured to:
and displaying the channel ranking data in the target time to a display interface according to a mouse cursor instruction.
The invention has the beneficial effects that:
the invention provides a method and a system for quickly inquiring channel ranking in a time interval, wherein the method comprises the steps of pulling channel playing data from kafka in a preset mode; storing all channel playing data into a historical data table; reading channel ranking data of preset time in a historical data table, and storing the channel ranking data of the preset time in an updating data table; and adding the field index into the update data table to enable the update data table to directly return all channel ranking data corresponding to the preset time of the channel, and storing the data by arranging the historical data table and the update data table, so that the data query speed can be ensured, and the audience rating and ranking query efficiency of the background system is effectively improved.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
FIG. 1 is a flow chart of a method for channel ranking within a fast query period according to an embodiment of the present invention;
fig. 2 is a schematic structural diagram of a system for channel ranking in a fast query period according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the technical solutions of the present invention will be described in detail below. It is to be understood that the described embodiments are merely exemplary of the invention, and not restrictive of the full scope of the invention. All other embodiments, which can be derived by a person skilled in the art from the examples given herein without any inventive step, are within the scope of the present invention.
Fig. 1 is a flowchart of a method for channel ranking in a fast query period according to an embodiment of the present invention.
As shown in fig. 1, the method for ranking channels in a fast query period provided by this embodiment includes the following steps:
and S11, pulling the channel playing data from the kafka in a preset mode.
Kafka is an open source stream processing platform, and is a high-throughput distributed publish-subscribe messaging system that can process all the action stream data of a consumer in a website. The preset manner may be to pull the channel playing data from the kafka without interruption, for example, the data may be pulled once every certain time interval, or another pulling manner may be used, which is not specifically limited in this embodiment.
And S12, storing all the channel playing data into a historical data table.
The historical data table is used for storing all data and storing all data collected by the big data platform.
And S13, reading the channel ranking data of the preset time in the historical data table, and storing the channel ranking data of the preset time in the updating data table.
For example, the data in the historical data table may be updated every minute to ensure that the data in the historical data table is up-to-date and complete. And then, the channel ranking data in the preset time, which can be ranking data in 24 hours, can be selected to be read, and then the channel ranking data in 24 hours is stored in the updating data table. That is, the history data table is used to store all the original data, and the update data table is used to store the latest 24 hours of data, and the data in the update data table is updated every minute, so that the data in the update data table is guaranteed to be the latest.
And S14, adding the field index to the update data table, so that the update data table directly returns all the channel ranking data corresponding to the channel preset time.
An index is a structure that sorts one or more columns of values in a database table, and the index can be used to quickly access specific information in the database table. If a particular employee wants to look up him or her by last name, indexing helps to get information faster than searching all rows in a table. One of the main purposes of indexing is to speed up the retrieval of data in the table, i.e. to assist the information searcher to find out the auxiliary data structure of record ID meeting the restriction condition as soon as possible. All data in 24 hours of the corresponding channel can be directly returned from the updated data table in a field indexing mode, and information such as channel ranking, audience rating and the like can be quickly inquired. In this embodiment, the channel ranking is used for explanation, and the audience rating is also used in the same manner, and is not specifically described again, so that the channel ranking can be understood by referring to each other.
The method for rapidly querying the channel ranking in the time interval provided by the embodiment comprises the steps of pulling channel playing data from kafka in a preset mode; storing all channel playing data into a historical data table; reading channel ranking data of preset time in a historical data table, and storing the channel ranking data of the preset time in an updating data table; and adding the field index into the update data table to enable the update data table to directly return all channel ranking data corresponding to the preset time of the channel, and storing the data by arranging the historical data table and the update data table, so that the data query speed can be ensured, and the audience rating and ranking query efficiency of the background system is effectively improved.
Further, in this embodiment, after adding the field index to the update data table, the method further includes: and storing all channel ranking data of preset time into the browser so as to read the channel ranking data through the browser. And, before reading the channel ranking data through the browser, further comprising: receiving a data query instruction, wherein the data query instruction comprises a mouse cursor instruction; according to a mouse cursor instruction, determining channel ranking data of a target time in a browser, wherein the specific reading of the channel ranking data by the browser comprises the following steps: and displaying the channel ranking data in the target time to a display interface according to the mouse cursor instruction. Through data storage in the browser, when the mouse shakes, the channel ranking information of corresponding time can be directly searched in the browser according to time, and the ranking information is displayed, so that the efficiency of inquiring the channel ranking data is greatly improved, and the experience of a user is improved.
Based on the same general inventive concept, the application also protects a system for quickly querying the channel ranking in the time period.
Fig. 2 is a schematic structural diagram of a system for channel ranking in a fast query period according to an embodiment of the present invention.
As shown in fig. 2, the system for ranking channels in a fast query period provided in this embodiment includes:
the pulling module 10 is configured to pull channel play data from the kafka in a preset manner;
the storage module 20 is configured to store all channel playing data in the history data table;
the reading module 30 is configured to read channel ranking data of preset time in the historical data table, and store the channel ranking data of the preset time in the update data table;
and the query module 40 is configured to add the field index to the update data table, so that the update data table directly returns all the channel ranking data corresponding to the channel preset time.
The system for rapidly querying the channel ranking in the time interval provided by the embodiment comprises the steps of pulling channel playing data from kafka in a preset mode; storing all channel playing data into a historical data table; reading channel ranking data of preset time in a historical data table, and storing the channel ranking data of the preset time in an updating data table; and adding the field index into the update data table to enable the update data table to directly return all channel ranking data corresponding to the preset time of the channel, and storing the data by arranging the historical data table and the update data table, so that the data query speed can be ensured, and the audience rating and ranking query efficiency of the background system is effectively improved.
Further, the system for ranking channels in a quick query period according to this embodiment further includes a ranking module, which is specifically configured to:
and storing all channel ranking data of preset time into the browser so as to read the channel ranking data through the browser.
Further, the ranking module in this embodiment is further specifically configured to:
receiving a data query instruction, wherein the data query instruction comprises a mouse cursor instruction;
and determining channel ranking data of the target time in the browser according to the mouse cursor instruction.
Further, the ranking module in this embodiment is further specifically configured to:
and displaying the channel ranking data in the target time to a display interface according to the mouse cursor instruction.
Embodiments of the apparatus parts have been described in detail in relation to corresponding method embodiments, and therefore will not be described in detail in relation to corresponding apparatus parts, which may be understood by reference to each other.
Embodiments of the present application provide a storage medium, where a computer program is stored, and when the computer program is executed by a processor, the method for controlling a novel multifunctional express cabinet according to any of the above embodiments is implemented.
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. Therefore, the protection scope of the present invention shall be subject to the protection scope of the appended claims.
It is understood that the same or similar parts in the above embodiments may be mutually referred to, and the same or similar parts in other embodiments may be referred to for the content which is not described in detail in some embodiments.
It should be noted that the terms "first," "second," and the like in the description of the present invention are used for descriptive purposes only and are not to be construed as indicating or implying relative importance. Further, in the description of the present invention, the meaning of "a plurality" means at least two unless otherwise specified.
Any process or method descriptions in flow charts or otherwise described herein may be understood as representing modules, segments, or portions of code which include one or more executable instructions for implementing specific logical functions or steps of the process, and alternate implementations are included within the scope of the preferred embodiment of the present invention in which functions may be executed out of order from that shown or discussed, including substantially concurrently or in reverse order, depending on the functionality involved, as would be understood by those reasonably skilled in the art of the present invention.
It should be understood that portions of the present invention may be implemented in hardware, software, firmware, or a combination thereof. In the above embodiments, the various steps or methods may be implemented in software or firmware stored in memory and executed by a suitable instruction execution system. For example, if implemented in hardware, as in another embodiment, any one or combination of the following techniques, which are known in the art, may be used: a discrete logic circuit having a logic gate circuit for implementing a logic function on a data signal, an application specific integrated circuit having an appropriate combinational logic gate circuit, a Programmable Gate Array (PGA), a Field Programmable Gate Array (FPGA), or the like.
It will be understood by those skilled in the art that all or part of the steps carried by the method for implementing the above embodiments may be implemented by hardware related to instructions of a program, which may be stored in a computer readable storage medium, and when the program is executed, the program includes one or a combination of the steps of the method embodiments.
In addition, functional units in the embodiments of the present invention may be integrated into one processing module, or each unit may exist alone physically, or two or more units are integrated into one module. The integrated module can be realized in a hardware mode, and can also be realized in a software functional module mode. The integrated module, if implemented in the form of a software functional module and sold or used as a stand-alone product, may also be stored in a computer readable storage medium.
The storage medium mentioned above may be a read-only memory, a magnetic or optical disk, etc.
In the description herein, references to the description of the term "one embodiment," "some embodiments," "an example," "a specific example," or "some examples," etc., mean that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, the schematic representations of the terms used above do not necessarily refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples.
Although embodiments of the present invention have been shown and described above, it is understood that the above embodiments are exemplary and should not be construed as limiting the present invention, and that variations, modifications, substitutions and alterations can be made to the above embodiments by those of ordinary skill in the art within the scope of the present invention.

Claims (8)

1. A method for channel ranking in a quick query period is characterized by comprising the following steps:
pulling channel playing data from the kafka in a preset mode;
storing all the channel playing data into a historical data table;
reading channel ranking data of preset time in the historical data table, and storing the channel ranking data of the preset time into an updating data table;
and adding fields to the updating data table in an indexing manner, so that the updating data table directly returns all the channel ranking data of the corresponding channels in the preset time.
2. The method for channel ranking within a fast query period as claimed in claim 1, wherein said adding field is indexed to said updated data table, further comprising:
and storing all the channel ranking data of the preset time into a browser so as to read the channel ranking data through the browser.
3. The method for channel ranking within a fast query period as claimed in claim 2, wherein before said reading of said channel ranking data by said browser, further comprising:
receiving a data query instruction, wherein the data query instruction comprises a mouse cursor instruction;
and determining channel ranking data of the target time in the browser according to the mouse cursor instruction.
4. The method for channel ranking within a fast query period as claimed in claim 3, wherein said browser reads said channel ranking data, comprising:
and displaying the channel ranking data in the target time to a display interface according to a mouse cursor instruction.
5. A system for channel ranking during a fast query period, comprising:
the pulling module is used for pulling the channel playing data from the kafka in a preset mode;
the storage module is used for storing all the channel playing data into a historical data table;
the reading module is used for reading the channel ranking data of the preset time in the historical data table and storing the channel ranking data of the preset time into an updating data table;
and the query module is used for adding a field index to the update data table so as to enable the update data table to directly return all the channel ranking data of the corresponding channel in the preset time.
6. The system for channel ranking within a quick query interval as claimed in claim 5, further comprising a ranking module, specifically configured to:
and storing all the channel ranking data of the preset time into a browser so as to read the channel ranking data through the browser.
7. The system for channel ranking within a quick query period of claim 6, wherein the ranking module is further specifically configured to:
receiving a data query instruction, wherein the data query instruction comprises a mouse cursor instruction;
and determining channel ranking data of the target time in the browser according to the mouse cursor instruction.
8. The system for channel ranking within a quick query period of claim 7, wherein the ranking module is further specifically configured to:
and displaying the channel ranking data in the target time to a display interface according to a mouse cursor instruction.
CN202110608193.9A 2021-06-01 2021-06-01 Method and system for rapidly inquiring channel ranking in time period Pending CN113343023A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110608193.9A CN113343023A (en) 2021-06-01 2021-06-01 Method and system for rapidly inquiring channel ranking in time period

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110608193.9A CN113343023A (en) 2021-06-01 2021-06-01 Method and system for rapidly inquiring channel ranking in time period

Publications (1)

Publication Number Publication Date
CN113343023A true CN113343023A (en) 2021-09-03

Family

ID=77474086

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110608193.9A Pending CN113343023A (en) 2021-06-01 2021-06-01 Method and system for rapidly inquiring channel ranking in time period

Country Status (1)

Country Link
CN (1) CN113343023A (en)

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020186296A1 (en) * 2000-06-30 2002-12-12 Metabyte Networks, Inc. Database management system and method for electronic program guide and television channel lineup organization
CN106557578A (en) * 2016-11-23 2017-04-05 中国工商银行股份有限公司 The inquiry of historical data method and system
WO2018059162A1 (en) * 2016-09-30 2018-04-05 深圳市九洲电器有限公司 Television program preview method utilized in channel switching, system, and electronic apparatus
CN111597238A (en) * 2020-06-10 2020-08-28 北京明朝万达科技股份有限公司 Method and device for dynamically displaying table data based on database
CN111651453A (en) * 2020-04-30 2020-09-11 中国平安财产保险股份有限公司 User historical behavior query method and device, electronic equipment and storage medium
CN112100138A (en) * 2020-09-16 2020-12-18 北京天融信网络安全技术有限公司 Log query method and device, storage medium and electronic equipment
CN112231317A (en) * 2020-09-25 2021-01-15 浙江三维通信科技有限公司 Data query method and device, electronic device and storage medium

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020186296A1 (en) * 2000-06-30 2002-12-12 Metabyte Networks, Inc. Database management system and method for electronic program guide and television channel lineup organization
WO2018059162A1 (en) * 2016-09-30 2018-04-05 深圳市九洲电器有限公司 Television program preview method utilized in channel switching, system, and electronic apparatus
CN106557578A (en) * 2016-11-23 2017-04-05 中国工商银行股份有限公司 The inquiry of historical data method and system
CN111651453A (en) * 2020-04-30 2020-09-11 中国平安财产保险股份有限公司 User historical behavior query method and device, electronic equipment and storage medium
CN111597238A (en) * 2020-06-10 2020-08-28 北京明朝万达科技股份有限公司 Method and device for dynamically displaying table data based on database
CN112100138A (en) * 2020-09-16 2020-12-18 北京天融信网络安全技术有限公司 Log query method and device, storage medium and electronic equipment
CN112231317A (en) * 2020-09-25 2021-01-15 浙江三维通信科技有限公司 Data query method and device, electronic device and storage medium

Similar Documents

Publication Publication Date Title
US7783630B1 (en) Tuning of relevancy ranking for federated search
US8239397B2 (en) System and method for managing user attention by detecting hot and cold topics in social indexes
JP5329900B2 (en) Digital information disclosure method in target area
US8452781B2 (en) System and method for using banded topic relevance and time for article prioritization
CN109889891B (en) Method, device and storage medium for acquiring target media file
US20040002945A1 (en) Program for changing search results rank, recording medium for recording such a program, and content search processing method
US20110214080A1 (en) Taxonomy Editor
EP3456360A1 (en) Device and method for tuning relational database
AU2014318151B2 (en) Smart search refinement
US20180121433A1 (en) Discovery of data assets using metadata
CN101601038A (en) Related word presentation device
JP2000067033A (en) Method and device for generating sequence information
CN101727950A (en) Playlist search device, playlist search method and program
CN113079417A (en) Method, device and equipment for generating bullet screen and storage medium
US8024656B2 (en) Data analysis using facet attributes
CN111061954A (en) Search result sorting method and device and storage medium
CN114328983A (en) Document fragmenting method, data retrieval device and electronic equipment
KR20130071829A (en) Contents search service providing method, search server and search system including that
CN113343023A (en) Method and system for rapidly inquiring channel ranking in time period
CN109558468B (en) Resource processing method, device, equipment and storage medium
EP1109114A1 (en) Compound view onto data of a database
KR101624172B1 (en) Appratus and method for management of contents information
WO2023278090A1 (en) Determining and generating search refiners for applications
CN111491198B (en) Small video searching method and device
RU2409849C2 (en) Method of searching for information in multi-topic unstructured text arrays

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