CN106294691A - List method for refreshing, device and service end - Google Patents
List method for refreshing, device and service end Download PDFInfo
- Publication number
- CN106294691A CN106294691A CN201610640064.7A CN201610640064A CN106294691A CN 106294691 A CN106294691 A CN 106294691A CN 201610640064 A CN201610640064 A CN 201610640064A CN 106294691 A CN106294691 A CN 106294691A
- Authority
- CN
- China
- Prior art keywords
- request
- time
- list
- working area
- scheduled time
- 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.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/951—Indexing; Web crawling techniques
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Accessory Devices And Overall Control Thereof (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides a kind of list method for refreshing, device and service end, this list method for refreshing includes: receive the request refreshing list；According to the assignment of the request summation in the previous scheduled time, the request utilizing and receiving in the scheduled time after previous scheduled time continuous print refreshes list, or the request received in the scheduled time after previous scheduled time continuous print is stored in working area.This list method for refreshing, device and service end can be according to the quantity of system request, and the real-time generation frequency adjusting list, it is ensured that stablizing of system makes list generate more real-time.
Description
Technical field
The present invention relates to internet arena, in particular to a kind of list method for refreshing, device and service end.
Background technology
Along with the fast development of the Internet, on the Internet, the ballot of various lists becomes focus, and list is to certain according to mark
The poll sequence that a little ID ballots are formed is single, and ID can be people, works etc., poll can be presented as the comment of ID, present or its
The form that he can increase, user is changed by the ID ranking on vote out list.Owing to being limited to big data and request
The request amount problem of brush list, in prior art, a lot of lists are all generated, i.e. every one section by backstage timing asynchronous computing
Whole requests in this section of time range are carried out the refreshing of list by the time, and the real-time experience sense of this mode user is poor, than
If user is to certain main broadcaster gives a present when, it would be desirable to be able to the seniority among brothers and sisters list that main broadcaster is contributed by real-time update user, so could be to master
Broadcast and play more direct arousal effect with user.The real-time generation of list, easily brings when triggering generation number of times and being the most intensive
Server performance fluctuation and instability, affect the experience of whole system.
Summary of the invention
In view of this, it is an object of the invention to provide a kind of list method for refreshing, device and service end, to improve at height
Under concurrent environment, quasi real time updating and the stability of system of list.
To achieve these goals, the technical scheme that the embodiment of the present invention uses is as follows:
First aspect, the invention provides a kind of list method for refreshing, and described method includes:
Receive the request that list is refreshed；
According to the assignment of the request summation in the previous scheduled time, utilize and a pre-timing after previous scheduled time continuous print
In the request that receives refresh list, or the request received in the scheduled time after previous scheduled time continuous print is stored in
Working area.
Preferably, described method includes:
When the difference of the up-to-date time receiving request and the time of startup is in the range of the very first time, by the startup time more
New for the up-to-date time receiving request；
Ask the assignment of summation to be updated correspondence in the previous scheduled time, after described renewal, be entered as up-to-date connecing
Request summation cumulative before the requested time；
According to the assignment after described renewal, the up-to-date request received is utilized to refresh list or recently received asked
Seek survival into working area.
Preferably, described method includes:
When in the time of latest requests and the difference of the time of startup are more than the second time range, the startup time is updated to
The time of described latest requests；
Ask the assignment of summation to be updated correspondence in the previous scheduled time, after described renewal, be entered as zero；
The up-to-date request received is utilized to refresh list.
Preferably, described method includes:
When the assignment of the request summation in the previous scheduled time is in the range of first, utilize continuous with the previous scheduled time
A rear scheduled time in the request that receives refresh list.
Preferably, described working area includes that the first working area, described method include:
When the assignment of the request summation in the previous scheduled time is in the range of second, will be with previous scheduled time continuous print
The request received in the rear scheduled time is stored in the first working area, when described first working area is saturated, merges described first temporary
The request in district of depositing obtains asking summation, and utilizes the request summation after merging to refresh list.
Preferably, described working area also includes the second working area, and the length in described second working area is first temporary more than described
Depositing the length in district, described method includes:
When the assignment of the request summation in the previous scheduled time is in the range of the 3rd, will be with previous scheduled time continuous print
The request received in the rear scheduled time is stored in the second working area, when described second working area is saturated, merges described second temporary
The request in district of depositing obtains asking summation, and utilizes the request summation after merging to refresh list.
Preferably, described method includes:
Response timing triggers, and utilizes the request in working area to refresh list.
On the other hand, the invention provides a kind of list refreshing apparatus, described device includes:
Receiver module, for receiving the request refreshing list；
Refresh module, for the assignment according to the request summation in the previous scheduled time, utilizes with the previous scheduled time even
The request received in the continuous rear scheduled time refreshes list, or connects within a scheduled time after previous scheduled time continuous print
The request received is stored in working area.
Preferably, described device also includes:
Time more new module, is used for up-to-date to receive the difference of the time of request and the time of startup in very first time scope
Time interior, is updated to the up-to-date time receiving request the startup time；
Assignment more new module, for asking the assignment of summation to be updated correspondence in the previous scheduled time, described more
The request summation being entered as adding up till the up-to-date time receiving request after Xin；
Described refresh module be additionally operable to according to described renewal after assignment, utilize up-to-date receive request refresh list or
Recently received request is stored in working area.
Preferably, described device also includes:
Time more new module, in when the time of latest requests and the difference of the time of startup more than the second time range
Time, the startup time is updated to the time of described latest requests；
Assignment more new module, for asking the assignment of summation to be updated correspondence in the previous scheduled time, described more
It is entered as zero after Xin；
Described refresh module be additionally operable within the previous scheduled time correspondence request summation be entered as utilize when zero up-to-date
The request that receives refreshes list.
Preferably, described refresh module is used for the assignment of the request summation within the previous scheduled time in the range of first
Time, the request utilizing and receiving in the scheduled time after previous scheduled time continuous print refreshes list.
Preferably, described working area includes the first working area, and described refresh module is for asking within the previous scheduled time
When asking the assignment of summation in the range of second, by with previous scheduled time continuous print after receive in a scheduled time please seek survival
Enter the first working area, and
When described first working area is saturated, merges the request in described first working area and obtain asking summation, and utilize
Request summation after merging refreshes list.
Preferably, described working area also includes the second working area, and the length in described second working area is first temporary more than described
Depositing the length in district, described refresh module, will be with previous when the request summation within the previous scheduled time is in the range of the 3rd
The request received in the scheduled time after scheduled time continuous print is stored in the second working area, and
When described second working area is saturated, merges the request in described second working area and obtain asking summation, and utilize
Request summation after merging refreshes list.
Preferably, described refresh module is additionally operable to respond timing and triggers, and utilizes the request in working area to refresh list.
The third aspect, present invention also offers a kind of service end, and described service end includes:
Memorizer；
Processor；And
List refreshing apparatus, described list refreshing apparatus is installed in described memorizer and includes one or more by described
The software function module that processor performs, described list refreshing apparatus includes:
Receiver module, for receiving the request refreshing list；
Refresh module, for the assignment according to the request summation in the previous scheduled time, utilizes with the previous scheduled time even
The request received in the continuous rear scheduled time refreshes list, or connects within a scheduled time after previous scheduled time continuous print
The request received is stored in working area.
The present invention provide list method for refreshing, device and service end, service end receive refresh list request after,
Can determine will connect within a scheduled time after previous scheduled time continuous print according to the assignment of the request summation of the previous scheduled time
The request received refreshes list, or is stored in temporary by the request received in the scheduled time after previous scheduled time continuous print
District.According to the quantity of system request, the real-time generation frequency adjusting list, it is ensured that stablizing of system, list is made to generate more
Real-time.
Accompanying drawing explanation
In order to be illustrated more clearly that the technical scheme of the embodiment of the present invention, below by embodiment required use attached
Figure is briefly described, it will be appreciated that the following drawings illustrate only certain embodiments of the present invention, and it is right to be therefore not construed as
The restriction of scope, for those of ordinary skill in the art, on the premise of not paying creative work, it is also possible to according to this
A little accompanying drawings obtain other relevant accompanying drawings.
Fig. 1 is the service end mutual schematic diagram with at least one client communication of present pre-ferred embodiments offer.
Fig. 2 is the block diagram of the service end shown in Fig. 1.
Fig. 3 is the schematic diagram for the account ranking list supporting network main broadcaster at present.
Fig. 4 is the flow process of the list method for refreshing being applied to the service end shown in Fig. 1 that present pre-ferred embodiments provides
Figure.
Fig. 5 is the example of practical application figure of the list method for refreshing that present pre-ferred embodiments provides.
Fig. 6 is the functional module framework schematic diagram of the list refreshing apparatus that present pre-ferred embodiments provides.
Main element symbol description: service end 100, list refreshing apparatus 110, memorizer 111, processor 112, communication unit
Unit 113, client 200, network 300, application program 400, receiver module 601, refresh module 602, time more new module 603,
Assignment more new module 604.
Detailed description of the invention
Below in conjunction with accompanying drawing in the embodiment of the present invention, the technical scheme in the embodiment of the present invention is carried out clear, complete
Ground describes, it is clear that described embodiment is only a part of embodiment of the present invention rather than whole embodiments.Generally exist
Can arrange and design with various different configurations with the assembly of the embodiment of the present invention that illustrates described in accompanying drawing herein.Cause
This, be not intended to limit claimed invention to the detailed description of the embodiments of the invention provided in the accompanying drawings below
Scope, but it is merely representative of the selected embodiment of the present invention.Based on embodiments of the invention, those skilled in the art are not doing
The every other embodiment obtained on the premise of going out creative work, broadly falls into the scope of protection of the invention.
The list method for refreshing that the embodiment of the present invention provides is applied to the service end being in communication with each other with multiple clients.Such as figure
Shown in 1, it it is the mutual schematic diagram that communicates with at least one client 200 of service end 100 that provides of present pre-ferred embodiments.Described
Service end 100 can be communicated with described client 200 by network 300, to realize between service end 100 and client 200
Data communication or mutual.Described service end 100 can provide at least one application program being applicable to various operating system
The installation kit of (Application, APP) 400 is downloaded for described client 200.Described client 200 is by described network 300
After accessing described service end 100, the operation system of this client 200 can be applicable to from service end 100 download by described network 300
The installation kit of the application program 400 of system, to be installed to described application program 400 in described client 200.
In the present embodiment, described service end 100 may be, but not limited to, web (website) server, ftp (file
Transfer protocol, file transfer protocol (FTP)) server etc..Described client 200 may be, but not limited to, intelligence hands
Machine, PC (personal computer, PC), panel computer, personal digital assistant (personal digital
Assistant, PDA), mobile internet surfing equipment (mobile Internet device, MID) etc..Described network 300 it may be that
But it is not limited to, cable network or wireless network.The operating system of described client 200 may be, but not limited to, Android
(Android) system, IOS (iPhone operating system) system, Windows phone system, Windows system
Deng.Described application program 400 can be service end 100 provide any be available for the self-defined download of client 200 and install should
By program, it is preferable that in the present embodiment, described application program 400 is can be the different ID client-side program that refreshes list, such as
Having the lists such as the main broadcaster of different ID, star, novel, game, client 200 receives user and refreshes the request of list to refresh list
Single, user can by present, comment on, the mode such as ballot refreshes list, user is refreshed the request method of list by the present embodiment
Do not limit.
Refer to Fig. 2, be the block diagram of the service end 100 shown in Fig. 1.Described service end 100 includes that list refreshes
Device 110, memorizer 111, processor 112 and communication unit 113.
Described memorizer 111, processor 112 and each element of communication unit 113 are the most electrical
Connect, to realize the transmission of data or mutual.Such as, these elements can pass through one or more communication bus or letter each other
Number line realizes being electrically connected with.Described list refreshing apparatus 110 includes that at least one can be with software or the shape of firmware (firmware)
Formula is stored in described memorizer 111 or is solidificated in the operating system (operating system, OS) of described service end 100
Software function module.Described processor 112 is for performing the executable module of storage in described memorizer 111, such as described
Software function module included by list refreshing apparatus 110 and computer program etc..
Wherein, described memorizer 111 may be, but not limited to, random access memory (Random Access
Memory, RAM), read only memory (Read Only Memory, ROM), programmable read only memory (Programmable
Read-Only Memory, PROM), erasable read-only memory (Erasable Programmable Read-Only
Memory, EPROM), electricallyerasable ROM (EEROM) (Electric Erasable Programmable Read-Only
Memory, EEPROM) etc..Wherein, memorizer 111 is used for storing program, described processor 112 receive execution instruction after,
Perform described program.Described communication unit 113 for by described network 300 set up described service end 100 and client 200 it
Between communication connection, and for by described network 300 transceiving data.
Refer to Fig. 3, be the schematic diagram for the account ranking list supporting network main broadcaster at present.User is by network master
Broadcasting gifts or mode that point is praised obtains contribution margin, how many list systems is ranked up generating according to the contribution margin of user
Contribution ranking list, user can by increase gifts to obtain more contribution margin, thus refreshes user contribution rank
Ranking on list, in this example, user's gifts that is one refreshes the request of list.
Refer to Fig. 4, be that the list being applied to the service end 100 shown in Fig. 1 that present pre-ferred embodiments provides refreshes
The flow chart of method.Below the idiographic flow described in Fig. 4 and step are described in detail.
Step S401: receive the request that list is refreshed.
The request refreshing list that service end 100 receives is that client 200 responds user's answering in client 200
Send with the operation in program.Such as, user clicks on gifts, then client on the application program of client 200
The operation of 200 response users sends the request of this gifts to service end 100.
Step S402: judge the time of recently received request and the time range of the difference of the time of startup.
Owing to service end 100 communicates to connect with multiple clients 200 simultaneously, service end 100 may connect in the same time
Receive the request that list is refreshed by multiple client 200, when client 200 send requested many, service end 100 is simultaneously
Multiple requests are processed, treatment effeciency and the stability of service end 100 may be affected.In the present embodiment, have employed
By time slice, judge, by the request summation received in judging the preceding paragraph time, the busy extent that service end 200 is current, with
Busy extent according to service end 200 determines that the processing mode of the request being currently received, the length of the preceding paragraph time are passed through
Preset.The time started of the preceding paragraph time is the startup time, and this startup time is not a regular time, but with
Request situation that system of is current and change.
In this preferred embodiment, when the up-to-date time of request and the difference of the time of startup of receiving is in very first time scope
Time interior, perform step S403；When the difference of the up-to-date time receiving request and the time of startup is in the second time range, hold
Row step S404, when the time of recently received request and the time range of the time difference of the time of startup are neither in the very first time
Scope, the most not at the second time range, performs step S406.
Step S403: ask the assignment of summation to be updated correspondence in the previous scheduled time, the tax after described renewal
Value is request summation cumulative before the up-to-date time receiving request.Thereafter, step S405 is performed.
Service end 100, receiving request when, can judge currently to receive according to the request summation of the preceding paragraph time
The processing mode of request, the request summation of the preceding paragraph time obtains by the way of assignment, and the preceding paragraph time is previous pre-
Fixing time, the time span of the previous scheduled time described herein is change, and concrete time span is according to very first time model
Enclose or the preseting length of the second time range and the time of recently received request and determine.In order to make it easy to understand, refer to
Fig. 5, sets the time that initial starts up of list system as 0, sets very first time scope as 1s (second)～2s (not including 2s), due to
The time of initial starting up is 0, not request before 0, " the previous scheduled time " of acquiescence 0 be entered as 0.Service end 100 is respectively
Receive 5 requests when 0.3s, when receiving 5 requests, 1.5s when receiving 5 requests, 0.7s during 0.5s, receive 22 requests, because of
It is respectively less than 1s for 0.3s, 0.5s, 0.7s, so receiving moment of number of request in these three the most do not carry out assignment, when 0.7s,
Request summation is 5+5+5=15.After 0.7s, the time of recently received request is 1.5s, and 1.5s is at the model of 1s～2s
In enclosing, so the assignment of the request summation of the previous scheduled time (the previous scheduled time here is 0～1.5s) is carried out more
Newly, the request summation after renewal is 5+5+5=15.In the present embodiment, very first time scope is set to 1s～2s, up-to-date connects
Receive the time span between the time of request and startup time the longest, show active user to ask more and enliven, by previous
The request summation of Preset Time is entered as 15, to determine to connect with a previous Preset Time rear Preset Time continuously according to this assignment
The processing mode of the request received.
Step S404: ask the assignment of summation to be updated correspondence in the previous scheduled time, the tax after described renewal
Value is zero.Thereafter, step S405 is performed.
Please continue to refer to Fig. 5, if the second time range is 2s～∞ s, 4.1s is the startup time of system, 4.1s
After, up-to-date request time is 7s, due to 7s-4.1s=2.9s > 2s, meet the second time range, then the previous of 7s is made a reservation for
Request summation (7) in time (the previous scheduled time here is 4.1s～7s) is entered as zero, for a rear continuous print
The process of the request received in the scheduled time, as reference, because service end 100 does not all have new request in 2.9s, shows
The current busy extent of service end 100 is relatively low, so directly the request summation of the previous scheduled time being entered as zero.
Step S405: the startup time is updated to the time of recently received request.Thereafter, step S406 is performed.
The time range of difference of the time of the most recently received request and the time of startup be very first time scope or
Second time range, is all updated to the time of recently received request by the startup time, to carry out the calculating of lower a period of time.Example
As, refer to Fig. 5, when 1.5s, the time of recently received request is 1.5s-0s=with the time difference of the time of startup
1.5s, in the range of the very first time, then using 1.5s as the new startup time.When 2.9s, receive time of request and open
The time difference of dynamic time is 2.9s-1.5s=1.4s, in the range of the very first time, then using 2.9s as the new startup time.
When 7s, receive the time of request and the time difference of the time of startup is 7s-4.1s=2.9s, in the second time range,
Then using 7s as the new startup time.By resetting the startup time, carrying out segment processing the time, rear one end time receives
Request process with reference to the assignment of the request summation in for the previous period.The mode processed will be said by below step
Bright.
Step S406: judge the scope of the assignment of request summation in the previous scheduled time.
The assignment of the request summation of the previous scheduled time that service end 100 obtains according to judgement is recently received to determine
The processing mode of request.When the assignment of the request summation in the previous scheduled time is in the first scope, perform step S407, currently
The assignment of the request summation in one scheduled time, when the second scope, performs step S408, and the request in the previous scheduled time is total
The assignment of sum, when three scopes, performs step S409.
Step 407: the request utilizing and receiving in the scheduled time after previous scheduled time continuous print refreshes list.
In the present embodiment, the value of the first scope is 0～10.When the assignment of the request summation in the previous scheduled time exists
In 0～10, show that service end 100 is the busiest, then by the request that is currently received (i.e. with previous scheduled time continuous print
The request received in the rear scheduled time) it is directly used in refreshing list.In order to make it easy to understand, refer to Fig. 5, when 0.3s,
Service end 100 have received 5 requests, because previous scheduled time during 0.3s does not exists, is defaulted as the previous scheduled time
That asks summation is entered as 0, and 0 is positioned at 0～10, then 5 requests that 0.3s receives are directly used in refreshing list.
Step S408: by with previous scheduled time continuous print after the request that receives in a scheduled time be stored in first and keep in
District.Thereafter step S410 is performed.
In the present embodiment, working area includes the first working area, and the value of this second scope is 11～100.When previous pre-
The assignment of the request summation fixing time interior, in 11～100, shows that service end 100 is the busiest, then will be currently received
Request (i.e. with previous scheduled time continuous print after the request that receives in a scheduled time) be stored temporarily in the first working area,
The first working area herein is buffer (buffer), a length of the 4 of this first working area, and the i.e. first working area can store
Number of request is 4.In order to make it easy to understand, refer to Fig. 5, when 1.7s, service end 100 have received 25 requests, due to
The request summation of the previous scheduled time (i.e. 0～1.5s) of 1.7s be entered as 15,15 are positioned at the second scope, then received by 1.7s
To 25 requests be sequentially placed into the first working area and keep in, the burden current to alleviate service end 100.When the first working area
Time saturated, when the number of request of the i.e. first working area storage reaches the upper limit, perform step S410.
Step S409: by with previous scheduled time continuous print after the request that receives in a scheduled time be stored in second and keep in
District.Thereafter step S411 is performed.
In the present embodiment, working area also includes that the second working area, the value of the 3rd scope are 101～∞.When previous
The assignment of the request summation in the scheduled time, in 101～∞, shows that service end 100 is the busiest, is susceptible to performance
Stir and unstable, now, the request being currently received (is i.e. received in a scheduled time with after previous scheduled time continuous print
To request) be stored temporarily in the second working area, it should be noted that the second working area and the first working area herein are slow
Rushing device (buffer), the length of this buffer can freely change, a length of the 8 of this second working area, the i.e. second working area energy
The number of request of enough storages is 8.In order to make it easy to understand, refer to Fig. 5, when 3.1s, service end 100 have received 1 request,
Owing to being entered as 122 in the request summation of the previous scheduled time of 3.1s (i.e. 1.5～2.9s), 122 are positioned at the 3rd scope, then
1 request received by 3.1s is put into the second working area and is kept in, the burden current to alleviate service end 100.When second
When working area is saturated, when the number of request of the i.e. second working area storage reaches the upper limit, perform step S411.
Step S410: merge the request in the first working area, and utilize the request after merging to refresh list.
In the present embodiment, when the request in the first working area reaches 4, then merge these 4 requests to refresh
List, when such as the first working area is put in when 1.7s 25 described in S408 request, brushes for the most completely 4 the most successively
Newly, then can carry out 6 times and refresh, increase by 4 requests for list every time, service end 100 asks the calculation times done to these 25
It is 6 times, compared in traditional real-time update, the mode that a request once calculates, it is possible to reduce by 19 calculating, make clothes
Business end 100 is more light, increases stability.
Step 411: merge the request in the second working area, and utilize the request after merging to refresh list.
The length in the second working area is more than the length in the first working area, it is possible to the more request of buffering, it is adaptable to service end
100 busier when, when the second working area is saturated, merge the request in the second working area, and refresh with the request after merging
List.
It is appreciated that the present invention is all right in order to prevent the delay asking longer-term storage to cause list to update in working area
After step S408 and S409, directly perform step S412: response timing triggers, utilize the first working area or second to keep in
Request in district refreshes list.
Due to the present embodiment provide method in, sometimes need to keep in number of request, wait working area saturated it
After remerge the number of request in working area to refresh list, when working area long-time unsaturated time, the request in working area
Fail immediately list to be refreshed, lose the quasi real time property that list refreshes, affect the experience of user.For the ease of reason
Solve, refer to Fig. 5, be entered as 122 due to the request summation between 1.5～2.9s, then the request in 2.9～4.1s will be put into
Second working area, in the present embodiment, a length of the 8 of the second working area, and the quantity of the number of request in 2.9～4.1s is 5, nothing
Second working area is filled up by method, and 7 requests in 4.1～7s will be directly used in refreshing list, will not be stored in working area, therefore
And 5 requests in the second working area will deposit at least 4.1s in the second working area.
In order to solve this problem, the list method for refreshing that the embodiment of the present invention provides is provided with a timing script, i.e. sets
In a fixed timing triggered time, when reaching the clocked flip time, respond this timing and trigger, by temporary to the first working area or second
The number of request remained in depositing district is in order to refresh list, to reach the instant process to request, it is ensured that the quasi real time property that list updates.
Receive the uncertainty of the time of request due to service end 100, in the present embodiment, regularly the setting of script is applied by reality
In time period of concurrent request and persistence length determine.
It should be noted that in each above-mentioned step, the several step of continuous print can essentially be performed in parallel, sometimes
Can also perform in a reverse order, this is depending on involved function.Such as step S403 and step S405 can be first
Perform step S403, it is also possible to first carry out step S405.And step S404 and step S405 can be to first carry out step S404,
Step S405 can also be first carried out.
The list method for refreshing that the embodiment of the present invention provides determines according to the assignment of the request summation of the previous scheduled time will
List is refreshed with the request received in the scheduled time after previous scheduled time continuous print, or by previous scheduled time continuous print
The request received in the rear scheduled time is stored in working area.According to the quantity of system request, the real-time generation adjusting list
Frequency, it is ensured that stablizing of system, makes list generate more real-time.
Refer to Fig. 6, be the functional module framework signal of the list refreshing apparatus 110 that present pre-ferred embodiments provides
Figure.
The list refreshing apparatus 110 that the present embodiment provides includes receiver module 601, refresh module 602, time more new module
603 and assignment more new module 604.
Wherein, described receiver module 601 can be used for performing step S401.List is carried out by receiver module 601 for receiving
The request refreshed, this request is sent by client 200.
More new module 603 of described time can be used for performing step S402 and S405.Time, more new module 603 was for when up-to-date
Receive the difference of time of request and the time of startup in the range of the very first time time, the startup time is updated to up-to-date receiving
The time of request.In the present embodiment, the value of very first time scope is 1s～2s (not including 2s).
Time more new module 603 is additionally operable to when the time of latest requests and the difference of the time of startup are more than the second time range
Time interior, is updated to the time of described latest requests the startup time.In the present embodiment, the value of very first time scope be 2s～
∞。
Described assignment more new module 604 can be used for performing step S403 and S404.Assignment more new module 604 is for previous
The assignment of request summation corresponding in the scheduled time is updated, and is entered as the up-to-date time receiving request after described renewal
Till cumulative request summation.Assignment more new module 604 is additionally operable to correspondence in the previous scheduled time is asked the assignment of summation
It is updated, after described renewal, is entered as zero.
Described refresh module 602 can be used for performing step S406～S412.Refresh module 602 is in the previous scheduled time
In the assignment of request summation in the range of first time, receive in the scheduled time after utilization and previous scheduled time continuous print
Request refresh list.In the present embodiment, the value of the first scope is 0～10.
When the assignment of the request summation that refresh module 602 was additionally operable within the previous scheduled time is in the range of second, will be with
The request received in the scheduled time after previous scheduled time continuous print is stored in the first working area, and saturated in the first working area
Time, merge the request in described first working area, utilize the request after merging to refresh list.In the present embodiment, the second scope
Value is 11～100, and the first working area is buffer, a length of the 4 of the first working area, and what the i.e. first working area can store please
Seeking number is 4.
When the request summation that refresh module 602 was additionally operable within the previous scheduled time is in the range of the 3rd, will be pre-with previous
The request received in the scheduled time after continuous print of fixing time is stored in the second working area, and when the second working area is saturated, closes
And the request that second in working area, and the request after merging is utilized to refresh list.Refresh module 602 is additionally operable to respond timing
Trigger, utilize the request in the first working area or the second working area to refresh list.In the present embodiment, the value of the 3rd scope is
101～∞, the second working area and the first working area are buffer, and the length of this buffer can freely change, and this is second temporary
Depositing a length of the 8 of district, the number of request that the i.e. second working area can store is 8.
In sum, embodiments provide a kind of list method for refreshing and device, receiving, list is carried out
After the request refreshed, according to the assignment decision of the request summation of the previous scheduled time will with previous scheduled time continuous print after one pre-
The request received in fixing time refreshes list, or the request that will receive in the scheduled time after previous scheduled time continuous print
It is stored in working area.According to the quantity of system request, the real-time generation frequency adjusting list, it is ensured that the stable and list of system is raw
The quasi real time property become.
In several embodiments provided herein, it should be understood that disclosed apparatus and method, it is also possible to pass through
Other mode realizes.Device embodiment described above is only schematically, such as, and the flow chart in accompanying drawing and block diagram
Show the device of multiple embodiments according to the present invention, the architectural framework in the cards of method and computer program product,
Function and operation.In this, each square frame in flow chart or block diagram can represent a module, program segment or the one of code
Part, a part for described module, program segment or code comprises holding of one or more logic function for realizing regulation
Row instruction.It should also be noted that at some as in the implementation replaced, the function marked in square frame can also be to be different from
The order marked in accompanying drawing occurs.Such as, two continuous print square frames can essentially perform substantially in parallel, and they are the most also
Can perform in the opposite order, this is depending on involved function.It is also noted that every in block diagram and/or flow chart
The combination of the square frame in individual square frame and block diagram and/or flow chart, can be with function or the special base of action performing regulation
System in hardware realizes, or can realize with the combination of specialized hardware with computer instruction.
It addition, each functional module in each embodiment of the present invention can integrate one independent portion of formation
Point, it is also possible to it is modules individualism, it is also possible to two or more modules are integrated to form an independent part.
If described function is using the form realization of software function module and as independent production marketing or use, permissible
It is stored in a computer read/write memory medium.Based on such understanding, technical scheme is the most in other words
The part contributing prior art or the part of this technical scheme can embody with the form of software product, this meter
Calculation machine software product is stored in a storage medium, including some instructions with so that a computer equipment (can be individual
People's computer, server, or the network equipment etc.) perform all or part of step of method described in each embodiment of the present invention.
And aforesaid storage medium includes: USB flash disk, portable hard drive, read only memory (ROM, Read-Only Memory), random access memory are deposited
The various media that can store program code such as reservoir (RAM, Random Access Memory), magnetic disc or CD.Need
Illustrate, in this article, the relational terms of such as first and second or the like be used merely to by an entity or operation with
Another entity or operating space separate, and there is any this reality between not necessarily requiring or imply these entities or operating
The relation on border or order.And, term " includes ", " comprising " or its any other variant are intended to the bag of nonexcludability
Contain, so that include that the process of a series of key element, method, article or equipment not only include those key elements, but also include
Other key elements being not expressly set out, or also include the key element intrinsic for this process, method, article or equipment.
In the case of there is no more restriction, statement " including ... " key element limited, it is not excluded that including described key element
Process, method, article or equipment in there is also other identical element.
The foregoing is only the preferred embodiments of the present invention, be not limited to the present invention, for the skill of this area
For art personnel, the present invention can have various modifications and variations.All within the spirit and principles in the present invention, that is made any repaiies
Change, equivalent, improvement etc., should be included within the scope of the present invention.It should also be noted that similar label and letter exist
Figure below represents similar terms, therefore, the most a certain Xiang Yi accompanying drawing is defined, is then not required in accompanying drawing subsequently
It is defined further and explains.
Claims (15)
1. a list method for refreshing, it is characterised in that described method includes:
Receive the request that list is refreshed；
According to the assignment of the request summation in the previous scheduled time, utilize and after previous scheduled time continuous print in the scheduled time
The request received refreshes list, or is stored in temporary by the request received in the scheduled time after previous scheduled time continuous print
District.
List method for refreshing the most according to claim 1, it is characterised in that described method includes:
When the difference of the up-to-date time receiving request and the time of startup is in the range of the very first time, the startup time is updated to
The up-to-date time receiving request；
Ask the assignment of summation to be updated correspondence in the previous scheduled time, after described renewal, be entered as up-to-date receiving
Request summation cumulative before the time of request；
According to the assignment after described renewal, the up-to-date request received is utilized to refresh list or recently received please be seek survival
Enter working area.
List method for refreshing the most according to claim 1, it is characterised in that described method includes:
When in the time of latest requests and the difference of the time of startup are more than the second time range, the startup time is updated to described
The time of latest requests；
Ask the assignment of summation to be updated correspondence in the previous scheduled time, after described renewal, be entered as zero；
The up-to-date request received is utilized to refresh list.
List method for refreshing the most according to claim 1, it is characterised in that described method includes:
When the assignment of the request summation in the previous scheduled time is in the range of first, utilize and after previous scheduled time continuous print
The request received in one scheduled time refreshes list.
List method for refreshing the most according to claim 1, it is characterised in that described working area includes the first working area, institute
The method of stating includes:
When the assignment of the request summation in the previous scheduled time is in the range of second, will with previous scheduled time continuous print after one
The request received in the scheduled time is stored in the first working area, when described first working area is saturated, merges described first working area
Interior request obtains asking summation, and utilizes the request summation after merging to refresh list.
List method for refreshing the most according to claim 5, it is characterised in that described working area also includes the second working area,
The length in described second working area is more than the length in described first working area, and described method includes:
When the assignment of the request summation in the previous scheduled time is in the range of the 3rd, will with previous scheduled time continuous print after one
The request received in the scheduled time is stored in the second working area, when described second working area is saturated, merges described second working area
Interior request obtains asking summation, and utilizes the request summation after merging to refresh list.
List method for refreshing the most according to claim 1, it is characterised in that described method includes:
Response timing triggers, and utilizes the request in working area to refresh list.
8. a list refreshing apparatus, it is characterised in that described device includes:
Receiver module, for receiving the request refreshing list；
Refresh module, for the assignment according to the request summation in the previous scheduled time, utilizes and previous scheduled time continuous print
The request received in the rear scheduled time refreshes list, or receives within a scheduled time after previous scheduled time continuous print
Request be stored in working area.
List refreshing apparatus the most according to claim 8, it is characterised in that described device also includes:
Time more new module, is used for up-to-date to receive the difference of the time of request and the time of startup in the range of the very first time
Time, the startup time is updated to the up-to-date time receiving request；
Assignment more new module, for asking the assignment of summation to be updated correspondence in the previous scheduled time, after described renewal
Be entered as request summation cumulative till the up-to-date time receiving request；
Described refresh module be additionally operable to according to described renewal after assignment, utilize and up-to-date receive request and refresh list or will
The request being newly received is stored in working area.
List refreshing apparatus the most according to claim 8, it is characterised in that described device also includes:
Time more new module, time in when the time of latest requests and the difference of the time of startup more than the second time range, will
The startup time is updated to the time of described latest requests；
Assignment more new module, for asking the assignment of summation to be updated correspondence in the previous scheduled time, after described renewal
Be entered as zero；
Described refresh module be additionally operable within the previous scheduled time correspondence request summation be entered as when zero utilizing up-to-date acceptance
List is refreshed to request.
11. list refreshing apparatus according to claim 8, it is characterised in that described refresh module is for previous predetermined
When the assignment of the request summation in the time is in the range of first, utilizes and connect in a scheduled time after previous scheduled time continuous print
The request received refreshes list.
12. list refreshing apparatus according to claim 8, it is characterised in that described working area includes the first working area, institute
State the refresh module assignment for the request summation within the previous scheduled time in the range of second time, will be with the previous scheduled time
The request received in the scheduled time after continuous print is stored in the first working area, and
When described first working area is saturated, merges the request in described first working area and obtain asking summation, and utilize merging
After request summation refresh list.
13. list refreshing apparatus according to claim 11, it is characterised in that described working area also includes that second keeps in
District, the length in described second working area is more than the length in described first working area, and described refresh module is in previous pre-timing
In request summation in the range of the 3rd time, by with previous scheduled time continuous print after the request that receives in a scheduled time
It is stored in the second working area, and
When described second working area is saturated, merges the request in described second working area and obtain asking summation, and utilize merging
After request summation refresh list.
14. list refreshing apparatus according to claim 8, it is characterised in that described refresh module is additionally operable to response timing
Time Triggered, utilizes the request in working area to refresh list.
15. 1 kinds of service ends, it is characterised in that described service end includes:
Memorizer；
Processor；And
List refreshing apparatus, described list refreshing apparatus is installed in described memorizer and includes one or more by described process
The software function module that device performs, described list refreshing apparatus includes:
Receiver module, for receiving the request refreshing list；
Refresh module, for the assignment according to the request summation in the previous scheduled time, utilizes and previous scheduled time continuous print
The request received in the rear scheduled time refreshes list, or receives within a scheduled time after previous scheduled time continuous print
Request be stored in working area.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610640064.7A CN106294691B (en) | 2016-08-04 | 2016-08-04 | List refreshing method and device and server |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610640064.7A CN106294691B (en) | 2016-08-04 | 2016-08-04 | List refreshing method and device and server |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106294691A true CN106294691A (en) | 2017-01-04 |
| CN106294691B CN106294691B (en) | 2020-03-03 |
Family
ID=57665925
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610640064.7A Expired - Fee Related CN106294691B (en) | 2016-08-04 | 2016-08-04 | List refreshing method and device and server |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106294691B (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107609015A (en) * | 2017-08-02 | 2018-01-19 | 武汉斗鱼网络科技有限公司 | A kind of methods of exhibiting of hot list, device, live Platform Server and medium |
| CN108984287A (en) * | 2018-07-06 | 2018-12-11 | 武汉斗鱼网络科技有限公司 | A kind of sliding list processing method, device, equipment and medium |
| CN109614555A (en) * | 2018-12-27 | 2019-04-12 | 腾讯音乐娱乐科技（深圳）有限公司 | The method and apparatus for generating ranking list |
| CN109636475A (en) * | 2018-12-14 | 2019-04-16 | 平安城市建设科技(深圳)有限公司 | Source of houses method for refreshing, device, equipment and storage medium |
| CN110401843A (en) * | 2019-08-06 | 2019-11-01 | 广州虎牙科技有限公司 | List data-updating method, device, equipment and medium in platform is broadcast live |
| CN111914140A (en) * | 2020-07-24 | 2020-11-10 | 上海阅文信息技术有限公司 | Real-time list realization method and system based on message data source |
| WO2021082649A1 (en) * | 2019-10-29 | 2021-05-06 | 北京字节跳动网络技术有限公司 | List update method and apparatus, readable medium, and electronic device |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7127485B2 (en) * | 2002-01-18 | 2006-10-24 | Telcordia Technologies, Inc. | Adaptive polling for asynchronous notification |
| US20080021872A1 (en) * | 2006-07-19 | 2008-01-24 | Ibm Corporation | Customized, Personalized, Integrated Client-Side Search Indexing of the Web |
| CN102880603A (en) * | 2011-07-11 | 2013-01-16 | 阿里巴巴集团控股有限公司 | Method and equipment for filtering ranking list data |
| CN104486129A (en) * | 2014-12-24 | 2015-04-01 | 中国科学院计算技术研究所 | Method and system for guaranteeing application service quality in distributed environment |
| CN104765782A (en) * | 2015-03-20 | 2015-07-08 | 五八同城信息技术有限公司 | Index sequencing updating method and device |
| CN104808984A (en) * | 2015-03-24 | 2015-07-29 | 魅族科技（中国）有限公司 | Display interface refresh method and device |
| CN105100143A (en) * | 2014-05-04 | 2015-11-25 | 腾讯科技（深圳）有限公司 | Data display method and device |
| CN105426433A (en) * | 2015-11-02 | 2016-03-23 | 广州华多网络科技有限公司 | Ranking list data response method and request method as well as ranking list data display system |
| CN105677819A (en) * | 2015-12-31 | 2016-06-15 | 广州华多网络科技有限公司 | Ranking list refreshing method and device |
| CN105808736A (en) * | 2016-03-10 | 2016-07-27 | 微梦创科网络科技（中国）有限公司 | List data updating method, apparatus and system |
-
2016
- 2016-08-04 CN CN201610640064.7A patent/CN106294691B/en not_active Expired - Fee Related
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7127485B2 (en) * | 2002-01-18 | 2006-10-24 | Telcordia Technologies, Inc. | Adaptive polling for asynchronous notification |
| US20080021872A1 (en) * | 2006-07-19 | 2008-01-24 | Ibm Corporation | Customized, Personalized, Integrated Client-Side Search Indexing of the Web |
| CN102880603A (en) * | 2011-07-11 | 2013-01-16 | 阿里巴巴集团控股有限公司 | Method and equipment for filtering ranking list data |
| CN105100143A (en) * | 2014-05-04 | 2015-11-25 | 腾讯科技（深圳）有限公司 | Data display method and device |
| CN104486129A (en) * | 2014-12-24 | 2015-04-01 | 中国科学院计算技术研究所 | Method and system for guaranteeing application service quality in distributed environment |
| CN104765782A (en) * | 2015-03-20 | 2015-07-08 | 五八同城信息技术有限公司 | Index sequencing updating method and device |
| CN104808984A (en) * | 2015-03-24 | 2015-07-29 | 魅族科技（中国）有限公司 | Display interface refresh method and device |
| CN105426433A (en) * | 2015-11-02 | 2016-03-23 | 广州华多网络科技有限公司 | Ranking list data response method and request method as well as ranking list data display system |
| CN105677819A (en) * | 2015-12-31 | 2016-06-15 | 广州华多网络科技有限公司 | Ranking list refreshing method and device |
| CN105808736A (en) * | 2016-03-10 | 2016-07-27 | 微梦创科网络科技（中国）有限公司 | List data updating method, apparatus and system |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107609015A (en) * | 2017-08-02 | 2018-01-19 | 武汉斗鱼网络科技有限公司 | A kind of methods of exhibiting of hot list, device, live Platform Server and medium |
| CN108984287A (en) * | 2018-07-06 | 2018-12-11 | 武汉斗鱼网络科技有限公司 | A kind of sliding list processing method, device, equipment and medium |
| CN108984287B (en) * | 2018-07-06 | 2020-10-16 | 武汉斗鱼网络科技有限公司 | Sliding list processing method, device, equipment and medium |
| CN109636475A (en) * | 2018-12-14 | 2019-04-16 | 平安城市建设科技(深圳)有限公司 | Source of houses method for refreshing, device, equipment and storage medium |
| CN109614555A (en) * | 2018-12-27 | 2019-04-12 | 腾讯音乐娱乐科技（深圳）有限公司 | The method and apparatus for generating ranking list |
| CN110401843A (en) * | 2019-08-06 | 2019-11-01 | 广州虎牙科技有限公司 | List data-updating method, device, equipment and medium in platform is broadcast live |
| CN110401843B (en) * | 2019-08-06 | 2022-02-25 | 广州虎牙科技有限公司 | List data updating method, apparatus, device and medium in live broadcast platform |
| WO2021082649A1 (en) * | 2019-10-29 | 2021-05-06 | 北京字节跳动网络技术有限公司 | List update method and apparatus, readable medium, and electronic device |
| US20220374419A1 (en) * | 2019-10-29 | 2022-11-24 | Beijing Bytedance Network Technology Co., Ltd. | List update method and apparatus, readable medium, and electronic device |
| CN111914140A (en) * | 2020-07-24 | 2020-11-10 | 上海阅文信息技术有限公司 | Real-time list realization method and system based on message data source |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106294691B (en) | 2020-03-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106294691A (en) | List method for refreshing, device and service end | |
| Alam et al. | Autonomic computation offloading in mobile edge for IoT applications | |
| CN107196869B (en) | The adaptive load balancing method, apparatus and system of Intrusion Detection based on host actual loading | |
| Berger et al. | {RobinHood}: Tail Latency Aware Caching--Dynamic Reallocation from {Cache-Rich} to {Cache-Poor} | |
| CN104584637B (en) | Network selection based on measurement | |
| CN105450579B (en) | Internet resources pre-add support method, client and middleware server | |
| CN112165691B (en) | Content delivery network scheduling method, device, server and medium | |
| CN102088754B (en) | Network access behavior-based access control method and system for wireless local area network | |
| CN104349391B (en) | A kind of scheduling processing method and device of WiFi working terminal | |
| CN112291793B (en) | Resource allocation method and device of network access equipment | |
| CN102681999A (en) | Method and device for collecting and sending user action information | |
| CN102868732A (en) | Account password-based login implementation method, system and device | |
| CN110380891A (en) | Edge computing service resource allocation method and device and electronic equipment | |
| CN103581207A (en) | Cloud terminal data storage system and data storing and sharing method based on cloud terminal data storage system | |
| Laghari et al. | Impact of storage of mobile on quality of experience (QoE) at user level accessing cloud | |
| CN109725988B (en) | Task scheduling method and device | |
| CN102750169A (en) | Television based application program recommending method | |
| CN111901385B (en) | Cloud hard disk speed limiting method, system, device and computer readable storage medium | |
| CN106233674A (en) | The battery-efficient using the communication of token bucket synchronizes | |
| CN106021512A (en) | Page refresh method and apparatus | |
| CN112187670B (en) | Networked software shared resource allocation method and device based on group intelligence | |
| CN109690483A (en) | For determining and mitigating the technology of the delay in virtual environment | |
| CN110286928A (en) | Interface element update method, device, electronic equipment and the storage medium of application program | |
| Cui et al. | Trading off between multi-tenancy and interference: A service user allocation game | |
| CN103605549A (en) | Interface exit display method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20200526 Address after: 310051 room 508, floor 5, building 4, No. 699, Wangshang Road, Changhe street, Binjiang District, Hangzhou City, Zhejiang Province Patentee after: Alibaba (China) Co.,Ltd. Address before: 510000 Room 07, First Floor, 146-150 Huangpu Avenue Middle Road, Tianhe District, Guangzhou City, Guangdong Province Patentee before: GUANGZHOU JIAOYIMAO INFORMATION TECHNOLOGY Co.,Ltd. |
|
| TR01 | Transfer of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20200303 Termination date: 20200804 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |