Online advertising has seen great growth over the past few years. Advertisers have gotten better results with campaigns targeted at more specific audiences. Ad networks with few visits are unable to create such campaigns and hence are moving forward towards a new model, consisting of a huge global ad exchange market. In this market millions of advertisers compete for the ad space so that their ad will be shown to users upon visiting a page. In selecting the best candidate from all possibilities algorithms able to process advertiser's requirements in tenths of seconds are needed. To face this problem we have developed algorithms using techniques such as threads, AVL trees with hash, multiple node trees or Hadoop technology. Throughout this article we will show the results gained from each algorithm, a comparative performance analysis and some conclusions. We have also proposed some future lines of work.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.