Xiao Bai
ABSTRACT
Several social networking applications enable users to view the events generated by other users, typically friends in the social network, in the form of ``news feeds''. Friends and events are typically maintained per user and cached in memory to enable efficient generation of news feeds. Caching user friends and events, however, raises concerns about the freshness of news feeds as users may not observe the most recent events when cache content becomes stale. Mechanisms to keep cache content fresh are thus critical for user satisfaction while computing news feeds efficiently through caching.
We propose a novel cache scheme called SOCR (Social Online Cache Refreshing) for identifying and refreshing cache entries. SOCR refreshes the cache in an online manner and does not require the backend data store to push updates to the cache. SOCR uses a utility-based strategy to accurately identify cache entries that need to be refreshed. The basic idea is to estimate at the time of each request to generate news feed whether refreshing would lead to different results for a news feed. To make such estimation, we model the rates of changes to social networks and events, and assess the performance of SOCR by analyzing datasets from Facebook and Yahoo! News Activity. Our experimental evaluation shows that the utility-based strategy ensures fresh news feeds (43% fewer stales) and efficient news feed responses (51% fewer false positives) compared to the TTL-based strategy. SOCR also reduces data transmission between the backend data store and the cache by 27% compared to a hybrid push-pull cache refreshing scheme.
- S. Alici, I. S. Altingovde, R. Ozcan, B. B. Cambazoglu, and O. Ulusoy. Timestamp-based result cache invalidation for web search engines. In SIGIR, 2011. Google Scholar
Digital Library
- X. Bai and F. P. Junqueira. Online result cache invalidation for real-time web search. In SIGIR, 2012. Google ScholarDigital Library
- B. B. Cambazoglu, F. P. Junqueira, V. Plachouras, S. Banachowski, B. Cui, S. Lim, and B. Bridge. A refreshing perspective of search engine caching. In WWW, 2010. Google ScholarDigital Library
- B. Chandramouli and J. Yang. End-to-end support for joins in large-scale publish/subscribe systems. Proc. VLDB Endow., 1(1):434--450, 2008. Google ScholarDigital Library
- H. Gupta. Selection of views to materialize in a data warehouse. In ICDT, 1997. Google ScholarDigital Library
- A. Y. Halevy. Answering queries using views: A survey. The VLDB Journal, 10(4):270--294, Dec. 2001. Google ScholarDigital Library
- F. P. Junqueira, V. Leroy, M. Serafini, and A. Silberstein. Shepherding social feed generation with sheep. In SNS, 2012. Google ScholarDigital Library
- M. Sarwat, J. Bao, A. Eldawy, J. J. Levandoski, A. Magdy, and M. F. Mokbel. Sindbad: a location-based social networking system. In SIGMOD, 2012. Google ScholarDigital Library
- A. Silberstein, J. Terrace, B. F. Cooper, and R. Ramakrishnan. Feeding frenzy: selectively materializing users' event feeds. In SIGMOD, 2010. Google ScholarDigital Library
- Y. Zhou, A. Salehi, and K. Aberer. Scalable delivery of stream query result. Proc. VLDB Endow., 2(1):49--60, 2009. Google ScholarDigital Library
Index Terms
- Cache refreshing for online social news feeds
Recommendations
Location cache: a low-power L2 cache system
ISLPED '04: Proceedings of the 2004 international symposium on Low power electronics and designWhile set-associative caches incur fewer misses than direct-mapped caches, they typically have slower hit times and higher power consumption, when multiple tag and data banks are probed in parallel. This paper presents the location cache structure which ...
Criticality aware tiered cache hierarchy: a fundamental relook at multi-level cache hierarchies
ISCA '18: Proceedings of the 45th Annual International Symposium on Computer ArchitectureOn-die caches are a popular method to help hide the main memory latency. However, it is difficult to build large caches without substantially increasing their access latency, which in turn hurts performance. To overcome this difficulty, on-die caches ...
Comments