CN112989147A - Data information pushing method and device, computer equipment and storage medium - Google Patents
Data information pushing method and device, computer equipment and storage medium Download PDFInfo
- Publication number
- CN112989147A CN112989147A CN202110194155.3A CN202110194155A CN112989147A CN 112989147 A CN112989147 A CN 112989147A CN 202110194155 A CN202110194155 A CN 202110194155A CN 112989147 A CN112989147 A CN 112989147A
- Authority
- CN
- China
- Prior art keywords
- pushed
- pushing
- data message
- bloom filter
- hash value
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 59
- 238000004364 calculation method Methods 0.000 claims abstract description 19
- 238000013507 mapping Methods 0.000 claims description 24
- 230000008569 process Effects 0.000 claims description 21
- 238000004590 computer program Methods 0.000 claims description 13
- 238000012545 processing Methods 0.000 abstract description 6
- 230000006870 function Effects 0.000 description 4
- 238000010586 diagram Methods 0.000 description 2
- 230000005012 migration Effects 0.000 description 2
- 238000013508 migration Methods 0.000 description 2
- 230000001360 synchronised effect Effects 0.000 description 2
- 238000004422 calculation algorithm Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/903—Querying
- G06F16/9035—Filtering based on additional data, e.g. user or group profiles
-
- 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/901—Indexing; Data structures therefor; Storage structures
- G06F16/9014—Indexing; Data structures therefor; Storage structures hash tables
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)
- Computational Linguistics (AREA)
- Software Systems (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The application provides a data information pushing method and device, computer equipment and a storage medium, relates to the technical field of data processing, and is used for improving the pushing efficiency of data information. The method mainly comprises the following steps: receiving a data message pushing request, wherein the data message pushing request comprises a user identifier to be pushed and a data message to be pushed; performing hash calculation on the user identification to be pushed to obtain a hash value; determining a corresponding bloom filter according to the hash value, and determining whether the user identifier to be pushed exists in a corresponding set or not according to the bloom filter; different hash values correspond to different bloom filters; and if the user identification to be pushed is in the set, pushing the data message to the user of the user identification to be pushed.
Description
Technical Field
The present application relates to the field of data processing technologies, and in particular, to a method and an apparatus for pushing a data message, a computer device, and a storage medium.
Background
The personalized data information is related data information recommended to the user according to the browsing interest of the user, so that the user experience can be effectively improved, the user can accept the personalized data information more easily, the waste of invalid information to bandwidth and network flow in data information pushing is avoided, and the data information pushing efficiency is improved.
At present, recommendation of data information is achieved by determining whether a user ID is in a set, but since the set contains a large amount of data, it takes much query time to determine whether the user ID is the data in the set through the set, and thus efficiency of pushing data messages to users is low.
Disclosure of Invention
The embodiment of the application provides a method and a device for pushing data information, computer equipment and a storage medium, which are used for improving the pushing efficiency of data information.
The embodiment of the invention provides a method for pushing data information, which comprises the following steps:
receiving a data message pushing request, wherein the data message pushing request comprises a user identifier to be pushed and a data message to be pushed;
performing hash calculation on the user identification to be pushed to obtain a hash value;
determining a corresponding bloom filter according to the hash value, and determining whether the user identifier to be pushed exists in a corresponding set or not according to the bloom filter; different hash values correspond to different bloom filters;
and if the user identification to be pushed is in the set, pushing the data message to the user of the user identification to be pushed.
The embodiment of the invention provides a data information pushing device, which comprises:
the receiving module is used for receiving a data message pushing request, wherein the data message pushing request comprises a user identifier to be pushed and a data message to be pushed;
the calculation module is used for carrying out hash calculation on the user identification to be pushed to obtain a hash value;
the determining module is used for determining a corresponding bloom filter according to the hash value and determining whether the user identifier to be pushed exists in a corresponding set or not according to the bloom filter; different hash values correspond to different bloom filters;
and the pushing module is used for pushing the data message to the user with the user identifier to be pushed if the user identifier to be pushed is in the set.
A computer device comprising a memory, a processor and a computer program stored in the memory and executable on the processor, the processor implementing the above data information pushing method when executing the computer program.
A computer-readable storage medium, which stores a computer program that, when executed by a processor, implements the above-described pushing method of data information.
The invention provides a method and a device for pushing data information, computer equipment and a storage medium, wherein a data message pushing request is received firstly, and the data message pushing request comprises a user identifier to be pushed and a data message to be pushed; performing hash calculation on the user identification to be pushed to obtain a hash value; determining a corresponding bloom filter according to the hash value, and determining whether the user identifier to be pushed exists in a corresponding set or not according to the bloom filter; different hash values correspond to different bloom filters; and if the user identification to be pushed is in the set, pushing the data message to the user of the user identification to be pushed. Compared with the prior art that the data message is pushed by inquiring the user ID in one set, the data message pushing method and the data message pushing device have the advantages that after the data message pushing request is received, the corresponding bloom filter is determined according to the user identification to be pushed in the request, and then whether the user identification to be pushed is in the corresponding set is inquired according to the bloom filter, so that the data message is pushed.
Drawings
Fig. 1 is a flowchart of a data information pushing method according to a first embodiment of the present application;
fig. 2 is a flowchart of a method for pushing data information according to a second embodiment of the present application;
fig. 3 is a block diagram illustrating a pushing apparatus for pushing data information according to an embodiment of the present application;
fig. 4 is a schematic diagram of a computer device according to an embodiment of the present application.
Detailed Description
In order to better understand the technical solutions described above, the technical solutions of the embodiments of the present application are described in detail below with reference to the drawings and the specific embodiments, and it should be understood that the specific features of the embodiments and the embodiments of the present application are detailed descriptions of the technical solutions of the embodiments of the present application, and are not limitations of the technical solutions of the present application, and the technical features of the embodiments and the embodiments of the present application may be combined with each other without conflict.
First embodiment
Referring to fig. 1, a method for pushing data information according to a first embodiment of the present invention is shown, the method specifically includes steps S10-S40:
step S10, receiving a data message pushing request, where the data message pushing request includes a user identifier to be pushed and a data message to be pushed.
The user identifier to be pushed, that is, the user identifier of the user needing to push the data message, may specifically represent the user identifier by an OAID (advertisement identifier). The data message to be pushed may be a text message, a voice message, a picture message, a video message, and the like, and the embodiment of the present invention is not limited specifically.
Step S20, performing hash calculation on the user identifier to be pushed to obtain a hash value.
When performing hash calculation on the to-be-pushed user identifier, the hash table length may be set according to the number of bloom filters, and if the number of bloom filters is 16, the hash table length is set to 16, so that after the hash function h (x) is calculated as x mod M (M is the hash table length), the range of the hash value is 0 to 15, and the corresponding bloom filter is identified by 0 to 15.
Step S30, determining a corresponding bloom filter according to the hash value, and determining whether the user identifier to be pushed exists in a corresponding set according to the bloom filter.
The different hash values correspond to different bloom filters, each bloom filter corresponds to a set, and the set stores user identifiers. The elements in the set of different bloom filters are different and the user identities in the set are also determined according to a hashing algorithm.
For a large number of user identifications, the user identifications need to be distributed into a set of corresponding bloom filters, if two bloom filters are respectively a bloom filter 1 and a bloom filter 2, hash calculation is carried out on each user identification to obtain a hash value, and if the hash value is 0, the user identifications are stored into the set corresponding to the bloom filter 1; and if the hash value is 1, storing the user identification in a set corresponding to the bloom filter 2.
Step S40, if the user identifier to be pushed is in the set, pushing the data message to the user of the user identifier to be pushed.
The invention provides a method for pushing data information, which comprises the steps of firstly receiving a data message pushing request, wherein the data message pushing request comprises a user identifier to be pushed and a data message to be pushed; performing hash calculation on the user identification to be pushed to obtain a hash value; determining a corresponding bloom filter according to the hash value, and determining whether the user identifier to be pushed exists in a corresponding set or not according to the bloom filter; different hash values correspond to different bloom filters; and if the user identification to be pushed is in the set, pushing the data message to the user of the user identification to be pushed. Compared with the prior art that the data message is pushed by inquiring the user ID in one set, the data message pushing method and the data message pushing device have the advantages that after the data message pushing request is received, the corresponding bloom filter is determined according to the user identification to be pushed in the request, and then whether the user identification to be pushed is in the corresponding set is inquired according to the bloom filter, so that the data message is pushed.
Second embodiment
Referring to fig. 2, a method for pushing data information according to a second embodiment of the present invention is shown, where the method includes:
step S01, receiving a data message pushing request, where the data message pushing request includes a user identifier to be pushed and a data message to be pushed.
Step S02, performing hash calculation on the user identifier to be pushed to obtain a hash value.
Step S01 and step S02 are the same as the corresponding steps in the first embodiment, and are not repeated here.
And step S03, determining the hash value according to a preset mapping table to determine the corresponding physical device.
And the preset mapping table stores physical equipment respectively corresponding to different hash values. It should be noted that the number of the physical devices may be specifically determined according to the number of bloom filters and the number of user identifiers in a set in the bloom filters. For example, if there are 16 bloom filters, 4 physical devices may be set, where physical device 1 is used to process bloom filters No. 0-3, physical device 2 is used to process bloom filters No. 4-7, physical device 3 is used to process bloom filters No. 8-11, and physical device 4 is used to process bloom filters No. 12-15, and then the correspondence between the above physical devices and bloom filters (hash values) is stored in a preset mapping table.
Step S04, sending the user identifier to be pushed to the physical device, and determining whether the user identifier to be pushed exists in a corresponding set through a bloom filter in the physical device.
In an embodiment provided by the present invention, the determining, by a bloom filter in the physical device, whether the user identifier to be pushed exists in a corresponding set includes:
and S041, determining a corresponding bloom filter in the physical device according to the hash value.
Step S042, determining whether the user identifier to be pushed exists in a corresponding set according to the corresponding bloom filter in the physical device.
For example, hash calculation is performed on the user identifier to be pushed to obtain a hash value of 3, then it is known that the hash value 3 corresponds to the physical device 1 according to the corresponding relationship between the hash value and the physical device in the preset mapping table, the user identifier to be pushed is sent to the physical device 1, since the physical device 1 includes 4 bloom filters (0-3), the corresponding bloom filter needs to be determined according to the hash value of the user identifier to be pushed, in this example, since the hash value of the user identifier to be pushed is 3, the corresponding bloom filter is 2, that is, whether the user identifier to be pushed exists in the set is searched through the bloom filter 2.
Step S05, if the user identifier to be pushed is in the set, pushing the data message to the user of the user identifier to be pushed.
The embodiment of the invention provides a method for pushing a data message, which comprises the steps of firstly carrying out hash calculation on a user identifier to be pushed to obtain a hash value, then determining the hash value according to a preset mapping table to determine corresponding physical equipment, sending the user identifier to be pushed to the physical equipment, and determining whether the user identifier to be pushed exists in a corresponding set or not through a bloom filter in the physical equipment. The invention can improve the data query efficiency and further improve the data information push efficiency by using a plurality of physical devices and a plurality of bloom filters to query the user identification to be pushed in parallel.
In an embodiment provided by the present invention, in order to always maintain the query efficiency of the data, the method further includes:
1. if the quantity of the data message pushing requests received within the preset time exceeds a first preset value, adding new physical equipment to process the data message pushing requests;
the first preset value may be determined according to the number of maximum push requests processed by the plurality of physical devices in parallel within a preset time, that is, after it is determined that the number of data message push requests received within the preset time exceeds the maximum number of requests processed by all the physical devices in parallel, a new physical device needs to be added to process the data message push requests.
2. Migrating one or more bloom filters in the physical device which processes the data message push request most to the newly added physical device;
it should be noted that, in this embodiment, specifically, the number of the added physical devices may be determined according to the number of the data message push requests received within the preset time, and specifically, 1 physical device, 2 physical devices, or 5 physical devices may be added, which is not limited in the embodiment of the present invention.
For example, one physical device a is added, and one bloom filter is selected from the physical devices which process the most data messages and is migrated to the physical device a. For another example, if one physical device B and one physical device C are added, one or more bloom filters are selected from the physical devices with the highest ranking of processing data messages and are migrated into the physical devices B and C, for example, one bloom filter in the physical device with the first ranking of processing data messages is migrated into the physical device B, and one bloom filter in the physical device with the second ranking of processing data messages is migrated into the physical device C.
3. And modifying the hash value corresponding to the added physical device in the preset mapping table.
In the embodiment of the present invention, after the bloom filter is successfully migrated to the newly added physical device, the hash value corresponding to the newly added physical device in the preset mapping table needs to be modified. Before adding a new physical device, the preset mapping table includes 2 physical devices, a physical device 1 and a physical device 2, the physical device 1 corresponds to a bloom filter 0 (hash value 0) and a bloom filter 1 (hash value 1), the physical device 2 corresponds to a bloom filter 2 (hash value 2) and a bloom filter 3 (hash value 3), and after adding a new physical device 3, the bloom filter 1 in the physical device 1 is migrated to the bloom filter 3. And then modifying the hash value corresponding to the physical device in the preset mapping table, wherein the modified preset mapping table is as follows: physical device 1 corresponds to bloom filter 0 (hash value 0), physical device 2 corresponds to bloom filter 2 (hash value 2) and bloom filter 3 (hash value 3), and physical device 3 corresponds to bloom filter 1 (hash value 1).
For the embodiment of the present invention, in order to balance the number of data message push requests processed by each physical device, the number of push requests processed by all the physical devices may also be obtained at intervals, and then a bloom filter between the physical devices may be adjusted according to the number of push requests processed by each physical device, and after the adjustment is completed, the corresponding relationship between the physical devices and the hash value in the preset mapping table is modified. For example, there are a physical device 1, a physical device 2, a physical device 3, and a physical device 4, each of which includes 3 bloom filters, and if it is detected that the number of push requests processed by the physical device 1 exceeds a preset value, one bloom filter in the physical device 1 may be migrated to the physical device 4 that processes the push request least, and then the corresponding relationship between the hash value (bloom filter) and the physical device in the preset mapping table is modified.
In an embodiment provided by the present invention, in order to reduce occupied physical device resources, the method further includes:
1. if the number of the data message pushing requests received within the preset time is less than a second preset value, migrating all the bloom filters in the physical device which processes the data message pushing requests at the least to other physical devices;
the second preset value may be specifically set according to a total amount of the push requests processed in parallel within a preset time of all the physical devices, for example, the second preset value is set to 60% of the total amount of the push requests processed in parallel, and if the first preset value is the first preset value, all the bloom filters in the physical device that processes the data message push request least are migrated to the other physical devices.
2. And modifying the hash value corresponding to the physical equipment in the preset mapping table.
For example, there are a physical device 1, a physical device 2, a physical device 3, and a physical device 4, each physical device includes 3 bloom filters, and if the number of data message push requests received within a preset time is less than a second preset value, the 3 bloom filters in the physical device 4 that processes the data message push request least are averagely migrated to other physical devices, and then the physical device 4 is deleted, and the hash value corresponding to the physical device in the preset mapping table is modified, so as to reduce occupied physical device resources.
It should be understood that, the sequence numbers of the steps in the foregoing embodiments do not imply an execution sequence, and the execution sequence of each process should be determined by its function and inherent logic, and should not constitute any limitation to the implementation process of the embodiments of the present invention.
In an embodiment, a data information pushing device is provided, where the data information pushing device corresponds to the data information pushing method in the foregoing embodiment one to one. As shown in fig. 3, the details of each functional module of the data information pushing device are as follows:
a receiving module 10, configured to receive a data message pushing request, where the data message pushing request includes a user identifier to be pushed and a data message to be pushed;
the calculating module 20 is configured to perform hash calculation on the user identifier to be pushed to obtain a hash value;
the determining module 30 determines a corresponding bloom filter according to the hash value, and determines whether the user identifier to be pushed exists in a corresponding set according to the bloom filter; different hash values correspond to different bloom filters;
a pushing module 40, configured to push the data message to the user with the to-be-pushed user identifier if the to-be-pushed user identifier is in the set.
Further, the apparatus further comprises:
the determining module 30 is further configured to determine, according to a preset mapping table, that the hash value determines a corresponding physical device; the preset mapping table stores physical devices corresponding to different hash values respectively;
a sending module 50, configured to send the user identifier to be pushed to the physical device;
the pushing module 40 is further configured to determine whether the user identifier to be pushed exists in the corresponding set through a bloom filter in the physical device.
The determining module 30 is specifically configured to determine, according to the hash value, a corresponding bloom filter in the physical device; and determining whether the user identification to be pushed exists in the corresponding set according to the corresponding bloom filter in the physical equipment.
Further, the apparatus further comprises:
an adding module 60, configured to add a new physical device to process the data message push request if the number of data message push requests received within a preset time exceeds a first preset value;
a migration module 70, configured to migrate one or more bloom filters in the physical device that has the most processing the data message push request to a newly added physical device;
and a modifying module 80, configured to modify the hash value corresponding to the added physical device in the preset mapping table.
The migration module 70 is further configured to migrate, if the number of the data message push requests received within a preset time is less than a second preset value, all of the bloom filters in the physical device that processes the data message push request least to other physical devices;
the modifying module 80 is configured to modify the hash value corresponding to the physical device in the preset mapping table.
For specific limitations of the pushing device of the data information, reference may be made to the above limitations on the pushing method of the data information, which are not described herein again. The various modules in the above-described apparatus may be implemented in whole or in part by software, hardware, and combinations thereof. The modules can be embedded in a hardware form or independent from a processor in the computer device, and can also be stored in a memory in the computer device in a software form, so that the processor can call and execute operations corresponding to the modules.
In one embodiment, a computer device is provided, which may be a server, the internal structure of which may be as shown in fig. 4. The computer device includes a processor, a memory, a network interface, and a database connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device comprises a nonvolatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program, and a database. The internal memory provides an environment for the operation of an operating system and computer programs in the non-volatile storage medium. The network interface of the computer device is used for communicating with an external terminal through a network connection. The computer program is executed by a processor to implement a method of pushing data information.
In one embodiment, a computer device is provided, comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, the processor implementing the following steps when executing the computer program:
receiving a data message pushing request, wherein the data message pushing request comprises a user identifier to be pushed and a data message to be pushed;
performing hash calculation on the user identification to be pushed to obtain a hash value;
determining a corresponding bloom filter according to the hash value, and determining whether the user identifier to be pushed exists in a corresponding set or not according to the bloom filter; different hash values correspond to different bloom filters;
and if the user identification to be pushed is in the set, pushing the data message to the user of the user identification to be pushed.
In one embodiment, a computer-readable storage medium is provided, having a computer program stored thereon, which when executed by a processor, performs the steps of:
receiving a data message pushing request, wherein the data message pushing request comprises a user identifier to be pushed and a data message to be pushed;
performing hash calculation on the user identification to be pushed to obtain a hash value;
determining a corresponding bloom filter according to the hash value, and determining whether the user identifier to be pushed exists in a corresponding set or not according to the bloom filter; different hash values correspond to different bloom filters;
and if the user identification to be pushed is in the set, pushing the data message to the user of the user identification to be pushed.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by hardware instructions of a computer program, which can be stored in a non-volatile computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. Any reference to memory, storage, database, or other medium used in the embodiments provided herein may include non-volatile and/or volatile memory, among others. Non-volatile memory can include read-only memory (ROM), Programmable ROM (PROM), Electrically Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDRSDRAM), Enhanced SDRAM (ESDRAM), Synchronous Link DRAM (SLDRAM), Rambus Direct RAM (RDRAM), direct bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).
It will be apparent to those skilled in the art that, for convenience and brevity of description, only the above-mentioned division of the functional units and modules is illustrated, and in practical applications, the above-mentioned function distribution may be performed by different functional units and modules according to needs, that is, the internal structure of the apparatus is divided into different functional units or modules to perform all or part of the above-mentioned functions.
The above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; such modifications and substitutions do not substantially depart from the spirit and scope of the embodiments of the present invention, and are intended to be included within the scope of the present invention.
Claims (10)
1. A method for pushing data information, the method comprising:
receiving a data message pushing request, wherein the data message pushing request comprises a user identifier to be pushed and a data message to be pushed;
performing hash calculation on the user identification to be pushed to obtain a hash value;
determining a corresponding bloom filter according to the hash value, and determining whether the user identifier to be pushed exists in a corresponding set or not according to the bloom filter; different hash values correspond to different bloom filters;
and if the user identification to be pushed is in the set, pushing the data message to the user of the user identification to be pushed.
2. The method for pushing data information according to claim 1, wherein after performing hash calculation on the to-be-pushed user identifier to obtain a hash value, the method further comprises:
determining the hash value according to a preset mapping table to determine corresponding physical equipment; the preset mapping table stores physical devices corresponding to different hash values respectively;
and sending the user identification to be pushed to the physical equipment, and determining whether the user identification to be pushed exists in a corresponding set or not through a bloom filter in the physical equipment.
3. The method according to claim 2, wherein the determining, by a bloom filter in the physical device, whether the user identifier to be pushed exists in a corresponding set includes:
determining a corresponding bloom filter in the physical equipment according to the hash value;
and determining whether the user identification to be pushed exists in the corresponding set according to the corresponding bloom filter in the physical equipment.
4. The method for pushing data information according to claim 2, wherein the method further comprises:
if the quantity of the data message pushing requests received within the preset time exceeds a first preset value, adding new physical equipment to process the data message pushing requests;
migrating one or more bloom filters in the physical device which processes the data message push request most to the newly added physical device;
and modifying the hash value corresponding to the added physical device in the preset mapping table.
5. The method for pushing data information according to claim 2, wherein the method further comprises:
if the number of the data message pushing requests received within the preset time is less than a second preset value, migrating all the bloom filters in the physical device which processes the data message pushing requests at the least to other physical devices;
and modifying the hash value corresponding to the physical equipment in the preset mapping table.
6. An apparatus for pushing data information, the apparatus comprising:
the receiving module is used for receiving a data message pushing request, wherein the data message pushing request comprises a user identifier to be pushed and a data message to be pushed;
the calculation module is used for carrying out hash calculation on the user identification to be pushed to obtain a hash value;
the determining module is used for determining a corresponding bloom filter according to the hash value and determining whether the user identifier to be pushed exists in a corresponding set or not according to the bloom filter; different hash values correspond to different bloom filters;
and the pushing module is used for pushing the data message to the user with the user identifier to be pushed if the user identifier to be pushed is in the set.
7. The apparatus for pushing data information according to claim 6, wherein the apparatus further comprises:
the determining module is further configured to determine, according to a preset mapping table, that the hash value determines a corresponding physical device; the preset mapping table stores physical devices corresponding to different hash values respectively;
the sending module is used for sending the user identifier to be pushed to the physical equipment;
the pushing module is further configured to determine whether the user identifier to be pushed exists in a corresponding set through a bloom filter in the physical device.
8. The apparatus for pushing data information according to claim 7, wherein the determining module is specifically configured to determine, according to the hash value, a corresponding bloom filter in the physical device; and determining whether the user identification to be pushed exists in the corresponding set according to the corresponding bloom filter in the physical equipment.
9. A computer device comprising a memory, a processor and a computer program stored in the memory and executable on the processor, characterized in that the processor implements the method of pushing data information according to any one of claims 1 to 5 when executing the computer program.
10. A computer-readable storage medium, in which a computer program is stored, which, when being executed by a processor, implements a method for pushing data information according to any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110194155.3A CN112989147A (en) | 2021-02-20 | 2021-02-20 | Data information pushing method and device, computer equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110194155.3A CN112989147A (en) | 2021-02-20 | 2021-02-20 | Data information pushing method and device, computer equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112989147A true CN112989147A (en) | 2021-06-18 |
Family
ID=76394194
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110194155.3A Pending CN112989147A (en) | 2021-02-20 | 2021-02-20 | Data information pushing method and device, computer equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112989147A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116258524A (en) * | 2023-03-14 | 2023-06-13 | 深圳乐信软件技术有限公司 | Advertisement putting method, device, equipment and storage medium based on bloom filter |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130339526A1 (en) * | 2012-06-19 | 2013-12-19 | Canon Kabushiki Kaisha | Method and system for generating and using an augmented bloom filter |
| CN103685502A (en) * | 2013-12-09 | 2014-03-26 | 腾讯科技（深圳）有限公司 | Message pushing method, device and system |
| CN106598984A (en) * | 2015-10-16 | 2017-04-26 | 北京国双科技有限公司 | Data processing method and device of web crawler |
| CN106970930A (en) * | 2016-10-10 | 2017-07-21 | 阿里巴巴集团控股有限公司 | Message, which is sent, determines method and device, tables of data creation method and device |
| CN107888659A (en) * | 2017-10-12 | 2018-04-06 | 北京京东尚科信息技术有限公司 | The processing method and system of user's request |
| CN110880147A (en) * | 2019-11-22 | 2020-03-13 | 腾讯科技（深圳）有限公司 | Transaction processing method, related equipment and computer storage medium |
| CN112330398A (en) * | 2020-10-30 | 2021-02-05 | 京东数字科技控股股份有限公司 | Object processing method and device, electronic equipment and storage medium |
-
2021
- 2021-02-20 CN CN202110194155.3A patent/CN112989147A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130339526A1 (en) * | 2012-06-19 | 2013-12-19 | Canon Kabushiki Kaisha | Method and system for generating and using an augmented bloom filter |
| CN103685502A (en) * | 2013-12-09 | 2014-03-26 | 腾讯科技（深圳）有限公司 | Message pushing method, device and system |
| CN106598984A (en) * | 2015-10-16 | 2017-04-26 | 北京国双科技有限公司 | Data processing method and device of web crawler |
| CN106970930A (en) * | 2016-10-10 | 2017-07-21 | 阿里巴巴集团控股有限公司 | Message, which is sent, determines method and device, tables of data creation method and device |
| CN107888659A (en) * | 2017-10-12 | 2018-04-06 | 北京京东尚科信息技术有限公司 | The processing method and system of user's request |
| CN110880147A (en) * | 2019-11-22 | 2020-03-13 | 腾讯科技（深圳）有限公司 | Transaction processing method, related equipment and computer storage medium |
| CN112330398A (en) * | 2020-10-30 | 2021-02-05 | 京东数字科技控股股份有限公司 | Object processing method and device, electronic equipment and storage medium |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116258524A (en) * | 2023-03-14 | 2023-06-13 | 深圳乐信软件技术有限公司 | Advertisement putting method, device, equipment and storage medium based on bloom filter |
| CN116258524B (en) * | 2023-03-14 | 2024-02-02 | 深圳乐信软件技术有限公司 | Advertisement putting method, device, equipment and storage medium based on bloom filter |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108173774B (en) | Client upgrading method and system | |
| CN112153170B (en) | Method, device and equipment for accessing server and storage medium | |
| CN111800459A (en) | Asynchronous processing method, device and system for download task and storage medium | |
| CN110213392B (en) | Data distribution method and device, computer equipment and storage medium | |
| CN108390933B (en) | Message distribution method, device, server and storage medium | |
| CN112231054A (en) | Multi-model inference service deployment method and device based on k8s cluster | |
| CN113434293A (en) | Method and apparatus for processing repeat request, storage medium, and electronic apparatus | |
| CN110741617B (en) | Resource updating method and device, computer equipment and storage medium | |
| CN108389124B (en) | Data processing method, data processing device, computer equipment and storage medium | |
| CN112989147A (en) | Data information pushing method and device, computer equipment and storage medium | |
| CN111083204A (en) | File transmission method, device and storage medium | |
| CN111866197B (en) | Domain name resolution method and system | |
| CN116303343A (en) | Data slicing method, device, electronic equipment and storage medium | |
| CN111259012A (en) | Data homogenizing method and device, computer equipment and storage medium | |
| WO2016176045A1 (en) | System, method, and apparatus for updating data in a distributed storage system | |
| CN108173892B (en) | Cloud mirror image operation method and device | |
| CN115203255A (en) | Data query method and device, electronic equipment and storage medium | |
| CN111654398B (en) | Configuration updating method and device, computer equipment and readable storage medium | |
| CN116028196A (en) | Data processing method, device and storage medium | |
| CN109548020B (en) | Compensation method and device after authentication failure, server and storage medium | |
| CN115033551A (en) | Database migration method and device, electronic equipment and storage medium | |
| CN113821495A (en) | Database cluster implementation system and method | |
| CN111666290A (en) | Data replacement method, device, computer equipment and medium based on artificial intelligence | |
| CN111176715A (en) | Information calling method and server | |
| CN113434598B (en) | Method, device and electronic device for realizing data double writing |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20210618 |