Expanded social circles : efficient query on social graphs

Abstract

Social graphs can be used to express personal relationships between internet users. Query the entire network is a very expensive task and here is no interest to continue a query when a successfully answer is already known. This paper proposes a searching mechanism to query nodes in several social graphs topologies. Active users are continuously expanding the social network, resulting in frequent changes on the social graph topology. The results show that expanded social circles are an efficient query mechanism and resilient to distinct social graph models.