Efficient search ranking in social networks

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2007, Pages 563-572

  Vieira, Monique V ^a,b   Golgher, Paulo B ^a   Fonseca, Bruno M ^a   De Reis, Davi Castro ^a   Damazio, Rodrigo ^a   Ribeiro Neto, Berthier ^a,b  

^a Google Inc   (Brazil)

^b FEDERAL UNIVERSITY OF MINAS GERAIS   (Brazil)

Author keywords

Graphs; Shortest path; Social networks

Indexed keywords

EFFICIENT COMPUTATIONS; FRIENDSHIP GRAPHS; GRAPHS; HIGH QUALITIES; LARGE SIZES; QUERY TIME; SHORTEST PATH; SOCIAL NETWORKS; USER QUERIES;

KNOWLEDGE MANAGEMENT; QUERY PROCESSING;

WIRELESS SENSOR NETWORKS;

EID: 63449133186     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1321440.1321520     Document Type: Conference Paper

References (16)

1. R. A. Baeza-Yates and B. Ribeiro-Neto. Modern Information Retrieval. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 1999.
2. S. Brin and L. Page. The anatomy of a large-scale hypertextual web search engine. In Proceedings of the seventh international conference on World Wide Web, pages 107-117, Amsterdam, The Netherlands, The Netherlands, 1998.
3. T. M. Chan. All-pairs shortest paths for unweighted undirected graphs in o(mn) time. In Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithms, pages 514-523, New York, NY, USA, 2006.
4. J. Dean and S. Ghemawat. Mapreduce: Simplified data processing on large clusters. In Sixth Symposium on Operating System Design and Implementation, pages 137-150, 2004.
5. E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1(1):269-271, 1959.
6. D. Dor, S. Halperin, and U. Zwick. All-pairs almost shortest paths. SIAM Journal on Computing, 29(5):1740-1759, 2000.
7. A. V. Goldberg and C. Harrelson. Computing the shortest path: A search meets graph theory. In Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, pages 156-165, Philadelphia, PA, USA, 2005.
8. M. Holzer, F. Schulz, D. Wagner, and T. Willhalm. Combining speed-up techniques for shortest-path computations. Journal of Experimental Algorithmics, 10, 2005.
9. J. Kekäläinen and K. Järvelin. Using graded relevance assessments in ir evaluation. Journal ofthe American Society for Information Science and Technology, 53(13):1120-1129, 2002.
10. C. Lampe, N. Ellison, and C. Steinfield. A face(book) in the crowd: social searching vs. social browsing. In Proceedings of the 2006 20th anniversary conference on Computer supported cooperative work, pages 167-170, New York, NY, USA, 2006.
11. M. J. Rattigan, M. Maier, and D. Jensen. Using structure indices for efficient approximation of network properties. In Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 357-366, New York, NY, USA, 2006.
12. S. Russell and P. Norvig. Artificial Intelligence: A Modern Approach. Prentice-Hall, Englewood Cliffs, NJ, 2nd edition edition, 2003.
13. R. Seidel. On the all-pairs-shortest-path problem. In Proceedings of the twenty-fourth annual A CM symposium on Theory of computing, pages 745-749, 1992.
14. E. Spertus, M. Sahami, and O. Buyukkokten. Evaluating similarity measures: a large-scale study in the orkut social network. In Proceeding of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, pages 678-684, New York, NY, USA, 2005.
15. M. Thorup and U. Zwick. Approximate distance oracles. In Proceedings of the thirty-third annual ACM symposium on Theory of computing, pages 183-192, New York, NY, USA, 2001.
16. U. Zwick. Exact and approximate distances in graphs - a survey. In Proceedings of the 9th Annual European Symposium on Algorithms, pages 33-48, London, UK, 2001.