KR20230162213A - Advertising method, device and computer program to ensure reach - Google Patents

Abstract

An advertising method, device, and computer program for ensuring reach are disclosed. An advertising method according to an embodiment includes the steps of storing and maintaining a mapping table in which user partitions representing users are mapped to advertisement partitions representing times at which advertisements are exposed; confirming at least one advertising partition registered in at least one advertising campaign; extracting at least one user partition mapped to the identified at least one advertising partition from the mapping table; and serving an advertisement corresponding to the at least one advertising campaign to the extracted at least one user partition.

Description

Advertising method, device and computer program for ensuring reach {ADVERTISING METHOD, DEVICE AND COMPUTER PROGRAM TO ENSURE REACH}

The explanation below is about advertising serving technology that guarantees reach.

Internet advertising is rapidly emerging as one of the top five media, following TV, radio, newspapers, and magazines. Banner advertising, which accounts for the most among Internet advertisements, is served in the form of a banner containing advertising content and links within a website, thereby encouraging clicks from users (hereinafter, users refer to advertising consumers) and leading to interaction. It is a special Internet advertisement with the advantage of being interactive and active. The described technology for Internet advertising is disclosed in Korean Patent Publication No. 10-2007-0105652.

However, such existing Internet advertisements only guarantee the number of exposures through the CPM (Cost Per Mile) method or the exposure time and period through the CPT (Cost Per Time) method, and serve advertisements to users so that they do not overlap. Or, there is a problem of not being able to guarantee reach due to lack of exposure.

One embodiment of the present invention is an advertising method that guarantees reach by using a mapping table in which advertising partitions and user partitions are mapped to serve or expose advertising to different users without serving or exposing advertising to overlapping users. , provides devices and computer programs.

At this time, embodiments of the present invention provide an advertising method, device, and computer program for updating a mapping table in consideration of serving schedules of advertising campaigns.

Additionally, embodiments of the present invention provide an advertising method, apparatus, and computer program for uniformly serving advertisements based on the target frequency of an advertising campaign and the advertising serving period.

According to an embodiment of the present invention, an advertising method for guaranteeing reach performed by a computer device including at least one processor includes user partitions representing users in advertising partitions indicating the time at which advertisements are exposed. storing and maintaining the mapped mapping table; confirming at least one advertising partition registered in at least one advertising campaign; extracting at least one user partition mapped to the identified at least one advertising partition from the mapping table; and serving an advertisement corresponding to the at least one advertising campaign to the extracted at least one user partition.

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

According to another aspect, the updating step is a step of updating the mapping table at the start of advertising serving of at least one other advertising campaign where advertising serving begins after advertising serving of the at least one advertising campaign ends. It can be characterized.

According to another aspect, the updating step includes: the updated mapping table can be used at the start of advertising serving of at least one other advertising campaign where advertising serving begins after advertising serving of the at least one advertising campaign ends. It may be characterized by including the step of updating and maintaining the mapping table in advance before the start of advertising serving of the at least one other advertising campaign.

According to another aspect, the step of updating and maintaining the updated mapping table used for serving the advertisement of the at least one other advertising campaign includes the mapping table used for serving the advertisement of the at least one advertising campaign. It may be characterized as a separately stored and maintained step.

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

According to another aspect, the serving step includes uniformly serving advertisements corresponding to the at least one advertisement campaign based on a target frequency of the at least one advertisement campaign and an advertisement serving period of the at least one advertisement campaign. It can be characterized as a step of doing.

According to another aspect, the evenly serving step includes serving the advertisement so that the advertisement corresponding to the at least one advertisement campaign is exposed once during a unit advertisement serving period where the advertisement serving period is divided by the target frequency. It can be characterized as:

According to another aspect, the uniformly serving step includes serving the advertisement while adjusting the allowable frequency of the advertisement so that the allowable frequency of the advertisement converges to the target frequency as the advertisement serving period elapses. can do.

According to 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 target of the advertisement corresponding to the at least one advertisement campaign. It can be characterized as:

According to another aspect, the user partitions may be created to correspond one-to-one to the advertisement partitions.

According to another aspect, the user partitions may be created based on hash values for the identifiers of each of the users.

According to another aspect, the identifier of each of the users may include at least one of a hardware identifier, a software identifier, or a temporary identifier temporarily assigned to each of the users. there is.

According to an embodiment of the present invention, in a computer-readable recording medium recording a computer program for executing an advertising method for guaranteeing reach on a computer device, the advertising method includes determining the time at which advertisements are exposed. storing and maintaining a mapping table in which user partitions representing users are mapped to advertising partitions representing users; confirming at least one advertising partition registered in at least one advertising campaign; extracting at least one user partition mapped to the identified at least one advertising partition from the mapping table; and serving an advertisement corresponding to the at least one advertising campaign to the extracted at least one user partition.

According to one embodiment of the present invention, a computer device that performs an advertising method for ensuring reach includes at least one processor configured to execute computer-readable instructions, wherein the at least one processor is configured to display advertisements. a storage and maintenance unit that stores and maintains a mapping table in which user partitions representing users are mapped to advertisement partitions representing exposure times; a confirmation unit that verifies 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 identified at least one advertisement partition from the mapping table; and a serving unit that serves an advertisement corresponding to the at least one advertising campaign to the extracted at least one user partition.

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

According to another aspect, the at least one processor updates the mapping table at the start of advertising serving of at least one other advertising campaign where advertising serving begins after advertising serving of the at least one advertising campaign ends. You can do this.

According to another aspect, the at least one processor uses the updated mapping table at the start of advertising serving of at least one other advertising campaign where advertising serving begins after advertising serving of the at least one advertising campaign ends. If possible, the mapping table may be updated and maintained in advance before the advertisement serving of the at least one other advertisement campaign begins.

According to another aspect, the at least one processor stores the updated mapping table used for serving advertisements of the other at least one advertisement campaign separately from the mapping table used for serving advertisements of the at least one advertisement campaign. and may be characterized by maintaining.

According to another aspect, the at least one processor evenly distributes advertisements corresponding to the at least one advertisement campaign based on a target frequency of the at least one advertisement campaign and an advertisement serving period of the at least one advertisement campaign. It can be characterized as serving.

One embodiment of the present invention is an advertising method that guarantees reach by using a mapping table in which advertising partitions and user partitions are mapped to serve or expose advertising to different users without serving or exposing advertising to overlapping users. , devices and computer programs can be provided.

At this time, embodiments of the present invention can provide an advertising method, device, and computer program that updates the mapping table in consideration of the serving schedule of advertising campaigns.

Additionally, embodiments of the present invention can provide an advertising method, device, and computer program that uniformly serves advertisements based on the target frequency of an advertising campaign and the advertisement serving period.

1 is a diagram illustrating an example of a network environment according to an embodiment of the present invention.
Figure 2 is a block diagram showing an example of a computer device according to an embodiment of the present invention.
FIG. 3 is a block diagram showing an example of components that the processor shown in FIG. 2 may include.
FIG. 4 is a flow chart showing an example of an advertising method that can be performed by the computer device shown in FIG. 2.
FIG. 5 is a diagram for explaining a mapping table used in the advertising method shown in FIG. 4.
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.
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.
FIG. 8 is a diagram for explaining an example of uniformly serving advertisements in the advertisement method shown in FIG. 4.
FIG. 9 is a diagram for explaining another example of uniformly serving advertisements in the advertisement method shown in FIG. 4.

Hereinafter, embodiments of the present invention will be described in detail with reference to the attached drawings.

Embodiments of the present invention are techniques for advertising methods, devices, and computer programs that guarantee reach rates.

Embodiments including those specifically disclosed in this specification use a mapping table in which advertisement partitions and user partitions are mapped to serve or expose advertisements to different users without serving or exposing advertisements to overlapping users. Describes an advertising system that serves advertisements. Accordingly, embodiments of the present invention can produce a technical effect that guarantees the reach rate.

Advertising systems according to embodiments of the present invention may be implemented by at least one computer device implementing a server or electronic device, which will be described later. The computer program according to the embodiments of the present invention may be installed and driven in the computer device, and the computer device may perform the advertising method according to the embodiments of the present invention under the control of the driven computer program. The above-described computer program can be combined with a computer device and stored in a computer-readable recording medium to execute the advertising method on the computer device. The computer program described here may be in the form of an independent program package, or may be pre-installed on a computer device and linked to an operating system or other program packages.

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

Figure 1 is an example for explaining the invention, and the number of electronic devices or servers is not limited as in Figure 1. In addition, the network environment in FIG. 1 only explains one example of environments applicable to the present embodiments, and the environment applicable to the present embodiments 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 implemented as computer devices. Examples of the plurality of electronic devices 110, 120, 130, and 140 include smart phones, mobile phones, navigation devices, computers, laptops, digital broadcasting terminals, Personal Digital Assistants (PDAs), and Portable Multimedia Players (PMPs). ), tablet PC, etc. For example, in FIG. 1, the shape of a smartphone is shown as an example of the electronic device 110. However, in embodiments of the present invention, the electronic device 110 actually communicates with other devices through the network 170 using a wireless or wired communication method. It may refer to one of various physical computer devices capable of communicating with electronic devices 120, 130, 140 and/or servers 150, 160.

The communication method is not limited, and may include not only a communication method utilizing a communication network that the network 170 may include (for example, a mobile communication network, wired Internet, wireless Internet, and a broadcast network), but also short-range wireless communication between devices. For example, the network 170 may include a personal area network (PAN), a local area network (LAN), a campus area network (CAN), a metropolitan area network (MAN), a wide area network (WAN), and a broadband network (BBN). , may include one or more arbitrary networks such as the Internet. Additionally, the network 170 may include any one or more of network topologies including a bus network, star network, ring network, mesh network, star-bus network, tree or hierarchical network, etc. Not limited.

Each of the servers 150 and 160 is a computer device or a plurality of computers that communicate with a plurality of electronic devices 110, 120, 130, 140 and a network 170 to provide commands, codes, files, content, services, etc. It can be implemented with devices. For example, the server 150 provides a service (for example, a service performed by an advertising method described later) to a plurality of electronic devices 110, 120, 130, and 140 connected through the network 170. It could be a system.

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

As shown in FIG. 2, this computer device 200 may include a memory 210, a processor 220, a communication interface 230, and an input/output interface 240. The memory 210 is a computer-readable recording medium and may include a non-permanent mass storage device such as random access memory (RAM), read only memory (ROM), and a disk drive. Here, non-perishable large-capacity recording devices such as ROM and disk drives 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 stored in the memory 210. These software components may be loaded into the memory 210 from a computer-readable recording medium separate from the memory 210. Such separate computer-readable recording media may include computer-readable recording media such as floppy drives, disks, tapes, DVD/CD-ROM drives, and memory cards. In another embodiment, software components may be loaded into the memory 210 through the communication interface 230 rather than a computer-readable recording medium. For example, software components may be loaded into memory 210 of computer device 200 based on computer programs installed by files received over network 170.

The processor 220 may be configured to process instructions of a computer program by performing basic arithmetic, logic, and input/output operations. Commands may be provided to the processor 220 by the memory 210 or the communication interface 230. For example, processor 220 may be configured to execute received instructions according to program code stored in a recording device such as memory 210.

The communication interface 230 may provide a function for the computer device 200 to communicate with other devices (eg, the storage devices described above) through the network 170. For example, a request, command, data, file, etc. generated by the processor 220 of the computer device 200 according to a program code stored in a recording device such as memory 210 is transmitted to the network ( 170) and can be transmitted to other devices. Conversely, signals, commands, data, files, etc. from other devices may be received by the computer device 200 through the communication interface 230 of the computer device 200 via the network 170. Signals, commands, data, etc. received through the communication interface 230 may be transmitted to the processor 220 or memory 210, and files, etc. may be stored in a storage medium (as described above) that the computer device 200 may further include. It can be stored as a permanent storage device).

The input/output interface 240 may be a means for interfacing with the 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 displays and speakers. As another example, the input/output interface 240 may be a means for interfacing with a device that integrates input and output functions, such as a touch screen. The input/output device 250 may be configured as a single device with the computer device 200.

Additionally, in other embodiments, computer device 200 may include fewer or more components than those of FIG. 2 . However, there is no need to clearly show most prior art components. For example, the computer device 200 may be implemented to include at least some of the input/output devices 250 described above, or may further include other components such as a transceiver, a database, etc.

Hereinafter, an advertising method, device, and computer program that guarantees reach rate by using a mapping table in which advertising partitions and user partitions are mapped to serve or expose advertising to different users without serving or exposing advertising to overlapping users. A specific example will be described.

FIG. 3 is a block diagram showing an example of components that the processor shown in FIG. 2 may include, and FIG. 4 is a flow chart showing an example of an advertising method that the computer device shown in FIG. 2 can perform. , FIG. 5 is a diagram for explaining the mapping table used in the advertising method shown in FIG. 4.

In embodiments of the present invention, the computer device 200 responds to a service request generated through a dedicated application or web/mobile site access installed on a server or electronic device owned by the client targeting an advertiser, and creates a mapping table. Based on this, an advertising service that serves advertisements can be provided. The computer device 200 may be configured with a computer-implemented advertising system. For example, the advertising system may be implemented in the form of a program that operates independently, or may be implemented in the form of an in-app of a dedicated application so that it can operate on the dedicated application.

The processor 220 of the computer device 200 may be implemented as a component for performing the advertising method according to FIG. 4. For example, the processor 220 includes a storage and maintenance unit 310, a confirmation unit 320, and an extraction unit 330 as shown in FIG. 3 to perform the steps S410 to S440 shown in FIG. 4. ) and a serving unit 340. Depending on the embodiment, components of the processor 220 may be selectively included in or excluded from the processor 220. Additionally, depending on the embodiment, components of the processor 220 may be separated or merged to express the functions of the processor 220.

The processor 220 and the components of the processor 220 can control the computer device 200 to perform steps S410 to S440 included in the advertising method of FIG. 4. For example, the processor 220 and its components may be implemented to execute instructions according to the code of an operating system included in the memory 210 and the code of at least one program.

Here, the components of the processor 220 may be expressions of different functions performed by the processor 220 according to instructions provided by program codes stored in the computer device 200. For example, the serving unit 340 may be used as a functional representation of the processor 220 that controls the computer device 200 to serve advertisements corresponding to at least one advertising campaign.

The processor 220 may read necessary instructions from the memory 210 where instructions related to controlling the computer device 200 are loaded. In this case, the read command may include a command for controlling the processor 220 to execute steps S410 to S440 that will be described later.

Steps S410 to S440 to be described later may be performed in an order different from the order shown in FIG. 4, and some of the steps S410 to S440 may be omitted or additional processes may be included.

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

Here, advertising partitions are indicators of the time when advertisements are exposed, and may mean an index of the time when advertisements are exposed. For example, advertising partitions may mean dividing the total time during which an advertisement is exposed and served into unit times. Hereinafter, the advertising partitions are described as being composed of partitions from 1 to 10 for convenience of explanation, but in reality, they may be composed of partitions from 0 to 99. However, the number of advertising partitions is not limited or limited to this and can be set arbitrarily.

User partitions are indicators representing users, and each user partition may mean a user group in which certain users are grouped. The number of users included in each user partition can be set arbitrarily, and the number of user partitions can be set based on the number of advertising partitions.

Regarding the number of user partitions, user partitions can be created to correspond one-to-one to advertising partitions. This is to create a mapping table by mapping user partitions to advertising partitions in a one-to-one correspondence, so that the number of user partitions is equal to the number of advertising partitions.

Regarding the number of users included in each of the user partitions, the user partitions may be created based on a hash value for the identifier of each user so that the number of users included in each user partition is uniform for each partition. For example, user partitions may be created based on hash values that are the result of applying a hash function for each time period to each user's identifier. For a more specific example, users whose hash values, which are the result of applying a hash function for each time zone to the identifiers of each user, fall into a first range may be included in user partition 1, and for which a hash function for each time zone is applied to the identifiers of each user. Users whose resulting hash values fall into the second range may be included in user partition 2.

At this time, the identifier for each user is a hardware identifier (e.g., unique terminal number, etc.) related to each user's terminal, a software identifier (identification code provided by the operating system installed on the terminal, etc.), or a temporary identifier for each user. An assigned temporary identifier (eg, a temporary code temporarily assigned by an advertising system, etc.) may be used.

Hereinafter, user partitions are also described as being composed of partitions from 1 to 10 for convenience of explanation, but in reality, they may be composed of partitions from 0 to 99. However, the number of user partitions is not limited or restricted to this and can be set arbitrarily.

In this way, the mapping table created by mapping user partitions to advertising partitions in a one-to-one correspondence is used as user partitions are shuffled by the processor 220 (more precisely, the storage and maintenance unit 310 included in the processor 220). It can be updated. Through this, the serving schedule of multiple advertising campaigns can be satisfied. A detailed description of this will be described with reference to FIGS. 6 and 7.

In step S420, the processor 220 (more precisely, the confirmation unit 320 included in the processor 220) selects at least one advertisement partition registered in at least one advertisement campaign (AD campaign) received from an advertiser as a client. can confirm.

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 first advertiser, a client, creates a first advertising campaign to serve an advertisement with a 30% share in the total time that the advertisement is exposed and served, advertising partitions 1 to 3 may be registered in the first advertising campaign. . For another example, if a third-party advertiser, a client, creates a third advertising campaign to serve advertisements with a 70% share of the total time that advertisements are exposed and served, advertising partitions 4 to 10 may be registered in the third advertising campaign. there is.

For example, as shown in FIG. 5, if the first advertising campaign, the second advertising campaign, and the third advertising campaign were created by advertisers who are clients, the processor 220 selects advertising partitions 1 to 2 registered in the first advertising campaign. 3, advertising partitions 1 to 3 registered in the second advertising campaign can be confirmed, and advertising partitions 4 to 10 registered in the third advertising campaign can be confirmed.

In step S430, the processor 220 (more precisely, the extraction unit 330 included in the processor 220) selects at least one user mapped to at least one advertisement partition identified through step S420 from the mapping table. Partitions can be extracted. For example, if the advertising partitions of each of the first advertising campaign, the second advertising campaign, and the third advertising campaign have been confirmed as described above, the processor 220 may determine the first advertising campaign from the mapping table as shown in FIG. 5. Extract user partitions 5, 6, 9 mapped to advertising partitions 1 to 3 as user partitions for the first advertising campaign, and user partitions 5, 6, mapped to advertising partitions 1 to 3 of the second advertising campaign from the mapping table. 9 as the user partition for the second advertising campaign, and user partitions 1, 2, 3, 4, 7, 8, 10 mapped to advertising partitions 4 to 10 of the third advertising campaign from the mapping table. Can be extracted to user partition.

In step S440, 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 at least one extracted user partition. Hereinafter, serving an advertisement corresponding to at least one advertising campaign to at least one user partition means exposing an advertisement corresponding to at least one advertising campaign to users included in the at least one user partition.

For example, as described above, user partitions 5, 6, and 9 are extracted as user partitions for each of the first and second advertising campaigns, and user partitions 1, 2, and 3 are extracted as user partitions for the third advertising campaign. , 4, 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 and 9. 6 and 9, and advertisements corresponding to the third advertising campaign can 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 an advertisement corresponding to at least one advertisement. More specifically, the processor 220 may serve an advertisement to at least some users included in at least one extracted user partition based on the target of an advertisement corresponding to at least one advertisement campaign. For example, as shown in Figure 5, when the target of the first advertising campaign is "men" and the target of the second advertising campaign is "women", the processor 220 stores the advertisement corresponding to the first advertising campaign in the user partition. When serving to 5, 6, and 9, the advertisement corresponding to the first advertising campaign can be served only to some users whose gender is “male” included in user partitions 5, 6, and 9. Likewise, when serving advertisements corresponding to the second advertising campaign to user partitions 5, 6, and 9, the processor 220 serves the second advertising campaign only to some users whose gender is “female” included in user partitions 5, 6, and 9. Advertisements corresponding to the advertising campaign can be served.

Additionally, in step S440, the processor 220 may serve advertisements evenly based on the target frequency and advertisement serving period of at least one advertisement campaign. A detailed description of this will be described 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.

In step S410, 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. can do.

This is to satisfy the serving schedule of multiple advertising campaigns, and updating the mapping table can be performed based on the serving schedule of advertising campaigns.

For example, as shown in Figure 6, the first advertising campaign targeting the first advertising period (for example, 2022.04.06 11:00 to 2022.04.07 11:00) and the second advertising period (for example, 2022.04.07) 11:00 to 2022.04.08 11:00), if the mapping table is not updated when the fourth advertising campaign targeting the same advertising campaign is created from the same client, the advertiser, the advertisement corresponding to the first advertising campaign The advertisements corresponding to the fourth advertising campaign are served to the same user partitions, so the reach rate is relatively low.

To prevent this, the processor 220 shuffles the user partitions when the advertisement period changes and then updates the mapping table by mapping the shuffled user partitions to the advertisement partitions, thereby maintaining different mapping relationships for each advertisement period when serving advertisements. You can use a mapping table that has:

Here, when the mapping table is updated, user partitions are shuffled based on the hash value and date for each user's identifier. For example, the processor 220 may shuffle user partitions by updating the hash value by applying a date-specific hash function to each user's identifier.

As described, the mapping table is updated at the time when the advertising period changes, meaning that the mapping table is updated at the time of the advertising serving of at least one other advertising campaign that begins after the advertising serving of at least one advertising campaign ends. It can mean becoming.

That is, the processor 220 updates the mapping table at the start of advertisement serving when the advertisement campaign with the second advertisement period starts after the advertisement campaign with the first advertisement period ends among the two advertisement campaigns with different advertisement periods. You can. For example, as shown in Figure 6, the mapping table is updated at 11:00 on April 7, 2022, at the start of advertising serving when the fourth advertising campaign begins after the first, second, and third advertising campaigns have ended. , the first advertising campaign, the second advertising campaign, and the third advertising campaign may be served using the mapping table before being updated, and the fourth advertising campaign may be served using the updated mapping table.

However, without being limited or restricted thereto, the mapping table may be updated in advance instead of being updated at the start of advertisement serving when an advertisement campaign with a late advertisement period begins. A detailed description of this is provided 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 fact that the mapping table is updated when the advertising period changes means that the updated mapping table can be used immediately when the advertising serving of at least one advertising campaign begins after the advertising serving of at least one advertising campaign ends. This may mean that it is updated in advance before the advertisement serving of at least one other advertisement campaign begins. To this end, the processor 220 may store and maintain an updated mapping table used for serving advertisements of at least one other advertising campaign separately from the mapping table used for serving advertisements of at least one advertising campaign.

That is, the processor 220 prepares the mapping table in advance before the advertisement serving start time when the advertisement campaign with the second advertisement period starts after the advertisement campaign with the first advertisement period ends among the two advertisement campaigns with different advertisement periods. It can be maintained by updating. For example, the processor 220 may convert the updated mapping table 720 used for serving advertisements of an advertising campaign having a second advertising period into the mapping table 710 used for serving advertising of an advertising campaign having a first advertising period. By storing and maintaining it separately, the mapping table 710 before the update can be used in the first advertising period and the updated mapping table 720 can be used in the second advertising period. For a more specific example, as shown in FIG. 7, the updated mapping date 720 before the end of the first advertising campaign, the second advertising campaign, and the third advertising campaign is As the mapping table 710 used in the third advertising campaign is created, stored, and maintained separately, the first advertising campaign, the second advertising campaign, and the third advertising campaign are served using the mapping table 710 before it is updated. The fourth advertising campaign can be served using the updated mapping table 720.

FIG. 8 is a diagram for explaining an example of uniformly serving advertisements in the advertisement method shown in FIG. 4.

In step S440, the processor 220 may serve advertisements evenly based on the target frequency and advertisement serving period of at least one advertisement campaign. More specifically, the processor 220 may serve advertisements such that advertisements corresponding to at least one advertisement campaign are exposed once during a unit advertisement serving period in which the advertisement serving period is divided by the target frequency.

For example, as shown in FIG. 8, if the advertising campaign has an advertising serving period of 2022.04.07 11:00 to 2022.04.09 11:00 and a target frequency of 2, the processor 220 performs 2022.04.07 11 The ad serving period of :00~2022.04.09 11:00 can be divided into two target frequencies and the ad can be served so that the ad of the ad campaign is exposed once during the unit ad serving period of 24 hours (2022.04.07 11:00 The advertisement is served so that the advertisement is exposed once during the first advertisement serving period from ~2022.04.08 11:00 and the advertisement is exposed once during the second advertisement serving period from 2022.04.08 11:00 to 2022.04.09 11:00) .

Accordingly, the advertisements of the advertising campaign can be prevented from being exposed, served, and terminated by focusing on a specific period and time during the advertisement serving period.

FIG. 9 is a diagram for explaining another example of uniformly serving advertisements in the advertisement method shown in FIG. 4.

In step S440, the processor 220 may serve advertisements evenly based on the target frequency and advertisement serving period of at least one advertisement campaign. In more detail, the processor 220 may serve an advertisement by adjusting the allowable frequency so that the ad allowable frequency converges to the target frequency as the ad serving period elapses.

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 a target frequency of 3 times, the processor 220 determines the advertising serving period As the end point approaches, the allowable frequency can be adjusted from 1 to 2 or from 2 to 3 so that the allowable frequency converges to the target frequency of 3. Accordingly, the processor 220 serves the advertisement while satisfying the allowable frequency adjusted from 1 to 2 times and from 2 to 3 times, thereby enabling equal serving of the advertisement. At this time, the allowable frequency means the maximum number of exposures that can serve an advertisement at the current time, and may be a value that includes the frequencies served up to now. For example, if the advertisement has already been served once when the allowed frequency is 2, the processor 220 can serve the advertisement only one more time by subtracting the one already served from the allowed frequency of 2.

Accordingly, the advertisements of the advertising campaign can be prevented from being exposed, served, and terminated by focusing on a specific period and time during the advertisement serving period.

Although an example in which advertisements are served equally throughout the advertisement serving period has been described with reference to FIGS. 8 and 9 above, the processor 220 is not limited or limited thereto and serves advertisements at a time at a specific point in time, such as at the beginning or end of the advertisement serving period. By serving, you can enable intensive exposure of advertisements.

As such, 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, thereby advertising to different users without serving or exposing advertisements to overlapping users. You can guarantee reach rate by serving or exposing. In addition, the advertising system can prevent the reach rate from decreasing by updating the mapping table by considering the serving schedule of advertising campaigns, and by serving ads evenly based on the target frequency of the advertising campaign and the advertising serving period, the advertising system can be used during a specific period. It is possible to prevent serving and termination by focusing on time.

The device described above may be implemented with hardware components, software components, and/or a combination of hardware components and software components. For example, the devices and components described in the embodiments include a processor, a controller, an arithmetic logic unit (ALU), a digital signal processor, a microcomputer, a field programmable gate array (FPGA), and a programmable logic unit (PLU). It may be implemented using one or more general-purpose or special-purpose computers, such as a logic unit, microprocessor, or any other device capable of executing and responding to instructions. The processing device may execute an operating system (OS) and one or more software applications running on the operating system. Additionally, a processing device may access, store, manipulate, process, and generate data in response to the execution of software. For ease of understanding, a single processing device may be described as being used; however, those skilled in the art will understand that a processing device includes multiple processing elements and/or multiple types of processing elements. It can be seen that it may include. For example, a processing device may include a plurality of processors or one processor and one controller. Additionally, other processing configurations, such as parallel processors, are possible.

Software may include a computer program, code, instructions, or a combination of one or more of these, which may configure a processing unit to operate as desired, or may be processed independently or collectively. You can command the device. The software and/or data may be embodied in any type of machine, component, physical device, computer storage medium or device for the purpose of being interpreted by or providing instructions or data to the processing device. there is. Software may be distributed over networked computer systems and stored or executed in a distributed manner. Software and data may be stored on one or more computer-readable recording media.

The method according to the embodiment may be implemented in the form of program instructions that can be executed through various computer means and recorded on a computer-readable medium. At this time, the medium may continuously store a computer-executable program, or temporarily store it for execution or download. In addition, the medium may be a variety of recording or storage means in the form of a single or several pieces of hardware combined. It is not limited to a medium directly connected to a computer system and may be distributed over a network. Examples of media include magnetic media such as hard disks, floppy disks, and magnetic tapes, optical recording media such as CD-ROMs and DVDs, magneto-optical media such as floptical disks, And there may be something configured to store program instructions, including ROM, RAM, flash memory, etc. Additionally, examples of other media include recording or storage media managed by app stores that distribute applications, sites or servers that supply or distribute various other software, etc.

As described above, although the embodiments have been described with limited examples and drawings, various modifications and variations can be made by those skilled in the art from the above description. For example, the described techniques are performed in a different order than the described method, and/or components of the described system, structure, device, circuit, etc. are combined or combined in a different form than the described method, or other components are used. Alternatively, appropriate results may be achieved even if substituted or substituted by an equivalent.

Therefore, other implementations, other embodiments, and equivalents of the claims also fall within the scope of the claims described below.

Claims (20)

In an advertising method for ensuring reach performed by a computer device including at least one processor,
storing and maintaining a mapping table in which user partitions representing users are mapped to advertisement partitions representing times at which advertisements are exposed;
confirming at least one advertising partition registered in at least one advertising campaign;
extracting at least one user partition mapped to the identified at least one advertising partition from the mapping table; and
Serving an advertisement corresponding to the at least one advertising campaign to the extracted at least one user partition.
Advertising method including. According to paragraph 1,
The storing and maintaining steps include:
Shuffling the user partitions and then updating the mapping table by mapping the shuffled user partitions to the advertising partitions.
An advertising method further comprising: According to paragraph 2,
The updating step is,
Advertising method, characterized in that the step of updating the mapping table at the start of advertising serving of at least one other advertising campaign where advertising serving begins after advertising serving of the at least one advertising campaign ends. According to paragraph 2,
The updating step is,
Starting advertising serving of the other at least one advertising campaign so that the updated mapping table is available at the start of advertising serving of the other at least one advertising campaign for which advertising serving begins after the advertising serving of the at least one advertising campaign ends. Updating and maintaining the mapping table in advance before the point in time
An advertising method comprising: According to paragraph 4,
The step of updating and maintaining in advance is,
Advertising method, characterized in that the step of storing and maintaining the updated mapping table used for serving the advertisement of the at least one other advertising campaign separately from the mapping table used for serving the advertisement of the at least one advertising campaign. According to paragraph 2,
The updating step is,
Shuffling the user partitions based on the hash value and date for each identifier of the users.
An advertising method comprising: According to paragraph 1,
The serving step is,
An advertising method comprising uniformly serving advertisements corresponding 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. In clause 7,
The evenly serving step includes:
Advertising method, characterized in that serving the advertisement so that the advertisement corresponding to the at least one advertising campaign is exposed once during a unit advertisement serving period where the advertisement serving period is divided by the target frequency. In clause 7,
The evenly serving step includes:
Advertising method, characterized in that the step of serving the advertisement by adjusting the allowable frequency of the advertisement so that the allowable frequency of the advertisement converges to the target frequency as the advertisement serving period elapses. According to paragraph 1,
The serving step is,
The advertising method comprising 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. According to paragraph 1,
The user partitions are:
An advertising method characterized in that the advertising partitions are created in one-to-one correspondence. According to clause 11,
The user partitions are:
An advertising method characterized in that it is generated based on hash values for the identifiers of each of the users. According to clause 12,
The identifier for each of the users is,
An advertising method comprising at least one of a hardware identifier associated with a terminal of each of the users, a software identifier, or a temporary identifier temporarily assigned to each of the users. In the computer-readable recording medium on which a computer program for executing an advertising method to guarantee reach on a computer device is recorded,
The advertising method is,
storing and maintaining a mapping table in which user partitions representing users are mapped to advertisement partitions representing times at which advertisements are exposed;
confirming at least one advertising partition registered in at least one advertising campaign;
extracting at least one user partition mapped to the identified at least one advertising partition from the mapping table; and
Serving an advertisement corresponding to the at least one advertising campaign to the extracted at least one user partition.
A computer-readable recording medium containing a. In a computer device that performs an advertising method to ensure reach,
At least one processor configured to execute computer readable instructions
Including,
The at least one processor,
a storage and maintenance unit that stores and maintains a mapping table in which user partitions representing users are mapped to advertisement partitions representing times at which advertisements are exposed;
a confirmation unit that verifies 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 identified at least one advertisement partition from the mapping table; and
A serving unit that serves advertisements corresponding to the at least one advertising campaign to the extracted at least one user partition.
Computer devices including. In paragraph 15
The at least one processor,
A computer device, characterized in that it updates the mapping table by shuffling the user partitions and then mapping the shuffled user partitions to the advertising partitions. According to clause 16,
The at least one processor,
A computer device, characterized in that the mapping table is updated at the start of advertising serving of at least one other advertising campaign where advertising serving begins after advertising serving of the at least one advertising campaign ends. According to clause 16,
The at least one processor,
Starting advertising serving of the other at least one advertising campaign so that the updated mapping table is available at the start of advertising serving of the other at least one advertising campaign for which advertising serving begins after the advertising serving of the at least one advertising campaign ends. A computer device characterized in that the mapping table is updated and maintained in advance. According to clause 18,
The at least one processor,
A computer device, characterized in that: 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. According to clause 15,
The at least one processor,
A computer device characterized in that it evenly serves advertisements corresponding 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.