{"title":"在线社交网络数据复制中的社会局部性保护","authors":"Khanh Nguyen, Cuong H. Pham, D. Tran, Feng Zhang","doi":"10.1109/ICDCSW.2011.14","DOIUrl":null,"url":null,"abstract":"An on line social network usually requires many servers to store its user data so that a large number of users can be served. The data should also be replicated across the servers to provide a high degree of availability in case failures occur. In this paper we discuss the importance of social locality in the replication procedure. To substantiate this importance, we propose and evaluate a replication method that can significantly improve the system efficiency by leveraging the social relationships of the data.","PeriodicalId":133514,"journal":{"name":"2011 31st International Conference on Distributed Computing Systems Workshops","volume":"14 4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"Preserving Social Locality in Data Replication for Online Social Networks\",\"authors\":\"Khanh Nguyen, Cuong H. Pham, D. Tran, Feng Zhang\",\"doi\":\"10.1109/ICDCSW.2011.14\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An on line social network usually requires many servers to store its user data so that a large number of users can be served. The data should also be replicated across the servers to provide a high degree of availability in case failures occur. In this paper we discuss the importance of social locality in the replication procedure. To substantiate this importance, we propose and evaluate a replication method that can significantly improve the system efficiency by leveraging the social relationships of the data.\",\"PeriodicalId\":133514,\"journal\":{\"name\":\"2011 31st International Conference on Distributed Computing Systems Workshops\",\"volume\":\"14 4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-06-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 31st International Conference on Distributed Computing Systems Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDCSW.2011.14\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 31st International Conference on Distributed Computing Systems Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDCSW.2011.14","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Preserving Social Locality in Data Replication for Online Social Networks
An on line social network usually requires many servers to store its user data so that a large number of users can be served. The data should also be replicated across the servers to provide a high degree of availability in case failures occur. In this paper we discuss the importance of social locality in the replication procedure. To substantiate this importance, we propose and evaluate a replication method that can significantly improve the system efficiency by leveraging the social relationships of the data.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
