An Advertising Placement Information Attribution Method and System
By storing and matching click logs for ad serving in the Hbase table, and using batch processing and data cleaning strategies, matching delay and accuracy problems in existing systems are solved, achieving more efficient attribution of ad serving information.
Patent Information
- Application Number
- CN202110153363.9
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2021-02-04
- Publication Date
- 2025-06-17
- Estimated Expiration
- 2041-02-04
AI Technical Summary
Existing ad delivery systems have latency and accuracy problems when user click log matching, especially when multiple click logs are repeated and storage pressure is high.
By storing the click log and click log keys in the Hbase table and setting the validity period, using batch processing matching strategies and unified data cleaning and maintenance strategies, the precise matching of media information and advertiser information is achieved.
It improves the speed and accuracy of matching media information and advertiser information, reduces storage pressure, and improves matching efficiency.
Smart Images

Figure CN112817979B_ABST
Abstract
Description
Technical Field
[0001] This application relates to the technical field of advertising placement information processing, and in particular, to a method and system for attributing advertising placement information. Background Art
[0002] For application download ads, the media can only monitor behaviors such as ad display and user clicks, and cannot monitor user behaviors within the application; advertisers can monitor user behaviors within the application but cannot monitor user behaviors on the media side. The accuracy and efficiency of matching attribution directly affect the efficiency of advertising placement. Therefore, by matching user information at both ends, the source of users can be attributed, and the advertising placement strategy can be adjusted specifically to increase the number of users. The current main processing flow is as follows: When a user generates a click or other behavior on the media side, the media sends the collected behavior to the advertiser through a monitoring link. The advertiser matches and attributes the received information with the user behavior information it monitors, and sends the successfully matched information to the callback address of the media. Most existing systems use Redis (a memory-based Key-Value database) as a key component for matching. The advertiser extracts various identity information from the received click logs and stores them as keys in Redis. Then, it extracts various identity information from the received user behaviors within the application and sequentially searches in Redis to see if the key exists. If it exists, the match is successful; otherwise, the match fails. For better adaptation, when storing user information in Redis, there are multiple types of identity information for the same user, but their corresponding click information is the same. When the advertiser receives user behaviors within the application, it can query the corresponding click information of the user in the Redis table, as Figure 2 shown. If it is found, the match is successful, and the successfully matched information is called back to the media. The prior art has the following disadvantages: If the same user generates multiple clicks in the click log, since the user identity information is the same, Redis can only save the most recent click; in order to have more successful matches, there are multiple types of the same user identity information, but the corresponding click is the same. If a certain click has already been matched, the same click should not be matched repeatedly; when matching one by one, when there are too many logs to be matched, the matching of subsequent logs will be delayed.
[0003] Therefore, in view of the above situation, the present invention provides a method and system for attributing advertising placement information. The present invention realizes the accurate matching of media information and advertiser information through the storage structure of click logs and identity information, the batch processing matching strategy, and the unified data cleaning and maintenance strategy, improves the matching speed and accuracy of media information and advertiser information, reduces the storage pressure of the memory of media information and advertiser information, and improves the matching efficiency of media information and advertiser information. Summary of the Invention
[0004] An embodiment of the present application provides a method and system for attributing advertising placement information, so as to at least solve the problem of subjective factor influence in related technologies.
[0005] The present invention provides a method for attributing advertising placement information, including:
[0006] Storage step: Store click logs and click log keys corresponding to the click logs in an Hbase table, and set the validity period of the click logs and the click log keys.
[0007] Grouping step: Group the activation logs according to the batch keys of the activation logs and the timestamps of the activation logs, and then send the activation log grouping request to the Hbase coprocessor.
[0008] Matching step: The Hbase coprocessor obtains the click logs corresponding to the activation logs from the Hbase table according to the batch keys and the timestamps of the activation logs, and matches click logs for the activation logs from the click logs.
[0009] Cleaning step: Clean the click logs matched by the activation logs through the Hbase coprocessor.
[0010] For the above method for attributing advertising placement information, the storage step includes storing the click logs and the click log keys corresponding to the click logs in the Hbase table, and setting the validity period of the click logs and the click log keys.
[0011] For the above method for attributing advertising placement information, the grouping step includes obtaining a batch of the activation logs, generating the batch keys according to the user identity information carried by the activation logs and the corresponding validity period, grouping the activation logs according to the batch keys and the timestamps of the activation logs, and then sending the activation log grouping request to the Hbase coprocessor.
[0012] For the above method for attributing advertising placement information, the matching step includes that the Hbase coprocessor obtains the click logs corresponding to the activation logs from the Hbase table according to the batch keys and the timestamps of the activation logs in each group, matches click logs with timestamps less than or equal to the timestamps of the activation logs for the activation logs from the click logs, batch modifies the status of the click logs matched by the activation logs in each group, and makes a callback. For activation logs that do not match click logs, they are pushed to the downstream delayed waiting queue. After a certain delay, activation logs that still do not match click logs continue to match click logs.
[0013] The above-mentioned advertising placement information attribution method, the cleaning step includes cleaning the click logs matched by all activation logs through the Hbase coprocessor.
[0014] The present invention also provides an advertising placement information attribution system, which is applicable to the above-mentioned advertising placement information attribution method. The advertising placement information attribution system includes:
[0015] Storage unit: The click logs and the click log keys corresponding to the click logs are stored in the Hbase table, and the validity periods of the click logs and the click log keys are set.
[0016] Grouping unit: After grouping the activation logs according to the batch keys and the timestamps of the activation logs, send the activation log grouping request to the Hbase coprocessor.
[0017] Matching unit: The Hbase coprocessor obtains the click logs corresponding to the activation logs from the Hbase table according to the batch keys and the timestamps of the activation logs, and matches click logs for the activation logs from the click logs.
[0018] Cleaning unit: Clean the click logs matched by the activation logs through the Hbase coprocessor.
[0019] For the above-mentioned advertising placement information attribution system, the storage unit stores the click logs and the click log keys corresponding to the click logs in the Hbase table, and sets the validity periods of the click logs and the click log keys.
[0020] For the above-mentioned advertising placement information attribution system, the grouping unit obtains a batch of the activation logs, generates the batch keys according to the user identity information carried by the activation logs and the corresponding validity periods, and after grouping the activation logs according to the batch keys and the timestamps of the activation logs, sends the activation log grouping request to the Hbase coprocessor.
[0021] In the above advertisement delivery information attribution system, the Hbase coprocessor, according to the batch keys and the timestamps of the activation logs in each group, the matching unit obtains the corresponding click logs of the activation logs from the Hbase table, and matches the click logs with timestamps less than or equal to the timestamp of the activation logs from the click logs for the activation logs, and batch modifies the status of the click logs matched by the activation logs in each group and makes a callback. For the activation logs that do not match the click logs, they are pushed to the downstream delayed waiting queue. After a certain delay, the activation logs that still do not match the click logs continue to match the click logs.
[0022] In the above advertisement delivery information attribution system, the cleaning unit cleans the click logs matched by all activation logs through the Hbase coprocessor.
[0023] Compared with the related art, the present invention provides an advertisement delivery information attribution method and system. Through the storage structure of click logs and identity information, the batch processing matching strategy, and the unified data cleaning and maintenance strategy, the present invention realizes the accurate matching of media information and advertiser information, improves the matching speed and accuracy of media information and advertiser information, reduces the storage pressure of the memory of media information and advertiser information, and improves the matching efficiency of media information and advertiser information.
[0024] The details of one or more embodiments of the present application are set forth in the following drawings and description to make other features, objects, and advantages of the present application more concise and understandable. BRIEF DESCRIPTION OF THE DRAWINGS
[0025] The drawings described herein are used to provide a further understanding of the present application and form a part of the present application. The illustrative embodiments and descriptions thereof of the present application are used to explain the present application and do not constitute an improper limitation of the present application. In the drawings:
[0026] Figure 1 is a flowchart of an advertisement delivery information attribution method according to an embodiment of the present application;
[0027] Figure 2 is a framework diagram of the prior art according to an embodiment of the present application;
[0028] Figure 3 is a framework diagram according to an embodiment of the present application;
[0029] Figure 4 is a schematic structural diagram of the advertisement delivery information attribution system of the present invention;
[0030] Figure 5 is a framework diagram of an electronic device according to an embodiment of the present application.
[0031] Among them, the reference signs are as follows:
[0032] Storage unit: 51;
[0033] Grouping unit: 52;
[0034] Matching unit: 53;
[0035] Cleaning unit: 54;
[0036] Bus: 80;
[0037] Processor: 81;
[0038] Memory: 82;
[0039] Communication interface: 83. Detailed implementation manners
[0040] In order to make the objectives, technical solutions and advantages of this application clearer, the following describes and explains this application in combination with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain this application and are not used to limit this application. Based on the embodiments provided in this application, all other embodiments obtained by those of ordinary skill in the art without creative efforts belong to the scope of protection of this application.
[0041] Obviously, the accompanying drawings in the following description are only some examples or embodiments of this application. For those of ordinary skill in the art, without creative efforts, this application can also be applied to other similar scenarios based on these drawings. In addition, it can also be understood that although the efforts made in this development process may be complex and lengthy, for those of ordinary skill in the art related to the disclosed content of this application, some design, manufacturing or production changes based on the technical content disclosed in this application are only conventional technical means and should not be understood as the disclosed content of this application being insufficient.
[0042] Referring to "embodiments" in this application means that the specific features, structures or characteristics described in combination with the embodiments can be included in at least one embodiment of this application. The appearance of this phrase in various positions in the specification does not necessarily refer to the same embodiment, nor is it an independent or alternative embodiment mutually exclusive with other embodiments. Those of ordinary skill in the art explicitly and implicitly understand that the embodiments described in this application can be combined with other embodiments without conflict.
[0043] Unless otherwise defined, the technical terms or scientific terms involved in this application shall have the ordinary meanings understood by those with ordinary skills in the technical field to which this application belongs. The similar words such as "a", "an", "one kind", "the" involved in this application do not indicate a quantity limitation and can represent singular or plural. The terms "include", "comprise", "have" and any variations thereof involved in this application are intended to cover non-exclusive inclusion; for example, a process, method, system, product or device that includes a series of steps or modules (units) is not limited to the listed steps or units, but may further include steps or units not listed, or may further include other steps or units inherent to these processes, methods, products or devices. The similar words such as "connect", "be connected", "couple" involved in this application are not limited to physical or mechanical connections, but may include electrical connections, whether direct or indirect. The "multiple" involved in this application means two or more than two. "And / or" describes the association relationship of associated objects and indicates that three relationships can exist. For example, "A and / or B" can represent: A exists alone, A and B exist simultaneously, and B exists alone. The character " / " generally represents an "or" relationship between the associated objects before and after. The terms "first", "second", "third", etc. involved in this application are only used to distinguish similar objects and do not represent a specific order for the objects.
[0044] The present invention is based on batch attribution of advertising placement information, and a brief introduction is given below.
[0045] Advertisement means to make something widely known. It refers to informing the general public about a certain thing or object. In terms of its meaning, it can be divided into broad sense and narrow sense. Broad - sense advertisement refers to advertisements that are not for profit, such as government announcements, announcements and statements in aspects of political parties, religions, education, culture, municipal administration, social groups, etc. Narrow - sense advertisement refers to a marketing behavior, that is, commercial advertisement. It is a means for industrial and commercial enterprises to promote goods or provide services. They spread product or service information to consumers or users through advertising media in a paid way. Advertisements are different from general mass communication and publicity activities, mainly manifested in: advertisement is a communication tool that transmits the information of a certain commodity from the production or business institution (advertiser) of this commodity to a group of users and consumers; advertising requires payment; the communication activity carried out by advertisement is persuasive; advertisement is purposeful, planned and continuous; advertisement is beneficial not only to the advertiser but also to the target audience. It can enable users and consumers to obtain useful information. Advertising information mainly comes from product information, which indicates the main benefits provided by the product. We can form various advertising ideas through communication with consumers, dealers, experts and competitors. Among them, consumers are the main source of good ideas. Since advertising information can be obtained through various channels, creativity is the core of optimizing the information communication channels. Therefore, many creative personnel collect materials and get inspiration by talking with customers, middlemen, marketing experts or competitors. By talking with customers, find out the reasons why customers buy and use products and highlight them in the advertisement. Advertisement creators usually design multiple alternative messages, but only a few of them are finally selected. Advertising information includes commodity information, service information, concept information, etc. Commodity information mainly introduces the appearance, quality, performance, origin, use, price, purchase time and place of the product, etc. The main role of this kind of advertisement is to enable consumers to timely understand the information of a certain commodity. Service information includes information about various forms of buying and selling or semi - commodity - form buying and selling service activities. For example, business items in industries such as cultural and entertainment activities, tourism services, haircuts, baths, photography, catering, and information consultation services. Concept information is to advocate a certain awareness through advertising activities, so that consumers trust a certain enterprise in terms of attitude and prefer a certain brand emotionally, thus establishing a consumption concept that is beneficial to the advertiser.
[0046] Hbase is an open-source non-relational distributed database. It is modeled after Google's BigTable and implemented in the Java programming language. It is part of the Apache Software Foundation's Hadoop project and runs on top of the HDFS file system, providing services similar to BigTable in scale for Hadoop. Although it has seen significant performance improvements, it cannot directly replace SQL databases. It has been applied to multiple data-driven websites. HBase is located in the structured storage layer. Hadoop HDFS provides high-reliability underlying storage support for HBase, Hadoop MapReduce provides high-performance computing power for HBase, and Zookeeper provides stable services and a failover mechanism for HBase. In addition, Pig and Hive also provide high-level language support for HBase, making it very simple to perform data statistical processing on HBase. Sqoop provides a convenient RDBMS data import function for HBase, making it very easy to migrate traditional database data to HBase. Hbase has two main models, including the logical model from which the name of Hbase comes from Hadoop database, that is, the hadoop database, mainly considered from the user's perspective, that is, how to use Hbase; the Hbase physical model is mainly discussed from the perspective of implementing Hbase. HBase – Hadoop Database is a highly reliable, high-performance, column-oriented, scalable distributed storage system. Using HBase technology, a large-scale structured storage cluster can be built on inexpensive PC Servers. Different from commercial big data products such as Yonghong Z-DataMart, HBase is an open-source implementation of Google Bigtable. Similar to Google Bigtable using GFS as its file storage system, HBase uses Hadoop HDFS as its file storage system; Google runs MapReduce to process the massive data in Bigtable, and HBase also uses Hadoop MapReduce to process the massive data in HBase; Google Bigtable uses Chubby as a coordination service, and HBase uses Zookeeper as the counterpart.All data files in HBase are stored on the Hadoop HDFS file system, mainly including the two types of files mentioned above: HFile, the storage format of KeyValue data in HBase. HFile is a binary format file of Hadoop. In fact, StoreFile is a lightweight wrapper for HFile, that is, StoreFile is essentially HFile at the bottom layer; HLogFile, the storage format of WAL (WriteAheadLog) in HBase, which is physically a SequenceFile of Hadoop. First, the HFile file is of variable length, and only two parts of it are of fixed length: Trailer and FileInfo. As shown in the figure, there are pointers in the Trailer pointing to the starting points of other data blocks. DataBlock is the basic unit of HBase I / O. To improve efficiency, there is an LRU-based BlockCache mechanism in the HRegionServer. The size of each Data block can be specified through parameters when creating a Table. Larger blocks are beneficial for sequential Scan, and smaller blocks are beneficial for random queries. Each Data block is composed of KeyValue pairs concatenated one by one except for the Magic at the beginning. The content of Magic is some random numbers, aiming to prevent data corruption. The internal structure of each KeyValue pair will be introduced in detail later. Each KeyValue pair in HFile is a simple byte array. However, this byte array contains many items and has a fixed structure. Let's take a look at the specific structure inside: At the beginning, there are two fixed-length values, representing the length of the Key and the length of the Value respectively. Immediately following is the Key. At the beginning, there is a fixed-length value representing the length of the RowKey, then the RowKey, then a fixed-length value representing the length of the Family, then the Family, followed by the Qualifier, and then two fixed-length values representing the TimeStamp and KeyType (Put / Delete). The Value part does not have such a complex structure and is just pure binary data.
[0047] The present invention provides an advertising placement information attribution method and system. Through the storage structure of click logs and identity information, batch processing matching strategies, and unified data cleaning and maintenance strategies, the present invention realizes the accurate matching of media information and advertiser information, improves the matching speed and accuracy of media information and advertiser information, reduces the storage pressure on the memory of media information and advertiser information, and improves the matching efficiency of media information and advertiser information.
[0048] The following will take the advertising placement information attribution as an example to illustrate the embodiments of the present application.
[0049] Example 1
[0050] This embodiment provides a method for attributing advertising placement information. Please refer to Figures 1 - 3 , Figure 1 which is a flowchart of the method for attributing advertising placement information according to an embodiment of the present application; Figure 2 which is a framework diagram of the prior art according to an embodiment of the present application; Figure 3 which is a framework diagram according to an embodiment of the present application. As shown in the figure, the method for attributing advertising placement information includes the following steps:
[0051] Storage step S1: Store the click log and the click log key corresponding to the click log in the Hbase table, and set the validity period of the click log and the click log key;
[0052] Grouping step S2: Group the activation logs according to the batch key of the activation logs and the time stamp of the activation logs, and then send the activation log grouping request to the Hbase coprocessor;
[0053] Matching step S3: The Hbase coprocessor obtains the click log corresponding to the activation log from the Hbase table according to the batch key and the time stamp of the activation log, and matches the click log for the activation log from the click logs;
[0054] Cleaning step S4: Clean the click logs matched by the activation logs through the Hbase coprocessor.
[0055] In the embodiment, the storage step S1 includes storing the click log and the click log key corresponding to the click log in the Hbase table, and setting the validity period of the click log and the click log key.
[0056] In specific implementation, the component used to store the click log and the key in the storage step S1 is Hbase. Hbase is a distributed, column-oriented database with millisecond-level query for massive data.
[0057] In the embodiment, the grouping step S2 includes obtaining a batch of the activation logs, generating the batch key according to the user identity information carried by the activation logs and the corresponding validity period, and grouping the activation logs according to the batch key and the time stamp of the activation logs, and then sending the activation log grouping request to the Hbase coprocessor.
[0058] In the embodiment, the matching step S3 includes that the Hbase coprocessor obtains the click logs corresponding to the activation logs from the Hbase table according to the batch keys and the timestamps of the activation logs in each group, matches the click logs with timestamps less than or equal to the timestamp of the activation logs for the activation logs from the click logs, modifies the status of the click logs matched by the activation logs in each group in batch, and performs a callback. The activation logs that do not match the click logs are pushed to the downstream delay waiting queue. After a certain delay, the activation logs that do not match the click logs continue to match the click logs.
[0059] In the specific implementation, by putting the logs with the same user information into the same group for processing, the Hbase coprocessor generates different keys for the data stored in the Hbase table according to the user identity information and the validity period of the activation logs in each group, starting from the latest moment to the earliest moment. Therefore, the click logs corresponding to the batch keys are obtained from the Hbase table, and the click logs with timestamps less than or equal to the timestamp of the activation logs are matched for the activation logs (matching means matching the same user identity information, and the same information is considered to be the same person). The status of the click logs matched by the activation logs in each group is modified in batch, and a callback is performed. The activation logs that do not match the click logs are pushed to the downstream delay waiting queue. After a certain delay, the activation logs that do not match the click logs continue to match the click logs. The grouping step S2 is repeated, and the matching step S3 continues to match until all the activation logs are successfully matched.
[0060] In the embodiment, the cleaning step S4 includes that the Hbase coprocessor cleans the click logs matched by all the activation logs.
[0061] In the specific implementation, Hbase can set the time-to-live (TTL) for the stored data. For the data that expires every day, through the coprocessor of Hbase (this is a program, developed by programmers to write code and then embedded in Hbase to trigger), the built-in code cleans up the click logs that should be deleted.
[0062] Therefore, the present invention provides an advertising placement information attribution method and system. Through the storage structure of click logs and identity information, the batch processing matching strategy, and the unified data cleaning and maintenance strategy, the present invention realizes the accurate matching of media information and advertiser information, improves the matching speed and accuracy of media information and advertiser information, reduces the storage pressure of the media information and advertiser information memory, and improves the matching efficiency of media information and advertiser information.
[0063] Embodiment 2
[0064] Please refer to Figure 4 , Figure 4 , which is a schematic structural diagram of the advertising placement information attribution system of the present invention. As Figure 4 shown, the advertising placement information attribution system of the invention is applicable to the above-mentioned advertising placement information attribution method. The advertising placement information attribution system includes:
[0065] Storage unit 51: Store the click log and the click log key corresponding to the click log in the Hbase table, and set the validity period of the click log and the click log key;
[0066] Grouping unit 52: Group the activation logs according to the batch key of the activation logs and the time stamp of the activation logs, and then send the activation log grouping request to the Hbase coprocessor;
[0067] Matching unit 53: The Hbase coprocessor obtains the click log corresponding to the activation log from the Hbase table according to the batch key and the time stamp of the activation log, and matches the click log for the activation log from the click log;
[0068] Cleaning unit 54: Clean the click logs matched by the activation logs through the Hbase coprocessor.
[0069] In this embodiment, the storage unit 51 stores the click log and the click log key corresponding to the click log in the Hbase table, and sets the validity period of the click log and the click log key.
[0070] In this embodiment, the grouping unit 52 obtains a batch of the activation logs, generates the batch key according to the user identity information carried by the activation logs and the corresponding validity period, and groups the activation logs according to the batch key and the time stamp of the activation logs, and then sends the activation log grouping request to the Hbase coprocessor.
[0071] In this embodiment, the Hbase coprocessor, according to the batch key and the time stamp of the activation logs in each group, the matching unit 53 obtains the click log corresponding to the activation log from the Hbase table, and matches the click log with a time stamp less than or equal to the time stamp of the activation log for the activation log from the click log, and batch modifies the status of the click logs matched by the activation logs in each group and performs a callback. For the activation logs that do not match the click logs, they are pushed to the downstream delayed waiting queue. After a certain delay, the activation logs that still do not match the click logs continue to match the click logs.
[0072] In this embodiment, the cleaning unit 54 cleans the click logs that match all the activation logs through the Hbase coprocessor.
[0073] Embodiment III
[0074] As shown in FIG. 5, this embodiment discloses a specific implementation manner of an electronic device. The electronic device may include a processor 81 and a memory 82 storing computer program instructions.
[0075] Specifically, the above-mentioned processor 81 may include a central processing unit (CPU), or an application specific integrated circuit (ASIC), or may be configured as one or more integrated circuits for implementing the embodiments of the present application.
[0076] Among them, the memory 82 may include a mass storage for data or instructions. By way of example and not limitation, the memory 82 may include a hard disk drive (HDD), a floppy disk drive, a solid state drive (SSD), a flash memory, an optical disc, a magneto-optical disc, a magnetic tape, or a universal serial bus (USB) drive, or a combination of two or more of these. In a suitable case, the memory 82 may include removable or non-removable (or fixed) media. In a suitable case, the memory 82 may be inside or outside the data processing device. In a particular embodiment, the memory 82 is a non-volatile memory. In a particular embodiment, the memory 82 includes a read-only memory (ROM) and a random access memory (RAM). In a suitable case, the ROM may be a mask-programmed ROM, a programmable ROM (PROM), an erasable PROM (EPROM), an electrically erasable PROM (EEPROM), an electrically alterable ROM (EAROM), or a flash memory, or a combination of two or more of these. In a suitable case, the RAM may be a static random access memory (SRAM) or a dynamic random access memory (DRAM), where the DRAM may be a fast page mode dynamic random access memory (FPMDRAM), an extended data output dynamic random access memory (EDODRAM), a synchronous dynamic random access memory (SDRAM), etc.
[0077] The memory 82 can be used to store or cache various data files required for processing and / or communication, as well as possible computer program instructions executed by the processor 81.
[0078] The processor 81 reads and executes the computer program instructions stored in the memory 82 to implement any of the advertisement placement information attribution methods in the above embodiments.
[0079] In some of these embodiments, the electronic device may further include a communication interface 83 and a bus 80. Among them, as Figure 5 shown, the processor 81, the memory 82, and the communication interface 83 are connected through the bus 80 to complete communication with each other.
[0080] The communication interface 83 is used to implement communication between the various modules, devices, units, and / or devices in the embodiments of the present application. The communication port 83 can also implement data communication with other components such as external devices, image / advertisement placement information attribution devices, databases, external storage, and image / data processing workstations.
[0081] Bus 80 includes hardware, software, or both, and couples components of an electronic device to each other. Bus 80 includes, but is not limited to, at least one of the following: Data Bus, Address Bus, Control Bus, Expansion Bus, Local Bus. By way of example and not limitation, Bus 80 may include an Accelerated Graphics Port (AGP) or other graphics bus, an Extended Industry Standard Architecture (EISA) bus, a Front Side Bus (FSB), a Hyper Transport (HT) interconnect, an Industry Standard Architecture (ISA) bus, an InfiniBand interconnect, a Low Pin Count (LPC) bus, a memory bus, a Micro Channel Architecture (MCA) bus, a Peripheral Component Interconnect (PCI) bus, a PCI-Express (PCI-X) bus, a Serial Advanced Technology Attachment (SATA) bus, a Video Electronics Standards Association Local Bus (VLB) bus, or other suitable bus or a combination of two or more of these. Where appropriate, Bus 80 may include one or more buses. Although the embodiments of the present application describe and illustrate specific buses, the present application contemplates any suitable bus or interconnect.
[0082] The electronic device may be connected to an advertising delivery information attribution system to implement the method described in Figures 1 - 3 combination.
[0083] The technical features of the above-described embodiments may be combined arbitrarily. For the sake of brevity of description, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, it should be considered as the scope described in this specification.
[0084] The above-described embodiments merely represent several implementation manners of the present application. The description thereof is relatively specific and detailed, but it should not be construed as a limitation on the scope of the invention patent. It should be noted that for those of ordinary skill in the art, without departing from the concept of the present application, several modifications and improvements can still be made, and these all fall within the protection scope of the present application. Therefore, the protection scope of the patent of the present application shall be subject to the appended claims.
Claims
1. An advertising placement information attribution method, characterized in that, Including: Storage step: storing click logs and corresponding click log keys in the Hbase table, and setting the validity periods of the click logs and the click log keys; Grouping step: grouping the activation logs according to the batch keys of the activation logs and the timestamps of the activation logs, and then sending the activation log grouping request to the Hbase coprocessor; Matching step: the Hbase coprocessor obtains the click logs corresponding to the activation logs from the Hbase table according to the batch keys and the timestamps of the activation logs, and matches click logs for the activation logs from the click logs; Cleaning step: cleaning the click logs matched by the activation logs through the Hbase coprocessor; Among them, the grouping step includes obtaining a batch of the activation logs, generating the batch keys according to the user identity information carried by the activation logs and the corresponding validity periods, and grouping the activation logs according to the batch keys and the timestamps of the activation logs, and then sending the activation log grouping request to the Hbase coprocessor; The matching step includes that the Hbase coprocessor obtains the click logs corresponding to the activation logs from the Hbase table according to the batch keys and the timestamps of the activation logs in each group, and matches click logs with timestamps less than or equal to the timestamps of the activation logs for the activation logs from the click logs, and batch modifies the status of the click logs matched by the activation logs in each group and performs a callback. For the activation logs that do not match click logs, they are pushed to the downstream delayed waiting queue. After a certain delay, the activation logs that still do not match click logs continue to match click logs.
2. The advertising placement information attribution method according to claim 1, characterized in that, The storage step includes storing the click logs and the corresponding click log keys in the Hbase table, and setting the validity periods of the click logs and the click log keys.
3. The advertising placement information attribution method according to claim 1, characterized in that, The cleaning step includes cleaning all the click logs matched by the activation logs through the Hbase coprocessor.
4. An advertising placement information attribution system, characterized in that, Applicable to the advertising placement information attribution method described in any one of the above claims 1-3, the advertising placement information attribution system includes: Storage unit: storing click logs and corresponding click log keys in the Hbase table, and setting the validity periods of the click logs and the click log keys; Grouping unit: grouping the activation logs according to the batch keys of the activation logs and the timestamps of the activation logs, and then sending the activation log grouping request to the Hbase coprocessor; Matching unit: the Hbase coprocessor obtains the click logs corresponding to the activation logs from the Hbase table according to the batch keys and the timestamps of the activation logs, and matches click logs for the activation logs from the click logs; Cleaning unit: cleaning the click logs matched by the activation logs through the Hbase coprocessor; Among them, the grouping unit obtains a batch of the activation logs, generates the batch key according to the user identity information carried in the activation logs and the corresponding validity period, and groups the activation logs according to the batch key and the timestamps of the activation logs, and then sends the activation log grouping request to the Hbase coprocessor; The matching unit includes: the Hbase coprocessor, according to the batch key and the timestamps of the activation logs in each group, the matching unit obtains the click logs corresponding to the activation logs from the Hbase table, and matches the click logs with timestamps less than or equal to the timestamps of the activation logs from the click logs for the activation logs, and batch modifies the status of the click logs matched by the activation logs in each group and performs a callback. The activation logs that do not match the click logs are pushed to the downstream delay waiting queue. After a certain delay, the activation logs that do not match the click logs continue to match the click logs.
5. The advertising placement information attribution system according to claim 4, characterized in that, The storage unit stores the click logs and the click log keys corresponding to the click logs in the Hbase table, and sets the validity periods of the click logs and the click log keys.
6. The advertising placement information attribution system according to claim 5, characterized in that, The cleaning unit cleans the click logs matched by all activation logs through the Hbase coprocessor.
Citation Information
Patent Citations
Method and device for locating faults in wireless local area network
CN109347688A
Device, method, and program for managing advertisement distribution
JP2007286803A