Skip to main content
SpringerLink
Log in

A Cost-Efficient Approach to Storing Users’ Data for Online Social Networks

  • Regular Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

As users increasingly befriend others and interact online via their social media accounts, online social networks (OSNs) are expanding rapidly. Confronted with the big data generated by users, it is imperative that data storage be distributed, scalable, and cost-efficient. Yet one of the most significant challenges about this topic is determining how to minimize the cost without deteriorating system performance. Although many storage systems use the distributed key value store, it cannot be directly applied to OSN storage systems. And because users’ data are highly correlated, hash storage leads to frequent inter-server communications, and the high inter-server traffic costs decrease the OSN storage system’s scalability. Previous studies proposed conducting network partitioning and data replication based on social graphs. However, data replication increases storage costs and impacts traffic costs. Here, we consider how to minimize costs from the perspective of data storage, by combining partitioning and replication. Our cost-efficient data storage approach supports scalable OSN storage systems. The proposed approach co-locates frequently interactive users together by conducting partitioning and replication simultaneously while meeting load-balancing constraints. Extensive experiments are undertaken on two realworld traces, and the results show that our approach achieves lower cost compared with state-of-the-art approaches. Thus we conclude that our approach enables economic and scalable OSN data storage.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Althoff T, Jindal P, Leskovec J. Online actions with offline impact: How online social networks influence online and offline user behavior. In Proc. the 10th ACM International Conference on Web Search and Data Mining, February 2017, pp.537-546.

  2. Peng S C, Yang A M, Cao L H, Yu S, Xie D Q. Social influence modeling using information theory in mobile social networks. Information Sciences, 2017, 379: 146-159.

    Article  Google Scholar 

  3. Wang F,Wang H Y, Xu K,Wu J H, Jia X H. Characterizing information diffusion in online social networks with linear diffusive model. In Proc. the 33rd International Conference on Distributed Computing Systems, July 2013, pp.307-316.

  4. Al-FaresM, Loukissas A, Vahdat, A. A scalable, commodity data center network architecture. In Proc. the ACM SIGCOMM Conference on Data communication, August 2008, pp.63-74.

  5. Shvachko K, Kuang H, Radia S, Chansler R. The Hadoop distributed file system. In Proc. the 26th IEEE Symposium on Mass Storage Systems and Technologies, May 2010.

  6. Lakshman A, Malik P. Cassandra: A decentralized structured storage system. ACM SIGOPS Operating Systems Review, 2010, 44(2): 35-40.

    Article  Google Scholar 

  7. Sumbaly R, Kreps J, Gao L, Feinberg A, Soman C, Shah S. Serving large-scale batch computed data with project Voldemort. In Proc. the 10th USENIX Conference on File and Storage Technologies, February 2012, pp.223-235.

  8. Karypis G, Kumar V. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing, 1998, 20(1): 359-392.

    Article  MathSciNet  MATH  Google Scholar 

  9. Chen H H, Jin H, Wu S. Minimizing inter-server communications by exploiting self-similarity in online social networks. IEEE Transactions on Parallel and Distributed Systems, 2016, 27(4): 1116-1130.

    Article  Google Scholar 

  10. Liu G X, Shen H Y, Chandler H. Selective data replication for online social networks with distributed datacenters. IEEE Transactions on Parallel and Distributed Systems, 2016, 27(8): 2377-2393.

    Article  Google Scholar 

  11. Pujol J M, Erramilli V, Siganos G, Yang X, Laoutaris N, Chhabra P, Rodriguez P. The little engine(s) that could: Scaling online social networks. IEEE/ACM Transactions on Networking, 2012, 20(4): 1162-1175.

    Article  Google Scholar 

  12. Tran D A, Zhang T. S-PUT: An EA-based framework for socially aware data partitioning. Computer Networks, 2014, 75: 504-518.

    Article  Google Scholar 

  13. Yu B Y, Pan J P. Location-aware associated data placement for geo-distributed data intensive applications. In Proc. the 34th IEEE International Conference on Computer Communications, April 2015, pp.603-611.

  14. Zhou J Y, Fan J X, Cheng B L, Jia J C. Optimizing interserver communications by exploiting overlapping communities in online social networks. In Proc. the 16th International Conference on Algorithms and Architectures for Parallel Processing, December 2016, pp.231-244.

  15. Tran D A, Nguyen K, Pham C. S-CLONE: Socially-aware data replication for social networks. Computer Networks, 2012, 56(7): 2001-2013

    Article  Google Scholar 

  16. Zhang J H, Chen J, Luo J Z, Song A B. Efficient locationaware data placement for data-intensive applications in geodistributed scientific data centers. Tsinghua Science and Technology, 2016, 21(5): 471-481.

    Article  Google Scholar 

  17. Jiao L, Lit J, Du W, Fu X M. Multi-objective data placement for multi-cloud socially aware services. In Proc. the 33rd IEEE International Conference on Computer Communications, April 2014, pp.28-36.

  18. Gregory S. Finding overlapping communities in networks by label propagation. New Journal of Physics, 2010, 12(10): Article No. 103018.

  19. Lancichinetti A, Fortunato S, Kertész J. Detecting the overlapping and hierarchical community structure in complex networks. New Journal of Physics, 2009, 11(3): Article No. 033015.

  20. Qiao S, Han N, Zhang K, Zou L, Wang H, Alberto G L. Algorithm for detecting overlapping communities from complex network big data. Journal of Software, 2017, 28(3): 631-647. (in Chinese)

    MathSciNet  MATH  Google Scholar 

  21. Wilson C, Sala A, Puttaswamy K P N, Zhao B Y. Beyond social graphs: User interactions in online social networks and their implications. ACM Transactions on the Web, 2012, 6(4): Article No. 17.

  22. Gjoka M, Kurant M, Butts C T, Markopoulou A. Walking in Facebook: A case study of unbiased sampling of OSNs. In Proc. the 29th IEEE International Conference on Computer Communications, March 2010, pp.2498-2506.

  23. Jiang J, Wilson C, Wang X, Sha W P, Huang P, Dai Y F, Zhao B Y. Understanding latent interactions in online social networks. ACM Transactions on the Web, 2013, 7(4): Article No. 18.

  24. Benevenuto F, Rodrigues T, Cha M, Almeida V A F. Characterizing user behavior in online social networks. In Proc. the 9th ACM SIGCOMM Conference on Internet Measurement, November 2009, pp.49-62.

  25. Roy A, Zeng H, Bagga J, Porter G, Snoeren A C. Inside the social network’s (datacenter) network. In Proc. the 2015 ACM Conference on Special Interest Group on Data Communication, August 2015, pp.123-137.

Download references

Acknowledgement(s)

We thank the anonymous reviewers and editors for their valuable suggestions that help to improve the presentation of the paper.

Author information

Authors and Affiliations

  1. School of Computer Science and Technology, Soochow University, Suzhou, 215006, China

    Jing-Ya Zhou, Jian-Xi Fan, Cheng-Kuan Lin & Bao-Lei Cheng

  2. Provincial Key Laboratory for Computer Information Processing Technology, Soochow University, Suzhou, 215006, China

    Jing-Ya Zhou

  3. Collaborative Innovation Center of Novel Software Technology and Industrialization, Nanjing University, Nanjing, 210023, China

    Jing-Ya Zhou

Authors
  1. Jing-Ya Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jian-Xi Fan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Cheng-Kuan Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Bao-Lei Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jing-Ya Zhou.

Electronic supplementary material

ESM 1

(PDF 68 kb)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhou, JY., Fan, JX., Lin, CK. et al. A Cost-Efficient Approach to Storing Users’ Data for Online Social Networks. J. Comput. Sci. Technol. 34, 234–252 (2019). https://doi.org/10.1007/s11390-019-1907-y

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-019-1907-y

Keywords

Search

Navigation