CN112330398B - Object processing method and device, electronic equipment and storage medium - Google Patents
Object processing method and device, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN112330398B CN112330398B CN202011197051.XA CN202011197051A CN112330398B CN 112330398 B CN112330398 B CN 112330398B CN 202011197051 A CN202011197051 A CN 202011197051A CN 112330398 B CN112330398 B CN 112330398B
- Authority
- CN
- China
- Prior art keywords
- target
- pushed
- information
- receiver
- 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
- 238000003672 processing method Methods 0.000 title claims abstract description 15
- 238000000034 method Methods 0.000 claims abstract description 41
- 238000004364 calculation method Methods 0.000 claims abstract description 37
- 238000012545 processing Methods 0.000 claims abstract description 28
- 230000006870 function Effects 0.000 claims abstract description 24
- 238000004891 communication Methods 0.000 claims description 18
- 238000001914 filtration Methods 0.000 claims description 15
- 238000004590 computer program Methods 0.000 claims description 8
- 238000004422 calculation algorithm Methods 0.000 abstract description 9
- 238000011156 evaluation Methods 0.000 description 19
- 230000008569 process Effects 0.000 description 6
- 238000004458 analytical method Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 4
- 230000009471 action Effects 0.000 description 3
- 239000013598 vector Substances 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000002093 peripheral effect Effects 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000000802 evaporation-induced self-assembly Methods 0.000 description 1
- 239000002360 explosive Substances 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 238000012886 linear function Methods 0.000 description 1
- 238000013507 mapping Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/06—Buying, selling or leasing transactions
- G06Q30/0601—Electronic shopping [e-shopping]
- G06Q30/0631—Item recommendations
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Physics & Mathematics (AREA)
- Economics (AREA)
- General Business, Economics & Management (AREA)
- Strategic Management (AREA)
- Marketing (AREA)
- Development Economics (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- Information Transfer Between Computers (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The application discloses an object processing method, an object processing device, electronic equipment and a storage medium. Wherein the method comprises the following steps: acquiring a push service request, wherein the push service request carries a target object identifier of an object to be pushed; carrying out hash calculation on the target object identifier by adopting N hash functions to obtain N target hash values, wherein N is an integer greater than or equal to 1; obtaining a target bitmap corresponding to the target object identifier; inquiring target data bits corresponding to N target hash values from the target bitmap; and executing processing operation on the object to be pushed according to the target parameter information displayed by the target data bit. According to the method, the hash value obtained by calculating the target object identifier is used for obtaining the parameters of the data bit display in the target bitmap, whether the object to be pushed is pushed or not can be rapidly determined according to the parameters, the method is simple in operation, the algorithm is configurable, and the processing efficiency is higher when the data volume of the object is huge.
Description
Technical Field
The present disclosure relates to the field of data processing, and in particular, to an object processing method, an object processing device, an electronic device, and a storage medium.
Background
The rapid growth of the internet industry has led to explosive growth of content. To assist users in efficiently obtaining information, personalized pushing systems are playing an increasingly important role. Collaborative filtering technology is a class of technology that is of great interest in push systems. Unlike traditional content-based direct filtering analysis pushing, collaborative filtering utilizes a large amount of user information to select users similar to the target user or items similar to the target items to finally push the items of possible interest of the current target user.
In the prior art, whether two articles are identical or not is analyzed, and the related algorithm comprises the following steps:
(1) Euclidean algorithm: a point for abstracting information into an N-dimensional space, and determining the similarity between different information by analyzing euclidean distances between the points;
(2) Cosine similarity algorithm: the method is used for abstracting information into an N-dimensional vector, obtaining a vector included angle value by analyzing and calculating cosine values of the two vectors, and determining the similarity of different information according to the included angle value.
In carrying out the present application, the inventors have found that the related algorithms of the prior art for analyzing whether the items are identical have the following drawbacks: the operation amount is large and complex; the algorithm is relatively fixed and has no collocation; therefore, when the data amount of the article is large, the processing performance is low.
Disclosure of Invention
In order to solve the technical problems described above or at least partially solve the technical problems described above, the application provides an object processing method, an object processing device, an electronic device and a storage medium.
According to an aspect of an embodiment of the present application, there is provided an object processing method, including:
acquiring a push service request, wherein the push service request carries a target object identifier of an object to be pushed;
carrying out hash calculation on the target object identifier by adopting N different hash functions to obtain N target hash values, wherein N is an integer greater than 1;
acquiring target bitmap information corresponding to the target object identifier;
inquiring target parameter information on target data bits corresponding to the N target hash values from the target bitmap information;
and executing processing operation on the object to be pushed according to the target parameter information on the target data bit.
Further, the method further comprises:
acquiring a history pushing set, wherein the history pushing set comprises at least one object set, and the object set is obtained by dividing the history pushing set based on at least one object type;
acquiring an initial bitmap established according to the object set and an object identifier corresponding to a history pushing object in the object set;
carrying out hash calculation on the object identifier by adopting the N different hash functions to obtain N hash values;
a calculation result obtained by performing modulo calculation on the hash value;
and updating the parameter information displayed by the data bits in the initial bitmap according to the calculation result to obtain bitmap information.
Further, the obtaining the target bitmap information corresponding to the target object identifier includes:
determining the target object type of the object to be pushed according to the target object identifier;
querying a target object set matched with the target object type from the history pushing set;
and taking the bitmap corresponding to the target object set as the target bitmap information.
Further, the executing the processing operation on the object to be pushed according to the target parameter information on the target data bit includes:
and when the object to be pushed exists in the target object set according to the target parameter information, executing filtering operation on the object to be pushed.
Further, the performing filtering operation on the object to be pushed includes:
acquiring history push information of the object, wherein the history push information comprises at least one of the following: push time, number of pushes, and/or push feedback data;
when the history push information meets preset conditions, filtering the object to be pushed;
the history push information meets preset conditions and comprises at least one of the following:
the pushing time is smaller than a preset pushing time;
the pushing times are larger than preset pushing times;
the data volume of the push feedback data is larger than the data volume of the preset push feedback data.
Further, the executing the processing operation on the object to be pushed according to the target parameter information on the target data bit further includes:
when the target parameter information determines that the object to be pushed does not exist in the target object set, updating the target parameter information, and determining a target receiver corresponding to the object to be pushed;
and sending the object to be pushed to the target receiver.
Further, the obtaining the target receiver corresponding to the object to be pushed includes:
determining a receiver set corresponding to the object to be pushed according to the target object identifier, wherein the receiver set comprises at least one receiver and receiver information corresponding to the receiver;
determining attribute information of the object to be pushed;
inquiring from the receiver set to obtain target receiver information matched with the attribute information;
and taking the receiver corresponding to the target receiver information as the target receiver.
According to another aspect of the embodiments of the present application, there is also provided an object processing apparatus, including:
the first acquisition module is used for acquiring a push service request, wherein the push service request carries a target object identifier of an object to be pushed;
the calculation module is used for carrying out hash calculation on the target object identifier by adopting N hash functions to obtain N target hash values, wherein N is an integer greater than or equal to 1;
the second acquisition module is used for acquiring a target bitmap corresponding to the target object identifier;
the query module is used for querying target data bits corresponding to the N target hash values from the target bitmap;
and the execution module is used for executing processing operation on the object to be pushed according to the target parameter information displayed by the target data bit.
According to another aspect of the embodiments of the present application, there is also provided a storage medium including a stored program that performs the steps described above when running.
According to another aspect of the embodiments of the present application, there is provided an electronic device including a processor, a communication interface, a memory, and a communication bus, where the processor, the communication interface, and the memory complete communication with each other through the communication bus; wherein: a memory for storing a computer program; and a processor for executing the steps of the method by running a program stored on the memory.
Embodiments of the present application also provide a computer program product comprising instructions which, when run on a computer, cause the computer to perform the steps of the above method.
Compared with the prior art, the technical scheme provided by the embodiment of the application has the following advantages: according to the method, the hash value obtained by calculating the target object identifier is used for obtaining the parameters of the data bit display in the target bitmap, whether the object to be pushed is pushed or not can be rapidly determined according to the parameters, the method is simple in operation, the algorithm is configurable, and when the data volume of the object is huge, the processing efficiency is higher.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the application and together with the description, serve to explain the principles of the application.
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings that are required to be used in the description of the embodiments or the prior art will be briefly described below, and it will be obvious to those skilled in the art that other drawings can be obtained from these drawings without inventive effort.
FIG. 1 is a flowchart of an object processing method according to an embodiment of the present application;
fig. 2 is a schematic diagram of calculating a target object identifier according to an embodiment of the present application;
FIG. 3 is a flowchart of an object processing method according to another embodiment of the present application;
FIG. 4 is a flowchart of an object processing method according to another embodiment of the present application;
FIG. 5 is a block diagram of an object processing apparatus according to an embodiment of the present application;
fig. 6 is a schematic structural diagram of an electronic device according to an embodiment of the present application.
Detailed Description
For the purposes of making the objects, technical solutions and advantages of the embodiments of the present application more apparent, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present application, and it is apparent that the described embodiments are some embodiments of the present application, but not all embodiments, the exemplary embodiments of the present application and the descriptions thereof are used to explain the present application and do not constitute undue limitations of the present application. All other embodiments, which can be made by one of ordinary skill in the art without undue burden from the present disclosure, are within the scope of the present application based on the embodiments herein.
It should be noted that in this document, relational terms such as "first" and "second" and the like are used solely to distinguish one entity or action from another similar entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Moreover, 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 one … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
The embodiment of the application provides an object processing method, device and system. The method provided by the embodiment of the invention can be applied to any needed electronic equipment, for example, the electronic equipment can be a server, a terminal and the like, is not particularly limited, and is convenient to describe and is called as the electronic equipment for short hereinafter.
According to an aspect of the embodiments of the present application, a method embodiment of an object processing method is provided. Fig. 1 is a flowchart of a control method for object processing according to an embodiment of the present application, where, as shown in fig. 1, the method further includes:
step S11, a push service request is obtained, and the push service request obtains a target object identifier carrying an object to be pushed;
in the embodiment of the present application, the push service request may be sent by a requester, and the object to be pushed may be a commodity to be pushed, an advertisement to be pushed, news to be pushed, and the like. The target object identification may be a merchandise identification, an advertisement identification, a news identification, or the like. The embodiment of the application is described by taking commodity identification as an example. The commodity identification is typically a string of characters, for example, commodity identification "123323235413451".
Step S12, carrying out hash calculation on the target object identifier by adopting N hash functions to obtain N target hash values, wherein N is an integer greater than or equal to 1;
in the embodiment of the application, hash calculation is performed on the commodity identifier through N different hash functions to obtain N hash values. As an example, commodity id= "123323235413451", this is calculated by a plurality of hash functions set in advance, resulting in a first hash value of 621, a second hash value of 500, and an nth hash value of 712, respectively.
Hash function design principle: the domain of the hash function must include all keys that need to be stored, while its value must be between 0 and m-1 if the hash table allows m addresses. The addresses calculated by the hash function can be uniformly distributed in the whole space. The hash function should be relatively simple.
A hash function calculation method is commonly used:
(1) Direct addressing:
taking a certain linear function of the target object identification as a hash value:
hash (Key) =a×key+b. Wherein Key is a target object identifier, and A, B is a constant.
The direct addressing method is characterized in that the size of the hash value set is equal to the size of the target object identification set, so that the calculation process is simpler, and the calculated hash values are uniformly distributed in the graph.
(2) Remainder-dividing method:
let m be the number of addresses allowed in the hash table and m be a positive integer. Taking a prime number p which is not more than m but is closest to or equal to m as a divisor, and according to a hash function: hash (Key) =key mod p (p.ltoreq.m), converts the target object identification Key into a Hash value.
The remainder dividing method is characterized by simple calculation process and high calculation speed.
The common hash function calculation method is not limited to the above two methods, and is not described here again.
Step S13, a target bitmap corresponding to the target object identifier is obtained;
in the embodiment of the application, firstly, an object set to which an object belongs is determined according to a target object identifier, a set identifier of the object set is determined, and a target bitmap corresponding to the target identifier object is determined according to a corresponding relation between a prestored set identifier and bitmaps, wherein each set identifier pair corresponds to one bitmap.
It may be appreciated that, taking the commodity as an example, each commodity set corresponds to a bitmap, where the commodity sets may include commodities of the same type or commodities belonging to the same service platform, and are not limited herein specifically.
It should be noted that each data bit in the bitmap stores a certain state. Typically, it is used to determine whether certain data exists, for example: when determining whether a certain commodity is pushed, the state of the commodity can be determined by whether the commodity is pushed, wherein the commodity is pushed through and is indicated as 1, and the commodity is not pushed through and is indicated as 0.
Step S14, inquiring target parameter information on target data bits corresponding to N target hash values from the target bitmap information;
in this embodiment of the present application, according to the first hash value, the second hash value, and the third hash value, respectively, the first address, the second address, and the third address are addresses of data bits in the target bitmap, and after determining the target data bits, the target parameter information on the target data bits is read, where the target parameter information may be 0 or 1, where "1" indicates that the commodity is pushed, and "0" indicates that the commodity is not pushed.
Step S15, executing processing operation on the object to be pushed according to the target parameter information on the target data bit.
In the embodiment of the present application, when the target parameter information on the target data bit is 1, it is determined that the object to be pushed exists in the object set, and filtering operation is performed on the object to be pushed.
For example: as shown in fig. 2, after determining the target object identifier of the object to be pushed, hash calculation is performed on the target object identifier by using different hash functions to obtain a first hash value hash1, a second hash value hash2, and a third hash value hash3, where three values on the target data bits corresponding to the first hash value hash1, the second hash value hash2, and the third hash value hash3 in the target bitmap shown in fig. 2 are all 1, which indicates that the object to be pushed has been pushed.
In contrast, if the three target parameter information on the target data bit are all 0, it is determined that the object to be pushed does not exist in the object set, and the object to be pushed is pushed. Meanwhile, updating target parameter information on target data bits and acquiring a target receiver corresponding to an object to be pushed; and sending the object to be pushed to the target receiver.
According to the method, the hash value obtained by calculating the target object identifier is used for obtaining the parameters of the data bit display in the target bitmap, whether the object to be pushed is pushed or not can be rapidly determined according to the parameters, the method is simple in operation, the algorithm is configurable, and when the data volume of the object is huge, the processing efficiency is higher.
The method provided by the embodiment of the application further comprises the following steps: acquiring history pushing information of an object to be pushed, wherein the history pushing information comprises at least one of the following: push time, number of pushes, and/or push feedback data; when the historical push information meets the preset conditions, executing filtering operation on the object to be pushed; the historical push information meets preset conditions and comprises at least one of the following: the pushing time is smaller than the preset pushing time; the pushing times are larger than the preset pushing times; the data volume of the push feedback data is larger than the data volume of the preset push feedback data.
It may be appreciated that the push feedback data may be a commodity evaluation type, for example, the evaluation information of each pushed commodity is crawled by a web crawler, after the evaluation information is obtained, the evaluation type of the evaluation information of the commodity may be determined by analyzing the evaluation information through a semantic analysis model, and the evaluation type may be a first evaluation type, a second evaluation type, a third evaluation type, and so on. Wherein the first evaluation type may be a good evaluation, the second evaluation type may be a medium evaluation, and the third evaluation type may be a bad evaluation. And finally, counting the corresponding quantity of each evaluation type, and determining that the data quantity of the push feedback data is larger than the data quantity of preset push feedback data when the quantity of the first type is larger than a first preset threshold value and the quantity of the second evaluation type and the third evaluation type is smaller than or equal to a second preset threshold value.
Before filtering the object to be pushed, the method provided by the embodiment of the invention also analyzes the historical pushing information, so that the commodity pushing of the user is more accurate and targeted, and the same commodity information is prevented from being pushed too frequently.
The following embodiments are embodiments of a method for determining that an object to be pushed corresponds to an target recipient, and fig. 3 is a flowchart of an object processing method provided in the embodiments of the present application, where, as shown in fig. 3, the method may include the following steps:
step S31, determining a receiver set corresponding to the object to be pushed according to the target object identifier, wherein the receiver set comprises at least one receiver and receiver information corresponding to the receiver;
in the embodiment of the application, first, an object tag type corresponding to a target object identifier is determined, for example, a character string representing the object tag type by a user is carried in the target object identifier, and the object tag type is determined according to the character string. A set of recipients associated with the object tag type may then be determined. Wherein the association relation between the object tag type and the receiver set is preset.
As an example, the association procedure of the object tag type and the receiver set is as follows: a history access record of a receiver (user) is acquired, the history access record including: user information and commodity purchasing records, so as to obtain user information corresponding to commodity identifications of all commodities; and analyzing based on the user information corresponding to each commodity according to a specific algorithm to obtain an analysis result, wherein the analysis result is used for establishing a mapping relation between the commodity identification and the user information.
The history access record in the embodiment of the application includes: user information m1 of user a, user commodity purchase record is: commodity identification 1, commodity identification 2 and commodity identification 3; user information m2 of user B, user B commodity purchase record is: commodity identification 2 and commodity identification 3; user information m3 of user C, user C commodity purchase record is: a commodity identification 4 and a commodity identification 5; user information m4 of user D, user D commodity purchase record is: commodity identification 1.
The user information m corresponding to the commodity identifier 1 is: user information m1, user information m4, and user information m5; the user information m corresponding to the commodity identifier 2 is: user information m1 and user information m2; the user information m corresponding to the commodity identifier 3 is: user information 1 and user information m5; the user information m corresponding to the commodity identifier 4 is: user information m3; the user information m corresponding to the commodity 5 is: user information m3 and user information m5.
In this embodiment of the present application, the set of receivers may be a set of users, and the receiver information corresponding to the receivers may be user information, for example: the user information may be the sex of the user, the age of the user, the consumption level of the user, the income of the user, the academy of the user, the crowd to which the user belongs, and the like.
Step S32, determining attribute information of an object to be pushed;
in the embodiment of the present application, when the object to be pushed is a commodity, the attribute information of the object to be pushed may be a commodity name, a commodity type, a commodity price, a commodity discount, a commodity application range, and so on.
Step S33, inquiring the target receiver information matched with the attribute information from the receiver set; and taking the receiver corresponding to the target receiver information as the target receiver.
In the embodiment of the present application, determining whether the attribute information and the receiver information are matched may include at least one of the following: judging whether the commodity price meets the consumption level of the user, whether the application range of the commodity meets the crowd of the user and the like, and can pertinently push the commodity to the user and improve the accuracy of commodity pushing.
In an alternative embodiment, as shown in fig. 4, the method further includes a process of generating a bitmap, which specifically includes the following steps:
step S41, a history pushing set is obtained, wherein the history pushing set comprises at least one object set, and the object set is obtained by dividing the history pushing set based on at least one object type;
in this embodiment of the present application, before obtaining a target bitmap corresponding to a target object identifier, a history push set needs to be obtained, where the history push set includes at least one object set, and the object set is obtained by dividing the history push set based on at least one object type.
As an example, taking the history push collection of goods as an example, the object types contained therein may be business platform types, such as financial platforms, e-commerce platforms, live broadcast platforms, and so forth. But also commodity types such as: home goods, office goods, learning goods, and the like.
Step S42, obtaining an initial bitmap established according to the object set and an object identifier corresponding to a history pushing object in the object set;
and acquiring an initial bitmap established according to the object set and an object identifier corresponding to the object set. It can be understood that one object set corresponds to one initial bitmap, and the set identifier corresponding to the object set may be a code of a platform, for example, the set identifier of a financial platform is JR, the set identifier of an e-commerce platform is DZSW, and the set identifier of a live platform is ZB. And then determining the number of the history push objects in each object set and the object identification of the history push objects, and determining the size of the data bit of the initial bitmap according to the number of the objects. The history pushing object can be a history pushing commodity, and the object identifier is a commodity identifier.
As an example, the history push set is M, and for a data volume M (e.g., 5000 thousands of commodities), a value containing a bitmap with size=a×m is created, where a represents the weight system. For example, the weight coefficient a of the e-commerce platform is 0.2. The bitmap size=0.2×m corresponding to the e-commerce platform, and the data bit initialization value in the bitmap is all 0.
S43, carrying out hash calculation on the object identifier by adopting N different hash functions to obtain N hash values;
step S44, performing modulo calculation on the hash value to obtain a calculation result;
step S45, updating the parameter information displayed by the data bits in the initial bitmap according to the calculation result to obtain bitmap information.
In the embodiment of the application, hash calculation is performed on the object identifier by adopting N hash functions to obtain N hash values; performing modulo calculation according to the hash value to obtain a calculation result; and updating the parameter information displayed by the data bits in the initial bitmap according to the calculation result to obtain the bitmap.
For example, the commodity id= "123323235413451", the first hash value 621, the second hash value 500, and the nth hash value 712 are obtained by calculating the commodity ID through N hash functions set in advance. And updating the data bits corresponding to the N hash values to 1 in the bitmap. And obtaining bitmap information corresponding to the object set until hash calculation is completed on object identifiers of all the historical push objects in the object set.
Fig. 5 is a block diagram of an object processing apparatus according to an embodiment of the present application, where the apparatus may be implemented as part or all of an electronic device by software, hardware, or a combination of both. As shown in fig. 5, the apparatus includes:
the first obtaining module 51 is configured to obtain a push service request, where the push service request carries a target object identifier of an object to be pushed;
the calculating module 52 is configured to perform hash calculation on the target object identifier by using N hash functions to obtain N target hash values, where N is an integer greater than or equal to 1;
a second obtaining module 53, configured to obtain a target bitmap corresponding to the target object identifier;
the query module 54 is configured to query target data bits corresponding to the N target hash values from the target bitmap;
and the execution module 55 is used for executing processing operation on the object to be pushed according to the target parameter information displayed by the target data bit.
Further, the device provided in the embodiment of the application further includes: the bitmap processing module is used for acquiring a history pushing set, wherein the history pushing set comprises at least one object set, and the object set is obtained by dividing the history pushing set based on at least one object type; acquiring an initial bitmap established according to the object set and an object identifier corresponding to a history pushing object in the object set; carrying out hash calculation on the object identifier by adopting N hash functions to obtain N hash values; performing modulo calculation according to the hash value to obtain a calculation result; and updating the parameter information displayed by the data bits in the initial bitmap according to the calculation result to obtain the bitmap.
Further, the second obtaining module is specifically configured to determine a target object type of the object to be pushed according to the target object identifier; querying a target object set matched with the target object type from the history pushing set; and taking the bitmap corresponding to the target object set as a target bitmap.
Further, the execution module is specifically configured to execute a filtering operation on the object to be pushed when it is determined that the object to be pushed exists in the target object set according to the target parameter information.
Further, the device provided in the embodiment of the application further includes: the verification module is used for acquiring history pushing information of the object to be pushed, wherein the history pushing information comprises at least one of the following items: push time, number of pushes, and/or push feedback data; when the historical push information meets the preset conditions, executing filtering operation on the object to be pushed; the historical push information meets preset conditions and comprises at least one of the following: the pushing time is smaller than the preset pushing time; the pushing times are larger than the preset pushing times; the data volume of the push feedback data is larger than the data volume of the preset push feedback data.
Further, the execution module is specifically configured to update the target parameter information when it is determined that the object to be pushed does not exist in the target object set according to the target parameter information, and obtain a target receiver corresponding to the object to be pushed; and sending the object to be pushed to the target receiver.
Further, the execution module is specifically configured to determine a receiver set corresponding to the object to be pushed according to the target object identifier, where the receiver set includes at least one receiver and receiver information corresponding to the receiver; determining attribute information of an object to be pushed; querying target receiver information matched with the attribute information from the receiver set; and taking the receiver corresponding to the target receiver information as the target receiver.
The embodiment of the application further provides an electronic device, as shown in fig. 6, the electronic device may include: the device comprises a processor 1501, a communication interface 1502, a memory 1503 and a communication bus 1504, wherein the processor 1501, the communication interface 1502 and the memory 1503 are in communication with each other through the communication bus 1504.
A memory 1503 for storing a computer program;
the processor 1501, when executing the computer program stored in the memory 1503, implements the steps of the above embodiments.
The communication bus mentioned by the above terminal may be a peripheral component interconnect standard (Peripheral Component Interconnect, abbreviated as PCI) bus or an extended industry standard architecture (Extended Industry Standard Architecture, abbreviated as EISA) bus, etc. The communication bus may be classified as an address bus, a data bus, a control bus, or the like. For ease of illustration, the figures are shown with only one bold line, but not with only one bus or one type of bus.
The communication interface is used for communication between the terminal and other devices.
The memory may include random access memory (Random Access Memory, RAM) or non-volatile memory (non-volatile memory), such as at least one disk memory. Optionally, the memory may also be at least one memory device located remotely from the aforementioned processor.
The processor may be a general-purpose processor, including a central processing unit (Central Processing Unit, CPU for short), a network processor (Network Processor, NP for short), etc.; but also digital signal processors (Digital Signal Processing, DSP for short), application specific integrated circuits (Application Specific Integrated Circuit, ASIC for short), field-programmable gate arrays (Field-Programmable Gate Array, FPGA for short) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components.
In yet another embodiment provided herein, there is also provided a computer-readable storage medium having instructions stored therein, which when run on a computer, cause the computer to perform the object processing method of any of the above embodiments.
In yet another embodiment provided herein, there is also provided a computer program product containing instructions that, when run on a computer, cause the computer to perform the object processing method of any of the above embodiments.
In the above embodiments, it may be implemented in whole or in part 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, produces a flow or function in accordance with embodiments of the present application, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a computer network, or other programmable apparatus. The computer instructions may be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another computer-readable storage medium, for example, the computer instructions may be transmitted from one website, computer, server, or data center to another website, computer, server, or data center by a wired (e.g., coaxial cable, fiber optic, digital subscriber line), or wireless (e.g., infrared, wireless, microwave, etc.). The computer readable storage medium may be any available medium that can be accessed by a computer or a data storage device such as a server, data center, etc. that contains an integration of one or more available media. The usable medium may be a magnetic medium (e.g., floppy Disk, hard Disk, tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., solid State Disk), etc.
The foregoing description is only of the preferred embodiments of the present application and is not intended to limit the scope of the present application. Any modifications, equivalent substitutions, improvements, etc. that are within the spirit and principles of the present application are intended to be included within the scope of the present application.
The foregoing is merely a specific embodiment of the application to enable one skilled in the art to understand or practice the application. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the application. Thus, the present application is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims (8)
1. An object processing method, comprising:
acquiring a push service request, wherein the push service request carries a target object identifier of an object to be pushed;
carrying out hash calculation on the target object identifier by adopting N different hash functions to obtain N target hash values, wherein N is an integer greater than 1;
obtaining target bitmap information corresponding to the target object identifier, including: determining the target object type of the object to be pushed according to the target object identifier; querying a target object set matched with the target object type from a history pushing set; taking a bitmap corresponding to the target object set as the target bitmap information;
inquiring target parameter information on target data bits corresponding to the N target hash values from the target bitmap information;
and executing processing operation on the object to be pushed according to the target parameter information on the target data bit, wherein the processing operation comprises the following steps: and when the object to be pushed exists in the target object set according to the target parameter information, executing filtering operation on the object to be pushed.
2. The method according to claim 1, wherein the method further comprises:
acquiring a history pushing set, wherein the history pushing set comprises at least one object set, and the object set is obtained by dividing the history pushing set based on at least one object type;
acquiring an initial bitmap established according to the object set and an object identifier corresponding to a history pushing object in the object set;
carrying out hash calculation on the object identifier by adopting the N different hash functions to obtain N hash values;
a calculation result obtained by performing modulo calculation on the hash value;
and updating the parameter information displayed by the data bits in the initial bitmap according to the calculation result to obtain bitmap information.
3. The method of claim 1, wherein the performing a filtering operation on the object to be pushed comprises:
acquiring history pushing information of the object to be pushed, wherein the history pushing information comprises at least one of the following items: push time, number of pushes, and/or push feedback data;
when the history push information meets preset conditions, filtering the object to be pushed;
the history push information meets preset conditions and comprises at least one of the following:
the pushing time is smaller than a preset pushing time;
the pushing times are larger than preset pushing times;
the data volume of the push feedback data is larger than the data volume of the preset push feedback data.
4. The method of claim 1, wherein the performing a processing operation on the object to be pushed according to the target parameter information on the target data bit further comprises:
updating the target parameter information when the target object to be pushed does not exist in the target object set according to the target parameter information, and determining a target receiver corresponding to the target object to be pushed which is not pushed;
and sending the objects to be pushed which are not pushed to the target receiver.
5. The method of claim 4, wherein the determining the target recipient to which the object to be pushed corresponds comprises:
determining a receiver set corresponding to the object to be pushed according to the target object identifier, wherein the receiver set comprises at least one receiver and receiver information corresponding to the receiver;
determining attribute information of the object to be pushed;
inquiring from the receiver set to obtain target receiver information matched with the attribute information;
and taking the receiver corresponding to the target receiver information as the target receiver.
6. An object processing apparatus, comprising:
the first acquisition module is used for acquiring a push service request, wherein the push service request carries a target object identifier of an object to be pushed;
the calculation module is used for carrying out hash calculation on the target object identifier by adopting N hash functions to obtain N target hash values, wherein N is an integer greater than or equal to 1;
the second obtaining module is configured to obtain target bitmap information corresponding to the target object identifier, and includes: determining the target object type of the object to be pushed according to the target object identifier; querying a target object set matched with the target object type from a history pushing set; taking a bitmap corresponding to the target object set as the target bitmap information;
the query module is used for querying target parameter information on target data bits corresponding to the N target hash values from the target bitmap information;
the execution module is used for executing processing operation on the object to be pushed according to the target parameter information on the target data bit, and comprises the following steps: and when the object to be pushed exists in the target object set according to the target parameter information, executing filtering operation on the object to be pushed.
7. A storage medium comprising a stored program, wherein the program when run performs the method of any one of the preceding claims 1 to 5.
8. The electronic equipment is characterized by comprising a processor, a communication interface, a memory and a communication bus, wherein the processor, the communication interface and the memory are communicated with each other through the communication bus; wherein:
a memory for storing a computer program;
a processor for performing the method of any of claims 1-5 by running a program stored on a memory.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011197051.XA CN112330398B (en) | 2020-10-30 | 2020-10-30 | Object processing method and device, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011197051.XA CN112330398B (en) | 2020-10-30 | 2020-10-30 | Object processing method and device, electronic equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112330398A CN112330398A (en) | 2021-02-05 |
| CN112330398B true CN112330398B (en) | 2024-04-09 |
Family
ID=74323739
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011197051.XA Active CN112330398B (en) | 2020-10-30 | 2020-10-30 | Object processing method and device, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112330398B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112989147A (en) * | 2021-02-20 | 2021-06-18 | 每日互动股份有限公司 | Data information pushing method and device, computer equipment and storage medium |
| CN113282247B (en) * | 2021-06-24 | 2024-08-16 | 京东科技控股股份有限公司 | Data storage method, data reading device and electronic equipment |
| CN113342859B (en) * | 2021-06-29 | 2023-08-15 | 北京奇艺世纪科技有限公司 | Information processing method and device and electronic equipment |
| CN114253992A (en) * | 2021-12-17 | 2022-03-29 | 中国农业银行股份有限公司 | Data aggregation method, device, equipment and storage medium |
| CN116756494B (en) * | 2023-08-22 | 2024-01-23 | 之江实验室 | Data outlier processing method, apparatus, computer device, and readable storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102523112A (en) * | 2011-12-14 | 2012-06-27 | 华为技术有限公司 | Information processing method and equipment |
| CN107391277A (en) * | 2017-07-17 | 2017-11-24 | 北京京东尚科信息技术有限公司 | Information processing method and device |
| CN108874803A (en) * | 2017-05-09 | 2018-11-23 | 腾讯科技（深圳）有限公司 | Date storage method, device and storage medium |
| CN110113393A (en) * | 2019-04-18 | 2019-08-09 | 北京奇艺世纪科技有限公司 | A kind of information push method, device, electronic equipment and medium |
| CN110535966A (en) * | 2019-09-05 | 2019-12-03 | 腾讯科技（深圳）有限公司 | A kind of data processing method and relevant device |
| CN111198961A (en) * | 2018-11-16 | 2020-05-26 | 北京京东尚科信息技术有限公司 | Commodity searching method and device and server |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9280780B2 (en) * | 2014-01-27 | 2016-03-08 | Umbel Corporation | Systems and methods of generating and using a bitmap index |
| US9788264B2 (en) * | 2014-10-17 | 2017-10-10 | Qualcomm Incorporated | Bloom filter for service hint information in advertisements |
| US10713255B2 (en) * | 2016-06-24 | 2020-07-14 | Teradata Us, Inc. | Spool file for optimizing hash join operations in a relational database system |
-
2020
- 2020-10-30 CN CN202011197051.XA patent/CN112330398B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102523112A (en) * | 2011-12-14 | 2012-06-27 | 华为技术有限公司 | Information processing method and equipment |
| CN108874803A (en) * | 2017-05-09 | 2018-11-23 | 腾讯科技（深圳）有限公司 | Date storage method, device and storage medium |
| CN107391277A (en) * | 2017-07-17 | 2017-11-24 | 北京京东尚科信息技术有限公司 | Information processing method and device |
| CN111198961A (en) * | 2018-11-16 | 2020-05-26 | 北京京东尚科信息技术有限公司 | Commodity searching method and device and server |
| CN110113393A (en) * | 2019-04-18 | 2019-08-09 | 北京奇艺世纪科技有限公司 | A kind of information push method, device, electronic equipment and medium |
| CN110535966A (en) * | 2019-09-05 | 2019-12-03 | 腾讯科技（深圳）有限公司 | A kind of data processing method and relevant device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112330398A (en) | 2021-02-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112330398B (en) | Object processing method and device, electronic equipment and storage medium | |
| CN106126630B (en) | A kind of collection of business object, searching method and device | |
| CN107038173B (en) | Application query method and device and similar application detection method and device | |
| US8533198B2 (en) | Mapping descriptions | |
| CN110020086B (en) | User portrait query method and device | |
| CN109388548B (en) | Method and apparatus for generating information | |
| WO2019169978A1 (en) | Resource recommendation method and device | |
| CN112541787B (en) | Advertisement recommendation method, advertisement recommendation system, storage medium and electronic equipment | |
| CN111443899B (en) | Element processing method and device, electronic equipment and storage medium | |
| US20210097045A1 (en) | Object identifier index | |
| CN112015986B (en) | Data pushing method, device, electronic equipment and computer readable storage medium | |
| US11556595B2 (en) | Attribute diversity for frequent pattern analysis | |
| CN114328632A (en) | User data analysis method and device based on bitmap and computer equipment | |
| CN110827101B (en) | Shop recommending method and device | |
| CN112804541A (en) | User behavior tracking method and device, electronic equipment and storage medium | |
| CN109886300A (en) | A kind of user's clustering method, device and equipment | |
| CN113450172B (en) | Commodity recommendation method and device | |
| CN112347147A (en) | Information pushing method and device based on user association relationship and electronic equipment | |
| US8577814B1 (en) | System and method for genetic creation of a rule set for duplicate detection | |
| CN112765502B (en) | Malicious access detection method, device, electronic equipment and storage medium | |
| CN111767457B (en) | Recommendation method and device | |
| CN116561434A (en) | Data retrieval recommendation method, device, storage medium and equipment | |
| CN111582795A (en) | Method, device and readable storage medium for automatically detecting logistics merchants | |
| CN108596647B (en) | Advertisement putting method and device and electronic equipment | |
| CN114282119B (en) | Scientific and technological information resource retrieval method and system based on heterogeneous information network |
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 | ||
| CB02 | Change of applicant information |
Address after: Room 221, 2 / F, block C, 18 Kechuang 11th Street, Daxing District, Beijing, 100176 Applicant after: Jingdong Technology Holding Co.,Ltd. Address before: Room 221, 2 / F, block C, 18 Kechuang 11th Street, Daxing District, Beijing, 100176 Applicant before: Jingdong Digital Technology Holding Co.,Ltd. |
|
| CB02 | Change of applicant information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |