ABSTRACT
We propose a new exact method for shortest-path distance queries on large-scale networks. Our method precomputes distance labels for vertices by performing a breadth-first search from every vertex. Seemingly too obvious and too inefficient at first glance, the key ingredient introduced here is pruning during breadth-first searches. While we can still answer the correct distance for any pair of vertices from the labels, it surprisingly reduces the search space and sizes of labels. Moreover, we show that we can perform 32 or 64 breadth-first searches simultaneously exploiting bitwise operations. We experimentally demonstrate that the combination of these two techniques is efficient and robust on various kinds of large-scale real-world networks. In particular, our method can handle social networks and web graphs with hundreds of millions of edges, which are two orders of magnitude larger than the limits of previous exact methods, with comparable query time to those of previous methods.
- I. Abraham, D. Delling, A. V. Goldberg, and R. F. Werneck. A hub-based labeling algorithm for shortest paths in road networks. In SEA, pages 230--241, 2011. Google ScholarDigital Library
- I. Abraham, D. Delling, A. V. Goldberg, and R. F. Werneck. Hierarchical hub labelings for shortest paths. In ESA, pages 24--35. 2012. Google ScholarDigital Library
- V. Agarwal, F. Petrini, D. Pasetto, and D. A. Bader. Scalable graph exploration on multicore processors. In SC, pages 1--11, 2010. Google ScholarDigital Library
- T. Akiba, C. Sommer, and K. Kawarabayashi. Shortest-path queries for complex networks: exploiting low tree-width outside the core. In EDBT, pages 144--155, 2012. Google ScholarDigital Library
- R. Albert, H. Jeong, and A. L. Barabasi. The diameter of the world wide web. Nature, 401:130--131, 1999.Google ScholarCross Ref
- L. Backstrom, D. Huttenlocher, J. Kleinberg, and X. Lan. Group formation in large social networks: membership, growth, and evolution. In KDD, pages 44--54, 2006. Google ScholarDigital Library
- S. Boccaletti, V. Latora, Y. Moreno, M. Chavez, and D. Hwang. Complex networks: Structure and dynamics. Physics reports, 424(4-5):175--308, 2006.Google ScholarCross Ref
- P. Boldi, M. Rosa, M. Santini, and S. Vigna. Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks. In WWW, pages 587--596, 2011. Google ScholarDigital Library
- P. Boldi and S. Vigna. The webgraph framework I: compression techniques. In WWW, pages 595--602, 2004. Google ScholarDigital Library
- D. S. Callaway, M. E. J. Newman, S. H. Strogatz, and D. J. Watts. Network robustness and fragility: Percolation on random graphs. Physical Review Letters, 85:5468--5471, 2000.Google ScholarCross Ref
- W. Chen, C. Sommer, S.-H. Teng, and Y. Wang. A compact routing scheme and approximate distance oracle for power-law graphs. TALG, 9(1):4:1--26, 2012. Google ScholarDigital Library
- J. Cheng and J. X. Yu. On-line exact shortest distance query processing. In EDBT, pages 481--492, 2009. Google ScholarDigital Library
- E. Cohen, E. Halperin, H. Kaplan, and U. Zwick. Reachability and distance queries via 2-hop labels. In SODA, pages 937--946, 2002. Google ScholarDigital Library
- W. Fan, J. Li, X. Wang, and Y. Wu. Query preserving graph compression. In SIGMOD, pages 157--168, 2012. Google ScholarDigital Library
- A. Gubichev, S. Bedathur, S. Seufert, and G. Weikum. Fast and accurate estimation of shortest paths in large graphs. In CIKM, pages 499--508, 2010. Google ScholarDigital Library
- H. He, H. Wang, J. Yang, and P. S. Yu. Blinks: ranked keyword searches on graphs. In SIGMOD, pages 305--316, 2007. Google ScholarDigital Library
- R. Jin, N. Ruan, Y. Xiang, and V. Lee. A highway-centric labeling approach for answering distance queries on large sparse graphs. In SIGMOD, pages 445--456, 2012. Google ScholarDigital Library
- C. Jordan. Sur les assemblages de lignes. J. Reine Angew Math, 70:185--190, 1869.Google ScholarCross Ref
- D. Kempe, J. Kleinberg, and E. Tardos. Maximizing the spread of influence through a social network. In KDD, pages 137--146, 2003. Google ScholarDigital Library
- J. Leskovec, D. Huttenlocher, and J. Kleinberg. Predicting positive and negative links in online social networks. In WWW, pages 641--650, 2010. Google ScholarDigital Library
- J. Leskovec, D. Huttenlocher, and J. Kleinberg. Signed networks in social media. In CHI, pages 1361--1370, 2010. Google ScholarDigital Library
- J. Leskovec, J. Kleinberg, and C. Faloutsos. Graphs over time: Densification laws, shrinking diameters and possible explanations. In KDD, pages 177--187, 2005. Google ScholarDigital Library
- J. Leskovec, K. Lang, A. Dasgupta, and M. Mahoney. Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Internet Mathematics, 6(1):29--123, 2009.Google ScholarCross Ref
- C. Magnien, M. Latapy, and M. Habib. Fast computation of empirically tight bounds for the diameter of massive graphs. J. Exp. Algorithmics, 13:10:1.10-10:1.9, Feb. 2009. Google ScholarDigital Library
- G. Malewicz, M. H. Austern, A. J. Bik, J. C. Dehnert, I. Horn, N. Leiser, and G. Czajkowski. Pregel: a system for large-scale graph processing. In SIGMOD, pages 135--146, 2010. Google ScholarDigital Library
- A. Mislove, M. Marcon, K. P. Gummadi, P. Druschel, and B. Bhattacharjee. Measurement and analysis of online social networks. In IMC, pages 29--42, 2007. Google ScholarDigital Library
- M. E. J. Newman, S. H. Strogatz, and D. J. Watts. Random graphs with arbitrary degree distributions and their applications. Physical Review E, 64(2):026118 1--17, 2001.Google ScholarCross Ref
- R. Pastor-Satorras and A. Vespignani. Evolution and structure of the Internet: A statistical physics approach. Cambridge University Press, 2004. Google ScholarDigital Library
- M. Potamias, F. Bonchi, C. Castillo, and A. Gionis. Fast shortest path distance estimation in large networks. In CIKM, pages 867--876, 2009. Google ScholarDigital Library
- M. Qiao, H. Cheng, L. Chang, and J. X. Yu. Approximate shortest distance computing: A query-dependent local landmark scheme. In ICDE, pages 462--473, 2012. Google ScholarDigital Library
- S. A. Rahman, P. Advani, R. Schunk, R. Schrader, and D. Schomburg. Metabolic pathway analysis web service (pathway hunter tool at cubic). Bioinformatics, 21(7):1189--1193, 2005. Google ScholarDigital Library
- S. A. Rahman and D. Schomburg. Observing local and global properties of metabolic pathways: 'load points' and 'choke points' in the metabolic networks. Bioinformatics, 22(14):1767--1774, 2006. Google ScholarDigital Library
- M. Richardson, R. Agrawal, and P. Domingos. Trust management for the semantic web. In ISWC, volume 2870, pages 351--368. 2003.Google ScholarDigital Library
- M. Ripeanu, A. Iamnitchi, and I. Foster. Mapping the gnutella network. IEEE Internet Computing, 6(1):50--57, Jan. 2002. Google ScholarDigital Library
- N. Robertson and P. D. Seymour. Graph minors. III. Planar tree-width. J. Comb. Theory, Ser. B, 36(1):49--64, 1984.Google ScholarCross Ref
- L. Tang and M. Crovella. Virtual landmarks for the internet. In SIGCOMM, pages 143--152, 2003. Google ScholarDigital Library
- T. Tran, H. Wang, S. Rudolph, and P. Cimiano. Top-k exploration of query candidates for efficient keyword search on graph-shaped (RDF) data. In ICDE, pages 405--416, 2009. Google ScholarDigital Library
- K. Tretyakov, A. Armas-Cervantes, L. Garcia-Banuelos, J. Vilo, and M. Dumas. Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs. In CIKM, pages 1785--1794, 2011. Google ScholarDigital Library
- A. Ukkonen, C. Castillo, D. Donato, and A. Gionis. Searching the wikipedia with contextual information. In CIKM, pages 1351--1352, 2008. Google ScholarDigital Library
- M. V. Vieira, B. M. Fonseca, R. Damazio, P. B. Golgher, D. d. C. Reis, and B. Ribeiro-Neto. Efficient search ranking in social networks. In CIKM, pages 563--572, 2007. Google ScholarDigital Library
- F. Wei. Tedi: efficient shortest path query answering on graphs. In SIGMOD, pages 99--110, 2010. Google ScholarDigital Library
- S. A. Yahia, M. Benedikt, L. V. S. Lakshmanan, and J. Stoyanovich. Efficient network aware search in collaborative tagging sites. PVLDB, 1(1):710--721, 2008. Google ScholarDigital Library
Index Terms
- Fast exact shortest-path distance queries on large networks by pruned landmark labeling
Recommendations
Dynamic and historical shortest-path distance queries on large evolving networks by pruned landmark labeling
WWW '14: Proceedings of the 23rd international conference on World wide webWe propose two dynamic indexing schemes for shortest-path and distance queries on large time-evolving graphs, which are useful in a wide range of important applications such as real-time network-aware search and network evolution analysis. To the best ...
Fully Dynamic Shortest-Path Distance Query Acceleration on Massive Networks
CIKM '16: Proceedings of the 25th ACM International on Conference on Information and Knowledge ManagementThe distance between vertices is one of the most fundamental measures for representing relations between them, and it is the basis of other classic measures of vertices, such as similarity, centrality, and influence. The 2-hop labeling methods are known ...
Query-by-Sketch: Scaling Shortest Path Graph Queries on Very Large Networks
SIGMOD '21: Proceedings of the 2021 International Conference on Management of DataComputing shortest paths is a fundamental operation in processing graph data. In many real-world applications, discovering shortest paths between two vertices empowers us to make full use of the underlying structure to understand how vertices are ...
Comments