CN110413887A - A kind of information push frequency limit method and system - Google Patents
A kind of information push frequency limit method and system Download PDFInfo
- Publication number
- CN110413887A CN110413887A CN201910663724.7A CN201910663724A CN110413887A CN 110413887 A CN110413887 A CN 110413887A CN 201910663724 A CN201910663724 A CN 201910663724A CN 110413887 A CN110413887 A CN 110413887A
- Authority
- CN
- China
- Prior art keywords
- push
- list
- frequency
- user list
- user
- 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
- 238000000034 method Methods 0.000 title claims abstract description 56
- 230000005540 biological transmission Effects 0.000 claims description 6
- 230000015572 biosynthetic process Effects 0.000 claims description 4
- 238000001914 filtration Methods 0.000 claims description 4
- 238000012216 screening Methods 0.000 claims description 2
- 238000004364 calculation method Methods 0.000 abstract description 3
- 230000000875 corresponding effect Effects 0.000 description 30
- PEDCQBHIVMGVHV-UHFFFAOYSA-N Glycerine Chemical compound OCC(O)CO PEDCQBHIVMGVHV-UHFFFAOYSA-N 0.000 description 5
- 238000013459 approach Methods 0.000 description 3
- 238000013500 data storage Methods 0.000 description 2
- 230000003442 weekly effect Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000008094 contradictory effect Effects 0.000 description 1
- 230000002596 correlated effect Effects 0.000 description 1
- 238000002716 delivery method Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000002360 explosive Substances 0.000 description 1
- 238000000605 extraction Methods 0.000 description 1
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/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
-
- 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/953—Querying, e.g. by the use of web search engines
- G06F16/9535—Search customisation based on user profiles and personalisation
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)
- Software Systems (AREA)
- User Interface Of Digital Computer (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a kind of information to push frequency limit method and system.Method includes: the step of storing user to be pushed, setting push period and the corresponding frequency upper limit using bitmap method, the step of recording the step of user record pushed under each frequency, can push user list based on record determination and push step.System includes data receipt unit, configuration unit, the first storage unit, the second storage unit, arithmetic element and push unit, configuration unit is according to data receipt unit received data configuration push period and the corresponding frequency upper limit, first storage unit storage can push user, second unit records have pushed user, arithmetic element screens user to be pushed away from can push away in user, updates user to be pushed away into the second storage unit also after push.Data record amount of the present invention is only related with frequency setting, i.e. data record amount is considerably less, the operation for data, can directly carry out simple logical operation, and operand is small, and required calculation resources are few.
Description
Technical field
The present invention relates to information to push field, the especially a kind of information-pushing method and system of limitation push frequency.
Background technique
The development of the communication technology brings the explosive growth of information, for obtaining the way of effective knowledge from massive information
Diameter, other than user actively subscribes to, it to be the active push of platform that there are also a kind of modes.
Existing information push platform has been achieved with the personalized push of information, i.e., pushes for different users different
Content, for each category information, correspondence establishment needs the user list pushed.But existing information push platform is generally deposited
In following problems, i.e., contradictory problems between the experience bothered of the push frequency of information and user, for the frequency limit of information push,
The prior art sets corresponding push rule, and one of the most common is that at the appointed time (interior) setting pushes the frequency upper limit.
But the setting for the frequency, the prior art using be directed to each user, be set separately push the time with
And the push frequency, cause data storage capacity to be positively correlated with user's total amount, calculation amount exponentially type is related.If user volume reaches one
Fixed number magnitude can then consume huge memory space and computing resource.
Summary of the invention
Goal of the invention of the invention is: in view of the above problems, the information for providing a kind of limitation push frequency pushes away
Delivery method and system.To realize the agreement to the information push frequency by few memory space and operand.
The technical solution adopted by the invention is as follows:
A kind of information push frequency limit method comprising following steps:
The first user list to be pushed is stored using bitmap method, is set separately under several push periods and is respectively pushed the frequency
The upper limit；
Record is completed in each push frequency being respectively stored under each push period using bitmap method, forms the second class and uses
Family list；
Using basic logic operation, it is based on the second class user list, from the first user list, filtering out at least can also be pushed away
The user of primary information is sent to form push list；
User's pushed information into push list；
It, will be in the corresponding record of the second class user list before push list update to push using basic logic operation.
The present invention dexterously utilizes bitmap method storage push record, and the item number of required record only has with the push frequency limit frequency
It closes, can substantially reduce the demand to data space compared with traditional approach.Meanwhile the data of storage can directly carry out " position " fortune
It calculates, so that the calculating to storing data can be realized by simple logic operation, calculation method is simple, quick, and operand is small.
Further, above-mentioned to use basic logic operation, it is based on the second class user list, from the first user list, sieve
Select the user's formation push list that at least can also push primary information specifically:
Step is executed by the sequence of push period from long to short:
S1: the collection cooperation difference set to reach the push frequency upper limit in the first user list and the second class user list obtains
Third user list；
S2: when currently the push period is the non-most short push period, using the data of third user list as next push
The first user list that data calculate in period repeats step S1, otherwise, using third user list as push list.
Further, above-mentioned to use basic logic operation, the record for pushing list is updated to the second class before push and is used
In the corresponding record of family list specifically: use basic logic operation, second before the record for pushing list to be added to push
In the corresponding record of class user list.
Further, above-mentioned to use basic logic operation, the record for pushing list is added to the second class before push and is used
In the corresponding record of family list specifically:
For each push period, following step is executed by the sequence of the frequency from low to high is pushed in the second class user list
It is rapid:
S3: when the currently push frequency is that non-highest pushes the frequency, S4 is executed, S5 is otherwise executed；
S4: obtaining the 5th user list to push the collection cooperation union of list and the current push frequency, obtains the as difference set
Six user lists；The set of corresponding push frequency under the second class user list is updated with the data of the 5th user list；With the 6th
Push list when the data of user list are calculated as next push frequency, executes S3；
S5: the 7th user list is obtained to push the collection cooperation union of list and the current push frequency, with the 7th user column
The data of table update the set of the corresponding push frequency under the second class user list.
The unresolved above problem, the present invention provides a kind of information transmission systems of limit frequency comprising data receiver
Unit, configuration unit, the first storage unit, the second storage unit, arithmetic element and push unit, in which:
Data receipt unit is used to receive the setting to several push periods, and pushes in the frequency under each push period
The setting of limit；
Configuration unit is used to several push periods be respectively configured, and each according to the received data of data receipt unit
Push the push frequency upper limit under the period；
First storage unit is used to store the first user list to be pushed using bitmap method；
Each push frequency that second storage unit is used to be respectively stored in using bitmap method under each push period is completed
Record forms the second class user list；
Arithmetic element is used to use basic logic operation, is based on the second class user list, from the first user list, screening
The user that at least can also push primary information out forms push list；It is also used to that list will be pushed using basic logic operation
Record is updated into the corresponding record of the second class user list in the second storage unit；
Push unit is used for user's pushed information into push list.
Further, above-mentioned arithmetic element uses basic logic operation, is based on the second class user list, arranges from the first user
In table, filtering out at least can also push the method that the user of primary information forms push list are as follows:
Step is executed by the sequence of push period from long to short:
S1: the collection cooperation difference set to reach the push frequency upper limit in the first user list and the second class user list obtains
Third user list；
S2: when currently the push period is the non-most short push period, using the data of third user list as next push
The first user list that data calculate in period repeats step S1, otherwise, using third user list as push list.
Further, above-mentioned arithmetic element uses basic logic operation, and the record for pushing list is updated to the second storage
Method in the corresponding record of the second class user list in unit are as follows: use basic logic operation, the record of list will be pushed
It is added in the corresponding record of the second class user list in the second storage unit.
Further, above-mentioned arithmetic element uses basic logic operation, and the record for pushing list is updated to the second storage
Method in the corresponding record of the second class user list in unit are as follows:
For each push period, following step is executed by the sequence of the frequency from low to high is pushed in the second class user list
It is rapid:
S3: when the currently push frequency is that non-highest pushes the frequency, S4 is executed, S5 is otherwise executed；
S4: obtaining the 5th user list to push the collection cooperation union of list and the current push frequency, obtains the as difference set
Six user lists；It is updated with the data of the 5th user list and corresponds to push frequency in the second storage unit under the second class user list
Set；Push list when being calculated using the data of the 6th user list as next push frequency, executes S3；
S5: the 7th user list is obtained to push the collection cooperation union of list and the current push frequency, with the 7th user column
The data of table update the set of the corresponding push frequency under the second class user list in the second storage unit.
In conclusion by adopting the above-described technical solution, the beneficial effects of the present invention are:
1, in date storage method, the present invention uses bitmap method storing data, data volume only with bitmap quantity (number of tags
The upper limit of amount, the i.e. frequency limitation) it is related, it is recorded respectively within each push period for each user respectively compared with traditional approach
Mode (related to user volume), can be greatly reduced the requirement to memory space.
2, in terms of data operation, the present invention directly can carry out logical operation to the data of storage, and operation is simple, quick,
Operand is few.Compared with the operand of traditional approach and user volume exponentially type relation with increase, the present invention only need to the bitmap of configuration into
Row operation.
Detailed description of the invention
Examples of the present invention will be described by way of reference to the accompanying drawings, in which:
Fig. 1 is one embodiment of the method for the present invention step A-D.
Fig. 2 is one embodiment of the method for the present invention step G-I.
Specific embodiment
All features disclosed in this specification or disclosed all methods or in the process the step of, in addition to mutually exclusive
Feature and/or step other than, can combine in any way.
Any feature disclosed in this specification (including any accessory claim, abstract), unless specifically stated,
It is replaced by other equivalent or with similar purpose alternative features.That is, unless specifically stated, each feature is a series of
An example in equivalent or similar characteristics.
Embodiment one
A kind of information push frequency limit method, comprising the following steps:
User list to be pushed is stored using bitmap method, is set separately under several push periods and respectively pushes the upper of the frequency
Limit.Such as it is set with 3 push periods: in the first, second, and third push period, under each push period, and is set separately
There is the push frequency upper limit, such as the push frequency upper limit of the first push cycle set is X, the push frequency of the second push cycle set
The secondary upper limit is Y ....
Record is completed in each push frequency being respectively stored under each push period using bitmap method.For example, by using bitmap
Method was separately recorded under the first push period, completed the set of 1 time, 2 times ... push of push, complete under the second push period
At the set of 1 time, 2 times ... push of push.Obviously, under the different push periods, it should there are the coincidence of record, i.e., a certain push
Between period and another push period there may be comprising with by comprising relationship, or there are intersections.
Using basic logic operation, record is completed based on each push frequency under each push period, from use to be pushed
In the list of family, the user's formation push list that at least can also push primary information is filtered out；And the user into the push list
Pushed information.The so-called user that can also push primary information, under each push period, to be the use for reaching the push frequency upper limit
Family, as long as user, which not in the corresponding set of each push frequency upper limit, that is, can determine that the user belongs to, at least can also push once
The user of information.
After completing information push, the record that is completed to each push frequency under each push period is needed to be updated.
Using basic logic operation, each push under each push period before the record in list is added to push will be pushed
The frequency is completed in record.Two states are arranged, for data in bitmap method storing data under each user tag
Update, for carried out on " position " for corresponding to user be non-property label all can, therefore, can be quick using basic logic operation
Complete the judgement to User Status.
Embodiment two
Present embodiment discloses a kind of information to push frequency limit method comprising following steps:
The first user list to be pushed is stored using bitmap method, is set separately in the push frequency in each push period
Limit.
A. the second class user list that each push frequency is completed being stored in respectively with bitmap method under each push period.
B. in each push, step C-D is executed by the sequence of push period from long to short:
C. to reach the collection cooperation difference set of the push frequency upper limit in the first user list and the second class user list, the is obtained
Three user lists indicate the user list that the frequency upper limit is not up to pushed within the push period；
D. when currently the push period is the non-most short push period, using the data of third user list as next push week
In phase data calculate the first user list, repeat step C, otherwise, using third user list as can pushed information the 4th
User list executes E.
The flow chart of above-mentioned steps A-D is as shown in Figure 1.
E. user's pushed information into fourth user list.
F. for each push period, following step is executed by the sequence of the frequency from low to high is pushed in the second class user list
It is rapid:
G. when the currently push frequency is that non-highest pushes the frequency, H is executed, otherwise, executes I.
H. the 5th user list is obtained as union with fourth user list and the list of the current push frequency, is obtained as difference set
6th user list；The set of corresponding push frequency under the second class user list is updated with the data of the 5th user list；With
Fourth user list when the data of six user lists are calculated as next push frequency, executes G.
I: the 7th user list is obtained with the collection cooperation union of fourth user list and the current push frequency, with the 7th user
The data of list update the set of the highest push frequency under the second class user list.
The flow chart of step G-I is as shown in Figure 2.
Embodiment three
Based on embodiment two, present embodiment discloses a kind of information to push frequency limit method comprising following steps:
It is process of information push for step A-D.In the present embodiment, sets each user one day and at most push away 2, one
It is all at most to push away 5, one month most 15.It is one day therein, one week, January then indicate the push period, corresponding number is then to push away
Send the frequency upper limit.
For daily frequency limit, the storage of bitmap method adds the keyword for pushing the frequency as corresponding lists using the daily date,
Such as with certain day date D20190425 plus the corresponding push frequency 1 or 2 (corresponding result be D20190425_1,
D20190425_2 it) indicates to have pushed the user list of 1 time and 2 times information on April 25th, 2019.
For frequency limit weekly, the storage of bitmap method adds the push frequency as the keyword of corresponding lists using all serial numbers, such as
It is indicated with W201901 (all serial numbers) plus the corresponding push frequency 1 or 5 (corresponding result is W201901_1, W201901_5)
The user list of 1 time and 5 times information is pushed within 1st week within 2019.
For frequency limit monthly, bitmap method storage using add in month push the frequency as corresponding lists keyword, such as with
M201912 (month) indicates 2019 plus the corresponding push frequency 1 or 15 (corresponding result is M201912_1, M201912_15)
Year has pushed the user list of 1 time and 15 times information week in December.
Then, the second class user list includes 3 push periods and 2+5+15=22 push frequency set.Collective number with
Number of users is unrelated.
In each pushed information, with the user list A (i.e. the first user list) to PUSH message and push the current moon
It crosses 15 set B15 (i.e. completing the set of moon highest frequency push in the second class user list) and obtains C15 as set difference operation
(being the third user list for pushing the period with the moon), indicates that explanation is not above the limit of the current moon not in B15 in A
System, C15 and the user's set (i.e. the set of all highest frequency push is completed in the second class user list) for pushing 5 current week
Make difference set, show that C151 expression had both been not above moon frequency limit or had been not above the user list of all frequency limits, C151 continues and the same day
It has pushed 2 set (i.e. completing the set of day highest frequency push in the second class user list) and has obtained set as difference set
C1511, C1511 are that the user that can be pushed gathers (i.e. fourth user list).
User's pushed information into set C1511 will not violate set frequency limit rule.
For traditional information pushes record storage mode, need to each user in pushing away daily, weekly, monthly
The frequency is sent to be recorded respectively, after pushing each time, each user needs to save 3 records, i.e., the required record saved
Item number is that user volume * pushes periodicity, such as 10 general-purpose families, then needs to save 1,0*3,=30 ten thousand records after pushing each time.This
The storage that invention is dexterously recorded using bitmap method, no matter user volume how many, amount of storage only with the frequency upper limit of configuration
Related, under comparable user amount and frequency limit condition, data storage capacity is substantially reduced.
After pushed information, need to be updated to having pushed record.Step is updated such as the data of push frequency record
Under (the step F-I of corresponding embodiment one):
Set C1511 pushed with the same day 1 time set D1 (i.e. in the second class user list push the period be day, push away
The push that the frequency is 1 is sent to record, below similarly) CD_U1 is obtained as union, CD_S1 is obtained as difference set, by CD_U1 setting to D1
Primary user's set was pushed as the new same day.Union is taken to obtain CD_ CD_S1 and the same day set D2 for pushing 2 times
U2 gathers the user that CD_U2 setting to D2 pushed 2 times as the new same day.
The set W1 that set C1511 and this week pushed 1 time obtains CW_U1 as union, obtains CW_S1 as difference set, will
CW_U1 setting pushed primary user's set as new this week to W1.CW_S1 and this week were pushed to 2 set W2
It takes union to obtain CW_U2, obtains CW_S2 as difference set, the user that CW_U2 setting to W2 pushed 2 times as new this week is collected
It closes ....And so on, until the set W5 that CW_S4 and this week were pushed 5 times takes union to obtain CW_U5, CW_U5 is set
Set user's set that W5 pushed 5 times as new this week.
The set M1 that set C1511 and this month pushed 1 time obtains CM_U1 as union, obtains CM_S1 as difference set, will
CM_U1 setting pushed primary user's set as new this month to M1.CM_S1 and this month were pushed to 2 set M2
It takes union to obtain CM_U2, obtains CM_S2 as difference set, the user that CM_U2 setting to M2 pushed 2 times as new this month is collected
It closes ....And so on, until the set M15 that CM_S14 and this month were pushed 15 times takes union to obtain CM_U15, by CM_
U15 setting pushed 15 user's set to M15 as new this week.
In data update, traditional data are updated there is still a need for being updated for each record, for 100,000 grades
User volume needs to carry out the updates of up to a million records, and the present invention is in such a way that bitmap method stores, for record
It updates, it is only necessary to update the bitmap for corresponding to frequency limit frequency quantity.
Example IV
Present embodiment discloses a kind of information transmission systems of limit frequency comprising data receipt unit, configuration unit,
First storage unit, the second storage unit, arithmetic element and push unit, in which:
Data receipt unit is used to receive the setting to several push periods, and pushes in the frequency under each push period
The setting of limit.That is setting of the administrator to system, the push in each period and cycle duration and each period including setting
The frequency upper limit (or setting push frequency, calculate the frequency automatically).For routine, the period is longer, the average daily push frequency
The upper limit is lower, and otherwise macrocyclic setting is exactly invalid.
Configuration unit is used to several push periods be respectively configured, and each according to the received data of data receipt unit
Push the push frequency upper limit under the period.
First storage unit is used to store the first user list to be pushed using bitmap method.Bitmap method storing data only needs
The record strip number of label bar number quantity is stored, rather than label is respectively created in each user.
Each push frequency that second storage unit is used to be respectively stored in using bitmap method under each push period is completed
Record forms the second class user list.Comprising several set in second class user list, particular number corresponds to each push week
The summation of the frequency upper limit in phase, the user list under each set record corresponding period, the frequency.
Arithmetic element is used to use basic logic operation, is based on the second class user list, from the first user list,
Filter out the user's formation push list that at least can also push primary information.In one embodiment, the calculating process include with
Lower step: step is executed by the sequence of push period from long to short:
S1: the collection cooperation difference set to reach the push frequency upper limit in the first user list and the second class user list obtains
Third user list；
S2: when currently the push period is the non-most short push period, using the data of third user list as next push
The first user list that data calculate in period repeats step S1, otherwise, using third user list as push list.
Arithmetic element is also used to update the record for pushing list (as added up-making with former record using basic logic operation
Former record is replaced after union) into the corresponding record of the second class user list in the second storage unit.In one embodiment,
The calculating process the following steps are included:
For each push period, following step is executed by the sequence of the frequency from low to high is pushed in the second class user list
It is rapid:
S3: when the currently push frequency is that non-highest pushes the frequency, S4 is executed, S5 is otherwise executed；
S4: obtaining the 5th user list to push the collection cooperation union of list and the current push frequency, obtains the as difference set
Six user lists；It is updated with the data of the 5th user list and corresponds to push frequency in the second storage unit under the second class user list
Set；Push list when being calculated using the data of the 6th user list as next push frequency, executes S3；
S5: the 7th user list is obtained to push the collection cooperation union of list and the current push frequency, with the 7th user column
The data of table update the set of the corresponding push frequency under the second class user list in the second storage unit.
Since storing data is stored using bitmap method, then it can directly carry out or wait logical operations quickly to calculate with non-
As a result, and not having to carry out traversal retrieval, extraction, data type conversion and calculating to each set.
Push unit is used for user's pushed information into push list.PUSH message is final purpose.It pushes in list
Be recorded as push user in limit frequency.
By above system, under the premise of ensuring information being pushed to booking reader end in time, frequency limit setting has been carried out,
Memory space requirement when the system stores data is smaller, and in terms of data operation, the logical operation using basis to transport
Resource requirement is calculated substantially to be reduced.
The invention is not limited to specific embodiments above-mentioned.The present invention, which expands to, any in the present specification to be disclosed
New feature or any new combination, and disclose any new method or process the step of or any new combination.
Claims (8)
1. a kind of information pushes frequency limit method, which comprises the following steps:
The first user list to be pushed is stored using bitmap method, is set separately under several push periods and is respectively pushed the upper of the frequency
Limit；
Record is completed in each push frequency being respectively stored under each push period using bitmap method, forms the second class user column
Table；
Using basic logic operation, it is based on the second class user list, from the first user list, filtering out at least can also be pushed away
The user of primary information is sent to form push list；
User's pushed information into push list；
It, will be in the corresponding record of the second class user list before push list update to push using basic logic operation.
2. information as described in claim 1 pushes frequency limit method, which is characterized in that it is described to use basic logic operation, it is based on
The second class user list filters out the user's formation push that at least can also push primary information from the first user list
List specifically:
Step is executed by the sequence of push period from long to short:
S1: the collection cooperation difference set to reach the push frequency upper limit in the first user list and the second class user list obtains third
User list；
S2: when currently the push period is the non-most short push period, using the data of third user list as next push period
The first user list that interior data calculate repeats step S1, otherwise, using third user list as push list.
3. information as claimed in claim 1 or 2 pushes frequency limit method, which is characterized in that it is described to use basic logic operation, it will
The record for pushing list is updated into the corresponding record of the second class user list before push specifically: is transported using basic logic
It calculates, in the corresponding record for the second class user list that the record for pushing list is added to before push.
4. information as claimed in claim 3 pushes frequency limit method, which is characterized in that it is described to use basic logic operation, it will push away
In the corresponding record for the second class user list for sending the record of list to be added to before push specifically:
For each push period, following steps are executed by the sequence of the frequency from low to high is pushed in the second class user list:
S3: when the currently push frequency is that non-highest pushes the frequency, S4 is executed, S5 is otherwise executed；
S4: the 5th user list is obtained to push the collection cooperation union of list and the current push frequency, is used as difference set and obtains the 6th
Family list；The set of corresponding push frequency under the second class user list is updated with the data of the 5th user list；With the 6th user
Push list when the data of list are calculated as next push frequency, executes S3；
S5: the 7th user list is obtained to push the collection cooperation union of list and the current push frequency, with the 7th user list
Data update the set of the corresponding push frequency under the second class user list.
5. a kind of information transmission system of limit frequency, which is characterized in that deposited including data receipt unit, configuration unit, first
Storage unit, the second storage unit, arithmetic element and push unit, in which:
Data receipt unit is used to receive the setting to several push periods, and to the push frequency upper limit under each push period
Setting；
Configuration unit is used to that several push periods, and each push to be respectively configured according to the received data of data receipt unit
The push frequency upper limit under period；
First storage unit is used to store the first user list to be pushed using bitmap method；
Record is completed in each push frequency that second storage unit is used to be respectively stored in using bitmap method under each push period,
Form the second class user list；
Arithmetic element is used to use basic logic operation, is based on the second class user list, from the first user list, screening
The user that at least can also push primary information out forms push list；It is also used to that list will be pushed using basic logic operation
Record is updated into the corresponding record of the second class user list in the second storage unit；
Push unit is used for user's pushed information into push list.
6. the information transmission system of limit frequency as claimed in claim 5, which is characterized in that the arithmetic element is using basis
Logical operation is based on the second class user list, and from the first user list, filtering out at least can also push primary information
The method that user forms push list are as follows:
Step is executed by the sequence of push period from long to short:
S1: the collection cooperation difference set to reach the push frequency upper limit in the first user list and the second class user list obtains third
User list；
S2: when currently the push period is the non-most short push period, using the data of third user list as next push period
The first user list that interior data calculate repeats step S1, otherwise, using third user list as push list.
7. such as the information transmission system of limit frequency described in claim 5 or 6, which is characterized in that the arithmetic element uses
Basic logic operation updates the record for pushing list into the corresponding record of the second class user list in the second storage unit
Method are as follows: use basic logic operation, by the record for pushing list be added to the second class user in the second storage unit arrange
In the corresponding record of table.
8. the information transmission system of limit frequency as claimed in claim 7, which is characterized in that the arithmetic element is using basis
Logical operation updates the record for pushing list to the side in the corresponding record of the second class user list in the second storage unit
Method are as follows:
For each push period, following steps are executed by the sequence of the frequency from low to high is pushed in the second class user list:
S3: when the currently push frequency is that non-highest pushes the frequency, S4 is executed, S5 is otherwise executed；
S4: the 5th user list is obtained to push the collection cooperation union of list and the current push frequency, is used as difference set and obtains the 6th
Family list；The collection of corresponding push frequency under the second class user list in the second storage unit is updated with the data of the 5th user list
It closes；Push list when being calculated using the data of the 6th user list as next push frequency, executes S3；
S5: the 7th user list is obtained to push the collection cooperation union of list and the current push frequency, with the 7th user list
Data update the set of the corresponding push frequency under the second class user list in the second storage unit.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910663724.7A CN110413887B (en) | 2019-07-23 | 2019-07-23 | Information pushing frequency limiting method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910663724.7A CN110413887B (en) | 2019-07-23 | 2019-07-23 | Information pushing frequency limiting method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110413887A true CN110413887A (en) | 2019-11-05 |
| CN110413887B CN110413887B (en) | 2022-03-25 |
Family
ID=68362463
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910663724.7A Active CN110413887B (en) | 2019-07-23 | 2019-07-23 | Information pushing frequency limiting method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110413887B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104572810A (en) * | 2014-11-17 | 2015-04-29 | 深圳市光息谷科技发展有限公司 | Method for carrying out operation processing on massive files by utilizing bitmaps |
| US9772910B1 (en) * | 2015-12-07 | 2017-09-26 | EMC IP Holding Co. LLC | Resource optimization for storage integrated data protection |
| CN109743378A (en) * | 2018-12-27 | 2019-05-10 | 北京爱奇艺科技有限公司 | Information transmission system, information-pushing method and electronic equipment |
| CN110018996A (en) * | 2018-07-23 | 2019-07-16 | 郑州云海信息技术有限公司 | A kind of the snapshot rollback method and relevant apparatus of distributed memory system |
-
2019
- 2019-07-23 CN CN201910663724.7A patent/CN110413887B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104572810A (en) * | 2014-11-17 | 2015-04-29 | 深圳市光息谷科技发展有限公司 | Method for carrying out operation processing on massive files by utilizing bitmaps |
| US9772910B1 (en) * | 2015-12-07 | 2017-09-26 | EMC IP Holding Co. LLC | Resource optimization for storage integrated data protection |
| CN110018996A (en) * | 2018-07-23 | 2019-07-16 | 郑州云海信息技术有限公司 | A kind of the snapshot rollback method and relevant apparatus of distributed memory system |
| CN109743378A (en) * | 2018-12-27 | 2019-05-10 | 北京爱奇艺科技有限公司 | Information transmission system, information-pushing method and electronic equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110413887B (en) | 2022-03-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102968436B (en) | Chart is recommended | |
| CN104536904B (en) | A kind of method of data management, equipment and system | |
| CN109255586B (en) | Online personalized recommendation method for e-government affairs handling | |
| CN101404009B (en) | Data classification filtering method, system and equipment | |
| US7987192B2 (en) | Hybrid data model and user interaction for data sets in a user interface | |
| Brachman et al. | The process of knowledge discovery in databases: A first sketch | |
| CN105608223A (en) | Hbase database entering method and system for kafka | |
| CN102117303A (en) | Patent data analysis method and system | |
| CN102893265A (en) | Managing storage of individually accessible data units | |
| CN102254238B (en) | Scalable record keeping with the deduplication in collector | |
| CN108765052A (en) | Electric business recommendation/method for pushing and device, storage medium and computing device | |
| CN101902335A (en) | Data filter and combination method | |
| CN102722381A (en) | Techniques to optimize upgrade tasks | |
| CN105955943A (en) | Patent writing auxiliary system and auxiliary method | |
| CN109635259A (en) | A kind of electronic test paper generation method, device, equipment and storage medium | |
| CN105975537A (en) | Sorting method and device of application program | |
| CN103064908A (en) | Method for rapidly removing repeated list through a memory | |
| CN103516880A (en) | Method and device for sending short messages | |
| CN110413887A (en) | A kind of information push frequency limit method and system | |
| CN107844515A (en) | Data close rule inspection method and device | |
| CN108171586A (en) | A kind of commercial articles clustering method and device | |
| CN104123307A (en) | Data loading method and system | |
| WO2016206395A1 (en) | Weekly report information processing method and device | |
| CN107506380B (en) | A kind of method and server updating business data | |
| CN103051511B (en) | A kind of processing method of message data and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CP03 | Change of name, title or address | ||
| CP03 | Change of name, title or address |
Address after: 312000, Building A-208, No.1 Tianhuangping Road, Tianhuangping Town, Anji County, Huzhou City, Zhejiang Province, China (self declared) Patentee after: Huzhou Yunti Technology Co.,Ltd. Country or region after: China Address before: Room 3013, block a, new era Internet Plaza, 669 Fengtan Road, Xihu District, Hangzhou City, Zhejiang Province 310011 Patentee before: Hangzhou Yunti Technology Co.,Ltd. Country or region before: China |