skip to main content
10.1145/2983323.2983731acmconferencesArticle/Chapter ViewAbstractPublication PagescikmConference Proceedingsconference-collections
research-article

Fully Dynamic Shortest-Path Distance Query Acceleration on Massive Networks

Published: 24 October 2016 Publication History

Abstract

The 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 as the fastest exact point-to-point distance algorithms on million-scale networks. However, they cannot handle billion-scale networks because of the large space requirement and long preprocessing time. In this paper, we present the first algorithm that can process exact distance queries on fully dynamic billion-scale networks besides trivial non-indexing algorithms, which combines an online bidirectional breadth-first search (BFS) and an offline indexing method for handling billion-scale networks in memory. First, we accelerate bidirectional BFSs by using heuristics that exploit the small-world property of complex networks. Then, we construct bit-parallel shortest-path trees to maintain sets of shortest paths passing through high-degree vertices of networks in compact form, the information of which enables us to avoid visiting vertices with high degrees during bidirectional BFSs. Thus, the searches achieve considerable speedup. In addition, our index size reduction technique enables us to handle billion-scale networks in memory. Furthermore, we introduce dynamic update procedures of our data structure to handle fully dynamic networks. We evaluated the performance of the proposed method on real-world networks. In particular, on large-scale social networks with over 1B edges, the proposed method enables us to answer distance queries in around 1 ms, on average.

References

[1]
konect network dataset - KONECT, May 2015.
[2]
B. Abrahao, F. Chierichetti, R. Kleinberg, and A. Panconesi. Trace complexity of network inference. In KDD, pages 491--499, 2013.
[3]
T. Akiba, Y. Iwata, and Y. Yoshida. Fast exact shortest-path distance queries on large networks by pruned landmark labeling. In SIGMOD, pages 349--360, 2013.
[4]
T. Akiba, Y. Iwata, and Y. Yoshida. Dynamic and historical shortest-path distance queries on large evolving networks by pruned landmark labeling. In WWW, pages 237--248, 2014.
[5]
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.
[6]
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.
[7]
P. Boldi and S. Vigna. The WebGraph Framework I: Compression Techniques. In WWW, pages 595--601, 2004.
[8]
P. Boldi and S. Vigna. Axioms for centrality. Internet Mathematics, 10(3--4):222--262, 2014.
[9]
L. Chang, J. X. Yu, L. Qin, H. Cheng, and M. Qiao. The exact distance to destination in undirected world. VLDB J., 21(6):869--888, 2012.
[10]
E. Cohen, D. Delling, F. Fuchs, A. V. Goldberg, M. Goldszmidt, and R. F. Werneck. Scalable similarity estimation in social networks: Closeness, node labels, and random edge lengths. In COSN, pages 131--142, 2013.
[11]
E. Cohen, E. Halperin, H. Kaplan, and U. Zwick. Reachability and distance queries via 2-hop labels. In SODA, pages 937--946, 2002.
[12]
E. Delling, A. V. Goldberg, T. Pajor, and R. F. Werneck. Robust distance queries on massive networks. In ESA, pages 321--333. 2014.
[13]
N. Du, L. Song, M. Gomez-Rodriguez, and H. Zha. Scalable influence estimation in continuous-time diffusion networks. In NIPS, pages 3147--3155, 2013.
[14]
L. C. Freeman. A set of measures of centrality based on betweenness. Sociometry, 40(1):35--41, 1977.
[15]
D. Frigioni, A. Marchetti-Spaccamela, and U. Nanni. Fully dynamic algorithms for maintaining shortest paths trees. J. Algorithms, 34(2):251--281, 2000.
[16]
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. PVLDB, 6(6):457--468, 2013.
[17]
A. V. Goldberg and C. Harrelson. Computing the shortest path: A search meets graph theory. In SODA, pages 156--165, 2005.
[18]
M. Gomez-Rodriguez, D. Balduzzi, and B. Schölkopf. Uncovering the temporal dynamics of diffusion networks. In ICML, pages 561--568, 2011.
[19]
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.
[20]
P. Gupta, A. Goel, J. Lin, A. Sharma, D. Wang, and R. Zadeh. WTF: The who to follow service at twitter. In WWW, pages 505--514, 2013.
[21]
M. Haghir Chehreghani. Effective co-betweenness centrality computation. In WSDM, pages 423--432, 2014.
[22]
M. Jiang, A. W.-C. Fu, R. C.-W. Wong, and Y. Xu. Hop doubling label indexing for point-to-point distance querying on scale-free networks. PVLDB, 7(12):1203--1214, 2014.
[23]
R. Jin, N. Ruan, B. You, and H. Wang. Hub-accelerator: Fast and exact shortest path computation in large social networks. CoRR, abs/1305.0507, 2013.
[24]
J. Leskovec and A. Krevl. SNAP Datasets: Stanford large network dataset collection.
[25]
D. Liben-Nowell and J. Kleinberg. The link-prediction problem for social networks. Journal of the American society for information science and technology, 58(7):1019--1031, 2007.
[26]
S. Maniu and B. Cautis. Network-aware search in social tagging applications: Instance optimality versus efficiency. In CIKM, pages 939--948, 2013.
[27]
M. Potamias, F. Bonchi, C. Castillo, and A. Gionis. Fast shortest path distance estimation in large networks. In CIKM, pages 867--876, 2009.
[28]
Z. Qi, Y. Xiao, B. Shao, and H. Wang. Toward a distance oracle for billion-node graphs. PVLDB, 7(1):61--72, 2013.
[29]
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.
[30]
G. Sabidussi. The centrality index of a graph. Psychometrika, 31(4):581--603, 1966.
[31]
K. Tretyakov, A. Armas-cervantes, L. García-banuelos, and M. Dumas. Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs. In CIKM, pages 1785--1794, 2011.
[32]
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.

Cited By

View all
  • (2024)FulBM: Fast Fully Batch Maintenance for Landmark-based 3-hop Cover LabelingACM Transactions on Knowledge Discovery from Data10.1145/365003518:6(1-26)Online publication date: 29-Apr-2024
  • (2024)Congestion-Mitigating Spatiotemporal Routing in Road Networks2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00349(4586-4599)Online publication date: 13-May-2024
  • (2024)BatchHL: batch dynamic labelling for distance queries on large-scale networksThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-023-00799-933:1(101-129)Online publication date: 1-Jan-2024
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
CIKM '16: Proceedings of the 25th ACM International on Conference on Information and Knowledge Management
October 2016
2566 pages
ISBN:9781450340731
DOI:10.1145/2983323
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 24 October 2016

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. dynamic updates
  2. graphs
  3. query processing
  4. shortest-path

Qualifiers

  • Research-article

Conference

CIKM'16
Sponsor:
CIKM'16: ACM Conference on Information and Knowledge Management
October 24 - 28, 2016
Indiana, Indianapolis, USA

Acceptance Rates

CIKM '16 Paper Acceptance Rate 160 of 701 submissions, 23%;
Overall Acceptance Rate 1,861 of 8,427 submissions, 22%

Upcoming Conference

CIKM '25

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)36
  • Downloads (Last 6 weeks)0
Reflects downloads up to 25 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2024)FulBM: Fast Fully Batch Maintenance for Landmark-based 3-hop Cover LabelingACM Transactions on Knowledge Discovery from Data10.1145/365003518:6(1-26)Online publication date: 29-Apr-2024
  • (2024)Congestion-Mitigating Spatiotemporal Routing in Road Networks2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00349(4586-4599)Online publication date: 13-May-2024
  • (2024)BatchHL: batch dynamic labelling for distance queries on large-scale networksThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-023-00799-933:1(101-129)Online publication date: 1-Jan-2024
  • (2023)Experimental Evaluation of Indexing Techniques for Shortest Distance Queries on Road Networks2023 IEEE 39th International Conference on Data Engineering (ICDE)10.1109/ICDE55515.2023.00054(624-636)Online publication date: Apr-2023
  • (2023)Top-k Distance Queries on Large Time-Evolving GraphsIEEE Access10.1109/ACCESS.2023.331660211(102228-102242)Online publication date: 2023
  • (2023)Efficient maintenance of highway cover labelling for distance queries on large dynamic graphsWorld Wide Web10.1007/s11280-023-01146-226:5(2427-2452)Online publication date: 22-Mar-2023
  • (2022)Recent Advances in Fully Dynamic Graph Algorithms – A Quick Reference GuideACM Journal of Experimental Algorithmics10.1145/355580627(1-45)Online publication date: 13-Dec-2022
  • (2022)DyGraphProceedings of the 5th ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA)10.1145/3534540.3534692(1-8)Online publication date: 12-Jun-2022
  • (2022)Coarse-Grained Path Planning Under Dynamic Situational EnvironmentSpatial Data and Intelligence10.1007/978-3-031-24521-3_1(3-18)Online publication date: 5-Aug-2022
  • (2021)Query-by-Sketch: Scaling Shortest Path Graph Queries on Very Large NetworksProceedings of the 2021 International Conference on Management of Data10.1145/3448016.3452826(1946-1958)Online publication date: 9-Jun-2021
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media