Not only Structured Query Language Method of Ad Request Processing.

V.A. NIKOLAIEV, O.I. KONASHEVYCH · Èlektronnoe modelirovanie · 2017

Method of Ad Request ProcessingVertaMedia Company's server provides operation of advertising exchange system between publishers (site's owners), advertisers and intermediaries (SSP 1 and DSP 2 platforms).The objective of the system server is to process a request from a Publisher's site as quickly as possible, choosing the most relevant advertisement campaign, to show it to a site's user.The system works real-time online and as faster it makes accurate choice, the more likely that a user will see an advertisement.The obvious solution was to use relational database to compare the parameters of queries with the parameters and settings of ad campaigns, stored in this database.However, it turned out to be unsuitable as such system showed high latency.VertaMedia TM programmers have found an original way to process data, in which comparison occurred in a flat table using the hash sum and a binary tree for matching ad campaigns and another part of the request, which contained a set of keywords/tags was processed by Sphinx Search as local software solution.A method incorporates the original decision to work with database management systemless non-relational tables and use of specialized software solutions for matching keywords.It showed remarkable results in performance of a resource-intensive process, as described in detail in the article.Ñåðâåð êîìïàíèè VertaMedia îáåñïå÷èâàåò ðàáîòó ðåêëàìíîé ñèñòåìû îáìåíà ìåæäó èçäàòåëÿìè (âëàäåëüöàìè ñàéòîâ), ðåêëàìîäàòåëåé è ïîñðåäíèêîâ (SSP 1 è DSP 2 ).Ñåðâåð ñèñòåìû äîëæåí îáðàáàòûâàòü çàïðîñû îò ñàéòîâ èçäàòåëåé òàê áûñòðî, íàñêîëüêî ýòî âîçìîæíî, âûáèðàÿ íàèáîëåå ïîäõîäÿùóþ ðåêëàìíóþ êàìïàíèþ, ÷òîáû ïîêàçàòü åe ïîëüçîâàòåëþ ñàéòà.Ñèñòåìà ðàáîòàåò â ðåàëüíîì âðåìåíè â èíòåðíåòå, è ÷åì áûñòðåå îíà äåëàåò òî÷íûé âûáîð, òåì áîëüøå âåðîÿòíîñòü òîãî, ÷òî ïîëüçîâàòåëü óâèäèò ðåêëàìó.Î÷åâèäíîå ðåøåíèå ñîñòîèò â èñïîëüçîâàíèè ðåëÿöèîííûõ áàç äàííûõ (ÁÄ) äëÿ ñðàâíåíèÿ ïàðàìåòðîâ çàïðîñîâ ñ ïàðàìåòðàìè è íàñòðîéêàìè ðåêëàìíûõ êàìïàíèé, êîòîðûå õðàíÿòñÿ â ÁÄ.Îäíàêî ýòî îêàçàëîñü íåäîñòàòî÷íî ýôôåêòèâíûì --ñèñòåìà ïîêàçàëà

Read the paper · More papers on PaperTik