Efficient search ranking in social networks

  • Authors:

  • Monique V. Vieira;Bruno M. Fonseca;Rodrigo Damazio;Paulo B. Golgher;Davi de Castro Reis;Berthier Ribeiro-Neto

  • Affiliations:

  • Google Engineering, & Federal University of Minas Gerais, Belo Horizonte, Brazil;Google Engineering Belo Horizonte, Belo Horizonte, Brazil;Google Engineering Belo Horizonte, Belo Horizonte, Brazil;Google Engineering Belo Horizonte, Belo Horizonte, Brazil;Google Engineering Belo Horizonte, Belo Horizonte, Brazil;Google Engineering & Federal University of Minas Gerais, Belo Horizonte, Brazil

  • Venue:
  • Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In social networks such as Orkut, www.orkut.com, a large portion of the user queries refer to names of other people. Indeed, more than 50% of the queries in Orkut are about names of other users, with an average of 1.8 terms per query. Further, the users usually search for people with whom they maintain relationships in the network. These relationships can be modelled as edges in a friendship graph, a graph in which the nodes represent the users. In this context, search ranking can be modelled as a function that depends on the distances among users in the graph, more specifically, of shortest paths in the friendship graph. However, application of this idea to ranking is not straightforward because the large size of modern social networks (dozens of millions of users) prevents efficient computation of shortest paths at query time. We overcome this by designing a ranking formula that strikes a balance between producing good results and reducing query processing time. Using data from the Orkut social network, which includes over 40 million users, we show that our ranking, augmented by this new signal, produces high quality results, while maintaining query processing time small.