A sketch-based distance oracle for web-scale graphs

WSDM 2010 - Proceedings of the 3rd ACM International Conference on Web Search and Data Mining

Volumn , Issue , 2010, Pages 401-410

  Das Sarma, Atish ^a   Gollapudi, Sreenivas ^b   Najork, Marc ^b   Panigrahy, Rina ^b  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

Algorithms; Distance computation; Embedding; Shortest path; Sketching

Indexed keywords

COMPUTING DISTANCES; DESTINATION NODES; DISTANCE COMPUTATION; EMBEDDING; FAST COMPUTATION; FUNDAMENTAL PROBLEM; LARGE GRAPHS; OFFLINE; QUERY TIME; REAL TIME; SHORTEST PATH; SHORTEST PATH ALGORITHMS; SOCIAL NETWORKS; WEB GRAPHS;

COMPUTATION THEORY; GRAPH THEORY; INFORMATION RETRIEVAL;

WORLD WIDE WEB;

EID: 77950874002     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1718487.1718537     Document Type: Conference Paper

References (20)

1. Yair Bartal. On approximating arbitrary metrices by tree metrics. In STOC, pages 161-168, 1998.
2. Surender Baswana. Streaming algorithm for graph spanners - single pass and constant processing time per edge. Inf. Process. Lett., 106(3):110-114, 2008.
3. Jean Bourgain. On Lipschitz embeddings of finite metric spaces in hilbert space. Israel Journal of Mathematics, 52(1-2):46-52, 1985.
4. Andrei Z. Broder. Identifying and filtering near-duplicate documents. In CPM, pages 1-10, 2000.
5. Andrei Z. Broder, Steven C. Glassman, Mark S. Manasse, and Geoffrey Zweig. Syntactic clustering of the web. Computer Networks, 29(8):1157-1166, 1997.
6. Edith Cohen, Eran Halperin, Haim Kaplan, and Uri Zwick. Reachability and distance queries via 2-hop labels. In SODA, pages 937-946, 2002.
7. Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, and David Peleg. Labeling schemes for tree representation. Algorithmica, 53(1):1-15, 2009.
8. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to algorithms. MIT Press and McGraw-Hill, 24.3:595-601, 2001.
9. Camil Demetrescu, Andrew V. Goldberg, and David S. Johnson. Implementation challenge for shortest paths. In Encyclopedia of Algorithms. 2008.
10. Wei Dong, Moses Charikar, and Kai Li. Asymmetric distance estimation with sketches for similarity search in high-dimensional spaces. In SIGIR, pages 123-130, 2008.
11. Jittat Fakcharoenphol, Satish Rao, and Kunal Talwar. A tight bound on approximating arbitrary metrics by tree metrics. J. Comp. Syst. Sci., 69(3):485-497, 2004.
12. Joan Feigenbaum, Sampath Kannan, Andrew McGregor, Siddharth Suri, and Jian Zhang. Graph distances in the streaming model: the value of space. In SODA, pages 745-754, 2005.
13. François Fouss, Alain Pirotte, Jean-Michel Renders, and Marco Saerens. Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. IEEE Trans. Knowl. Data Eng., 19(3):355-369, 2007.
14. Cyril Gavoille, David Peleg, Stéphane Pérennes, and Ran Raz. Distance labeling in graphs. J. Algorithms, 53(1):85-112, 2004.
15. Andrew V. Goldberg. Point-to-point shortest path algorithms with preprocessing. In SOFSEM (1), pages 88-102, 2007.
16. Michal Katz, Nir A. Katz, Amos Korman, and David Peleg. Labeling schemes for flow and connectivity. SIAM J. Comput., 34(1):23-40, 2004.
17. Jiri Matousek. On the distortion required for embedding finite metric spaces into normed spaces. Israel Journal of Mathematics, 93(1):333-344, 1996.
18. Marc Najork. The scalable hyperlink store. In Hypertext, pages 89-98, 2009.
19. Mikkel Thorup and Uri Zwick. Approximate distance oracles. J. ACM, 52(1):1-24, 2005.
20. Luh Yen, Marco Saerens, Amin Mantrach, and Masashi Shimbo. A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances. In KDD, pages 785-793, 2008.