This Article 
 Bibliographic References 
 Add to: 
Disk Layout Techniques for Online Social Network Data
May-June 2012 (vol. 16 no. 3)
pp. 24-36
Imranul Hoque, University of Illinois, Urbana-Champaign
Indranil Gupta, University of Illinois, Urbana-Champaign

Social networking applications' disk access patterns differ from those of traditional applications. However, today's disk layout techniques aren't adapted to social networking workloads, and thus their performance suffers. The authors' disk layout techniques leverage community structure in a social graph to make placement decisions that optimize read latency. Their layout manager, Bondhu, incorporates these techniques and is integrated into the popular Neo4j graph database engine. Experimental results show that Bondhu improves the median response time for online social network operations by as much as 48 percent.

1. J.M. Pujol et al., "The Little Engine(s) that Could: Scaling Online Social Networks," Proc. ACM SIGCOMM 2010 Conf. (SIGCOMM 10), ACM Press, 2010, pp. 375–386.
2. M.R. Garey, D.S. Johnson, and L. Stockmeyer, "Some Simplified NP-Complete Problems," Proc. 6th Ann. ACM Symp. Theory of Computing (STOC 74), ACM Press, 1974, pp. 47–63.
3. J. Petit, "Experiments on the Minimum Linear Arrangement Problem," J. Experimental Algorithmics, vol. 8, Dec. 2003, pp. 2.3:1–2.3:29.
4. G. Karypis and V. Kumar, "Multilevel k-way Partitioning Scheme for Irregular Graphs," J. Parallel and Distributed Computing, vol. 48, no. 1, 1998, pp. 96–129.
5. V.D. Blondel et al., "Fast Unfolding of Communities in Large Networks," J. Statistical Mechanics: Theory and Experiment, vol. 2008, Oct. 2008, p. P10008.
6. B. Viswanath et al., "On the Evolution of User Interaction in Facebook," Proc. 2nd ACM Workshop Online Social Networks (WoSN 09), ACM Press, 2009, pp. 37–42.
7. F. Benevenuto et al., "Characterizing User Behavior in Online Social Networks," Proc. 9th ACM SIGCOMM Conf. Internet Measurement (IMC 09), ACM Press, 2009, pp. 49–62.
8. B. Salmon et al., "A Two-Tiered Software Architecture for Automated Tuning of Disk Layouts," Proc. Workshop Algorithms and Architectures for Self-Managing Systems, ACM Press, 2003, pp. 13–18.
9. G. Soundararajan et al., "Extending SSD Lifetimes with Disk-Based Write Caches," Proc. 8th Usenix Conf. File and Storage Technologies (FAST 10), Usenix Assoc., 2010, pp. 101–114.
1. M.K. Mckusick et al., "A Fast File System for UNIX," ACM Trans. Computer Systems, vol. 2, no. 3, 1984, pp. 181-197.
2. M. Rosenblum and J.K. Ousterhout, "The Design and Implementation of a Log-Structured File System," ACM Trans. Computer Systems, vol. 10, no. 1, 1992, pp. 26-52.
3. G. Ganger and M.F. Kaashoek, "Embedded Inodes and Explicit Grouping:Exploiting Disk Bandwidth for Small Files," Proc. 1997 Ann. Usenix Technical Conf. (ACT 97), Usenix Assoc., 1997, pp. 1-17.
4. C. Ruemmler and J. Wilkes, Disk Shuffling, tech. report HPL-91-156, Hewlett-Packard Labs, 1991.
5. Z. Li et al., "C-Miner: Mining Block Correlations in Storage Systems," Proc. 3rd Usenix Conf. File and Storage Technologies (FAST 04), Usenix Assoc., 2004, pp. 173-186.
6. M. Bhadkamkar et al., "BORG: Block-reORGanization for Self-Optimizing Storage Systems," Proc. 7th Usenix Conf. File and Storage Technologies (FAST 09), Usenix Assoc., 2009, pp. 183-196.
7. J.A. Nugent, A.C. Arpaci-dusseau,, and R.H. Arpaci-dusseau, "Controlling Your PLACE in the File System with Gray-Box Techniques," Proc. 2003 Ann. Usenix Technical Conf. (ATC 03), Usenix Assoc., 2003, pp. 311-324.
8. X. Ding et al., "DiskSeen: Exploiting Disk Layout and Access History to Enhance I/O Prefetch," Proc. 2007 Ann. Usenix Technical Conf. (ATC 07), Usenix Assoc., 2007, pp. 20:1-20:14.

Index Terms:
data organization, disk layout, social network, storage management
Imranul Hoque, Indranil Gupta, "Disk Layout Techniques for Online Social Network Data," IEEE Internet Computing, vol. 16, no. 3, pp. 24-36, May-June 2012, doi:10.1109/MIC.2012.40
Usage of this product signifies your acceptance of the Terms of Use.