CN109614555A - The method and apparatus for generating ranking list - Google Patents
The method and apparatus for generating ranking list Download PDFInfo
- Publication number
- CN109614555A CN109614555A CN201811612020.9A CN201811612020A CN109614555A CN 109614555 A CN109614555 A CN 109614555A CN 201811612020 A CN201811612020 A CN 201811612020A CN 109614555 A CN109614555 A CN 109614555A
- Authority
- CN
- China
- Prior art keywords
- ranking list
- time
- user
- medium data
- newest
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
- G06Q50/01—Social networking
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Primary Health Care (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- General Health & Medical Sciences (AREA)
- Human Resources & Organizations (AREA)
- Marketing (AREA)
- Computing Systems (AREA)
- Health & Medical Sciences (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Information Transfer Between Computers (AREA)
Abstract
This application discloses a kind of method and apparatus for generating ranking list, belong to Internet technical field.Method includes: to obtain the newest issuing time of multiple association users of user when receiving the ranking list acquisition request of terminal transmission；It determines that current time is less than at least one association user of preset duration with the time interval of newest issuing time, obtains at least one multi-medium data of at least one association user issued in preset duration；Obtain the degree of concern index of each multi-medium data at least one multi-medium data；Degree of concern index based on each multi-medium data, generates target ranking list, and target ranking list includes the information of at least one association user and corresponding multi-medium data after sequence；Target ranking list is sent to terminal.Using the application, the ranking list of big request amount, high real-time requirements, big quantity can solve, and can expand applied in ranking list similar with this in internet industry.
Description
Technical field
This application involves Internet technical field, in particular to a kind of method and apparatus for generating ranking list.
Background technique
In multimedia social platform, user can issue the personal production, such as sing the multimedias such as works, video work
Data.
After user's issuing multimedia data, the server of multimedia social platform can recorde each user to the multimedia
The behavioral data of data, counts the amount of listening to of the multi-medium data.The amount of listening to is more, shows that the multi-medium data is more welcome.
Therefore, server can periodically obtain the amount of listening to of each multi-medium data, establish good friend's works seniority among brothers and sisters of each user
List.For each user, the amount of listening to of each multi-medium data of its available good friend of server, and it is based on the amount of listening to, it is right
The multi-medium data of good friend is ranked up, and is obtained good friend's works ranking list of the user, is carried out corresponding storage with the user.
When any user sends ranking list acquisition request to server, server can be arranged from stored good friend's works
In row list, good friend's works ranking list of the user is obtained, the user is sent to.
During realizing the application, the inventor finds that the existing technology has at least the following problems:
The amount of listening to of multi-medium data refers to that from date of promulgation, each user clicks and plays the multi-medium data
Total degree.The issuing time of multi-medium data is more early, and the amount of listening to may be also bigger, which is deposited always
It is in good friend's works ranking list, thus, cause the content of good friend's works ranking list to solidify, mobility is poor.
Summary of the invention
In order to solve problems in the prior art, the embodiment of the present application provides a kind of method and apparatus for generating ranking list.
The technical solution is as follows:
In a first aspect, providing a kind of method for generating ranking list, which comprises
When receiving the ranking list acquisition request of terminal transmission, when obtaining the newest publication of multiple association users of user
Between, the newest issuing time is for indicating that association user issues the time of newest multi-medium data；
It determines that current time is less than at least one association user of preset duration with the time interval of newest issuing time, obtains
Take at least one multi-medium data of at least one association user issued in the preset duration；
Obtain the degree of concern index of each multi-medium data at least one described multi-medium data；
Based on the degree of concern index of each multi-medium data, target ranking list, the target ranking list packet are generated
The information of at least one described association user and corresponding multi-medium data after including sequence；
The target ranking list is sent to the terminal.
Optionally, described when receiving the ranking list acquisition request of terminal transmission, obtain multiple association users of user
Newest issuing time, comprising:
When receiving the ranking list acquisition request of terminal transmission, ranking list renewal time is obtained, the ranking list updates
Time is used to indicate the time of last update ranking list；
If current time and the time interval of the ranking list renewal time are greater than preset threshold, the more of user are obtained
The newest issuing time of a association user.
Optionally, before the newest issuing time of the multiple association users for obtaining user, further includes:
The ranking list renewal time is updated to the current time.
Optionally, the newest issuing time of the multiple association users for obtaining user, comprising:
If the ranking list acquisition request carries the page number mark of ranking list homepage, multiple associations of user are obtained
The newest issuing time of user.
Optionally, after the generation target ranking list, further includes:
The target ranking list is divided at least one sub- ranking list, is ranked based on every sub- ranking list in the target
Position in list determines the page number mark of every sub- ranking list.
Optionally, the degree of concern index based on each multi-medium data generates target ranking list, comprising:
In the degree of concern index of each multi-medium data, the maximum attention level index of each association user is obtained；
The maximum attention level index of each association user is ranked up, target ranking list is generated.
Optionally, the degree of concern index is by the amount of listening to, the amount of thumbing up, comment amount, reference one of transfer amount or more
Kind generates.
Second aspect, provides a kind of device for generating ranking list, and described device includes:
Acquiring unit, for when receiving the ranking list acquisition request of terminal transmission, the multiple associations for obtaining user to be used
The newest issuing time at family, the newest issuing time is for indicating that association user issues the time of newest multi-medium data；
Determination unit, for determining that the time interval of current time and newest issuing time is less than at least the one of preset duration
A association user obtains at least one the multimedia number of at least one association user issued in the preset duration
According to；
The acquiring unit is also used to obtain the concern of each multi-medium data at least one described multi-medium data
Level index；
Generation unit generates target ranking list for the degree of concern index based on each multi-medium data, described
Target ranking list includes the information of at least one described association user and corresponding multi-medium data after sequence；
Transmission unit, for sending the target ranking list to the terminal.
Optionally, the acquiring unit, is used for:
When receiving the ranking list acquisition request of terminal transmission, ranking list renewal time is obtained, the ranking list updates
Time is used to indicate the time of last update ranking list；
If current time and the time interval of the ranking list renewal time are greater than preset threshold, the more of user are obtained
The newest issuing time of a association user.
Optionally, described device further include:
Updating unit, before the newest issuing time of multiple association users for obtaining user, more by the ranking list
The new time is updated to the current time.
Optionally, the acquiring unit, is used for:
If the ranking list acquisition request carries the page number mark of ranking list homepage, multiple associations of user are obtained
The newest issuing time of user.
Optionally, the determination unit, is also used to:
After generating target ranking list, the target ranking list is divided at least one sub- ranking list, is based on every height
Position of the ranking list in the target ranking list determines the page number mark of every sub- ranking list.
Optionally, the generation unit, is used for:
In the degree of concern index of each multi-medium data, the maximum attention level index of each association user is obtained；
The maximum attention level index of each association user is ranked up, target ranking list is generated.
Optionally, which is characterized in that the degree of concern index is by the amount of listening to, the amount of thumbing up, comment amount, reference transfer amount
One or more generations.
The third aspect, provides a kind of computer equipment, and the computer equipment includes processor, communication interface, storage
Device and communication bus, wherein processor, communication interface, memory complete mutual communication by bus；Memory is used for
Store computer program；Processor realizes the side as described in above-mentioned first aspect for executing the program stored on memory
Method step.
Fourth aspect provides a kind of computer readable storage medium, at least one finger is stored in the storage medium
It enables, at least one instruction is loaded as the processor and executed to realize the generation ranking list as described in above-mentioned first aspect
Method.
Technical solution bring beneficial effect provided by the embodiments of the present application includes at least:
In the embodiment of the present application, when terminal to server request ranking list, server obtains multiple passes of user
The degree of concern index for the multi-medium data that combination family updates in preset duration, and referred to according to the degree of concern of multi-medium data
Mark generates target ranking list.In this way, user is when checking ranking list, server at least one multimedia number recent according to good friend
According to calculate ranking list, reduces and occur causing some multimedia always present in the situation in ranking list due to accumulated time, make
The content obtained in ranking list can be replaced according to the amount of listening to of works in a short time, in this way, more in the ranking list filtered out
Media data is preferable multi-medium data, so that the content mobility in ranking list is preferable.
Detailed description of the invention
In order to more clearly explain the technical solutions in the embodiments of the present application, make required in being described below to embodiment
Attached drawing is briefly described, it should be apparent that, the drawings in the following description are only some examples of the present application, for
For those of ordinary skill in the art, without creative efforts, it can also be obtained according to these attached drawings other
Attached drawing.
Fig. 1 is a kind of interface schematic diagram of method for generating ranking list provided by the embodiments of the present application；
Fig. 2 is a kind of flow chart of method for generating ranking list provided by the embodiments of the present application；
Fig. 3 is a kind of interface schematic diagram of method for generating ranking list provided by the embodiments of the present application；
Fig. 4 is a kind of flow diagram of method for generating ranking list provided by the embodiments of the present application；
Fig. 5 is a kind of flow diagram of method for generating ranking list provided by the embodiments of the present application；
Fig. 6 is a kind of structural schematic diagram of device for generating ranking list provided by the embodiments of the present application；
Fig. 7 is a kind of structural schematic diagram of device for generating ranking list provided by the embodiments of the present application；
Fig. 8 is a kind of server architecture schematic diagram provided by the embodiments of the present application.
Specific embodiment
To keep the purposes, technical schemes and advantages of the application clearer, below in conjunction with attached drawing to the application embodiment party
Formula is described in further detail.
The embodiment of the present application provides a kind of method for generating ranking list, and this method can be realized by server.Wherein, should
Server is server corresponding with the destination application of the terminal of user installation.Wherein, the terminal of user is equipped with target
Application program is based on the destination application, and user, which can deliver, sings works or short-sighted frequency, and user can also pass through the terminal
Application program check and sing works or short-sighted frequency, as shown in Figure 1.The destination application can check the seniority among brothers and sisters of good friend's works
List, the ranking lists of good friend's works can there are many ranking lists, such as can be the corresponding row of good friend of user's actively concern
Row list is also possible to pay close attention to corresponding ranking list of good friend of the user etc..
The calculation of a variety of ranking lists is roughly the same, is with the corresponding ranking list of good friend that user actively pays close attention to below
Example, as shown in Fig. 2, being illustrated to the method for generating ranking list.
In step 201, when server receives the ranking list acquisition request of terminal transmission, multiple passes of user are obtained
It is combined the newest issuing time at family.
Wherein, newest issuing time is for indicating that association user issues the time of newest multi-medium data.
In one possible embodiment, when user wants inquiry ranking list, corresponding target can be opened by terminal
Application program, user can find the icon of ranking list in destination application, click the icon, and triggering terminal is to corresponding
Server sends ranking list acquisition request, and the account information of user is carried in the ranking list acquisition request.
When server receives the ranking list acquisition request for carrying account information of terminal transmission, according to the account of user
Information inquires the account information of the association user of the account information of user, then, is pulled pair according to the account information of association user
The issuing time of the multi-medium data for the user's publication answered, that is, server obtains the newest publication of multiple association users of user
Time.
It should be noted that obtaining the mode of the newest issuing time of association user can be, server can be built in advance
A mapping table is found, account information and corresponding the last time for storing each association user of the user are delivered
The timestamp of works, the timestamp are the newest issuing time of each association user.When server needs to obtain the more of user
When the newest issuing time of a association user, server can be according to the account information of multiple association users, in the corresponding relationship
Corresponding multiple newest issuing times are inquired in table.Certainly, the mode for obtaining the newest issuing time of association user is also possible to
Other processing modes, the application do not limit this.
It optionally, can be right in order to avoid the icon triggering that user repeatedly clicks inquiry ranking list computes repeatedly ranking list
Each ranking list safeguards a ranking list renewal time that corresponding processing step can be such that when server receives terminal hair
When the ranking list acquisition request sent, ranking list renewal time is obtained, ranking list renewal time is for indicating that last update is arranged
The time of row list；If current time and the time interval of ranking list renewal time are greater than preset threshold, the more of user are obtained
The newest issuing time of a association user.
In one possible embodiment, when server receives the ranking list acquisition request of terminal transmission, server is obtained
The ranking list renewal time of pre-stored ranking list is taken, the ranking list renewal time is for indicating last update ranking list
Time.Then, server obtains current time, and calculates the time interval of current time Yu ranking list renewal time, if
Current time and the time interval of ranking list renewal time are less than or equal to preset threshold, illustrate user within the preset short time
Repeatedly triggering calculates ranking list, in this case, if recalculating ranking list, can more wasteful process resource, and in short-term
A possibility that interior ranking list can change is smaller, therefore is not necessarily to recalculate ranking list.If current time with
The time interval of ranking list renewal time is greater than preset threshold, and illustrating user not is that repeatedly triggering calculates within the preset short time
Ranking list, ranking list may change, and therefore, can recalculate ranking list.
Therefore, it if current time and the time interval of ranking list renewal time are less than or equal to preset threshold, services
The ranking list of storage is sent to the terminal of user by device, and terminal is made to show the ranking list to user.If current time and seniority among brothers and sisters
The time interval of list renewal time is greater than preset threshold, then when server obtains the newest publication of multiple association users of user
Between, and then recalculate ranking list.
It should be noted that the current time that above-mentioned server obtains can be server and receive ranking list acquisition request
Time, be also possible to time when server gets the ranking list renewal time of pre-stored ranking list, the application couple
This is without limitation.
Optionally, before obtaining the newest issuing time of multiple association users of user, server updates ranking list
Time is updated to current time.
In one possible embodiment, when server determines that current time and the time interval of ranking list renewal time are greater than
Preset threshold, when server determination needs to recalculate ranking list, server can update ranking list according to current time and update
Time, that is, ranking list renewal time is updated to current time, then, server obtains multiple association users of user most
New issuing time, and then recalculate ranking list.
It should be noted that the processing step of above-mentioned update ranking list renewal time is only that the application one is illustratively handled
Step, in addition to this, the processing step for updating ranking list renewal time can also occur at other time points, such as row of calculating
After row list, ranking list renewal time etc. is updated according to the time for calculating ranking list, the application does not limit this.
Optionally, if ranking list acquisition request carries the page number mark of ranking list homepage, the multiple of user are obtained
The newest issuing time of association user.
In one possible embodiment, it may include a plurality of data in ranking list, when user query ranking list, it is possible to only
Want to check the data of certain a part, such as come the data of ranking list top ten, in this case, if server is by ranking list
All data be disposably sent to terminal, Internet resources can be wasted.Therefore, in order to solve the problems, and convenient for using
Family checks that the ranking list data of generation can be divided into multiple segments by server, and terminal to server is initiated ranking list and obtained
When request, the page number mark of ranking list can be carried, page number mark is corresponding with some segment of ranking list data, service
Device is identified according to the page number of the ranking list carried in ranking list acquisition request, the segment of corresponding ranking list data is obtained, by it
It is sent to terminal, which is shown as a page of ranking list by terminal.
Based on the above situation, if carrying the page number of ranking list in the ranking list acquisition request that terminal to server is sent
Mark, and page number mark is not the page number mark of homepage, illustrates that the ranking list data of terminal request are calculated rows
A part of data of row list, rather than ranking list is recalculated in request, in this case, server is according to ranking list acquisition request
The page number of carrying identifies, and the segment of corresponding ranking list data is got according to page number mark, by the piece of the ranking list data
Section is sent to terminal, so that the segment of the ranking list data is shown to user by terminal.
If carrying the page number mark of ranking list in the ranking list acquisition request that terminal to server is sent, and the page number
Mark is the page number mark of homepage, then illustrates that user's using terminal recalculates ranking list, server receives ranking list acquisition
When request, the newest issuing time of multiple association users of user is obtained, and then recalculates ranking list.
In step 202, server determines that the time interval of current time and newest issuing time is less than preset duration
At least one association user obtains at least one multi-medium data of at least one association user issued in preset duration.
In one possible embodiment, server obtains the newest publication of multiple association users of user through the above steps
After time, in order to select the good friend for delivering multi-medium data in the recent period, server can calculate current time and each association
The time interval of the newest issuing time of user, and the time interval being calculated is compared with preset duration, if when
Between interval be greater than or equal to preset duration, illustrate nearest multi-medium data works that the association user is delivered also not default
In time limit, i.e., the association user did not delivered multi-medium data in the recent period, it is therefore not necessary to obtain the multimedia number of the association user
According to.If the time interval calculated is less than preset duration, illustrate that the association user delivered multi-medium data in the recent period, then in the pass
It is combined in all multi-medium datas of family publication, chooses at least one multi-medium data of issuing time in preset duration.
In this way, have huge request amount in synchronization while a large amount of ranking list data can be generated, and each
The data that ranking list is relied on are again very more.Current ranking list can be calculated by the way of off-line calculation mostly, that is, be mentioned
Preceding timing calculates ranking list, and user directly shows all right when requesting, but by the way of this off-line calculation, user sees
Ranking list data be it is outmoded, cause the experience of user poor.In this way, the application obtains recently issuing for association user
Works are ranked up the works, in this way, the quantity of ranking list data can be largely reduced, reduce the calculating to server and provide
The occupancy in source.
In step 203, server obtains the degree of concern of each multi-medium data at least one multi-medium data
Index.
Wherein, the degree of concern index of each multi-medium data can be the amount of listening to, click volume, amount of collection etc..
In one possible embodiment, after obtaining at least one multi-medium data through the above steps, server obtain to
The degree of concern index of each multi-medium data in a few multi-medium data, wherein degree of concern index is to preset
The index that multi-medium data is counted, such as the amount of listening to of multi-medium data, click volume, amount of collection.Multi-medium data
The amount of listening to can be listen to the multi-medium data duration be more than preset duration number, click volume be click the multimedia number
According to number, amount of collection be collect the multi-medium data number of users, certainly, degree of concern index is also possible to other fingers
Mark, by taking degree of concern index is the amount of listening to as an example, server determines issuing in preset duration at least one association user
After at least one multi-medium data, the amount of listening to of each multi-medium data is obtained.
In step 204, based on the degree of concern index of each multi-medium data, server generates target ranking list.
Wherein, target ranking list includes the letter of at least one association user and corresponding multi-medium data after sequence
Breath.
In one possible embodiment, server obtains the degree of concern index of each multi-medium data through the above steps
Afterwards, server is ranked up multi-medium data according to the degree of concern index of acquisition, will sort according to preset ordering rule
Multi-medium data and corresponding information afterwards is determined as target ranking list.
It should be noted that the information of the multi-medium data in target ranking list can be carried out according to preset information category
Screening, for example, as shown in figure 3, title, author, degree of concern that the information of multi-medium data may include multi-medium data refer to
Mark etc..
It optionally, can be according to most high point when the above-mentioned degree of concern index based on each multi-medium data is ranked up
Note level index is ranked up, and corresponding processing step can be such that in the degree of concern index of each multi-medium data, obtain
Take the maximum attention level index of each association user；The maximum attention level index of each association user is ranked up, it is raw
At target ranking list.
In one possible embodiment, choose masterpiece, can in the multi-medium data issued in the recent period of each association user,
The maximum multi-medium data of degree of concern index is chosen, is arranged according to the maximum attention level index of each association user
Sequence, server are ranked up multi-medium data according to the degree of concern index of acquisition, will sort according to preset ordering rule
Multi-medium data and corresponding information afterwards is determined as target ranking list.
Optionally, in order to save Internet resources, server can be when terminal sends ranking list acquisition request, server hair
A segment of ranking list is sent, in this way, server needs that ranking list is divided into multiple segments in advance, corresponding processing step can be with
As follows: target ranking list is divided at least one sub- ranking list by server, based on every sub- ranking list in target ranking list
Position, determine the page number mark of every sub- ranking list.
, can be according to preset division rule after server generates target ranking list in one possible embodiment, it will
Target ranking list is divided at least one sub- ranking list, includes the information of at least one multi-medium data in every sub- ranking list.
After marking off multiple sub- ranking lists, according to the every relative position of sub- ranking list in all sub- ranking lists, every height row is determined
The page number of row list identifies.For example, the page number mark of second sub- ranking list is determined as second page number mark.
In this way, accomplishing to calculate ranking list in real time and showing use when the application is realized to a large amount of ranking list acquisition requests
Family, and accomplish that approximate real time response improves the performance of user, in this way, solving the calculating of the huge ranking list of data volume
Problem, and accomplish that approximate real time response improves the performance of user.
In step 205, server sends target ranking list to terminal.
In one possible embodiment, after server calculates target ranking list, target ranking list is sent to terminal, eventually
After termination receives target ranking list, user is shown to so that user checks.
It should be noted that after server calculates target ranking list, if target ranking list is marked off multiple sub- rows
After row list, first sub- ranking list first can be sent to terminal, so that terminal first shows the number of a part of ranking list to user
According to, if user wants to continue checking other data of ranking list, can by terminal trigger again to server send rank
List acquisition request carries the page number mark that user wants the ranking list checked in the ranking list acquisition request.For example, user is first
Secondary when checking target ranking list, server sends the data of the ranking list of first page to terminal, if user wants to check third
When the target ranking list of page, server sends the data of the ranking list of third page to terminal.
Optionally, by taking user is user1 as an example, as shown in figure 4, illustrate to the method for above-mentioned generation ranking list
It is bright:
For user user1, all friend relation chains (good friend 1, good friend 2 ...) of the user are first pulled, which closes
It does not include being drawn black good friend in tethers.Its uid (user identification, the identification number of good friend) is obtained, then again
The maximum multi-medium data of its amount of listening to is pulled to each good friend one by one.By taking good friend 1 as an example, for " good friend 1 ", the good friend is pulled
The ugc (user generated content, the original data of user) of publication in nearly 3 weeks, and the maximum ugc of the amount of listening to is selected,
Record the id (as ugcid, the identification number of multi-medium data) of the ugc and the amount of listening to of ugc.For other good friends, press
The id of each good friend is pulled according to above-mentioned steps and selects the corresponding maximum ugc of the amount of listening to, i.e., each uid is one corresponding
These three attributes are considered as a tuple by ugcid and the amount of listening to.All tuples are ranked up according to the amount of listening to, are obtained most
Whole ranking list rank_of_user1, the i.e. good friend of this user of user1 listen to ranking list.Then, to obtained ranking list into
Row paging.
Optionally, as shown in figure 5, the method for above-mentioned generation ranking list is illustrated:
User click destination application in listen to list icon after, server receive terminal transmission ranking list obtain
After taking request, judge whether the request of terminal requests the ranking list data of homepage.Since the data of ranking list may be very much,
In order to allow terminal to pull ranking list data on demand, it can be multiple segments by ranking list cutting, only return to one to terminal every time
Segment, so that terminal shows the ranking list data an of page to user.If the request that server judges that terminal is sent is not
The ranking list data for requesting homepage then show to have generated before the ranking list and illustrated part ranking list content to user,
Therefore, the partial data of the ranking list generated before server is returned to terminal.
If server judges that the request that terminal is sent is to request the ranking list data of homepage, server can inquire the user
Listen to list timestamp, if the timestamp is not recent timestamp (for example, before earlier than 5 minutes), according to following steps
Rapid a-g recalculates generation ranking list:
A. the renewal time (i.e. execution cache_time=time () function) of ranking list is updated.
B. Get_friend_List () function is executed, obtains the list of good friend, and filter out the good friend in blacklist.
C. screen friend_List (buddy list), select the multi-medium data of current time and each good friend when
Between good friend of the difference less than 3 weeks that stabs.
D. the Recent Works for pulling the good friend of selection filter out the works being not belonging in 3 weeks, then obtain the receipts of remaining works
The amount of listening.
E. the maximum works of the amount of listening to of the Recent Works of each good friend are selected.
F. the maximum works of the amount of listening to of each good friend's Recent Works are ranked up according to the amount of listening to.
G. ranking list is obtained, to terminal returned data.
In the embodiment of the present application, when terminal to server request ranking list, server obtains multiple passes of user
The degree of concern index for the multi-medium data that combination family updates in preset duration, and referred to according to the degree of concern of multi-medium data
Mark generates target ranking list.In this way, user is when checking ranking list, server at least one multimedia number recent according to good friend
According to calculate ranking list, reduces and occur causing some multimedia always present in the situation in ranking list due to accumulated time, make
The content obtained in ranking list can be replaced according to the amount of listening to of works in a short time, in this way, more in the ranking list filtered out
Media data is preferable multi-medium data, so that the content mobility in ranking list is preferable.The application has been solved perfectly greatly
Request amount (at present applied on the software of daily 60,000,000 any active ues), high real-time requirements, big quantity (more than 6,000 ten thousand)
Ranking list, and can expand applied in ranking list similar with this in internet industry.
Based on the same technical idea, the embodiment of the present application also provides a kind of device for generating ranking list, which can
Think the server in above-described embodiment, as shown in fig. 6, the device includes: acquiring unit 610, determination unit 620 generates list
Member 630 and transmission unit 640.
The acquiring unit 610 is configured as obtaining the more of user when receiving the ranking list acquisition request of terminal transmission
The newest issuing time of a association user, the newest issuing time is for indicating that association user issues newest multi-medium data
Time；
The determination unit 620, when being configured to determine that the time interval of current time and newest issuing time is less than default
At least one long association user obtains at least one the more matchmaker of at least one association user issued in the preset duration
Volume data；
The acquiring unit 610 is additionally configured to obtain each multi-medium data at least one multi-medium data
Degree of concern index；
The generation unit 630 is configured as the degree of concern index based on each multi-medium data, generates target seniority among brothers and sisters
List, the target ranking list include the information of at least one association user and corresponding multi-medium data after sequence；
Transmission unit 640 is configured as sending the target ranking list to the terminal.
Optionally, the acquiring unit 610, is configured as:
When receiving the ranking list acquisition request of terminal transmission, ranking list renewal time is obtained, when which updates
Between for indicating time of last update ranking list；
If current time and the time interval of the ranking list renewal time are greater than preset threshold, the multiple of user are obtained
The newest issuing time of association user.
Optionally, as shown in fig. 7, the device further include:
Updating unit 650 is configured as before the newest issuing time for obtaining multiple association users of user, by the seniority among brothers and sisters
List renewal time is updated to the current time.
Optionally, the acquiring unit 610, is configured as:
If the ranking list acquisition request carries the page number mark of ranking list homepage, the multiple associations for obtaining user are used
The newest issuing time at family.
Optionally, the determination unit 620, is also configured to
After generating target ranking list, which is divided at least one sub- ranking list, is arranged based on every height
Position of the row list in the target ranking list determines the page number mark of every sub- ranking list.
Optionally, the generation unit 630, is configured as:
In the degree of concern index of each multi-medium data, the maximum attention level index of each association user is obtained；
The maximum attention level index of each association user is ranked up, target ranking list is generated.
Optionally, which is characterized in that the degree of concern index is by the amount of listening to, the amount of thumbing up, comment amount, reference transfer amount
One or more generations.
In the embodiment of the present application, when terminal to server request ranking list, server obtains multiple passes of user
The degree of concern index for the multi-medium data that combination family updates in preset duration, and referred to according to the degree of concern of multi-medium data
Mark generates target ranking list.In this way, user is when checking ranking list, server at least one multimedia number recent according to good friend
According to calculate ranking list, reduces and occur causing some multimedia always present in the situation in ranking list due to accumulated time, make
The content obtained in ranking list can be replaced according to the amount of listening to of works in a short time, in this way, more in the ranking list filtered out
Media data is preferable multi-medium data, so that the content mobility in ranking list is preferable.
About the device in above-described embodiment, wherein modules execute the concrete mode of operation in related this method
Embodiment in be described in detail, no detailed explanation will be given here.
It should be understood that it is provided by the above embodiment generate ranking list device when generating ranking list, only with above-mentioned
The division progress of each functional module can according to need and for example, in practical application by above-mentioned function distribution by different
Functional module is completed, i.e., the internal structure of equipment is divided into different functional modules, with complete it is described above whole or
Partial function.In addition, the embodiment of the method for the device provided by the above embodiment for generating ranking list and generation ranking list belongs to together
One design, specific implementation process are detailed in embodiment of the method, and which is not described herein again.
In the exemplary embodiment, a kind of computer readable storage medium is additionally provided, is stored at least in storage medium
One instruction, at least one instruction are loaded by processor and are executed the side to realize the identification maneuver classification in above-described embodiment
Method.For example, the computer readable storage medium can be ROM, random access memory (RAM), CD-ROM, tape, floppy disk
With optical data storage devices etc..
Fig. 8 is a kind of structural schematic diagram of computer equipment provided by the embodiments of the present application, which can be
Server in above-described embodiment.The computer equipment 800 can generate bigger difference because configuration or performance are different, can be with
Including one or more processors (central processing units, CPU) 801 and one or more deposit
Reservoir 802, wherein at least one instruction is stored in the memory 802, at least one instruction is by the processor
801 load and execute the method and step to realize above-mentioned generation ranking list.
In the embodiment of the present application, when terminal to server request ranking list, server obtains multiple passes of user
The degree of concern index for the multi-medium data that combination family updates in preset duration, and referred to according to the degree of concern of multi-medium data
Mark generates target ranking list.In this way, user is when checking ranking list, server at least one multimedia number recent according to good friend
According to calculate ranking list, reduces and occur causing some multimedia always present in the situation in ranking list due to accumulated time, make
The content obtained in ranking list can be replaced according to the amount of listening to of works in a short time, in this way, more in the ranking list filtered out
Media data is preferable multi-medium data, so that the content mobility in ranking list is preferable.
Those of ordinary skill in the art will appreciate that realizing that all or part of the steps of above-described embodiment can pass through hardware
It completes, relevant hardware can also be instructed to complete by program, the program can store in a kind of computer-readable
In storage medium, storage medium mentioned above can be read-only memory, disk or CD etc..
The foregoing is merely the preferred embodiments of the application, not to limit the application, it is all in spirit herein and
Within principle, any modification, equivalent replacement, improvement and so on be should be included within the scope of protection of this application.
Claims (16)
1. a kind of method for generating ranking list and generating ranking list, which is characterized in that the described method includes:
When receiving the ranking list acquisition request of terminal transmission, the newest issuing time of multiple association users of user is obtained,
The newest issuing time is for indicating that association user issues the time of newest multi-medium data；
Determine at least one association user of time interval less than preset duration of current time and newest issuing time, acquisition institute
State at least one multi-medium data of at least one association user issued in the preset duration；
Obtain the degree of concern index of each multi-medium data at least one described multi-medium data；
Based on the degree of concern index of each multi-medium data, target ranking list is generated, the target ranking list includes row
The information of at least one described association user and corresponding multi-medium data after sequence；
The target ranking list is sent to the terminal.
2. the method according to claim 1, wherein described when the ranking list acquisition request for receiving terminal transmission
When, obtain the newest issuing time of multiple association users of user, comprising:
When receiving the ranking list acquisition request of terminal transmission, ranking list renewal time, the ranking list renewal time are obtained
For indicating the time of last update ranking list；
If current time and the time interval of the ranking list renewal time are greater than preset threshold, multiple passes of user are obtained
It is combined the newest issuing time at family.
3. according to the method described in claim 2, it is characterized in that, the newest publication of the multiple association users for obtaining user
Before time, further includes:
The ranking list renewal time is updated to the current time.
4. the method according to claim 1, wherein the newest publication of the multiple association users for obtaining user
Time, comprising:
If the ranking list acquisition request carries the page number mark of ranking list homepage, multiple association users of user are obtained
Newest issuing time.
5. according to the method described in claim 4, it is characterized in that, after the generation target ranking list, further includes:
The target ranking list is divided at least one sub- ranking list, based on every sub- ranking list in the target ranking list
Position, determine the page number mark of every sub- ranking list.
6. the method according to claim 1, wherein the degree of concern based on each multi-medium data
Index generates target ranking list, comprising:
In the degree of concern index of each multi-medium data, the maximum attention level index of each association user is obtained；
The maximum attention level index of each association user is ranked up, target ranking list is generated.
7. -6 any method according to claim 1, which is characterized in that the degree of concern index by the amount of listening to, thumb up
One of amount, comment amount, reference transfer amount or a variety of generations.
8. a kind of device for generating ranking list and generating ranking list, which is characterized in that described device includes:
Acquiring unit, for obtaining multiple association users of user when receiving the ranking list acquisition request of terminal transmission
Newest issuing time, the newest issuing time is for indicating that association user issues the time of newest multi-medium data；
Determination unit, for determining that the time interval of current time and newest issuing time is less than at least one pass of preset duration
It is combined family, obtains at least one multi-medium data of at least one association user issued in the preset duration；
The acquiring unit is also used to obtain the degree of concern of each multi-medium data at least one described multi-medium data
Index；
Generation unit generates target ranking list, the target for the degree of concern index based on each multi-medium data
Ranking list includes the information of at least one described association user and corresponding multi-medium data after sequence；
Transmission unit, for sending the target ranking list to the terminal.
9. device according to claim 8, which is characterized in that the acquiring unit is used for:
When receiving the ranking list acquisition request of terminal transmission, ranking list renewal time, the ranking list renewal time are obtained
For indicating the time of last update ranking list；
If current time and the time interval of the ranking list renewal time are greater than preset threshold, multiple passes of user are obtained
It is combined the newest issuing time at family.
10. device according to claim 9, which is characterized in that described device further include:
Updating unit, before the newest issuing time of multiple association users for obtaining user, when the ranking list is updated
Between be updated to the current time.
11. device according to claim 8, which is characterized in that the acquiring unit is used for:
If the ranking list acquisition request carries the page number mark of ranking list homepage, multiple association users of user are obtained
Newest issuing time.
12. device according to claim 11, which is characterized in that the determination unit is also used to:
After generating target ranking list, the target ranking list is divided at least one sub- ranking list, is ranked based on every height
Position of the list in the target ranking list determines the page number mark of every sub- ranking list.
13. device according to claim 8, which is characterized in that the generation unit is used for:
In the degree of concern index of each multi-medium data, the maximum attention level index of each association user is obtained；
The maximum attention level index of each association user is ranked up, target ranking list is generated.
14. according to any device of claim 8-13, which is characterized in that the degree of concern index is by the amount of listening to, point
One of the amount of praising, comment amount, reference transfer amount or a variety of generations.
15. a kind of computer equipment, which is characterized in that the computer equipment includes processor, communication interface, memory and leads to
Believe bus, wherein processor, communication interface, memory complete mutual communication by bus；Memory, based on storing
Calculation machine program；Processor realizes the generation as described in claim 1 to 7 is any for executing the program stored on memory
The method of ranking list.
16. a kind of computer readable storage medium, which is characterized in that be stored at least one instruction, institute in the storage medium
At least one instruction is stated to be loaded by the processor and executed to realize the generation ranking list as described in claim 1 to 7 is any
Method.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811612020.9A CN109614555A (en) | 2018-12-27 | 2018-12-27 | The method and apparatus for generating ranking list |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811612020.9A CN109614555A (en) | 2018-12-27 | 2018-12-27 | The method and apparatus for generating ranking list |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109614555A true CN109614555A (en) | 2019-04-12 |
Family
ID=66012105
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811612020.9A Pending CN109614555A (en) | 2018-12-27 | 2018-12-27 | The method and apparatus for generating ranking list |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109614555A (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110975296A (en) * | 2019-11-25 | 2020-04-10 | 网易（杭州）网络有限公司 | Method, device, equipment and storage medium for maintaining ranking list in game |
| CN111339327A (en) * | 2020-02-20 | 2020-06-26 | 北京达佳互联信息技术有限公司 | Work recommendation method and device, server and storage medium |
| CN113420236A (en) * | 2021-05-24 | 2021-09-21 | 北京达佳互联信息技术有限公司 | List data display method and device, electronic equipment and storage medium |
| CN113476854A (en) * | 2021-06-30 | 2021-10-08 | 北京达佳互联信息技术有限公司 | Ranking list determining method and device, electronic equipment and storage medium |
| CN115334022A (en) * | 2021-05-11 | 2022-11-11 | 中国移动通信集团上海有限公司 | Method, device, equipment and storage medium for implementing card punching list in 5G message system |
| US11962455B2 (en) | 2021-11-29 | 2024-04-16 | T-Mobile Usa, Inc. | Prioritizing multiple issues associated with a wireless telecommunication network |
| CN113420236B (en) * | 2021-05-24 | 2024-05-17 | 北京达佳互联信息技术有限公司 | Method and device for displaying list data, electronic equipment and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102982112A (en) * | 2012-11-08 | 2013-03-20 | 北京小米科技有限责任公司 | Ranking list generation method and journal generation method and server |
| CN103049511A (en) * | 2012-03-28 | 2013-04-17 | 李晶 | Method and client for displaying microblog interest list and microblog contents |
| CN105208064A (en) * | 2014-06-24 | 2015-12-30 | 腾讯科技（北京）有限公司 | Method and device for acquiring micro blog messages |
| CN106294691A (en) * | 2016-08-04 | 2017-01-04 | 广州交易猫信息技术有限公司 | List method for refreshing, device and service end |
| CN108833266A (en) * | 2018-07-04 | 2018-11-16 | 奇酷互联网络科技（深圳）有限公司 | Dynamic shares management method, management equipment, storage medium and the terminal of message |
-
2018
- 2018-12-27 CN CN201811612020.9A patent/CN109614555A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103049511A (en) * | 2012-03-28 | 2013-04-17 | 李晶 | Method and client for displaying microblog interest list and microblog contents |
| CN102982112A (en) * | 2012-11-08 | 2013-03-20 | 北京小米科技有限责任公司 | Ranking list generation method and journal generation method and server |
| CN105208064A (en) * | 2014-06-24 | 2015-12-30 | 腾讯科技（北京）有限公司 | Method and device for acquiring micro blog messages |
| CN106294691A (en) * | 2016-08-04 | 2017-01-04 | 广州交易猫信息技术有限公司 | List method for refreshing, device and service end |
| CN108833266A (en) * | 2018-07-04 | 2018-11-16 | 奇酷互联网络科技（深圳）有限公司 | Dynamic shares management method, management equipment, storage medium and the terminal of message |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110975296A (en) * | 2019-11-25 | 2020-04-10 | 网易（杭州）网络有限公司 | Method, device, equipment and storage medium for maintaining ranking list in game |
| CN110975296B (en) * | 2019-11-25 | 2023-04-07 | 网易（杭州）网络有限公司 | Method, device, equipment and storage medium for maintaining ranking list in game |
| CN111339327A (en) * | 2020-02-20 | 2020-06-26 | 北京达佳互联信息技术有限公司 | Work recommendation method and device, server and storage medium |
| CN111339327B (en) * | 2020-02-20 | 2024-05-07 | 北京达佳互联信息技术有限公司 | Work recommendation method and device, server and storage medium |
| CN115334022A (en) * | 2021-05-11 | 2022-11-11 | 中国移动通信集团上海有限公司 | Method, device, equipment and storage medium for implementing card punching list in 5G message system |
| CN115334022B (en) * | 2021-05-11 | 2023-08-15 | 中国移动通信集团上海有限公司 | Method, device, equipment and storage medium for realizing card-punching list in 5G message system |
| CN113420236A (en) * | 2021-05-24 | 2021-09-21 | 北京达佳互联信息技术有限公司 | List data display method and device, electronic equipment and storage medium |
| CN113420236B (en) * | 2021-05-24 | 2024-05-17 | 北京达佳互联信息技术有限公司 | Method and device for displaying list data, electronic equipment and storage medium |
| CN113476854A (en) * | 2021-06-30 | 2021-10-08 | 北京达佳互联信息技术有限公司 | Ranking list determining method and device, electronic equipment and storage medium |
| CN113476854B (en) * | 2021-06-30 | 2024-04-16 | 北京达佳互联信息技术有限公司 | Method and device for determining ranking list, electronic equipment and storage medium |
| US11962455B2 (en) | 2021-11-29 | 2024-04-16 | T-Mobile Usa, Inc. | Prioritizing multiple issues associated with a wireless telecommunication network |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109614555A (en) | The method and apparatus for generating ranking list | |
| US20180255009A1 (en) | Emoji recommendation method and apparatus | |
| US10249006B2 (en) | Providing social context to calendar events | |
| US8185492B2 (en) | Messaging application with multiple viewports for presenting messages in different orders | |
| JP3885483B2 (en) | Service execution method and apparatus | |
| US20170206379A1 (en) | User-generated content permissions status analysis system and method | |
| US20080243789A1 (en) | Groupware system with improved contact data handling | |
| CN104796449B (en) | Content delivery method, device and equipment | |
| CN104333501B (en) | Contact list display method and device | |
| US20150149572A1 (en) | Integration System Providing Conversation Messages and Social Network Posts by Conversation Message Authors to Client | |
| CN107808440B (en) | Queuing service processing method and processing device | |
| CN108399186A (en) | A kind of collecting method and device | |
| CN108241539B (en) | Interactive big data query method and device based on distributed system, storage medium and terminal equipment | |
| CN105491085A (en) | Method and device for on-line requesting for queuing | |
| CN108959319A (en) | Information-pushing method and device | |
| US8880595B2 (en) | Asynchronous, passive knowledge sharing system and method | |
| CN107247720B (en) | Expression ranks list generation method and device, computer equipment | |
| US20140164116A1 (en) | Searching for and creating an adaptive content | |
| WO2020007266A1 (en) | Method and device for managing dynamic shared message, storage medium, and terminal | |
| CN112272137B (en) | Method, computing device and computer readable memory device for mass data management in a communication application via multiple mailboxes | |
| WO2012079147A1 (en) | Method, system and apparatus for managing contact data | |
| JP2018032115A (en) | Data store device and data management method | |
| JP6427997B2 (en) | Communication control method, communication control system, and communication control program | |
| CN111309674A (en) | System and method for file management by mobile computing device | |
| JP5846033B2 (en) | Information processing device, terminal device, information processing method, display method, information processing program, and display program |
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 |