JP2023171288A - Advertisement method for securing carry-over factor, device, and computer program - Google Patents

Abstract

To provide an advertisement method for securing a carry-over factor (Reach), a device, and a computer program.SOLUTION: An advertisement method according to an embodiment includes the steps of: storing and maintaining a mapping table to which a user partition indicating a user is mapped to an advertisement partition indicating a time when an advertisement is displayed; confirming at least one advertisement partition registered to at least one advertisement campaign; extracting at least one user partition mapped to the confirmed at least one advertisement partition from the mapping table; and serving an advertisement corresponding to the at least one advertisement campaign to the at least one user partition extracted.SELECTED DRAWING: Figure 4

Description

The following description relates to an advertisement serving technique that guarantees reach.

Internet advertising is rapidly emerging as one of the top five media following TV, radio, newspapers, and magazines. Banner advertisements, which account for a high proportion of Internet advertisements, are served by displaying a banner format containing advertising content and links within a website, and are served to users (hereinafter "users" refer to advertising consumers). It is a special type of Internet advertising that has the advantage of being interactive and active, inducing clicks and interaction (on the Internet). A technique related to such Internet advertising is disclosed in Patent Document 1.

However, with such conventional Internet advertising, it is possible to guarantee the number of impressions using the CPM (Cost Per Mile) method, and the display time and display period using the CPT (Cost Per Time) method. However, since advertisements cannot be served or displayed to users without duplication, there is a problem in guaranteeing reach.

Korean Published Patent No. 10-2007-0105652

One embodiment of the present invention utilizes a mapping table in which ad partitions and user partitions are mapped such that ads are served or displayed to different users without serving or displaying ads to overlapping users. The present invention provides an advertising method, device, and computer program that guarantees reachability.

One embodiment of the present invention then provides an advertising method, apparatus, and computer program that updates a mapping table while taking into account the serving schedule of an advertising campaign.

An embodiment of the present invention also provides an advertising method, apparatus, and computer program product that evenly serves advertisements based on the target frequency and advertisement serving period of the advertising campaign.

According to one embodiment of the present invention, an advertising method executed by a computing device including at least one processor stores a mapping table in which user partitions indicating users are mapped to advertising partitions indicating times at which advertisements are displayed. and maintaining, identifying at least one advertising partition registered in at least one advertising campaign, extracting from the mapping table at least one user partition mapped to the identified at least one advertising partition. and serving the extracted at least one user partition with an advertisement corresponding to the at least one advertising campaign.

According to one aspect, the storing and maintaining step may further include, after shuffling the user partitions, mapping the shuffled user partitions to the advertising partitions and updating the mapping table. .

According to another aspect, the updating step is performed at a time point at which serving of advertisements of the at least one other advertising campaign begins after serving of advertisements of the at least one advertising campaign ends. It may be characterized in that it is a stage of updating the mapping table.

According to still another aspect, the updating step is performed after the serving of advertisements of the at least one advertising campaign is completed and at the point in time when serving of advertisements of the at least one other advertising campaign begins. Updating and maintaining the mapping table in advance before the time when serving of advertisements of the at least one other advertising campaign is started so that the updated mapping table can be used. It is good to have this feature.

According to still another aspect, the pre-updating and maintaining step includes updating the updated mapping table used for serving advertisements of the at least one other advertising campaign to The mapping table may be stored and maintained separately from the mapping table used for serving.

According to yet another aspect, the updating step may include shuffling the user partitions based on a hash value for each user's identifier and a date.

According to yet another aspect, the serving step evenly distributes advertisements applicable to the at least one advertising campaign based on a target frequency of the at least one advertising campaign and an advertising serving period of the at least one advertising campaign. It may be characterized by being in the serving stage.

According to another aspect, the evenly serving step includes displaying an advertisement corresponding to the at least one advertising campaign once during a unit advertising serving period in which the advertising serving period is divided by the target frequency. The method may be characterized in that the step of serving the advertisement at

According to another aspect, the evenly serving step includes the step of serving the advertisement by adjusting the allowable frequency such that the allowable frequency of the ad converges to the target frequency as the ad serving period elapses. A certain thing can be characterized as a characteristic.

According to still another aspect, the serving step includes serving the advertisement to at least some users included in the extracted at least one user partition based on the targeting of the advertisement corresponding to the at least one advertising campaign. It may be characterized by being in the serving stage.

According to another aspect, the user partition may be generated in one-to-one correspondence with the advertisement partition.

According to another aspect, the user partition may be generated based on a hash value for an identifier of each of the users.

According to another aspect, the identifiers of the respective users include at least one of a hardware identifier, a software identifier, and a temporary identifier temporarily assigned to the respective users' terminals. This may be a feature.

According to an embodiment of the present invention, there is provided a computer-readable recording medium storing a computer program for causing a computer device to execute an advertising method, wherein the advertising method indicates a time during which an advertisement is displayed. storing and maintaining a mapping table in which user partitions representing users are mapped to advertising partitions; identifying at least one advertising partition registered in at least one advertising campaign; The method may include extracting at least one user partition mapped to at least one advertising partition, and serving the extracted at least one user partition with an advertisement corresponding to the at least one advertising campaign.

According to an embodiment of the invention, a computer device for performing an advertising method includes at least one processor configured to execute computer-readable instructions, said at least one processor being configured to perform an advertising method on which an advertisement is displayed. a storage and maintenance unit that stores and maintains a mapping table in which user partitions that indicate users are mapped to advertising partitions that indicate time; a confirmation unit that confirms at least one advertising partition registered in at least one advertising campaign; the mapping; an extraction unit that extracts at least one user partition mapped to the confirmed at least one advertising partition from a table; and an extraction unit that extracts an advertisement corresponding to the at least one advertising campaign to the extracted at least one user partition; It may include a serving portion for serving.

According to one aspect, the at least one processor may update the mapping table by shuffling the user partitions and mapping the shuffled user partitions to the advertisement partitions.

According to another aspect, the at least one processor is configured to start serving the advertisements of the at least one other advertising campaign after the serving of advertisements of the at least one advertising campaign ends. The method may be characterized by updating the mapping table.

According to yet another aspect, the at least one processor determines when, after the serving of advertisements of the at least one advertising campaign ends, the serving of advertisements of the other at least one advertising campaign begins. The mapping table is updated and maintained in advance before the serving of advertisements of the at least one other advertising campaign is started so that the updated mapping table can be used in the advertising campaign. may be used as

According to still other aspects, the at least one processor uses the updated mapping table used for serving advertisements of the at least one other advertising campaign for serving advertisements of the at least one other advertising campaign. The mapping table may be stored and maintained separately from the mapping table.

According to still other aspects, the at least one processor distributes advertisements applicable to the at least one advertising campaign based on a target frequency of the at least one advertising campaign and an advertising serving period of the at least one advertising campaign. Good for serving.

One embodiment of the present invention utilizes a mapping table in which ad partitions and user partitions are mapped such that ads are served or displayed to different users without serving or displaying ads to overlapping users. It is possible to provide an advertising method, apparatus, and computer program that guarantees the reach rate.

At this time, an embodiment of the present invention can provide an advertising method, apparatus, and computer program that updates a mapping table while taking into account the serving schedule of an advertising campaign.

An embodiment of the present invention may also provide an advertising method, apparatus, and computer program product that evenly serves advertisements based on the target frequency and advertisement serving period of the advertising campaign.

1 is a diagram illustrating an example of a network environment in an embodiment of the present invention. FIG. 1 is a block diagram illustrating an example of a computer device in an embodiment of the present invention. FIG. 3 is a block diagram illustrating an example of components that may be included in the processor illustrated in FIG. 2. FIG. 3 is a flowchart illustrating an example of an advertising method that can be executed by the computer device illustrated in FIG. 2; 5 is a diagram for explaining a mapping table used in the advertising method shown in FIG. 4. FIG. 5 is a diagram for explaining an example in which a mapping table used in the advertising method shown in FIG. 4 is updated; FIG. 5 is a diagram for explaining another example in which a mapping table used in the advertising method shown in FIG. 4 is updated; FIG. FIG. 5 is a diagram illustrating an example of uniformly serving advertisements using the advertisement method shown in FIG. 4; 5 is a diagram illustrating another example of uniformly serving advertisements using the advertisement method shown in FIG. 4; FIG.

Embodiments of the present invention will be described in detail below with reference to the accompanying drawings.

Embodiments of the present invention are techniques related to advertising methods, devices, and computer programs that guarantee delivery rates.

Embodiments, including what is specifically disclosed herein, provide a way to partition advertising partitions and user partitions such that advertisements are served or displayed to different users without serving or displaying advertisements to overlapping users. An advertisement system that serves advertisements using a mapping table in which are mapped will be described. Thereby, embodiments of the present invention can derive technical effects that guarantee the arrival rate.

An advertising system according to an embodiment of the present invention may be realized by at least one computer device that implements a server or electronic device described below. The computer program according to the embodiment of the present invention may be installed and executed on the computer device, and the computer device may execute the advertising method according to the embodiment of the present invention under the control of the executed computer program. . The above-mentioned computer program may be recorded on a computer-readable recording medium to be coupled to a computer device and cause the computer device to execute an advertising method. The computer program described here may be in the form of an independent program package, or may be in the form of an independent program package that is preinstalled on a computer device and linked with the operating system and other program packages. It may be.

FIG. 1 is a diagram showing an example of a network environment in an embodiment of the present invention. The network environment of FIG. 1 shows an example including multiple electronic devices 110, 120, 130, 140, multiple servers 150, 160, and a network 170.

Such FIG. 1 is only an example for explaining the invention, and the number of electronic devices and the number of servers are not limited as shown in FIG. 1. Furthermore, the network environment in FIG. 1 is merely an example of an environment applicable to this embodiment, and the environment applicable to this embodiment is not limited to the network environment in FIG. 1. .

The plurality of electronic devices 110, 120, 130, and 140 may be fixed terminals or mobile terminals realized by computer devices. Examples of the plurality of electronic devices 110, 120, 130, and 140 include a smartphone, a mobile phone, a navigation system, a PC (Personal Computer), a notebook PC, a digital broadcasting terminal, a PDA (Personal Digital Assistant), and a PMP (Portable Multimedia Platform). ayer ), tablets, etc. As an example, although FIG. 1 shows a smartphone as an example of the electronic device 110, in the embodiment of the present invention, the electronic device 110 may utilize a substantially wireless or wired communication method to communicate with others via the network 170. electronic devices 120, 130, 140 and/or servers 150, 160.

The communication method is not limited, and is not limited to communication methods that utilize communication networks that can be included in the network 170 (for example, mobile communication networks, wired Internet, wireless Internet, and broadcasting networks), as well as communication methods that utilize short distances between devices. Wireless communications may also be included. For example, the network 170 may be a PAN (Personal Area Network), a LAN (Local Area Network), a CAN (Campus Area Network), a MAN (Metropolitan Area Network), or a WAN (Width Network). e Area Network), BBN (Broadband Network), the Internet, etc. may include any one or more of the networks. Additionally, network 170 may include any one or more of network topologies including, but not limited to, a bus network, a star network, a ring network, a mesh network, a star-bus network, a tree or a hierarchical network, and the like. It will not be done.

Each server 150, 160 is implemented by one or more computing devices that communicate with a plurality of electronic devices 110, 120, 130, 140 via a network 170 to provide instructions, code, files, content, services, etc. good. For example, the server 150 may be a system that provides services (for example, services that do not use the advertising method described below) to a plurality of electronic devices 110, 120, 130, and 140 connected via the network 170.

FIG. 2 is a block diagram illustrating an example of a computer device in an embodiment of the present invention. Each of the plurality of electronic devices 110, 120, 130, and 140 and each of the servers 150 and 160 described above may be realized by the computer device 200 shown in FIG. 2.

Such a computing device 200 may include a memory 210, a processor 220, a communication interface 230, and an input/output interface 240, as shown in FIG. Memory 210 is a computer-readable storage medium and may include permanent mass storage devices such as random access memory (RAM), read only memory (ROM), and disk drives. Here, a permanent large capacity storage device such as a ROM or a disk drive may be included in the computer device 200 as a separate permanent storage device separate from the memory 210. Additionally, an operating system and at least one program code may be recorded in the memory 210. Such software components may be loaded into memory 210 from a computer-readable storage medium separate from memory 210. Such other computer readable storage media may include computer readable storage media such as floppy drives, disks, tapes, DVD/CD-ROM drives, memory cards, and the like. In other embodiments, software components may be loaded into memory 210 through communication interface 230 that is not a computer-readable storage medium. For example, software components may be loaded into memory 210 of computing device 200 based on a computer program installed by a file received over network 170.

Processor 220 may be configured to process instructions of a computer program by performing basic arithmetic, logic, and input/output operations. Instructions may be provided to processor 220 by memory 210 or communication interface 230. For example, processor 220 may be configured to execute instructions received according to program code recorded on a storage device, such as memory 210.

The communication interface 230 may provide functionality for the computing device 200 to communicate with other devices (eg, the recording device described above) via the network 170. As an example, requests, instructions, data, files, etc. generated by the processor 220 of the computer device 200 according to a program code recorded in a storage device such as the memory 210 may be transmitted to others via the network 170 under the control of the communication interface 230. may be transmitted to the device. Conversely, signals, instructions, data, files, etc. from other devices may be received by the computing device 200 via the network 170 and through the communication interface 230 of the computing device 200 . Signals, instructions, data, etc. received through communication interface 230 may be communicated to processor 220 and memory 210, files, etc. may be transferred to a storage medium (such as a persistent storage device as described above) that computing device 200 may further include. May be recorded.

Input/output interface 240 may be a means for interfacing with input/output device 250. For example, input devices may include devices such as a microphone, keyboard, or mouse, and output devices may include devices such as a display and speakers. As another example, input/output interface 240 may be a means for interfacing with a device that has integrated input and output functionality, such as a touch screen. Input/output device 250 may be configured as one device with computer device 200.

Also, in other embodiments, computing device 200 may include fewer or more components than those of FIG. However, most prior art components need not be clearly illustrated. For example, computing device 200 may be implemented to include at least some of the input/output devices 250 described above, and may further include other components such as transceivers, databases, and the like.

In the following, we will use a mapping table in which ad partitions and user partitions are mapped so that ads are served or shown to different users without serving or showing ads to duplicate users. Specific embodiments of advertising methods, devices, and computer programs that provide assurance will be described.

FIG. 3 is a block diagram illustrating an example of components that may be included in the processor illustrated in FIG. 2, and FIG. FIG. 5 is a diagram for explaining a mapping table used in the advertising method shown in FIG. 4.

In an embodiment of the present invention, the computer device 200 targets an advertiser as a client, and provides service requests generated by connection to a dedicated application or web/mobile site installed on a server or electronic device owned by the client. may provide an advertising service that serves advertisements based on the mapping table. The computer device 200 may be configured with a computer-implemented advertising system. For example, the advertising system may be realized in the form of a program that operates independently, or may be realized in the form of a dedicated application in-app (in-app) so that it can operate on the dedicated application. It's okay.

The processor 220 of the computing device 200 may be realized by components for executing the advertising method according to FIG. 4 . As an example, processor 220 includes a storage and maintenance unit 310, a verification unit 320, an extraction unit 330, and a serving unit 340, as shown in FIG. 3, to perform steps 410-440 shown in FIG. good. Depending on the embodiment, components of processor 220 may be selectively included or excluded from processor 220. Also, depending on the embodiment, components of processor 220 may be separated or combined to express the functionality of processor 220.

Such processor 220 and components of processor 220 may control computing device 200 to perform steps 410-440 included in the advertising method of FIG. For example, processor 220 and components of processor 220 may be implemented to execute instructions in accordance with operating system code and at least one program code contained in memory 210.

Here, the components of processor 220 may be representations of different functions that are performed by processor 220 according to instructions provided by program code recorded on computer device 200. For example, serving unit 340 may be utilized as a functional representation of processor 220 that controls computing device 200 to serve advertisements applicable to at least one advertising campaign.

Processor 220 may read the necessary instructions from memory 210 loaded with instructions related to controlling computing device 200 . In this case, the read instructions may include instructions for controlling the processor 220 to perform steps 410-440 described below.

The steps 410-440 described below may be performed in a different order than shown in FIG. 4, and some of the steps 410-440 may be omitted or additional steps may be included. It's okay.

In step 410, the processor 220 (more precisely, the storage and maintenance unit 310 included in the processor 220) stores a mapping table in which user partitions are mapped to AD partitions. and may be maintained.

Here, the advertisement partition is an index indicating the time during which an advertisement is displayed, and may mean an index of the time during which an advertisement is displayed. As an example, an advertisement partition may refer to a unit time division of the entire time during which an advertisement is displayed and served. In the following, for convenience of explanation, the advertisement partition will be explained as being composed of partitions 1 to 10, but it may actually be composed of partitions 0 to 99. However, the number of advertisement partitions is not limited or limited to this, and may be set arbitrarily.

A user partition is an index indicating a user, and each user partition may mean a user group in which certain users are grouped. The number of users included in each user partition may be set arbitrarily, and the number of user partitions may be set based on the number of advertisement partitions.

Regarding the number of user partitions, user partitions may be generated in one-to-one correspondence with advertisement partitions. This is to generate a mapping table by mapping advertisement partitions and user partitions in a one-to-one correspondence, so that the number of user partitions and the number of advertisement partitions are equal.

Regarding the numbers of users included in each user partition, the user partitions may be generated based on hash values for the identifiers of each user such that the numbers of users included in each user partition are uniform from partition to partition. For example, user partitions may be generated based on a hash value that is a result of applying a time zone-specific hash function to each user's identifier. More specifically, the user partition 1 may include users whose hash values, which are the results of applying a time zone-specific hash function to each user's identifier, belong to the first range. User partition 2 may include users whose hash values, which are the results of applying time zone-specific hash functions to each user's identifier, belong to the second range.

At this time, each user's identifier may be a hardware identifier associated with each user's terminal (for example, a unique number of the terminal, etc.), a software identifier (such as an identification code provided by the operating system installed on the terminal), or a user A temporary identifier (for example, a temporary code temporarily assigned by an advertising system) may be used.

In the following, for convenience of explanation, the user partition will be explained as being composed of partitions 1 to 10, but it may actually be composed of partitions 0 to 99. However, the number of user partitions is not restricted or limited to this, and may be set arbitrarily.

In this way, the processor 220 (more precisely, the storage and maintenance unit 310 included in the processor 220) generates a mapping table in which user partitions are mapped in one-to-one correspondence with advertisement partitions. It may be updated by being shuffled. This allows serving schedules for multiple advertising campaigns to be met. This will be explained in more detail with reference to FIGS. 6 and 7.

At step 420, the processor 220 (more precisely, the verification unit 320 included in the processor 220) determines whether at least one advertising partition is registered in at least one advertising campaign (AD campaign) received from an advertiser that is a client. You may check.

Here, at least one advertising partition registered in at least one advertising campaign may be set by an advertiser as a client. For example, if a client, a first advertiser, creates a first ad campaign that intends to serve ads at a rate of 30% of the total time that ads are displayed and served, the first ad campaign includes ad partition 1. ~3 may be registered. As another example, if a third-party advertiser client creates a third-party ad campaign that attempts to serve ads 70% of the total time the ads are displayed and served, the third-party advertiser may Advertisement partitions 4 to 10 may be registered.

For example, as shown in FIG. 5, if a first advertising campaign, a second advertising campaign, and a third advertising campaign are created by an advertiser that is a client, the processor 220 may select an advertising partition registered in the first advertising campaign. 1 to 3, advertising partitions 1 to 3 registered in the second advertising campaign, and advertising partitions 4 to 10 registered in the third advertising campaign.

In step 430, the processor 220 (more precisely, the extraction unit 330 included in the processor 220) extracts from the mapping table at least one user partition mapped to the at least one advertisement partition identified in step 420. good. For example, as described above, when the ad partitions of the first ad campaign, the second ad campaign, and the third ad campaign are identified, the processor 220 determines, from the mapping table, the first ad User partitions 5, 6, and 9 mapped to advertising partitions 1 to 3 of the campaign are extracted as user partitions for the first advertising campaign, and user partitions 5, 6, and 9 mapped to advertising partitions 1 to 3 of the second advertising campaign are extracted as user partitions for the first advertising campaign. 9 is extracted as a user partition for the second advertising campaign, and user partitions 1, 2, 3, 4, 7, 8, and 10 mapped to advertising partitions 4 to 10 of the third advertising campaign are user partitions for the third advertising campaign. You can extract it as

In step 440, the processor 220 (more precisely, the serving unit 340 included in the processor 220) may serve an advertisement corresponding to at least one advertising campaign to the extracted at least one user partition. Here, serving an advertisement corresponding to at least one advertising campaign to at least one user partition means displaying an advertisement corresponding to at least one advertising campaign to users included in at least one user partition. means.

For example, as described above, user partitions 5, 6, and 9 are extracted from the user partitions for the first and second advertising campaigns, respectively, and user partitions 1, 2, 3, 4, and 9 are extracted from the user partitions for the third advertising campaign, respectively. 7, 8, and 10 are extracted, the processor 220 serves advertisements corresponding to the first advertising campaign to user partitions 5, 6, and 9, and serves advertisements corresponding to the second advertising campaign to user partitions 5, 6, and 9. 9, and advertisements corresponding to the third advertisement campaign may be served to user partitions 1, 2, 3, 4, 7, 8, and 10.

At this time, the processor 220 may consider the target of the advertisement when serving the advertisement corresponding to the at least one advertisement. More specifically, processor 220 may serve advertisements to at least some users included in the extracted at least one user partition based on targeting of the advertisements applicable to the at least one advertising campaign. As an example, as shown in FIG. 5, if the target of the first advertising campaign is "male" and the target of the second advertising campaign is "female", the processor 220 sends the corresponding advertisement to the first advertising campaign. When serving user partitions 5, 6, and 9, advertisements corresponding to the first advertising campaign may be served only to some users whose gender is "male" included in user partitions 5, 6, and 9. Similarly, when serving advertisements corresponding to the second advertising campaign to user partitions 5, 6, and 9, the processor 220 selects some users whose gender is "female" included in user partitions 5, 6, and 9. Only advertisements corresponding to the second advertising campaign may be served.

Also, at step 440, processor 220 may evenly serve the advertisements based on the target frequency and advertisement serving period of the at least one advertising campaign. This will be explained in more detail with reference to FIGS. 8 and 9.

FIG. 6 is a diagram for explaining an example in which the mapping table used in the advertising method shown in FIG. 4 is updated.

At step 410, the processor 220 (more precisely, the storage and maintenance unit 310 included in the processor 220) shuffles the user partitions and then updates the mapping table by mapping the shuffled user partitions to advertisement partitions. good.

This is to meet the serving schedules of multiple advertising campaigns, and the mapping table update may be performed based on the serving schedules of the advertising campaigns.

For example, as shown in FIG. 6, a first advertising campaign targeting the first advertising period (for example, 2022.04.06 11:00 to 2022.04.07 11:00) and a second advertising period ( As an example, if a fourth advertising campaign targeting 2022.04.07 11:00 to 2022.04.08 11:00) is created by the same client, an advertiser, to include the same advertising campaign, mapping If the table is not updated, advertisements corresponding to the first advertising campaign and advertisements corresponding to the fourth advertising campaign will be served to the same user partition, resulting in a relatively low reach rate.

To prevent this, processor 220 shuffles the user partitions at the time the ad period changes, and maps the shuffled user partitions to ad partitions to update the mapping table so that each ad period when serving the ad. mapping tables with different mapping relationships can be used.

Here, shuffling of user partitions when the mapping table is updated may be done based on the hash value and date for each user's identifier. As an example, processor 220 may update hash values and shuffle user partitions by applying a date-specific hash function to each user's identifier.

As mentioned above, the mapping table is updated when the ad period changes, which means that after the serving of ads for at least one ad campaign ends, the serving of ads for at least one other ad campaign begins. This may mean that the mapping table is updated at the time the serving is started.

That is, the processor 220 performs the mapping at the time point when serving of an advertisement starts after the advertisement campaign having the first advertisement period ends and the advertisement campaign having the second advertisement period ends among the two advertisement campaigns having different advertisement periods. You can update the table. As an example, as shown in FIG. 6, after the first advertising campaign, the second advertising campaign, and the third advertising campaign end, the fourth advertising campaign starts at the time when the serving of advertisements starts, which is 2022.04. 07 By updating the mapping table at 11:00, the first advertising campaign, the second advertising campaign, and the third advertising campaign are served using the mapping table before the update, and the fourth advertising campaign is served using the mapping table before the update. Serving may be done using the updated mapping table.

However, without being limited to or limited to this, the mapping table may be pre-updated in advance, instead of being updated at the point at which the serving of advertisements begins, when an advertising campaign with a slow advertising period begins. Good too. This will be explained in more detail below.

FIG. 7 is a diagram for explaining another example in which the mapping table used in the advertising method shown in FIG. 4 is updated.

The mapping table is updated at the time the advertising period changes, which means that after the serving of advertisements of at least one advertising campaign ends, the serving of advertisements of at least one other advertising campaign begins. This may mean that the updated mapping table is updated in advance before the serving of advertisements of at least one other advertising campaign is started, so that the updated mapping table is immediately available for use. To this end, the processor 220 stores and stores an updated mapping table used for serving advertisements of the at least one other advertising campaign separately from the mapping table used for serving advertisements of the at least one advertising campaign. You can keep it.

In other words, the processor 220 determines whether, among two advertising campaigns with different advertising periods, after the advertising campaign with the first advertising period ends and the advertising campaign with the second advertising period starts, the serving of the advertisement is started. The mapping table may be updated and maintained in advance. For example, the processor 220 updates the updated mapping table 720 used for serving advertisements for an advertising campaign having a second advertising period with the mapping table 710 used for serving advertisements for an advertising campaign having a first advertising period. may be stored and maintained separately, so that the mapping table 710 before being updated may be used during the first advertising period, and the updated mapping table 720 may be used during the second advertising period. More specifically, as shown in FIG. 7, the mapping table 720 updated before the end of the first advertising campaign, the second advertising campaign, and the third advertising campaign is By being generated, stored, and maintained separately from the mapping table 710 used in the campaign and the third advertising campaign, the first advertising campaign, the second advertising campaign, and the third advertising campaign are mapped before being updated. Serving may be performed using the table 710, and the fourth advertising campaign may be served using the updated mapping table 720.

FIG. 8 is a diagram illustrating an example of uniformly serving advertisements using the advertising method shown in FIG. 4. Referring to FIG.

At stage 440, processor 220 may evenly serve the advertisements based on the target frequency and advertisement serving period of the at least one advertising campaign. More specifically, the processor 220 may serve advertisements such that an advertisement corresponding to at least one advertising campaign is displayed once during a unit advertisement serving period in which the advertisement serving period is divided by a target frequency.

For example, as shown in FIG. 8, if the advertising campaign has an advertising serving period of 2022.04.7 11:00 to 2022.04.09 11:00 and has a target frequency of 2 times, the processor 220: The ad serving period from 2022.04.07 11:00 to 2022.04.09 11:00 will be divided into two target frequencies, so that the ad of the ad campaign will be displayed once during the 24-hour unit ad serving period. (The advertisement may be displayed once during the first advertisement serving period from 2022.04.07 11:00 to 2022.04.08 11:00, and from 2022.04.08 11:00 to 2022 .04.09 Serving the advertisement such that the advertisement is displayed once during the second advertisement serving period of 11:00).

This can prevent the advertisements of the advertising campaign from being displayed and served in a concentrated manner during a particular period or at a particular time during the advertisement serving period.

FIG. 9 is a diagram illustrating another example of uniformly serving advertisements using the advertisement method shown in FIG. 4. Referring to FIG.

At stage 440, processor 220 may evenly serve the advertisements based on the target frequency and advertisement serving period of the at least one advertising campaign. More specifically, the processor 220 may serve the advertisement by adjusting the allowable frequency so that the allowable ad frequency converges to the target frequency as the ad serving period passes.

For example, as shown in FIG. 9, if the advertising campaign has an advertising serving period of 2022.04.07 11:00 to 2022.04.10 11:00 and has a target frequency of 3 times, the processor 220: The allowable frequency may be adjusted from 1 time to 2 times or from 2 times to 3 times so that the allowable frequency converges to the target frequency of 3 times as the advertisement serving period approaches the end point. This allows the processor 220 to serve the advertisement evenly by serving the advertisement while satisfying the allowed frequency, which is adjusted from 1 to 2 times and from 2 to 3 times. At this time, the allowable frequency refers to the maximum number of times an advertisement can be displayed at present, and may be a value that includes the frequency of advertisements served up to now. As an example, if the allowed frequency is 2 and the ad has already been served once, processor 220 may serve the ad only once at the allowed frequency of 2 minus the 1 that has already been served. Make it.

This can prevent the advertisements of the advertising campaign from being displayed and served in a concentrated manner during a particular period and at a particular time during the advertisement serving period.

Above, with reference to FIGS. 8 and 9, an example in which advertisements are served evenly over the entire advertisement serving period has been described; however, the invention is not limited to or limited to this; It may be possible to display advertisements in a concentrated manner, serving them all at once at a specific point in time, such as at the beginning or end of a period.

Thus, according to embodiments of the present invention, the advertising system serves advertisements using a mapping table in which advertisement partitions and user partitions are mapped, so that advertisements are not served or displayed to overlapping users. , reachability can be guaranteed by having advertisements served or displayed to different users. Additionally, the advertising system can prevent the drop in reach by updating the mapping table while considering the advertising campaign's serving schedule, serving ads evenly based on the advertising campaign's target frequency and advertising serving period. By doing so, it is possible to prevent advertisements from being served in a concentrated manner during a specific period and at a specific time.

The apparatus described above may be realized by hardware components, software components, and/or a combination of hardware and software components. For example, the devices and components described in the embodiments include a processor, a controller, an ALU (Arithmetic Logic Unit), a digital signal processor, a microcomputer, an FPGA (Field Programmable Gate Array), a PLU (Programmable Logic Unit), a microprocessor, or may be implemented using one or more general purpose or special purpose computers, such as various devices capable of executing and responding to instructions. A processing device may execute an operating system (OS) and one or more software applications that execute on the OS. The processing device may also be responsive to execution of the software to access, record, manipulate, process, and generate data. For convenience of understanding, one processing device may be described as being used, but those skilled in the art will understand that a processing device may include multiple processing elements and/or multiple types of processing elements. You will understand that. For example, a processing device may include multiple processors or a processor and a controller. Other processing configurations are also possible, such as parallel processors.

Software may include computer programs, code, instructions, or a combination of one or more of these that configure a processing device or instruct a processing device, independently or collectively, to perform operations as desired. You may do so. The software and/or data may be embodied in a machine, component, physical device, computer storage medium or device of any kind for being interpreted by or providing instructions or data to a processing device. good. The software may be distributed on computer systems connected by a network, and may be recorded or executed in a distributed manner. The software and data may be recorded on one or more computer readable storage media.

Methods according to embodiments may be implemented in the form of program instructions executable by various computer means and recorded on computer-readable media. Here, the medium may be one that continuously records a computer-executable program, or one that temporarily records it for execution or download. Also, the medium may be a variety of recording or storage means in the form of a single or multiple hardware combinations, and is not limited to a medium directly connected to a computer system, but may be distributed over a network. It may also exist. Examples of media include magnetic media such as hard disks, floppy disks, and magnetic tape, optical media such as CD-ROMs and DVDs, magneto-optical media such as floptical disks, and ROM, RAM. , flash memory, etc., and may be configured to store program instructions. Further, other examples of the medium include an application store that distributes applications, a site that supplies or distributes various other software, and a recording medium or storage medium managed by a server.

As mentioned above, although the embodiments have been described based on limited embodiments and drawings, those skilled in the art will be able to make various modifications and variations based on the above description. For example, the techniques described may be performed in a different order than in the manner described, and/or components of the systems, structures, devices, circuits, etc. described may be performed in a different form than in the manner described. Even when combined or combined, opposed or replaced by other components or equivalents, suitable results can be achieved.

Therefore, different embodiments are within the scope of the appended claims if they are equivalent to the claims.

220: Processor 310: Storage and Maintenance Unit 320: Validation Unit 330: Extraction Unit 340: Serving Unit

Claims (20)

1. An advertising method performed by a computer device comprising at least one processor, the method comprising:
storing and maintaining a mapping table in which user partitions indicating users are mapped to ad partitions indicating times when advertisements are displayed;
identifying at least one advertising partition registered with at least one advertising campaign;
extracting from the mapping table at least one user partition mapped to the identified at least one advertising partition; and placing an advertisement corresponding to the at least one advertising campaign in the extracted at least one user partition; advertising method, including the step of serving. The storing and maintaining step includes:
The advertising method of claim 1, further comprising: after shuffling the user partitions, mapping the shuffled user partitions to the advertising partitions and updating the mapping table. The updating step includes:
The mapping table may be updated at a time when serving of advertisements of at least one other advertising campaign starts after serving of advertisements of the at least one advertising campaign ends. The advertising method according to claim 2. The updating step includes:
After the serving of advertisements of the at least one advertising campaign has ended, the updated mapping table can be used at the time when the serving of advertisements of the at least one other advertising campaign begins. The advertising method according to claim 2, further comprising the step of: updating and maintaining the mapping table in advance before the serving of advertisements of the at least one other advertising campaign is started. . The pre-updating and maintaining step includes:
storing and maintaining the updated mapping table used for serving advertisements of the at least one other advertising campaign separately from the mapping table used for serving advertisements of the at least one advertising campaign; Advertising method according to claim 4, characterized in that: The updating step includes:
3. The advertising method of claim 2, further comprising: shuffling the user partitions based on a hash value and a date for each user's identifier. The serving step includes:
3. Serving advertisements corresponding to the at least one advertising campaign evenly based on a target frequency of the at least one advertising campaign and an advertising serving period of the at least one advertising campaign. The advertising method described in 1. The evenly serving step includes:
serving the advertisement so that the advertisement corresponding to the at least one advertising campaign is displayed once during a unit advertisement serving period in which the advertisement serving period is divided by the target frequency; The advertising method according to claim 7. The evenly serving step includes:
The advertising method of claim 7, further comprising the step of serving the advertisement by adjusting the allowable frequency so that the allowable frequency of the ad converges to the target frequency as the ad serving period passes. . The serving step includes:
4. Serving the advertisement to at least some users included in the extracted at least one user partition based on the target of the advertisement corresponding to the at least one advertising campaign. The advertising method described in 1. The user partition is
The advertising method according to claim 1, wherein the advertising method is generated in one-to-one correspondence with the advertising partition. The user partition is
The advertising method according to claim 11, wherein the advertising method is generated based on a hash value for each user's identifier. The identifier of each of the users is
The advertising method according to claim 12, characterized in that the advertising method includes at least one of a hardware identifier, a software identifier, or a temporary identifier temporarily assigned to each of the users. . A computer-readable recording medium on which a computer program for causing a computer device to execute an advertising method is recorded,
The advertising method is
storing and maintaining a mapping table in which user partitions indicating users are mapped to ad partitions indicating times when advertisements are displayed;
identifying at least one advertising partition registered with at least one advertising campaign;
extracting from the mapping table at least one user partition mapped to the identified at least one advertising partition; and placing an advertisement corresponding to the at least one advertising campaign in the extracted at least one user partition; a computer-readable recording medium comprising a step of serving a computer-readable storage medium; A computer device for carrying out an advertising method, the computer device comprising:
at least one processor configured to execute computer-readable instructions;
The at least one processor includes:
a storage and maintenance unit that stores and maintains a mapping table in which user partitions indicating users are mapped to advertisement partitions indicating times when advertisements are displayed;
a verification unit for verifying at least one advertising partition registered in at least one advertising campaign;
an extraction unit that extracts at least one user partition mapped to the confirmed at least one advertising partition from the mapping table; and the extracted at least one user partition corresponds to the at least one advertising campaign. A computer device that includes a serving section that serves advertisements. The at least one processor includes:
16. The computing device of claim 15, wherein after shuffling the user partitions, the shuffled user partitions are mapped to the advertisement partitions to update the mapping table. The at least one processor includes:
The mapping table is updated at a time when serving of advertisements of at least one other advertising campaign starts after serving of advertisements of the at least one advertising campaign ends. 17. The computer device according to item 16. The at least one processor includes:
After the serving of advertisements of the at least one advertising campaign has ended, the updated mapping table can be used at the time when the serving of advertisements of the at least one other advertising campaign begins. 17. The computer device of claim 16, wherein the mapping table is updated and maintained in advance before the serving of advertisements of the at least one other advertising campaign is started. The at least one processor includes:
storing and maintaining said updated mapping table used for serving advertisements of said at least one other advertising campaign separately from said mapping table used for serving advertisements of said at least one advertising campaign; 20. A computer device according to claim 18, characterized in that: The at least one processor includes:
16. The method according to claim 15, characterized in that advertisements corresponding to the at least one advertising campaign are evenly served based on a target frequency of the at least one advertising campaign and an advertising serving period of the at least one advertising campaign. computer equipment.

Images