CN107133818B - Method and system for settling online advertisements in Internet - Google Patents
Method and system for settling online advertisements in Internet Download PDFInfo
- Publication number
- CN107133818B CN107133818B CN201710278407.4A CN201710278407A CN107133818B CN 107133818 B CN107133818 B CN 107133818B CN 201710278407 A CN201710278407 A CN 201710278407A CN 107133818 B CN107133818 B CN 107133818B
- Authority
- CN
- China
- Prior art keywords
- advertisement
- advertiser
- settlement
- settled
- buffer queue
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/02—Marketing; Price estimation or determination; Fundraising
- G06Q30/0283—Price estimation or determination
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/02—Marketing; Price estimation or determination; Fundraising
- G06Q30/0241—Advertisements
- G06Q30/0273—Determination of fees for advertising
Landscapes
- Business, Economics & Management (AREA)
- Development Economics (AREA)
- Engineering & Computer Science (AREA)
- Accounting & Taxation (AREA)
- Strategic Management (AREA)
- Finance (AREA)
- Game Theory and Decision Science (AREA)
- Entrepreneurship & Innovation (AREA)
- Economics (AREA)
- Marketing (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The embodiment of the invention provides a settlement method and a settlement system for online advertisements in the Internet, wherein the settlement method comprises the following steps: analyzing at least one received advertisement to be settled to obtain key information of each advertisement to be settled, wherein the key information comprises an advertiser, an advertisement plan and a consumption value; performing primary aggregation on each advertisement to be settled according to the advertiser and the advertisement plan, and respectively pushing aggregated advertisement data into a buffer queue with a corresponding serial number of the advertiser; performing secondary aggregation on the aggregated advertisement data in each buffer queue to obtain at least one piece of settlement data, wherein each piece of settlement data represents the same advertisement plan under the same advertiser; and respectively calculating the advertisements to be settled according to the settlement data to obtain the payment amount of the corresponding advertiser. The settlement method of the online advertisement in the internet can reduce the number of logs and reduce the queue length through two-stage aggregation so as to improve the settlement speed and effectively control the advertisement over-delivery.
Description
Technical Field
The invention relates to the technical field of internet advertisement settlement, in particular to a settlement method and a settlement system for online advertisements in the internet.
Background
The existing online advertisement settlement is generally to calculate the amount of money consumed by an advertiser by a method of counting advertisement exposure or interaction logs, and when the consumed amount of money reaches or exceeds the limit set by the advertiser, the advertiser is notified to be offline. When one advertisement is off-line, no consumption is generated, and no bandwidth resource is occupied. However, the advertisement log amount increases with the increase of the advertisement exposure, and if the log amount increases rapidly in a short time or a large amount of advertisements are delivered by the same advertiser, the settlement or the processing upper limit of the database is reached, and the redundant logs cannot be processed in time, so that the advertisement offline notification cannot be sent in time, the advertisements are delivered all the time, bandwidth resources are occupied, and the advertisement income cannot be brought.
The prior method for solving the problem of advertisement overspray generally comprises the following steps: and (4) delaying settlement, namely after the limit set by the advertiser is reached, if the advertisements to be charged still arrive, continuing to charge until all the advertisements are counted. And secondly, the contract is agreed to settle the amount of money exceeding the set limit by a certain proportion, for example, the limit set by the advertiser is 1 ten thousand yuan, the accepted excess investment proportion agreed by the contract is 10%, and the actual settled amount of money is 1.1 ten thousand yuan.
In the process of implementing the invention, the inventor finds that at least the following problems exist in the prior art: the existing method cannot essentially solve the problem of advertisement overspray, only compensates the loss caused by the overspray to a certain extent, and some of the compensation is based on infringing the benefits of advertisers.
Disclosure of Invention
The embodiment of the invention provides a settlement method and a settlement system for online advertisements in the Internet, which can effectively control the advertisement over-delivery.
In one aspect, an embodiment of the present invention provides a settlement method for online advertisements in the internet, where the settlement method includes:
analyzing at least one received advertisement to be settled to obtain key information of each advertisement to be settled, wherein the key information of the advertisement to be settled comprises an advertiser, an advertisement plan and a consumption value;
performing primary aggregation on each advertisement to be settled according to the advertiser and the advertisement plan, and respectively pushing aggregated advertisement data into a buffer queue with a corresponding serial number of the advertiser;
performing secondary aggregation on the aggregated advertisement data in each buffer queue to obtain at least one piece of settlement data, wherein each piece of settlement data represents the same advertisement plan under the same advertiser;
and respectively calculating the advertisements to be settled according to the settlement data to obtain the payment amount of the corresponding advertiser.
Optionally, the performing of first-level aggregation on each advertisement to be settled according to the advertiser and the advertisement plan specifically includes:
aggregating logs of the same advertisement plan under the same advertiser, combining consumption values, and obtaining aggregated advertisement data, aggregated number, aggregated consumption values, first time and second time of each advertisement plan under each advertiser; the first time represents the time difference between the current moment when the advertisement to be settled is received and the moment when the aggregated advertisement data is pushed into the buffer queue at the previous time, and the second time represents the time difference between the current moment when the advertisement to be settled is received and the moment when the advertisement to be settled is received at the previous time;
aiming at each advertisement plan of each advertiser, judging whether the first time reaches a first time threshold value, if so, pushing the corresponding aggregated advertisement data to a buffer queue of the corresponding serial number of the advertiser; otherwise, at least one of the following judgments is executed:
judging whether the number of the aggregation pieces reaches a piece number threshold value, judging whether the aggregation consumption value reaches a consumption threshold value, and judging whether the second time is greater than a second time threshold value;
if any one of the three judged judgment results is yes, pushing the corresponding aggregated advertisement data to a buffer queue of the corresponding serial number of the advertiser;
otherwise, no action is taken.
Optionally, the sequence number of the buffer queue is determined according to the following formula:
i-advertiser ID% I, where I denotes the number of buffer queues, I-1, 2.
Optionally, the performing second-stage aggregation on each aggregated advertisement data in each buffer queue to obtain at least one piece of settlement data specifically includes:
acquiring the current queue length of each buffer queue;
determining the quantity of extracted elements according to the length of the current queue, and extracting the elements with the corresponding quantity from the corresponding buffer queue;
and aggregating the extracted elements according to the same advertisement plan under the same advertiser to obtain at least one piece of settlement data.
Optionally, the number of the extracted elements is determined according to the following formula:
ni＝αi·liwherein n isiIndicating the number of extracted elements corresponding to buffer queue i, αiSpeed factor representing buffer queue number i，liIndicating the current queue length of the buffer queue # i.
The technical scheme has the following beneficial effects: analyzing the received settlement advertisement, performing primary aggregation on the advertisement to be settled according to the advertiser and the advertisement plan, and respectively pushing aggregated advertisement data into a buffer queue with a corresponding serial number of the advertiser, so that the number of logs of the advertisement plan can be reduced; by carrying out two-stage aggregation on the aggregated advertisement data in each buffer queue, the queue length can be reduced, the settlement speed is improved, and the advertisement over-delivery is effectively controlled.
In another aspect, an embodiment of the present invention provides a settlement system for online advertisements in the internet, where the settlement system includes:
the system comprises an analyzing unit, a calculating unit and a calculating unit, wherein the analyzing unit is used for analyzing at least one received advertisement to be settled to obtain key information of each advertisement to be settled, and the key information of the advertisement to be settled comprises an advertiser, an advertisement plan and a consumption value;
the first-stage aggregation unit is used for performing first-stage aggregation on the advertisements to be settled according to the advertisers and the advertisement plans and pushing aggregated advertisement data to a buffer queue of the corresponding serial numbers of the advertisers;
the buffer unit is internally provided with buffer queues with different serial numbers;
the second-stage aggregation unit is used for performing second-stage aggregation on the advertisement data in each buffer queue to obtain at least one piece of settlement data, wherein each piece of settlement data represents the same advertisement plan under the same advertiser;
and the settlement unit is used for calculating the advertisement to be settled according to each settlement data to obtain the payment amount of the corresponding advertiser.
Optionally, the primary aggregation unit specifically includes a primary aggregation module, a first judgment module, a second judgment module, and a push module;
the first-stage aggregation module is used for aggregating logs of the same advertisement plan under the same advertiser, combining consumption values and obtaining aggregated advertisement data, aggregated number, aggregated consumption values, first time and second time of each advertisement plan under each advertiser; the first time represents the time difference between the current moment when the advertisement to be settled is received and the moment when the aggregated advertisement data is pushed into the buffer queue at the previous time, and the second time represents the time difference between the current moment when the advertisement to be settled is received and the moment when the advertisement to be settled is received at the previous time;
the first judging module is used for judging whether the first time reaches a first time threshold value or not aiming at each advertisement plan of each advertiser;
the pushing module is used for pushing the corresponding aggregated advertisement data to the buffer queue of the corresponding serial number of the advertiser when the judgment result of the first judging module is yes;
the second judging module is configured to, when the judgment result of the first judging module is negative, perform at least one of the following judgments:
judging whether the number of the aggregation pieces reaches a piece number threshold value, judging whether the aggregation consumption value reaches a consumption threshold value, and judging whether the second time difference value is larger than a second time threshold value;
the pushing module is further configured to, when any one of the three determination results of the second determining module is yes, push the corresponding aggregated advertisement data to a buffer queue of a corresponding sequence number of an advertiser; and when the judgment result of the second judgment module is negative, no action is performed.
Optionally, the sequence number of the buffer queue in the buffer unit is determined according to the following formula:
i-advertiser ID% I, where I denotes the number of buffer queues, I-1, 2.
Optionally, the secondary polymerization unit includes:
the acquisition module is used for acquiring the current queue length of each buffer queue;
the extraction module is used for determining the number of extracted elements according to the length of the current queue and extracting the elements with the corresponding number from the corresponding buffer queue;
and the second-stage aggregation module is used for aggregating the extracted elements according to the same advertisement plan under the same advertiser to obtain at least one piece of settlement data.
Optionally, the extraction module determines the number of extraction elements according to the following formula:
ni＝αi·liwherein n isiIndicating the number of extracted elements corresponding to buffer queue i, αiRepresenting the speed factor, l, of the buffer queue # iiIndicating the current queue length of the buffer queue # i.
The technical scheme has the following beneficial effects: analyzing the received advertisement to be settled by setting an analyzing unit, a primary aggregation unit and a buffer unit, performing primary aggregation on the advertisement to be settled according to the advertiser and the advertisement plan, and respectively pushing aggregated advertisement data into buffer queues with different serial numbers, so that the number of logs of the advertisement plan can be reduced; by arranging the second-stage aggregation unit and the settlement unit, the second-stage aggregation can be performed on the aggregated advertisement data in each buffer queue, the queue length can be reduced, the settlement speed is increased, and the advertisement over-casting is effectively controlled.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
FIG. 1 is a flow chart of a method for settling online advertisements in the Internet according to an embodiment of the present invention;
FIG. 2 is a flow chart of a first-level aggregation method in a settlement method for online advertisements in the Internet according to an embodiment of the present invention;
FIG. 3 is a diagram of a specific embodiment of log aggregation of a first-level aggregation method in the settlement method of online advertisements in the Internet according to the embodiment of the present invention;
FIG. 4 is a flowchart of a second-level aggregation method in a settlement method for online advertisements in the Internet according to an embodiment of the present invention;
fig. 5 is a schematic structural diagram of a settlement system for online advertisements in the internet according to an embodiment of the present invention.
Description of the symbols:
an analysis unit-1, a primary polymerization unit-2, a buffer unit-3, a secondary polymerization unit-4, and a settlement unit-5.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The invention aims to provide a settlement method for online advertisements in the Internet, which can reduce the log quantity of advertisement plans by analyzing received settlement advertisements, performing primary aggregation on the advertisements to be settled according to the advertisement owners and the advertisement plans and respectively pushing aggregated advertisement data into buffer queues with corresponding serial numbers of the advertisers; by carrying out two-stage aggregation on the aggregated advertisement data in each buffer queue, the queue length can be reduced, the settlement speed is improved, and the advertisement over-delivery is effectively controlled.
The advertiser is a person who puts advertisements, and can create a plurality of advertisement plans for putting advertisements; the advertisement plan is designed to refer to a specific advertisement object, is created by an advertiser and is the minimum granularity of settlement; the malicious overdose of the advertiser refers to the behavior that the advertiser cheats the flow through the overdose operation by utilizing the loophole of the overdose caused by the settlement delay after the advertisement reaches the release limit.
In order to make the aforementioned objects, features and advantages of the present invention comprehensible, embodiments accompanied with figures are described in further detail below.
As shown in fig. 1, the settlement method for online advertisements in the internet of the present invention includes:
step 100: analyzing the received at least one advertisement to be settled to obtain key information of each advertisement to be settled; the key information of the advertisement to be settled comprises an advertiser, an advertisement plan and a consumption value.
Step 200: and performing primary aggregation on the advertisements to be settled according to the advertisers and the advertisement plans, and respectively pushing aggregated advertisement data into buffer queues of corresponding serial numbers of the advertisers.
Step 300: and performing secondary aggregation on the aggregated advertisement data in each buffer queue to obtain at least one piece of settlement data, wherein each piece of settlement data represents the same advertisement plan under the same advertiser.
Step 400: and calculating the advertisement to be settled according to the settlement data to obtain the payment amount of the corresponding advertiser.
The method can accurately determine whether each advertisement to be settled is the advertisement delivered by the same advertiser or not according to the ID of the advertiser, and can accurately determine the same advertisement plan under the same advertiser according to the ID of the advertisement plan.
As shown in fig. 2, in step 200, the performing of first-level aggregation on each advertisement to be settled according to the advertiser and the advertisement plan specifically includes:
step 201: and aggregating logs of the same advertisement plan under the same advertiser, and combining the consumption values to obtain aggregated advertisement data, the number of aggregates, the aggregated consumption value, the first time and the second time of each advertisement plan under each advertiser.
The first time represents the time difference between the current time when the advertisement to be settled is received and the time when the aggregated advertisement data is pushed into the buffer queue at the previous time, and the second time represents the time difference between the current time when the advertisement to be settled is received and the time when the advertisement to be settled is received at the previous time.
As shown in FIG. 3, by aggregating the logs, the consumption value (i.e., the consumption amount) of each advertisement campaign under each advertiser may be determined.
Step 202: for each advertisement plan of each advertiser, judging whether the first time reaches a first time threshold value, if so, executing a step 204; otherwise, at least one of the steps 203a, 203b and 203c is executed:
step 203 a: judging whether the number of the aggregation pieces reaches the threshold value of the number of the aggregation pieces, and a step 203 b: judging whether the aggregate consumption value reaches the consumption threshold value, step 203 c: judging whether the second time is greater than a second time threshold value; if any one of the judgment results of the three judgments in the steps 203a to 203c is yes, executing a step 204; otherwise, no action is taken.
Step 204: and pushing the corresponding aggregated advertisement data to a buffer queue of the corresponding serial number of the advertiser.
At least one of the three determinations in steps 203a to 203c may be performed, so that the pushing of the aggregated advertisement data may be implemented. Further, by respectively executing the three determinations in steps 203a to 203c, when the corresponding aggregation number does not reach the number threshold, the aggregation consumption value does not reach the consumption threshold, and the second time difference is less than or equal to the second time threshold, no action is performed until the corresponding threshold is reached, and by screening the maximum limiting condition, the advertisement data in the maximum range is obtained for pushing, thereby avoiding omission of settlement advertisement information and ensuring the accuracy of settlement.
The first time threshold, the second time threshold, the number threshold and the consumption threshold can be configured and adjusted according to needs.
Optionally, the sequence number of the buffer queue is determined according to the following formula:
i-advertiser ID% I, where I denotes the number of buffer queues, I-1, 2.
As shown in fig. 4, in step 300, performing secondary aggregation on each aggregated advertisement data in each buffer queue to obtain at least one piece of settlement data specifically includes:
step 301: and acquiring the current queue length of each buffer queue.
Step 302: and determining the quantity of the extracted elements according to the length of the current queue, and extracting the elements with the corresponding quantity from the corresponding buffer queue.
Step 303: and aggregating the extracted elements according to the same advertisement plan under the same advertiser to obtain at least one piece of settlement data.
Wherein the number of the decimation elements is determined according to the following formula:
ni＝αi·liwherein n isiIndicating the number of extracted elements corresponding to buffer queue i, αiRepresenting the speed factor, l, of the buffer queue # iiIndicating the current queue length of the buffer queue # i. The speed factor can be adjusted according to factors such as processing progress or advertisement putting quantity, and the like, so that settlement progress is accelerated.
For example, if the current queue length in the buffer queue No. 3 is 1000 and the corresponding speed factor is 0.1, the number of elements extracted from the buffer queue No. 3 is 100.
The settlement method of the online advertisement starts from the reason of the advertisement overdose, and prevents the occurrence of the overdose to a great extent on the basis of not damaging the benefits of any party through two-stage polymerization; and the parameters of the two-stage polymerization can be adjusted, so that the adjustment of subsequent parameters is facilitated, the effect is optimized, the super-input rate is continuously reduced, and the settlement speed is increased.
As shown in fig. 5, the settlement system for online advertisements in the internet of the present invention includes a parsing unit 1, a first-level aggregation unit 2, a buffer unit 3, a second-level aggregation unit 4, and a settlement unit 5.
The analysis unit 1 analyzes at least one received advertisement to be settled to obtain key information of each advertisement to be settled, wherein the key information of the advertisement to be settled comprises an advertiser, an advertisement plan and a consumption value; the primary aggregation unit 2 performs primary aggregation on the advertisements to be settled according to the advertisers and the advertisement plans; the buffer unit 3 is internally provided with buffer queues with different serial numbers, and the primary aggregation unit 2 pushes aggregated advertisement data to the buffer queues with the serial numbers corresponding to advertisers; the second-stage aggregation unit 4 performs second-stage aggregation on the advertisement data in each buffer queue to obtain at least one piece of settlement data, wherein each piece of settlement data represents the same advertisement plan under the same advertiser; the settlement unit 5 calculates the advertisement to be settled according to each settlement data, and obtains the payment amount of the corresponding advertiser.
The primary aggregation unit 2 specifically includes a primary aggregation module, a first determination module, a second determination module, and a pushing module.
The first-stage aggregation module aggregates logs of the same advertisement plan under the same advertiser, combines consumption values, and obtains aggregated advertisement data, aggregated number, aggregated consumption values, first time and second time of each advertisement plan under each advertiser; the first time represents the time difference between the current time when the advertisement to be settled is received and the time when the aggregated advertisement data is pushed into the buffer queue at the previous time, and the second time represents the time difference between the current time when the advertisement to be settled is received and the time when the advertisement to be settled is received at the previous time.
The first judging module judges whether the first time reaches a first time threshold value or not according to each advertisement plan of each advertiser. And the pushing module pushes the corresponding aggregated advertisement data to a buffer queue of the corresponding serial number of the advertiser when the judgment result of the first judgment module is yes.
The second judging module executes at least one of the following judgments when the judging result of the first judging module is negative:
judging whether the number of the aggregation pieces reaches a piece number threshold value, judging whether the aggregation consumption value reaches a consumption threshold value, and judging whether the second time difference value is larger than a second time threshold value;
the pushing module is further configured to, when any one of the three determination results of the second determining module is yes, push the corresponding aggregated advertisement data to a buffer queue of a corresponding sequence number of an advertiser; and when the judgment result of the second judgment module is negative, no action is performed.
Preferably, the sequence number of the buffer queue in the buffer unit is determined according to the following formula:
i-advertiser ID% I, where I denotes the number of buffer queues, I-1, 2.
Further, the secondary aggregation unit 4 includes an acquisition module, an extraction module, and a secondary aggregation module; the obtaining module obtains the current queue length of each buffer queue; the extraction module determines the number of extracted elements according to the length of the current queue and extracts the elements with the corresponding number from the corresponding buffer queue; and the secondary aggregation module aggregates the extracted elements according to the same advertisement plan under the same advertiser to obtain at least one piece of settlement data.
Preferably, the obtaining module, the extracting module and the secondary aggregation module form a group, which is a processing thread to process advertisement data in a buffer sequence, in order to increase the processing speed, a plurality of processing threads may be disposed in the secondary aggregation unit 4, and each processing thread corresponds to the buffer queue one by one, so that a plurality of ready-made processing modules can process the corresponding buffer queues at the same time, and the processing speed can be effectively increased.
Wherein the extraction module determines the number of extraction elements according to the following formula:
ni＝αi·liwherein n isiIndicating the number of extracted elements corresponding to buffer queue i, αiRepresenting the speed factor, l, of the buffer queue # iiIndicating the current queue length of the buffer queue # i.
Compared with the prior art, the settlement system for the online advertisements in the internet has the same beneficial effects as the settlement method for the online advertisements in the internet, and the detailed description is omitted.
It should be understood that the specific order or hierarchy of steps in the processes disclosed is an example of exemplary approaches. Based upon design preferences, it is understood that the specific order or hierarchy of steps in the processes may be rearranged without departing from the scope of the present disclosure. The accompanying method claims present elements of the various steps in a sample order, and are not intended to be limited to the specific order or hierarchy presented.
In the foregoing detailed description, various features are grouped together in a single embodiment for the purpose of streamlining the disclosure. This method of disclosure is not to be interpreted as reflecting an intention that the claimed embodiments of the subject matter require more features than are expressly recited in each claim. Rather, as the following claims reflect, invention lies in less than all features of a single disclosed embodiment. Thus, the following claims are hereby expressly incorporated into the detailed description, with each claim standing on its own as a separate preferred embodiment of the invention.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. To those skilled in the art; various modifications to these embodiments will be readily apparent, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the disclosure. Thus, the present disclosure is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
What has been described above includes examples of one or more embodiments. It is, of course, not possible to describe every conceivable combination of components or methodologies for purposes of describing the aforementioned embodiments, but one of ordinary skill in the art may recognize that many further combinations and permutations of various embodiments are possible. Accordingly, the embodiments described herein are intended to embrace all such alterations, modifications and variations that fall within the scope of the appended claims. Furthermore, to the extent that the term "includes" is used in either the detailed description or the claims, such term is intended to be inclusive in a manner similar to the term "comprising" as "comprising" is interpreted when employed as a transitional word in a claim. Furthermore, any use of the term "or" in the specification of the claims is intended to mean a "non-exclusive or".
Those of skill in the art will further appreciate that the various illustrative logical blocks, units, and steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both. To clearly illustrate the interchangeability of hardware and software, various illustrative components, elements, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware or software depends upon the particular application and design requirements of the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present embodiments.
The various illustrative logical blocks, or elements, described in connection with the embodiments disclosed herein may be implemented or performed with a general purpose processor, a digital signal processor, an Application Specific Integrated Circuit (ASIC), a field programmable gate array or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A general-purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices, e.g., a digital signal processor and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a digital signal processor core, or any other similar configuration.
The steps of a method or algorithm described in connection with the embodiments disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. A software module may be stored in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art. For example, a storage medium may be coupled to the processor such the processor can read information from, and write information to, the storage medium. In the alternative, the storage medium may be integral to the processor. The processor and the storage medium may reside in an ASIC, which may be located in a user terminal. In the alternative, the processor and the storage medium may reside in different components in a user terminal.
In one or more exemplary designs, the functions described above in connection with the embodiments of the invention may be implemented in hardware, software, firmware, or any combination of the three. If implemented in software, the functions may be stored on or transmitted over as one or more instructions or code on a computer-readable medium. Computer-readable media includes both computer storage media and communication media that facilitate transfer of a computer program from one place to another. Storage media may be any available media that can be accessed by a general purpose or special purpose computer. For example, such computer-readable media can include, but is not limited to, RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to carry or store program code in the form of instructions or data structures and which can be read by a general-purpose or special-purpose computer, or a general-purpose or special-purpose processor. Additionally, any connection is properly termed a computer-readable medium, and, thus, is included if the software is transmitted from a website, server, or other remote source via a coaxial cable, fiber optic cable, twisted pair, Digital Subscriber Line (DSL), or wirelessly, e.g., infrared, radio, and microwave. Such discs (disk) and disks (disc) include compact disks, laser disks, optical disks, DVDs, floppy disks and blu-ray disks where disks usually reproduce data magnetically, while disks usually reproduce data optically with lasers. Combinations of the above may also be included in the computer-readable medium.
The above-mentioned embodiments are intended to illustrate the objects, technical solutions and advantages of the present invention in further detail, and it should be understood that the above-mentioned embodiments are merely exemplary embodiments of the present invention, and are not intended to limit the scope of the present invention, and any modifications, equivalent substitutions, improvements and the like made within the spirit and principle of the present invention should be included in the scope of the present invention.
Claims (10)
1. A settlement method for online advertisements in the internet, the settlement method comprising:
analyzing at least one received advertisement to be settled to obtain key information of each advertisement to be settled, wherein the key information of the advertisement to be settled comprises an advertiser, an advertisement plan and a consumption value;
performing primary aggregation on each advertisement to be settled according to the advertiser and the advertisement plan, and respectively pushing aggregated advertisement data into a buffer queue with a corresponding serial number of the advertiser;
performing secondary aggregation on the aggregated advertisement data in each buffer queue to obtain at least one piece of settlement data, wherein each piece of settlement data represents the same advertisement plan under the same advertiser;
and respectively calculating the advertisements to be settled according to the settlement data to obtain the payment amount of the corresponding advertiser.
2. A settlement method for online advertisements in the internet as claimed in claim 1, wherein said performing a first-level aggregation of each advertisement to be settled according to the advertiser and the advertisement plan specifically comprises:
aggregating logs of the same advertisement plan under the same advertiser, combining consumption values, and obtaining aggregated advertisement data, aggregated number, aggregated consumption values, first time and second time of each advertisement plan under each advertiser; the first time represents the time difference between the current moment when the advertisement to be settled is received and the moment when the aggregated advertisement data is pushed into the buffer queue at the previous time, and the second time represents the time difference between the current moment when the advertisement to be settled is received and the moment when the advertisement to be settled is received at the previous time;
aiming at each advertisement plan of each advertiser, judging whether the first time reaches a first time threshold value, if so, pushing the corresponding aggregated advertisement data to a buffer queue of the corresponding serial number of the advertiser; otherwise, at least one of the following judgments is executed:
judging whether the number of the aggregation pieces reaches a piece number threshold value, judging whether the aggregation consumption value reaches a consumption threshold value, and judging whether the second time is greater than a second time threshold value;
if any one of the three judged judgment results is yes, pushing the corresponding aggregated advertisement data to a buffer queue of the corresponding serial number of the advertiser;
otherwise, no action is taken.
3. A settlement method for online advertisements in the internet according to claim 1 or 2, wherein the sequence number of the buffer queue is determined according to the following formula:
i-advertiser ID% I, where I denotes the number of buffer queues, I-1, 2.
4. A settlement method for online advertisements in the internet as claimed in claim 1, wherein the performing of the second-stage aggregation on each aggregated advertisement data in each buffer queue to obtain at least one piece of settlement data specifically comprises:
acquiring the current queue length of each buffer queue;
determining the quantity of extracted elements according to the length of the current queue, and extracting the elements with the corresponding quantity from the corresponding buffer queue;
and aggregating the extracted elements according to the same advertisement plan of the same advertiser to obtain at least one piece of settlement data.
5. A settlement method for online advertisements on the internet as claimed in claim 4, wherein the number of the extracted elements is determined according to the following formula:
ni＝αi·liwherein n isiIndicating the number of extracted elements corresponding to buffer queue i, αiRepresenting the speed factor, l, of the buffer queue # iiIndicating the current queue length of the buffer queue # i.
6. A settlement system for online advertisements in the internet, the settlement system comprising:
the system comprises an analyzing unit, a calculating unit and a calculating unit, wherein the analyzing unit is used for analyzing at least one received advertisement to be settled to obtain key information of each advertisement to be settled, and the key information of the advertisement to be settled comprises an advertiser, an advertisement plan and a consumption value;
the first-stage aggregation unit is used for performing first-stage aggregation on the advertisements to be settled according to the advertisers and the advertisement plans and pushing aggregated advertisement data to a buffer queue of the corresponding serial numbers of the advertisers;
the buffer unit is internally provided with buffer queues with different serial numbers;
the second-stage aggregation unit is used for performing second-stage aggregation on the advertisement data in each buffer queue to obtain at least one piece of settlement data, wherein each piece of settlement data represents the same advertisement plan under the same advertiser;
and the settlement unit is used for calculating the advertisement to be settled according to each settlement data to obtain the payment amount of the corresponding advertiser.
7. The system for settling accounts for online advertisements in the internet as claimed in claim 6, wherein the primary aggregation unit specifically comprises a primary aggregation module, a first judgment module, a second judgment module and a push module;
the first-stage aggregation module is used for aggregating logs of the same advertisement plan under the same advertiser, combining consumption values and obtaining aggregated advertisement data, aggregated number, aggregated consumption values, first time and second time of each advertisement plan under each advertiser; the first time represents the time difference between the current moment when the advertisement to be settled is received and the moment when the aggregated advertisement data is pushed into the buffer queue at the previous time, and the second time represents the time difference between the current moment when the advertisement to be settled is received and the moment when the advertisement to be settled is received at the previous time;
the first judging module is used for judging whether the first time reaches a first time threshold value or not aiming at each advertisement plan of each advertiser;
the pushing module is used for pushing the corresponding aggregated advertisement data to the buffer queue of the corresponding serial number of the advertiser when the judgment result of the first judging module is yes;
the second judging module is configured to, when the judgment result of the first judging module is negative, perform at least one of the following judgments:
judging whether the number of the aggregation pieces reaches a piece number threshold value, judging whether the aggregation consumption value reaches a consumption threshold value, and judging whether the second time difference value is larger than a second time threshold value;
the pushing module is further configured to, when any one of the three determination results of the second determining module is yes, push the corresponding aggregated advertisement data to a buffer queue of a corresponding sequence number of an advertiser; and when the judgment result of the second judgment module is negative, no action is performed.
8. A settlement system for on-line advertisement in internet as claimed in claim 6 or 7, wherein the sequence number of the buffer queue in the buffer unit is determined according to the following formula:
i-advertiser ID% I, where I denotes the number of buffer queues, I-1, 2.
9. A settlement system for online advertisement in the internet as claimed in claim 6, wherein the secondary aggregation unit comprises:
the acquisition module is used for acquiring the current queue length of each buffer queue;
the extraction module is used for determining the number of extracted elements according to the length of the current queue and extracting the elements with the corresponding number from the corresponding buffer queue;
and the second-stage aggregation module is used for aggregating the extracted elements according to the same advertisement plan under the same advertiser to obtain at least one piece of settlement data.
10. A settlement system for online advertisements on the internet as claimed in claim 9, wherein the extraction module determines the number of the extraction elements according to the following formula:
ni＝αi·liwherein n isiRepresenting the number of the extraction elements corresponding to the buffer queue IVolume, αiRepresenting the speed factor, l, of the buffer queue # iiIndicating the current queue length of the buffer queue # i.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710278407.4A CN107133818B (en) | 2017-04-25 | 2017-04-25 | Method and system for settling online advertisements in Internet |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710278407.4A CN107133818B (en) | 2017-04-25 | 2017-04-25 | Method and system for settling online advertisements in Internet |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107133818A CN107133818A (en) | 2017-09-05 |
| CN107133818B true CN107133818B (en) | 2020-10-09 |
Family
ID=59716646
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710278407.4A Active CN107133818B (en) | 2017-04-25 | 2017-04-25 | Method and system for settling online advertisements in Internet |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107133818B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107886352B (en) * | 2017-10-27 | 2021-11-19 | 微梦创科网络科技（中国）有限公司 | Advertisement settlement method and system |
| CN109919674B (en) * | 2019-03-04 | 2021-06-01 | 厦门美图之家科技有限公司 | Advertisement settlement method, device and equipment |
| CN112241899A (en) * | 2019-07-19 | 2021-01-19 | 上海哔哩哔哩科技有限公司 | Advertisement charging method, device and system and readable storage medium |
| CN112433886A (en) * | 2020-11-24 | 2021-03-02 | 厦门美图之家科技有限公司 | Data processing method and device, server and storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2006115911A3 (en) * | 2005-04-26 | 2006-12-28 | Governing Dynamics Inc | A method of digital good placement in a dynamic, real time environment |
| CN101022353A (en) * | 2006-10-10 | 2007-08-22 | 鲍东山 | Directional stream media advertisement insert-cut system |
| CN103578010A (en) * | 2012-07-26 | 2014-02-12 | 阿里巴巴集团控股有限公司 | Method and device generating flow quality comparison parameters and advertisement billing method |
| CN104753975A (en) * | 2013-12-26 | 2015-07-01 | 腾讯科技（北京）有限公司 | Method and system for controlling release of network medium information |
| CN105303394A (en) * | 2014-06-12 | 2016-02-03 | 紫格网络科技（上海）有限公司 | Network advertisement placement method and system based on web search engine |
| CN106204136A (en) * | 2016-07-08 | 2016-12-07 | 合网络技术（北京）有限公司 | A kind of advertisement delivery system and advertisement placement method |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140046777A1 (en) * | 2009-08-14 | 2014-02-13 | Dataxu, Inc. | Methods and systems for using consumer aliases and identifiers |
| US20130305269A1 (en) * | 2012-05-09 | 2013-11-14 | Opentv, Inc. | High definition playback verification |
-
2017
- 2017-04-25 CN CN201710278407.4A patent/CN107133818B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2006115911A3 (en) * | 2005-04-26 | 2006-12-28 | Governing Dynamics Inc | A method of digital good placement in a dynamic, real time environment |
| CN101022353A (en) * | 2006-10-10 | 2007-08-22 | 鲍东山 | Directional stream media advertisement insert-cut system |
| CN103578010A (en) * | 2012-07-26 | 2014-02-12 | 阿里巴巴集团控股有限公司 | Method and device generating flow quality comparison parameters and advertisement billing method |
| CN104753975A (en) * | 2013-12-26 | 2015-07-01 | 腾讯科技（北京）有限公司 | Method and system for controlling release of network medium information |
| CN105303394A (en) * | 2014-06-12 | 2016-02-03 | 紫格网络科技（上海）有限公司 | Network advertisement placement method and system based on web search engine |
| CN106204136A (en) * | 2016-07-08 | 2016-12-07 | 合网络技术（北京）有限公司 | A kind of advertisement delivery system and advertisement placement method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107133818A (en) | 2017-09-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107133818B (en) | Method and system for settling online advertisements in Internet | |
| US20200372424A1 (en) | System and method for generating risk-control rules | |
| CN107122369B (en) | Service data processing method, device and system | |
| WO2021051529A1 (en) | Method, apparatus and device for estimating cloud host resources, and storage medium | |
| CN107886352B (en) | Advertisement settlement method and system | |
| CN116383190A (en) | Intelligent cleaning method and system for massive big data | |
| CN111600894B (en) | Network attack detection method and device | |
| CN110347568A (en) | The treating method and apparatus of user behavior data | |
| CN110347566B (en) | Method and device for evaluating effectiveness of registration wind control model | |
| CN111951008A (en) | Risk prediction method and device, electronic equipment and readable storage medium | |
| CN105245351A (en) | Charging method and device | |
| CN106484671B (en) | A kind of recognition methods of timeliness inquiry content | |
| CN113055751A (en) | Data processing method and device, electronic equipment and storage medium | |
| CN114997879A (en) | Payment routing method, device, equipment and storage medium | |
| CN113220741B (en) | Internet advertisement false traffic identification method, system, equipment and storage medium | |
| CN112685610B (en) | False registration account identification method and related device | |
| CN111429257A (en) | Transaction monitoring method and device | |
| CN113610633A (en) | Method and device for setting identity verification mode | |
| CN112561687A (en) | Multithreading account fund asynchronous processing method | |
| CN110880101A (en) | Data processing method, device, server and storage medium thereof | |
| CN112583414A (en) | Scene processing method, device, equipment, storage medium and product | |
| CN112087310B (en) | Charging processing method, device and computer readable storage medium | |
| CN104951976A (en) | System and method for obtaining exchange gains/losses during bill verification | |
| CN113722442B (en) | Linkage analysis method based on keyword recognition and related products | |
| CN113051444B (en) | Method and device for automatically distributing content classification category |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |