Loading...
Please wait, while we are loading the content...
Similar Documents
Nearest-neighbor caching for content-match applications (2009).
| Content Provider | CiteSeerX |
|---|---|
| Author | Pandey, Sandeep |
| Description | This content is published in WWW 2009 |
| Abstract | Motivated by contextual advertising systems and other web applications involving efficiency–accuracy tradeoffs, we study similarity caching. Here, a cache hit is said to occur if the requested item is similar but not necessarily equal to some cached item. We study two objectives that dictate the efficiency–accuracy tradeoff and provide our caching policies for these objectives. By conducting extensive experiments on real data we show similarity caching can significantly improve the efficiency of contextual advertising systems, with minimal impact on accuracy. Inspired by the above, we propose a simple generative model that embodies two fundamental characteristics of page requests arriving to advertising systems, namely, long-range dependences and similarities. We provide theoretical bounds on the gains of similarity caching in this model and demonstrate these gains empirically by fitting the actual data to the model. |
| File Format | |
| Publisher Date | 2009-01-01 |
| Access Restriction | Open |
| Subject Keyword | Nearest-neighbor Caching Content-match Application Similarity Caching Contextual Advertising System Efficiency Accuracy Tradeoff Cached Item Cache Hit Real Data Page Request Minimal Impact Requested Item Simple Generative Model Fundamental Characteristic Theoretical Bound Long-range Dependence Web Application Extensive Experiment Actual Data |
| Content Type | Text |
| Resource Type | Conference Proceedings |
