April 26, 2013

Storage and Performance Optimization of Long Tail Key Access in a Social Network

International Workshop on Cloud Data and Platforms (Cloud DP)

In a social network, it is natural to have hot objects such as a celebrity’s Facebook page. Duplicating hot object data in each cluster provides quick cache access and avoids stressing a single server’s network or CPU resources. But duplicating cold data in each cache cluster consumes significant RAM. A more storage efficient way is to separate hot data from cold data and duplicate only hot data in each cache cluster within a data center. The cold data, or the long tail data, which is accessed much less frequently, has only one copy at a regional cache cluster.

John Liang, Yang 'James' Luo, Mark Drayton, Rajesh Nishtala, Richard Liu, Nick Hammer, Jason Taylor, Bill Jia
April 3, 2013

Scaling Memcache at Facebook

USENIX Symposium on Networked Systems Design and Implementation (NSDI)

Memcached is a well known, simple, in memory caching solution. This paper describes how Facebook leverages memcached as a building block to construct and scale a distributed key-value store that supports the world’s largest social network.

Rajesh Nishtala, Hans Fugal, Steven Grimm, Marc Kwiatkowski, Herman Lee, Harry Li, Ryan McElroy, Michael Paleczny, Daniel Peek, Paul Saab, David Stafford, Tony Tung, Venkat Venkataramani
April 1, 2013

Using Facebook after Losing a Job: Differential Benefits of Strong and Weak Ties

ACM Conference on Computer Supported Cooperative Work and Social Computing (CSCW)

Among those who have recently lost a job, social networks in general and online ones in particular may be useful to cope with stress and find new employment. This study focuses on the psychological an…

Moira Burke, Robert Kraut
February 6, 2013

Arrival and Departure Dynamics in Social Networks

ACM International Conference on Web Search and Data Mining (WSDM)

In this paper, we consider the natural arrival and departure of users in a social network, and ask whether the dynamics of arrival, which have been studied in some depth, also explain the dynamics of departure, which are not as well studied.

Shaomei Wu, Atish Das Sarma, Alex Fabrikant, Silvio Lattanzi, Andrew Tomkins
February 6, 2013

Balanced Label Propagation for Partitioning Massive Graphs

ACM International Conference on Web Search and Data Mining (WSDM)

Partitioning graphs at scale is a key challenge for any application that involves distributing a graph across disks, machines, or data centers. Graph partitioning is a very well studied problem with a…

Johan Ugander, Lars Backstrom
February 6, 2013

Characterizing and Curating Conversation Threads: Expansion, Focus, Volume, Re-entry

ACM International Conference on Web Search and Data Mining (WSDM)

Discussion threads form a central part of the experience on many Web sites, including social networking sites such as Facebook and Google Plus and knowledge creation sites such as Wikipedia.

Lars Backstrom, Jon Kleinberg, Lillian Lee, Cristian Danescu-Niculescu-Mizil
February 5, 2013

Yahtzee: An Anonymized Group Level Matching Procedure

PLOS One

Researchers often face the problem of needing to protect the privacy of subjects while also needing to integrate data that contains personal information from diverse data sources. The advent of comput…

Jason J. Jones, Robert Bond, Christopher J. Fariss, Jaime Settle, Adam D. I. Kramer, Cameron Marlow
January 2, 2013

Inferring Tie Strength from Online Directed Behavior

PLOS One

Some social connections are stronger than others. People have not only friends, but also best friends. Social scientists have long recognized this characteristic of social connections and researchers frequently use the term ‘tie strength’ to refer to this concept. We used online interaction data (specifically, Facebook interactions) to successfully identify real-world strong ties.

Jason J. Jones, Jaime Settle, Robert Bond, Christopher J. Fariss, Cameron Marlow
October 24, 2012

The HipHop Compiler for PHP

ACM International Conference on Object Oriented Programming Systems, Languages, and Applications (OOPSLA)

Scripting languages are widely used to quickly accomplish a variety of tasks because of the high productivity they enable. Among other reasons, this increased productivity results from a combination o…

Haiping Zhao, Minghui Yang, Xin Qi, Mark Williams, Charlie Gao, Guilherme Ottoni, Drew Paroski, Scott MacVicar, Jason Evans, Stephen Tu
September 13, 2012

A 61-million-person experiment in social influence and political mobilization

Nature

Human behaviour is thought to spread through face-to-face social networks, but it is difficult to identify social influence effects in observational studies, and it is unknown whether online social ne…

Robert Bond, Christopher J. Fariss, Jason J. Jones, Adam D. I. Kramer, Cameron Marlow, Jaime Settle
August 16, 2012

Workload Analysis of a Large-Scale Key-Value Store

ACM International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS)

Key-value stores are a vital component in many scale-out enterprises, including social networks, online retail, and risk analysis. Accordingly, they are receiving increased attention from the research community in an effort to improve their performance, scalability, reliability, cost, and power consumption. To be effective, such efforts require a detailed understanding of realistic key-value workloads. And yet little is known about these workloads outside of the companies that operate them. This paper aims to address this gap.

Berk Atikoglu, Yuehai Xu, Eitan Frachtenberg, Song Jiang, Michael Paleczny
August 13, 2012

DeTail: Reducing the Flow Completion Time Tail in Datacenter Networks

ACM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM)

Web applications have now become so sophisticated that rendering a typical page may require hundreds of intra-datacenter flows. At the same time, web sites must meet strict page creation deadlines of 200-300ms to satisfy user demands for interactivity. Long-tailed flow completion times make it challenging for web sites to meet these constraints. They are forced to choose between rendering a subset of the complex page, or delay its rendering, thus missing deadlines and sacrificing either quality or responsiveness. Either option leads to potential financial loss.

Dhruba Borthakur, Randy Katz, Prashanth Mohan, Tathagata Das, David Zats
August 12, 2012

Active Sampling for Entity Matching

ACM Conference on Knowledge Discovery and Data Mining (KDD)

In entity matching, a fundamental issue while training a classifier to label pairs of entities as either duplicates or non-duplicates is the one of selecting informative examples. Although active learning presents an attractive solution to this problem, previous approaches minimize the misclassification rate (0-1 loss) of the classifier, which is an unsuitable metric for entity matching due to class imbalance (i.e., many more non-duplicate pairs than duplicate pairs).

Kedar Bellare, Suresh Iyengar Parthasarathy, Aditya Parameswaran, Vibhor Rastogi
June 22, 2012

Four Degrees of Separation

ACM Web Science Conference (WebSci)

Frigyes Karinthy, in his 1929 short story “Lancszemek” (in English, “Chains”) suggested that any two persons are distanced by at most six friendship links. Stanley Milgram in his famous experiments challenged people to route postcards to a fixed recipient by passing them only through direct acquaintances. Milgram found that the average number of intermediaries on the path of the postcards lay between 4.4 and 5.7, depending on the sample of people chosen.

Lars Backstrom, Paolo Boldi, Marco Rosa, Johan Ugander, Sebastiano Vigna
June 17, 2012

Storage Infrastructure Behind Facebook Messages: Using HBase at Scale

IEEE International Conference on Data Engineering (ICDE)

Facebook Messages, which combines messages, chat and email into a real-time conversation, is the first application in Facebook to use HBase in production.

Amitanand Aiyer, Mikhail Bautin, Guoqiang Jerry Chen, Pritam Damania, Prakash Khemani, Kannan Muthukkaruppan, Karthik Ranganathan, Nicolas Spiegelberg, Liyin Tang, Madhuwanti Vaidya
June 8, 2012

Social Influence in Social Advertising: Evidence from Field Experiments

ACM Conference on Electronic Commerce (EC)

Social advertising uses information about consumers’ peers, including peer affiliations with a brand, product, organization, etc., to target ads and contextualize their display. This approach can incr…

Eytan Bakshy, Dean Eckles, Rong Yan, Itamar Rosenn
June 1, 2012

Power and Performance Evaluation of Memcached on the TILEPro64 Architecture

Sustainable Computing: Informatics and Systems

Power consumption of data centers had become an important factor in the economy and sustainability of large-scale Web services. Researchers and practitioners are spending considerable effort to characterize Web-scale workloads and evaluating their applicability to alternative, more power-efficient architectures. One such workload in particular is the caching layer, which stores expensive-to-regenerate data in fast storage to reduce service times.

Mateusz Berezecki, Eitan Frachtenberg, Michael Paleczny, Ken Steele
May 16, 2012

The spread of emotion via Facebook

ACM Conference on Human Factors in Computing Systems (CHI)

In this paper we study large-scale emotional contagion through an examination of Facebook status updates. After a user makes a status update with emotional content, their friends are significantly more likely to make a valence-consistent post.

Adam D. I. Kramer
May 1, 2012

Thermal Design in the Open Compute Datacenter

IEEE Intersociety Conference on Thermal and Thermomechanical Phenomena in Electronic Systems (ITHERM)

The advent of Web-based services and cloud computing has instigated an explosive growth in demand for datacenters. Traditionally, Internet companies would lease datacenter space and servers from vendors that often emphasize flexibility over efficiency. But as these companies grew larger, they sought to reduce acquisition and operation costs by building their own datacenters.

Eitan Frachtenberg, Dan Lee, Marco Magarelli, Veerendra Mulay, Jay Park
April 25, 2012

PACMan: Coordinated Memory Caching for Parallel Jobs

USENIX Symposium on Networked Systems Design and Implementation (NSDI)

Data-intensive analytics on large clusters is important for modern Internet services. As machines in these clusters have large memories, in-memory caching of inputs is an effective way to speed up the…

Ganesh Ananthanarayanan, Ali Ghodsi, Andrew Wang, Dhruba Borthakur, Srikanth Kandula, Scott Shenker, Ion Stoica