CN110113393B - Message pushing method and device, electronic equipment and medium - Google Patents
Message pushing method and device, electronic equipment and medium Download PDFInfo
- Publication number
- CN110113393B CN110113393B CN201910312499.2A CN201910312499A CN110113393B CN 110113393 B CN110113393 B CN 110113393B CN 201910312499 A CN201910312499 A CN 201910312499A CN 110113393 B CN110113393 B CN 110113393B
- Authority
- CN
- China
- Prior art keywords
- pushed
- terminal
- message
- pushing
- bitmap
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/55—Push-based network services
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The embodiment of the invention provides a message pushing method, a message pushing device, electronic equipment and a medium, relates to the technical field of data transmission, and can avoid pushing the same message for the same user for multiple times during message pushing, wherein the embodiment of the application comprises the following steps: and if the total number of the terminals to be pushed corresponding to the message to be pushed is greater than a preset threshold value, grouping the terminals to be pushed corresponding to the message to be pushed. And then generating a storage bit set according to the packet number of the terminal to be pushed, calculating a hash value of the ID of the terminal to be pushed by using a preset hash function, determining a storage bit mapped by the ID of the terminal to be pushed according to the hash value of the ID of the terminal to be pushed, and acquiring a pushing mark of the terminal to be pushed from the determined storage bit. And then determining whether the message to be pushed is not pushed by the terminal to be pushed according to the obtained pushing mark, if so, pushing the message to be pushed to the terminal to be pushed, and updating the pushing mark of the storage bit mapped by the ID of the terminal to be pushed.
Description
Technical Field
The present invention relates to the field of data transmission technologies, and in particular, to a method and an apparatus for pushing a message, an electronic device, and a medium.
Background
To increase user stickiness, enhance user activity, increase company revenue, etc., a company may push messages to some user devices through a message push platform. The existing message pushing method generally includes obtaining information of a user's location, preference, habit and the like through user equipment, then selecting a part of user equipment needing message pushing according to the information, and pushing messages to the user equipment. For example: the typhoon is logging in Guangdong province, and can push a typhoon early warning message for user equipment with geographical positions of the Guangdong province.
However, when a message needs to be pushed, the server may select the pushed user equipment according to various features, which may result in the same user equipment being sent multiple identical push messages. For example: when the promotion message of the 'ice and snow curiosity' movie is pushed, users who like to watch the cartoon and users who like to watch the English movie need to be selected, and some users may like to watch the cartoon and the English movie, so the users are selected twice and can be pushed with the promotion messages of two identical 'ice and snow curiosity' movies.
Disclosure of Invention
Embodiments of the present invention provide a method, an apparatus, an electronic device, and a medium for pushing a message, so as to avoid pushing the same message for the same user multiple times when pushing the message. The specific technical scheme is as follows:
in a first aspect, a message pushing method is provided, where the method includes:
judging whether the total number of terminals to be pushed corresponding to the message to be pushed is greater than a preset threshold value or not, and if so, grouping the terminals to be pushed corresponding to the message to be pushed;
generating a set of storage bits according to the number of the packets of the terminal to be pushed, wherein the number of rows in the set is the same as the number of the packets of the terminal to be pushed, or the number of columns in the set is the same as the number of the packets of the terminal to be pushed, and the storage bits are used for recording a pushing mark of a pushing state of the terminal to be pushed;
aiming at each terminal to be pushed, the following steps are executed:
calculating a hash value of an Identity (ID) of the terminal to be pushed by using a preset hash function, determining a storage bit mapped by the ID of the terminal to be pushed according to the hash value of the ID of the terminal to be pushed, and acquiring a push mark of the terminal to be pushed from the determined storage bit;
and determining whether the message to be pushed is not pushed by the terminal to be pushed according to the obtained pushing mark, if so, pushing the message to be pushed to the terminal to be pushed, and updating the pushing mark of the storage bit record mapped by the ID of the terminal to be pushed.
Optionally, the set of storage bits is a set of bitmaps (bitmaps), where the bitmaps include storage bits for recording push flags of a push state of a terminal to be pushed, and the total number of bitmaps in the set of bitmaps is the same as the number of packets of the terminal to be pushed;
the step of grouping the terminals to be pushed corresponding to the messages to be pushed includes:
determining the packet number of the terminal to be pushed according to the total number of the terminal to be pushed corresponding to the message to be pushed and the actual storage bit number in a single bitmap; grouping the terminals to be pushed corresponding to the messages to be pushed according to the number of the groups of the terminals to be pushed;
the step of generating a storage bit set according to the packet number of the terminal to be pushed comprises the following steps:
determining the number of the packets of the terminal to be pushed as the total number of bitmaps;
determining the expected storage digit of the single bitmap according to the actual storage digit and the expected error rate in the single bitmap, wherein the expected error rate is the probability of allowing the push mark recorded in the bitmap to have errors;
and generating a storage bit set according to the expected storage bit number of the single bitmap and the total number of the bitmaps.
Optionally, the step of calculating a hash value of the ID of the terminal to be pushed by using a preset hash function, determining a storage bit to which the ID of the terminal to be pushed is mapped according to the hash value of the ID of the terminal to be pushed, and acquiring a push flag of the terminal to be pushed from the determined storage bit includes:
calculating a first hash value of the identity ID of the terminal to be pushed by using a preset first hash function; determining a target bitmap mapped by the ID of the terminal to be pushed according to the first hash value of the ID of the terminal to be pushed and the packet number of the terminal to be pushed;
calculating a second hash value of the ID of the terminal to be pushed by using a preset second hash function; determining a target storage bit mapped by the ID of the terminal to be pushed in the target bitmap according to the second hash value of the ID of the terminal to be pushed and the expected storage bit number of the single bitmap;
and reading a push mark of the terminal to be pushed from the target storage bit.
Optionally, the initial pushing state of the storage bit record is not pushed;
the step of determining whether the terminal to be pushed is not pushed the message to be pushed according to the obtained pushing sign includes:
if the obtained push marks of the terminal to be pushed are not all pushed, determining that the terminal to be pushed is not pushed with the message to be pushed.
Optionally, the step of pushing the message to be pushed to the terminal to be pushed and updating the push flag of the storage location record mapped by the ID of the terminal to be pushed includes:
pushing the message to be pushed to a terminal to be pushed, and judging whether the message to be pushed to the terminal to be pushed is successfully pushed or not;
and if the message to be pushed which is pushed to the terminal to be pushed is successfully pushed, updating a pushing mark of a target storage bit record mapped by the ID of the terminal to be pushed into the pushed message.
In a second aspect, a message pushing apparatus is provided, the apparatus including:
the grouping module is used for judging whether the total number of the terminals to be pushed corresponding to the message to be pushed is greater than a preset threshold value or not, and grouping the terminals to be pushed corresponding to the message to be pushed when the total number of the terminals to be pushed corresponding to the message to be pushed is greater than the preset threshold value;
the generating module is used for generating a set of storage bits according to the number of the groups of the terminal to be pushed, wherein the number of rows in the set is the same as the number of the groups of the terminal to be pushed, or the number of columns in the set is the same as the number of the groups of the terminal to be pushed, and the storage bits are used for recording a pushing mark of the pushing state of the terminal to be pushed;
the pushing module is used for calculating a hash value of the ID of the terminal to be pushed by using a preset hash function aiming at each terminal to be pushed, determining a storage bit mapped by the ID of the terminal to be pushed according to the hash value of the ID of the terminal to be pushed, and acquiring a pushing mark of the terminal to be pushed from the determined storage bit; determining whether the message to be pushed is not pushed by the terminal to be pushed according to the obtained pushing mark, pushing the message to be pushed to the terminal to be pushed when the message to be pushed is not pushed by the terminal to be pushed, and updating the pushing mark of the storage bit record mapped by the ID of the terminal to be pushed.
Optionally, the set of storage bits is a set of bitmap, where the bitmap includes storage bits of a push flag used for recording a push state of a terminal to be pushed, and the total number of bitmaps in the set of bitmap is the same as the number of packets of the terminal to be pushed;
the grouping module is specifically configured to:
determining the packet number of the terminal to be pushed according to the total number of the terminal to be pushed corresponding to the message to be pushed and the actual storage bit number in a single bitmap; grouping the terminals to be pushed corresponding to the messages to be pushed according to the number of the groups of the terminals to be pushed;
the generation module is specifically configured to:
determining the number of the packets of the terminal to be pushed as the total number of bitmaps;
determining the expected storage digit of the single bitmap according to the actual storage digit and the expected error rate in the single bitmap, wherein the expected error rate is the probability of allowing the push mark recorded in the bitmap to have errors;
and generating a storage bit set according to the expected storage bit number of the single bitmap and the total number of the bitmaps.
Optionally, the pushing module is specifically configured to:
calculating a first hash value of the identity ID of the terminal to be pushed by using a preset first hash function; determining a target bitmap mapped by the ID of the terminal to be pushed according to the first hash value of the ID of the terminal to be pushed and the packet number of the terminal to be pushed;
calculating a second hash value of the ID of the terminal to be pushed by using a preset second hash function; determining a target storage bit mapped by the ID of the terminal to be pushed in the target bitmap according to the second hash value of the ID of the terminal to be pushed and the expected storage bit number of the single bitmap;
and reading a push mark of the terminal to be pushed from the target storage bit.
Optionally, the initial pushing state of the storage bit record is not pushed;
the pushing module is specifically configured to:
and when the obtained push marks of the terminal to be pushed are not all pushed, determining that the terminal to be pushed is not pushed with the message to be pushed.
Optionally, the pushing module is specifically configured to:
pushing the message to be pushed to a terminal to be pushed, and judging whether the message to be pushed to the terminal to be pushed is successfully pushed or not;
and when the message to be pushed which is pushed to the terminal to be pushed is successfully pushed, updating a pushing mark of a target storage bit record mapped by the ID of the terminal to be pushed into the pushed message.
In a third aspect, an electronic device is provided, which includes a processor, a communication interface, a memory and a communication bus, wherein the processor, the communication interface and the memory complete communication with each other through the communication bus;
a memory for storing a computer program;
and the processor is used for realizing any one of the message pushing method steps when executing the program stored in the memory.
In a fourth aspect, an embodiment of the present invention further provides a computer-readable storage medium, where a computer program is stored in the computer-readable storage medium, and when being executed by a processor, the computer program implements any of the message pushing method steps described above.
In a fifth aspect, an embodiment of the present invention further provides a computer program product containing instructions, which when run on a computer, causes the computer to perform any of the message pushing method steps described above.
It can be seen that, with the message pushing method, device, electronic device, and medium provided in the embodiments of the present invention, before pushing a message to be pushed to each terminal to be pushed corresponding to the message to be pushed, a pushing flag of a storage bit record mapped by an Identity (ID) of the terminal to be pushed is obtained according to a hash value of the ID of the terminal to be pushed. And then determining whether the to-be-pushed terminal is not pushed with the to-be-pushed message according to the obtained pushing mark, pushing the to-be-pushed message to the to-be-pushed terminal which is not pushed with the to-be-pushed message, and updating the pushing mark of the storage bit record mapped by the ID of the to-be-pushed terminal, so that the situation that the to-be-pushed message is pushed again to the to-be-pushed terminal which is pushed with the to-be-pushed message can be avoided.
Of course, not all of the advantages described above need to be achieved at the same time in the practice of any one product or method of the invention.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below.
Fig. 1 is a schematic structural diagram of a message pushing system according to an embodiment of the present invention;
fig. 2 is a flowchart of a message pushing method according to an embodiment of the present invention;
fig. 3 is an exemplary diagram of a message pushing method according to an embodiment of the present invention;
fig. 4 is a flowchart of another message pushing method according to an embodiment of the present invention;
fig. 5 is an exemplary diagram of another message pushing method provided in the embodiment of the present invention;
fig. 6 is an exemplary diagram of another message pushing method provided in the embodiment of the present invention;
fig. 7 is a schematic structural diagram of a message pushing apparatus according to an embodiment of the present invention;
fig. 8 is a schematic structural diagram of an electronic device according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be described below with reference to the drawings in the embodiments of the present invention.
The message pushing method provided by the embodiment of the invention can be applied to a message pushing system shown in fig. 1, and the system comprises: a server and a terminal; the terminal may communicate with the server and the connection between the terminal and the server may be a wireless connection. The connection between the terminal and the server in fig. 1 is a Wireless-Fidelity (WiFi) connection as an example.
The terminal in the embodiment of the present invention may be a mobile phone or a tablet computer and the like capable of receiving a message sent by a server. The terminal comprises a receiving module, and the receiving module is used for receiving the message to be pushed sent by the server.
The server comprises a grouping module, a storage module, a filtering module and a pushing module. The grouping module is used for grouping the terminals to be pushed corresponding to the messages to be pushed; the storage module is used for storing the push mark of each terminal to be pushed; the filtering module is used for filtering repeated terminals in the terminals to be pushed corresponding to the messages to be pushed; the pushing module is used for pushing the message to be pushed.
The filtering module in the embodiment of the present invention may be deployed in a plurality of servers, for example: in fig. 1, the terminals to be pushed corresponding to the messages to be pushed are divided into three groups, and each group of terminals to be pushed for filtering can be executed in parallel by the filtering modules in the three servers.
In another embodiment, the grouping module, the storage module, the filtering module and the pushing module can be respectively deployed in different servers to improve the operation speed.
The message pushing method provided by the embodiment of the invention comprises the following steps:
judging whether the total number of the terminals to be pushed corresponding to the message to be pushed is greater than a preset threshold value or not, and if so, grouping the terminals to be pushed corresponding to the message to be pushed;
generating a storage bit set according to the number of the groups of the terminal to be pushed, wherein the number of rows in the storage bit set is the same as the number of the groups of the terminal to be pushed, or the number of columns in the storage bit set is the same as the number of the groups of the terminal to be pushed, and the generated storage bits are pushing marks for recording the pushing state of the terminal to be pushed;
for each terminal to be pushed, the following steps are executed:
calculating a hash value of the ID of the terminal to be pushed by using a preset hash function, determining a storage bit mapped by the ID of the terminal to be pushed according to the hash value of the ID of the terminal to be pushed, and acquiring a pushing mark of the terminal to be pushed from the determined storage bit;
and determining whether the terminal to be pushed does not push the message to be pushed according to the obtained pushing mark, if so, pushing the message to be pushed to the terminal to be pushed, and updating the pushing mark of the storage bit record mapped by the ID of the terminal to be pushed.
With reference to fig. 1, an embodiment of the present invention further provides a message pushing method, which is applied to a server, and as shown in fig. 2, the method includes the following steps:
In the embodiment of the invention, the server can acquire the information such as the position, the preference, the habit and the like of the user through the terminal, and then select a part of terminals to be pushed, which need to push the message, according to the information.
In one implementation, the number N of packets of a terminal to be pushed may be calculated according to the total number X of terminals to be pushed corresponding to a message to be pushed and the actual storage bit number T in a single bitmap (bitmap) by using formula (1), and then the terminals to be pushed corresponding to the message to be pushed are divided into N groups.
Wherein, the actual storage digit T in a single bitmap indicates that the single bitmap can store the push marks of T terminals to be pushed, the push mark indicates whether the terminals to be pushed have pushed the messages to be pushed or not,
the operation represented is taking an integer. For example:
illustratively, the actual number of storage bits T in a single bitmap may be set to 1000000.
The number of rows in the set of bitmaps is the same as the number of packets of the terminal to be pushed, or the number of columns in the set of bitmaps is the same as the number of packets of the terminal to be pushed, and the storage bits are used for recording push marks of the push state of the terminal to be pushed.
In one embodiment, N bitmaps are generated, and the initial push flag recorded in each storage bit of each generated bitmap is that the message to be pushed is not pushed (N is the number of packets of the terminal to be pushed). For example: and the initial push marks recorded by all the storage bits in the N generated bitmaps are all 0.
Wherein, the bitmap stores the push mark of the terminal to be pushed, and the push information represented by the push mark comprises: the message to be pushed is pushed or not pushed.
In an implementation manner, for each terminal to be pushed, a preset first hash function may be used to determine a target bitmap mapped by an ID of the terminal to be pushed. And then determining a target storage bit mapped by the ID of the terminal to be pushed in the target bitmap according to a preset second hash function, and reading a pushing mark from the determined target storage bit.
And 204, determining whether the terminal to be pushed is not pushed with the message to be pushed according to the obtained pushing mark for each terminal to be pushed, if so, pushing the message to be pushed to the terminal to be pushed, and updating the pushing mark of the storage bit record mapped by the ID of the terminal to be pushed.
In one embodiment, if the push flags of the to-be-pushed terminal read from the target storage bit in the target bitmap are all pushed, it is determined that the to-be-pushed terminal is pushed with the to-be-pushed message. And if the push marks of the terminal to be pushed, which are read from the target storage bit in the target bitmap, are not all pushed, determining that the terminal to be pushed is not pushed with the message to be pushed. And if the to-be-pushed terminal is not pushed with the to-be-pushed message, updating all the pushing marks of the target storage bit records mapped by the ID of the to-be-pushed terminal to be pushed, and pushing the to-be-pushed message to the to-be-pushed terminal. And if the message to be pushed is pushed by the terminal to be pushed, not pushing the message to be pushed to the terminal to be pushed.
In the embodiment of the present invention, there may be a case where one storage bit stores push flags of a plurality of terminals to be pushed, so that it can be determined that a terminal to be pushed has pushed a message to be pushed only when all the push flags of a target storage bit record of the terminal to be pushed have been pushed.
For example, a "1" push flag may be set to indicate that the push is already performed, and a "0" push flag may be set to indicate that the push is not already performed.
Optionally, the method for pushing the message to be pushed to the terminal to be pushed, which is not pushed with the message to be pushed, includes the following three methods:
and the first mode is that whether each terminal to be pushed is not pushed with the message to be pushed is respectively determined, and if yes, the pushing mark of the storage bit record mapped by the ID of the terminal to be pushed is updated. And after determining whether each terminal to be pushed corresponding to the message to be pushed is not pushed with the message to be pushed, pushing the message to be pushed to the terminal to be pushed which is not pushed with the message to be pushed.
And secondly, respectively determining whether each terminal to be pushed is not pushed with the message to be pushed, if so, updating a pushing mark of the storage bit record mapped by the ID of the terminal to be pushed, and then pushing the message to be pushed to the terminal to be pushed.
And a third mode of respectively determining whether each terminal to be pushed is not pushed with the message to be pushed, and if so, judging whether the message to be pushed which is pushed to the terminal to be pushed is successfully pushed. If yes, updating the pushing mark of the target storage bit record in the target bitmap to be pushed.
It can be understood that, if the message to be pushed that is pushed to the terminal to be pushed is successfully pushed, it indicates that the terminal to be pushed receives the message to be pushed and the push flag needs to be updated. And if the pushing of the message to be pushed to the terminal to be pushed fails, the terminal to be pushed does not receive the message to be pushed, and the pushing mark does not need to be updated.
It can be understood that, after it is determined that the to-be-pushed terminal is not pushed with the to-be-pushed message, the pushing flags of the target storage bit records mapped by the to-be-pushed terminal are all changed to be pushed in time, so as to avoid that when the same to-be-pushed terminal reads the pushing flags of the target storage bit records of the to-be-pushed terminal again, the read pushing flags are not updated in time, so that the wrong pushing flags are read, and the to-be-pushed terminal receives repeated to-be-pushed messages.
Therefore, by applying the message pushing method provided by the embodiment of the present invention, before the message to be pushed is pushed to each terminal to be pushed corresponding to the message to be pushed, the pushing flag of the storage bit record mapped by the ID of the terminal to be pushed is obtained according to the hash value of the ID of the terminal to be pushed. And then determining whether the to-be-pushed terminal is not pushed with the to-be-pushed message according to the obtained pushing mark, pushing the to-be-pushed message to the to-be-pushed terminal which is not pushed with the to-be-pushed message, and updating the pushing mark of the storage bit record mapped by the ID of the to-be-pushed terminal, so that the situation that the to-be-pushed message is pushed again to the to-be-pushed terminal which is pushed with the to-be-pushed message can be avoided.
Optionally, with reference to fig. 3, the method for generating N bitmaps in step 202 includes: determining the total number N of bitmaps for recording the push marks of the terminal to be pushed according to a formula (1), determining the expected storage bit number M of a single bitmap according to a formula (2), initializing the number of bitmaps according to the total number N of bitmaps, initializing the storage bit number of each bitmap according to the expected storage bit number M of the single bitmap, and generating a storage bit set.
And the initial push marks of all storage bit records in the generated bitmap are all not pushed. For example: the initial push flag of each storage bit record in the generated bitmap is set to "0".
In one implementation, the desired number of storage bits M for a single bitmap is calculated by equation (2):
the expected storage bit number M of a single bitmap indicates that the single bitmap can record M push marks, the actual storage bit number T in the single bitmap indicates that the single bitmap can store T push marks of terminals to be pushed, the expected error rate P is a probability that the push marks recorded in the bitmap are allowed to have errors, and illustratively, the expected error rate P may be 0.01%.
In the embodiment of the present invention, if the expected storage bit number of a single bitmap is set to T, it is likely that the same storage bit stores push flags of multiple terminals to be pushed, which results in that the push flags are determined incorrectly. For example: the push marks of the terminal A to be pushed and the terminal B to be pushed are recorded in the storage bit 1, if the terminal A to be pushed is pushed with a message to be pushed, the push mark recorded in the storage bit 1 is pushed, and if the terminal B to be pushed is not pushed with the message to be pushed, the push mark in the storage bit 1 is read as pushed when the push mark of the terminal B to be pushed is inquired, so that the push mark of the terminal B to be pushed is determined to be wrong. In order to avoid this, the expected storage bit number of a single bitmap can be increased, so that the push mark of each terminal to be pushed is stored in different storage bits as much as possible.
It can be seen that, compared with the prior art in which the push flags of the to-be-pushed terminals corresponding to the to-be-pushed messages are all recorded in one bitmap, in the embodiment of the present invention, the push flags of the to-be-pushed terminals corresponding to the to-be-pushed messages are respectively recorded in N bitmaps, so that the expected storage bit number M of a single bitmap is small, and the time for querying or writing in the single bitmap is reduced, so that the speed of message pushing can be increased by applying the embodiment of the present invention.
In the embodiment of the invention, because the bitmap is created in the database (Redis), and the Redis is executed by a single thread when the program is executed, the situation that the pushing result is determined to be wrong when the same pushing mark of the terminal to be pushed is searched from the bitmap at the same time can be avoided. For example: if the message to be pushed is not pushed by the terminal A to be pushed, the pushing mark of the storage bit 1 mapped by the ID of the terminal A to be pushed in the bitmap is not pushed, when two terminals A to be pushed read the pushing mark in the storage bit 1 at the same time, the pushing mark of one terminal A to be pushed is determined first, and then the pushing mark of the terminal A to be pushed is changed into pushed. When the push mark of another terminal a to be pushed is searched, the another terminal a to be pushed is determined as the pushed message.
In addition, the embodiment of the present invention may also determine, in parallel, the push flags of the to-be-pushed terminals corresponding to the multiple to-be-pushed messages, where the method for generating the bitmap is as follows: respectively calculating the total number of bitmaps corresponding to the messages A, B and C to be pushed according to the total number of terminals to be pushed respectively corresponding to the messages A, B and C to be pushed, and respectively generating the bitmaps according to the total number of bitmaps corresponding to the messages A, B and C to be pushed and the expected storage bit number M of a single bitmap. And the initial push marks of all storage bit records in the generated bitmap are all not pushed. See table 1 for generated bitmaps:
TABLE 1
The information A to be pushed is divided into three groups, and three bitmaps are created and used for recording pushing marks of the information A to be pushed corresponding to the terminals to be pushed. Similarly, B:0 indicates that the number of the to-be-pushed terminals corresponding to the to-be-pushed message B is small, so that the to-be-pushed terminals corresponding to the to-be-pushed message B are not grouped, and a bitmap for recording the pushing mark of the to-be-pushed terminal corresponding to the to-be-pushed message B can be created. Similarly, C:0, C:1, C:2 and C:3 indicate that the terminals to be pushed corresponding to the message C to be pushed are divided into four groups, and four bitmaps are created and used for recording pushing marks of the terminals to be pushed corresponding to the message C to be pushed.
It can be seen that, compared with the prior art in which all terminals to be pushed corresponding to messages to be pushed are recorded in one bitmap, in the embodiment of the present invention, multiple bitmaps can be created, and each bitmap can be stored in different servers, so that, because the length of the bitmaps allowed to be stored in one server is limited, the number of terminals to be pushed that can be filtered in the prior art is limited, but the embodiment of the present invention can be stored in different servers, and one or more bitmaps can be stored in each server, so that the number of terminals to be pushed that can be filtered in the message pushing method can be increased by applying the embodiment of the present invention.
Optionally, referring to fig. 4, the method for reading the push flag in step 203 includes:
In the embodiment of the present invention, the first hash function may be a preset hash function, and the ID of the terminal to be pushed may be a number set by the server for the terminal to be pushed when the terminal to be pushed establishes a connection with the server for the first time.
In one implementation, a target bitmap mapped by an ID of a terminal to be pushed is calculated by formula (3):
Rx＝hash(id)％N (3)
wherein R isxThe number X of bitmaps, hash (ID) represents a first hash value of the ID of the terminal to be pushed,% represents a remainder operation, and N is the packet number of the terminal to be pushed.
Calculating the number K of second hash values of the ID of the terminal to be pushed according to a formula (4):
wherein M is the expected storage bit number of a single bitmap, and T is the actual storage bit number in the single bitmap.
In the embodiment of the present invention, K second hash values of the ID of the terminal to be pushed may be calculated by using K different preset second hash functions.
And step 404, determining a target storage bit mapped by the ID of the terminal to be pushed in the target bitmap according to the second hash value of the ID of the terminal to be pushed and the expected storage bit number of the single bitmap.
In one embodiment, a target storage bit C mapped by the ID of the terminal to be pushed in the target bitmap is calculated by formula (5)y：
Cy＝fy(id)％M (5)
Wherein, CyFor the y-th stored bit, fy(ID) represents a second hash value of the ID of the terminal to be pushed,% represents the remainder operation, and M is the expected storage bit number of a single bitmap.
For example, referring to fig. 5, it is assumed that a target bitmap corresponding to a terminal a to be pushed is R x3. In the target bitmap, 3 target storage bits C mapped by the ID of the terminal A to be pushedyIf 2, 5 or 7, the storage bit mapped in the bitmap by the terminal a to be pushed is: the second, fifth and seventh storage bits of the third bitmap, the read push flags are respectively: "1", "0" and "1".
Further, after the push mark of the terminal to be pushed is read, if the push mark indicates that the terminal to be pushed is not pushed with the message to be pushed, the read push mark is updated.
Illustratively, referring to fig. 6, according to the description in fig. 5, in the target bitmap, the storage bits of the ID map of the terminal a to be pushed are: the second, fifth and seventh storage bits of the third bitmap. It can be seen from fig. 5 that the values recorded in the three storage bits are: and determining that the push marks of the terminal to be pushed are not all pushed, updating the push marks in the three storage bits mapped by the ID of the terminal A to be pushed, namely changing the push marks to be 1, and pushing the message to be pushed to the terminal to be pushed.
Therefore, by applying the embodiment of the invention, the push mark can be updated in time after the push mark of the terminal to be pushed is read, so that the updated push mark is obtained when the same terminal to be pushed reads the corresponding push mark again, and the condition that the push mark of the terminal to be pushed is determined incorrectly due to the fact that the push mark is not updated timely is avoided.
Corresponding to the above method embodiment, as shown in fig. 7, an embodiment of the present invention provides a message pushing apparatus applied to a server, where the apparatus includes: a grouping module 701, a generating module 702 and a pushing module 703.
The grouping module 701 is configured to determine whether the total number of terminals to be pushed corresponding to the message to be pushed is greater than a preset threshold, and group the terminals to be pushed corresponding to the message to be pushed when the total number of terminals to be pushed corresponding to the message to be pushed is greater than the preset threshold;
a generating module 702, configured to generate a set of storage bits according to the number of packets of the terminal to be pushed, where a number of rows in the set is the same as the number of packets of the terminal to be pushed, or a number of columns in the set is the same as the number of packets of the terminal to be pushed, and the storage bits are used to record a push flag of a push state of the terminal to be pushed;
the push module 703 is configured to calculate, for each terminal to be pushed, a hash value of an identity ID of the terminal to be pushed by using a preset hash function, determine, according to the hash value of the ID of the terminal to be pushed, a storage bit to which the ID of the terminal to be pushed is mapped, and obtain a push flag of the terminal to be pushed from the determined storage bit; determining whether a to-be-pushed terminal is not pushed with a to-be-pushed message according to the obtained pushing mark, pushing the to-be-pushed message to the to-be-pushed terminal when the to-be-pushed terminal is not pushed with the to-be-pushed message, and updating the pushing mark of the storage location record mapped by the ID of the to-be-pushed terminal.
Optionally, the storage bit set is a bitmap set, where the bitmap includes a storage bit for recording a push flag of a push state of the terminal to be pushed, and the total number of bitmaps in the bitmap set is the same as the number of packets of the terminal to be pushed;
the grouping module 701 may be specifically configured to:
determining the packet number of the terminal to be pushed according to the total number of the terminal to be pushed corresponding to the message to be pushed and the actual storage bit number in the single bitmap; grouping the terminals to be pushed corresponding to the messages to be pushed according to the number of the groups of the terminals to be pushed;
the generating module 702 may be specifically configured to:
determining the number of the packets of the terminal to be pushed as the total number of bitmaps;
determining the expected storage digit of a single bitmap according to the actual storage digit and the expected error rate in the single bitmap, wherein the expected error rate is the probability of allowing the push mark recorded in the bitmap to have errors;
and generating a storage bit set according to the expected storage bit number of the single bitmap and the total number of the bitmaps.
Optionally, the pushing module 703 may be specifically configured to:
calculating a first hash value of the identity ID of the terminal to be pushed by using a preset first hash function; determining a target bitmap mapped by the ID of the terminal to be pushed according to the first hash value of the ID of the terminal to be pushed and the packet number of the terminal to be pushed;
calculating a second hash value of the ID of the terminal to be pushed by using a preset second hash function; determining a target storage bit mapped by the ID of the terminal to be pushed in the target bitmap according to the second hash value of the ID of the terminal to be pushed and the expected storage bit number of the single bitmap;
and reading the push mark of the terminal to be pushed from the target storage bit.
Optionally, the initial pushing state of the storage bit record is not pushed;
the pushing module 703 may be specifically configured to:
and when the obtained push marks of the terminal to be pushed are not all pushed, determining that the terminal to be pushed is not pushed with the message to be pushed.
Optionally, the pushing module 703 may be specifically configured to:
pushing a message to be pushed to a terminal to be pushed, and judging whether the message to be pushed to the terminal to be pushed is successfully pushed or not;
and when the message to be pushed which is pushed to the terminal to be pushed is successfully pushed, updating the pushing mark of the target storage bit record mapped by the ID of the terminal to be pushed into the pushed message.
An embodiment of the present invention further provides an electronic device, as shown in fig. 8, which includes a processor 801, a communication interface 802, a memory 803, and a communication bus 804, where the processor 801, the communication interface 802, and the memory 803 complete mutual communication through the communication bus 804,
a memory 803 for storing a computer program;
the processor 801 is configured to implement the steps executed by the server in the above method embodiments when executing the program stored in the memory 803.
The communication bus mentioned in the electronic device may be a Peripheral Component Interconnect (PCI) bus, an Extended Industry Standard Architecture (EISA) bus, or the like. The communication bus may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, only one thick line is shown, but this does not mean that there is only one bus or one type of bus.
The communication interface is used for communication between the electronic equipment and other equipment.
The Memory may include a Random Access Memory (RAM) or a Non-Volatile Memory (NVM), such as at least one disk Memory. Optionally, the memory may also be at least one memory device located remotely from the processor.
The Processor may be a general-purpose Processor, including a Central Processing Unit (CPU), a Network Processor (NP), and the like; but also Digital Signal Processors (DSPs), Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs) or other Programmable logic devices, discrete Gate or transistor logic devices, discrete hardware components.
In yet another embodiment provided by the present invention, a computer-readable storage medium is further provided, in which a computer program is stored, and the computer program, when executed by a processor, implements the steps of any of the above message pushing methods.
In yet another embodiment, a computer program product containing instructions is provided, which when run on a computer causes the computer to execute any of the message pushing methods in the above embodiments.
In the above embodiments, the implementation may be wholly or partially realized by software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When loaded and executed on a computer, cause the processes or functions described in accordance with the embodiments of the invention to occur, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored in a computer readable storage medium or transmitted from one computer readable storage medium to another, for example, from one website site, computer, server, or data center to another website site, computer, server, or data center via wired (e.g., coaxial cable, fiber optic, Digital Subscriber Line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device, such as a server, a data center, etc., that incorporates one or more of the available media. The usable medium may be a magnetic medium (e.g., floppy Disk, hard Disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., Solid State Disk (SSD)), among others.
It is noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
All the embodiments in the present specification are described in a related manner, and the same and similar parts among the embodiments may be referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, as for the apparatus embodiment, since it is substantially similar to the method embodiment, the description is relatively simple, and for the relevant points, reference may be made to the partial description of the method embodiment.
The above description is only for the preferred embodiment of the present invention, and is not intended to limit the scope of the present invention. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention shall fall within the protection scope of the present invention.
Claims (12)
1. A message pushing method, the method comprising:
judging whether the total number of terminals to be pushed corresponding to the message to be pushed is greater than a preset threshold value or not, and if so, grouping the terminals to be pushed corresponding to the message to be pushed;
generating a set of storage bits according to the number of the packets of the terminal to be pushed, wherein the number of rows in the set is the same as the number of the packets of the terminal to be pushed, or the number of columns in the set is the same as the number of the packets of the terminal to be pushed, and the storage bits are used for recording a pushing mark of a pushing state of the terminal to be pushed;
aiming at each terminal to be pushed, the following steps are executed:
calculating a hash value of the ID of the terminal to be pushed by using a preset hash function, determining a storage bit mapped by the ID of the terminal to be pushed according to the hash value of the ID of the terminal to be pushed, and acquiring a pushing mark of the terminal to be pushed from the determined storage bit;
and determining whether the message to be pushed is not pushed by the terminal to be pushed according to the obtained pushing mark, if so, pushing the message to be pushed to the terminal to be pushed, and updating the pushing mark of the storage bit record mapped by the ID of the terminal to be pushed.
2. The method according to claim 1, wherein the set of storage bits is a set of bitmap, wherein the bitmap includes storage bits of a push flag for recording a push state of a terminal to be pushed, and the total number of bitmaps in the set of bitmap is the same as the number of packets of the terminal to be pushed;
the step of grouping the terminals to be pushed corresponding to the messages to be pushed includes:
determining the packet number of the terminal to be pushed according to the total number of the terminal to be pushed corresponding to the message to be pushed and the actual storage bit number in a single bitmap; grouping the terminals to be pushed corresponding to the messages to be pushed according to the number of the groups of the terminals to be pushed;
the step of generating a storage bit set according to the packet number of the terminal to be pushed comprises the following steps:
determining the number of the packets of the terminal to be pushed as the total number of bitmaps;
determining the expected storage digit of the single bitmap according to the actual storage digit and the expected error rate in the single bitmap, wherein the expected error rate is the probability of allowing the push mark recorded in the bitmap to have errors;
and generating a storage bit set according to the expected storage bit number of the single bitmap and the total number of the bitmaps.
3. The method according to claim 2, wherein the step of calculating a hash value of the ID of the terminal to be pushed by using a preset hash function, determining a storage bit to which the ID of the terminal to be pushed is mapped according to the hash value of the ID of the terminal to be pushed, and obtaining the push flag of the terminal to be pushed from the determined storage bit comprises:
calculating a first hash value of the identity ID of the terminal to be pushed by using a preset first hash function; determining a target bitmap mapped by the ID of the terminal to be pushed according to the first hash value of the ID of the terminal to be pushed and the packet number of the terminal to be pushed;
calculating a second hash value of the ID of the terminal to be pushed by using a preset second hash function; determining a target storage bit mapped by the ID of the terminal to be pushed in the target bitmap according to the second hash value of the ID of the terminal to be pushed and the expected storage bit number of the single bitmap;
and reading a push mark of the terminal to be pushed from the target storage bit.
4. The method of claim 3, wherein the initial push states of the memory location records are all non-pushed;
the step of determining whether the terminal to be pushed is not pushed the message to be pushed according to the obtained pushing sign includes:
if the obtained push marks of the terminal to be pushed are not all pushed, determining that the terminal to be pushed is not pushed with the message to be pushed.
5. The method according to claim 4, wherein the steps of pushing the message to be pushed to the terminal to be pushed and updating the push flag of the storage location record mapped by the ID of the terminal to be pushed comprise:
pushing the message to be pushed to a terminal to be pushed, and judging whether the message to be pushed to the terminal to be pushed is successfully pushed or not;
and if the message to be pushed which is pushed to the terminal to be pushed is successfully pushed, updating a pushing mark of a target storage bit record mapped by the ID of the terminal to be pushed into the pushed message.
6. A message push apparatus, the apparatus comprising:
the grouping module is used for judging whether the total number of the terminals to be pushed corresponding to the message to be pushed is greater than a preset threshold value or not, and grouping the terminals to be pushed corresponding to the message to be pushed when the total number of the terminals to be pushed corresponding to the message to be pushed is greater than the preset threshold value;
the generating module is used for generating a set of storage bits according to the number of the groups of the terminal to be pushed, wherein the number of rows in the set is the same as the number of the groups of the terminal to be pushed, or the number of columns in the set is the same as the number of the groups of the terminal to be pushed, and the storage bits are used for recording a pushing mark of the pushing state of the terminal to be pushed;
the pushing module is used for calculating a hash value of the ID of the terminal to be pushed by using a preset hash function aiming at each terminal to be pushed, determining a storage bit mapped by the ID of the terminal to be pushed according to the hash value of the ID of the terminal to be pushed, and acquiring a pushing mark of the terminal to be pushed from the determined storage bit; determining whether the terminal to be pushed is not pushed and whether the message to be pushed disappears is determined according to the obtained pushing mark, pushing the message to be pushed to the terminal to be pushed when the message to be pushed is not pushed by the terminal to be pushed, and updating the pushing mark of the storage bit record mapped by the ID of the terminal to be pushed.
7. The apparatus according to claim 6, wherein the set of storage bits is a set of bitmap, wherein the bitmap includes storage bits of a push flag for recording a push state of a terminal to be pushed, and the total number of bitmaps in the set of bitmap is the same as the number of packets of the terminal to be pushed;
the grouping module is specifically configured to:
determining the packet number of the terminal to be pushed according to the total number of the terminal to be pushed corresponding to the message to be pushed and the actual storage bit number in a single bitmap; grouping the terminals to be pushed corresponding to the messages to be pushed according to the number of the groups of the terminals to be pushed;
the generation module is specifically configured to:
determining the number of the packets of the terminal to be pushed as the total number of bitmaps;
determining the expected storage digit of the single bitmap according to the actual storage digit and the expected error rate in the single bitmap, wherein the expected error rate is the probability of allowing the push mark recorded in the bitmap to have errors;
and generating a storage bit set according to the expected storage bit number of the single bitmap and the total number of the bitmaps.
8. The apparatus according to claim 7, wherein the push module is specifically configured to:
calculating a first hash value of the identity ID of the terminal to be pushed by using a preset first hash function; determining a target bitmap mapped by the ID of the terminal to be pushed according to the first hash value of the ID of the terminal to be pushed and the packet number of the terminal to be pushed;
calculating a second hash value of the ID of the terminal to be pushed by using a preset second hash function; determining a target storage bit mapped by the ID of the terminal to be pushed in the target bitmap according to the second hash value of the ID of the terminal to be pushed and the expected storage bit number of the single bitmap;
and reading a push mark of the terminal to be pushed from the target storage bit.
9. The apparatus of claim 8, wherein the initial push states of the memory location records are both non-pushed;
the pushing module is specifically configured to:
and when the obtained push marks of the terminal to be pushed are not all pushed, determining that the terminal to be pushed is not pushed with the message to be pushed.
10. The apparatus according to claim 9, wherein the push module is specifically configured to:
pushing the message to be pushed to a terminal to be pushed, and judging whether the message to be pushed to the terminal to be pushed is successfully pushed or not;
and when the message to be pushed which is pushed to the terminal to be pushed is successfully pushed, updating a pushing mark of a target storage bit record mapped by the ID of the terminal to be pushed into the pushed message.
11. An electronic device is characterized by comprising a processor, a communication interface, a memory and a communication bus, wherein the processor and the communication interface are used for realizing mutual communication by the memory through the communication bus;
a memory for storing a computer program;
a processor for implementing the method steps of any one of claims 1 to 5 when executing a program stored in the memory.
12. A computer-readable storage medium, characterized in that a computer program is stored in the computer-readable storage medium, which computer program, when being executed by a processor, carries out the method steps of any one of the claims 1-5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910312499.2A CN110113393B (en) | 2019-04-18 | 2019-04-18 | Message pushing method and device, electronic equipment and medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910312499.2A CN110113393B (en) | 2019-04-18 | 2019-04-18 | Message pushing method and device, electronic equipment and medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110113393A CN110113393A (en) | 2019-08-09 |
| CN110113393B true CN110113393B (en) | 2022-04-22 |
Family
ID=67485702
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910312499.2A Active CN110113393B (en) | 2019-04-18 | 2019-04-18 | Message pushing method and device, electronic equipment and medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110113393B (en) |
Families Citing this family (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111400510B (en) * | 2020-03-18 | 2024-02-27 | 腾讯音乐娱乐科技（深圳）有限公司 | Data archiving processing method, device, equipment and readable storage medium |
| CN112330398B (en) * | 2020-10-30 | 2024-04-09 | 京东科技控股股份有限公司 | Object processing method and device, electronic equipment and storage medium |
| CN112632375B (en) * | 2020-12-18 | 2023-07-25 | 深圳市和讯华谷信息技术有限公司 | Session information processing method, server and storage medium |
| CN113111067A (en) * | 2021-04-25 | 2021-07-13 | 京东数科海益信息科技有限公司 | Data storage method, information push method and device |
| CN113760915B (en) * | 2021-09-07 | 2024-07-19 | 百果园技术(新加坡)有限公司 | Data processing method, device, equipment and medium |
| CN114430427B (en) * | 2022-01-11 | 2023-12-12 | 上海焜耀网络科技有限公司 | Method, storage medium and equipment for managing messages with same identity |
| CN114553946B (en) * | 2022-01-29 | 2024-01-19 | 北京金堤科技有限公司 | Method and device for processing message |
Family Cites Families (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103995866A (en) * | 2014-05-19 | 2014-08-20 | 北京邮电大学 | Commodity information pushing method and device based on link forecasting |
| CN105991408B (en) * | 2015-02-12 | 2019-07-16 | 腾讯科技（深圳）有限公司 | A kind of message treatment method, device and processing server |
| CN105718534B (en) * | 2016-01-14 | 2017-05-03 | 广州市动景计算机科技有限公司 | Information pushing apparatus, information pushing method and client |
| CN106897905B (en) * | 2017-02-28 | 2021-09-17 | 重庆度小满优扬科技有限公司 | Method and device for pushing information and electronic equipment |
| CN108572789B (en) * | 2017-03-13 | 2022-01-28 | 阿里巴巴集团控股有限公司 | Disk storage method and device, message pushing method and device and electronic equipment |
| CN107766482B (en) * | 2017-10-13 | 2021-12-14 | 北京猎户星空科技有限公司 | Information pushing and sending method, device, electronic equipment and storage medium |
| CN108629045A (en) * | 2018-05-14 | 2018-10-09 | 平安科技（深圳）有限公司 | A kind of information push method, storage medium and server |
-
2019
- 2019-04-18 CN CN201910312499.2A patent/CN110113393B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN110113393A (en) | 2019-08-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110113393B (en) | Message pushing method and device, electronic equipment and medium | |
| CN110008743A (en) | Data attribute identification method, device and equipment in a kind of piece of chain type account book | |
| CN113591068B (en) | Online login device management method and device and electronic device | |
| US20230205755A1 (en) | Methods and systems for improved search for data loss prevention | |
| CN105391594A (en) | Method and device for recognizing characteristic account number | |
| CN111159160B (en) | Version rollback method and device, electronic equipment and storage medium | |
| CN109886300A (en) | A kind of user's clustering method, device and equipment | |
| CN111506580A (en) | Transaction storage method based on centralized block chain type account book | |
| CN110059088B (en) | Data attribute identification method, device and equipment in block chain type account book | |
| US20180034949A1 (en) | Method and system for detecting abnormal contact information and server | |
| CN110750533A (en) | Data storage method, device and equipment based on multiple service attributes | |
| CN112256691B (en) | Data mapping method and device and electronic equipment | |
| CN110727895B (en) | Sensitive word sending method and device, electronic equipment and storage medium | |
| CN110059087B (en) | Data attribute identification method, device and equipment in block chain type account book | |
| CN108846009B (en) | Copy data storage method and device in ceph | |
| CN111078773A (en) | Data processing method and device | |
| CN108804625B (en) | LSM tree optimization method and device and computer equipment | |
| CN110866380A (en) | Method and terminal for filling in information field content | |
| CN110209666B (en) | data storage method and terminal equipment | |
| CN110020348B (en) | Early warning method and device for circled events | |
| CN106681524A (en) | Method and device for processing information | |
| CN111698765A (en) | IP address verification method and device, electronic equipment and storage medium | |
| CN110347333A (en) | Improve method, apparatus, computer equipment and the storage medium of clone's mirror image performance | |
| CN116860180B (en) | Distributed storage method and device, electronic equipment and storage medium | |
| CN110209679B (en) | data storage method and terminal equipment for improving access efficiency |
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 |