Estimating pairwise distances in large graphs

Proceedings - 2014 IEEE International Conference on Big Data, IEEE Big Data 2014

Volumn , Issue , 2014, Pages 335-344

  Christoforaki, Maria ^a   Suel, Torsten ^a  

^a POLYTECHNIC UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTANCE BOUND; DISTANCE ESTIMATION; LARGE GRAPHS; LARGE-SCALES; LOW BOUND; PAIRWISE DISTANCES; POINT DISTANCES; SOCIAL SEARCH; TRIANGLE INEQUALITY; UPPER BOUND;

EID: 84921778513     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/BigData.2014.7004250     Document Type: Conference Paper

References (36)

1. A. Ukkonen, C. Castillo, D. Donato, and A. Gionis, "Searching the wikipedia with contextual information," CIKM, pp. 1351-1352, 2008.
2. M. Potamias, F. Bonchi, C. Castillo, and A. Gionis, "Fast shortest path distance estimation in large networks," CIKM, pp. 867-876, 2009.
3. B. Bahmani and A. Goel, "Partitioned multi-indexing: bringing order to social search," WWW, pp. 399-408, 2012.
4. M. Qiao, L. Qin, H. Cheng, J. X. Yu, and W. Tian, "Top-k nearest keyword search on large graphs," PVLDB, vol. 6, no. 10, 2013.
5. M. V. Vieira, B. M. Fonseca, R. Damazio, P. B. Golgher, D. de Castro Reis, and B. A. Ribeiro-Neto, "Efficient search ranking in social networks," CIKM, pp. 563-572, 2007.
6. M. Qiao, H. Cheng, and J. X. Yu, "Querying shortest path distance with bounded errors in large graphs," SSDBM, vol. 6809, pp. 255-273 2011.
7. A. Gubichev, S. J. Bedathur, S. Seufert, and G. Weikum, "Fast and accurate estimation of shortest paths in large graphs," CIKM, pp. 499-508, 2010.
8. A. D. Sarma, S. Gollapudi, M. Najork, and R. Panigrahy, "A sketchbased distance oracle for web-scale graphs," WSDM, pp. 401-410, 2010.
9. E. Dijkstra, "A note on two problems in connexion with graphs," Numerische Mathematik, vol. 1, no. 1, pp. 269-271, 1959.
10. A. V. Goldberg, H. Kaplan, and R. F. F. Werneck, "Reach for a: Effcient point-to-point shortest path algorithms," Microsoft Research CA, Tech. Rep. MSR-TR-2005-132, October 2005.
11. A. V. Goldberg and C. Harrelson, "Computing the shortest path: A search meets graph theory," SODA, pp. 156-165, 2005.
12. A. V. Goldberg, "Point-to-point shortest path algorithms with preprocessing," SOFSEM (1), vol. 4362, pp. 88-102, 2007.
13. C. Demetrescu, A. V. Goldberg, and D. S. Johnson, "Implementation challenge for shortest paths," in Encyclopedia of Algorithms, M.-Y. Kao Ed. Springer, 2008.
14. Y. Xiao, W. Wu, J. Pei, W. Wang, and Z. He, "Efficiently indexing shortest paths by exploiting symmetry in graphs," EDBT, pp. 493-504 2009.
15. E. Cohen, E. Halperin, H. Kaplan, and U. Zwick, "Reachability and distance queries via 2-hop labels," SIAM J. Comput., vol. 32, no. 5, pp. 1338-1355, 2003.
16. R. Jin, N. Ruan, Y. Xiang, and V. Lee, "A highway-centric labeling approach for answering distance queries on large sparse graphs," in SIGMOD, 2012, pp. 445-456.
17. A. W.-C. Fu, H. Wu, J. Cheng, and R. C.-W. Wong, "Is-label: An independent-set based labeling scheme for point-to-point distance querying," Proc. VLDB Endow., vol. 6, no. 6, pp. 457-468, 2013.
18. T. Akiba, Y. Iwata, and Y. Yoshida, "Fast exact shortest-path distance queries on large networks by pruned landmark labeling," in SIGMOD 2013, pp. 349-360.
19. M. Thorup and U. Zwick, "Approximate distance oracles," STOC, pp. 183-192, 2001.
20. J. Bourgain, "On lipschitz embedding of finite metric spaces in hilbert space," Israel Journal of Mathematics, vol. 52, no. 1, pp. 46-52, 1985.
21. J. Matousek, "On the distortion required for embedding finite metric spaces into normed spaces," Israel Journal of Mathematics, vol. 93 no. 1, pp. 333-344, 1996.
22. Y. Bartal, "On approximating arbitrary metrices by tree metrics," STOC pp. 161-168, 1998.
23. J. Fakcharoenphol, S. Rao, and K. Talwar, "A tight bound on approximating arbitrary metrics by tree metrics," J. Comput. Syst. Sci., vol. 69 no. 3, pp. 485-497, 2004.
24. T.-H. H. Chan, K. Dhamdhere, A. Gupta, J. M. Kleinberg, and A. Slivkins, "Metric embeddings with relaxed guarantees," SIAM J. Comput., vol. 38, no. 6, pp. 2303-2329, 2009.
25. X. Zhao, A. Sala, H. Zheng, and B. Y. Zhao, "Efficient shortest paths on massive social graphs," CollaborateCom, pp. 77-86, 2011.
26. S. Baswana, "Streaming algorithm for graph spanners-single pass and constant processing time per edge," Inf. Process. Lett., vol. 106, no. 3 pp. 110-114, 2008.
27. J. Feigenbaum, S. Kannan, A. McGregor, S. Suri, and J. Zhang, "Graph distances in the streaming model: the value of space," SODA, pp. 745-754, 2005.
28. M. Qiao, H. Cheng, L. Chang, and J. Yu, "Approximate shortest distance computing: A query-dependent local landmark scheme," IEEE Transactions on Knowledge and Data Engineering, vol. 26, no. 1, pp. 55-68, 2014.
29. K. Tretyakov, A. Armas-Cervantes, L. García-Banuelos, J. Vilo, and M. Dumas, "Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs," CIKM, pp. 1785-1794, 2011.
30. R. Jin, Y. Xiang, N. Ruan, and D. Fuhry, "3-hop: a high-compression indexing scheme for reachability query," SIGMOD Conference, pp. 813-826, 2009.
31. R. Jin, Y. Xiang, N. Ruan, and H. Wang, "Efficiently answering reachability queries on very large directed graphs," SIGMOD Conference, pp. 595-608, 2008.
32. S. Trißl and U. Leser, "Fast and practical indexing and querying of very large graphs," SIGMOD Conference, pp. 845-856, 2007.
33. R. Schenkel, A. Theobald, and G. Weikum, "Hopi: An efficient connection index for complex xml document collections," EDBT, vol. 2992 pp. 237-255, 2004.
34. B. Shaw, B. C. Huang, and T. Jebara, "Learning a distance metric from a network," NIPS, pp. 1899-1907, 2011.
35. U. Brandes, "A faster algorithm for betweeness centrality," Journal of Mathematical Sociology, vol. 25, no. 2, pp. 163-177, 2001.
36. M. Christoforaki and T. Suel, "Learning to estimate pairwise distances in large graphs," http: //cse.poly.edu/~christom/distanceestimation.pdf 2014