分而治之：划分在线社交网络
Divide and Conquer: Partitioning Online Social Networks
摘要：
在线社交网络（OSN）在过去几年中在规模和范围方面呈爆炸式增长。这些网络的空前增长给系统设计和维护带来了挑战。解决这一问题的一种方法是对这样的大型网络进行分区，并将这些分区分配给不同的机器。然而，社交网络具有独特的属性，使划分问题的重要性。本文的主要贡献是了解不同属性的社交网络，以及这些属性如何可以指导选择的分割算法。使用大规模的测量代表真正的OSN，我们首先表征不同的属性的社交网络，然后我们评估定性不同的划分方法，覆盖设计空间。我们揭示了不同的权衡所涉及的，并理解他们在社交网络的属性。我们表明，一个明智的选择分区方案可以帮助提高性能。
英文摘要：
Online Social Networks (OSNs) have exploded in terms of scale and scope over the last few years. The unprecedented growth of these networks present challenges in terms of system design and maintenance. One way to cope with this is by partitioning such large networks and assigning these partitions to different machines. However, social networks possess unique properties that make the partitioning problem non-trivial. The main contribution of this paper is to understand different properties of social networks and how these properties can guide the choice of a partitioning algorithm. Using large scale measurements representing real OSNs, we first characterize different properties of social networks, and then we evaluate qualitatively different partitioning methods that cover the design space. We expose different trade-offs involved and understand them in light of properties of social networks. We show that a judicious choice of a partitioning scheme can help improve performance.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
