skip to main content
10.1145/3007818.3007837acmotherconferencesArticle/Chapter ViewAbstractPublication PagesedbConference Proceedingsconference-collections
research-article

SP2: spanner construction for shortest path computation on streaming graph

Published: 17 October 2016 Publication History

Abstract

Computing shortest paths in graphs is one of the most fundamental and well-studied problem. It has a range of applications such as robot navigation, optimal pipelining of VLSI chip, traffic planning, and telecommunications messages routing. Many of these applications require to be solved by streaming data in real time, and recently new graph algorithmic techniques have been introduced to deal with such streaming data. This paper presents SPanner construction for Shortest Path computation (SP2) framework with three main operators C, U, and P-operator, which constructs the spanner for computation of shortest paths over a large graph stream. We compute three types of shortest paths like Single Source Shortest Path (SSSP), Single Pair Shortest Path (SPSP), and All Pairs Shortest Path (APSP) using the dynamic algorithm for constructing the spanner in small internal memory. We experimentally demonstrate and verify that this algorithm of SP2 using real datasets. Therefore, it works significantly to reduce the time complexity for updating and processing query in response to dynamic changes, such as edge insertions and deletions in a graph.

References

[1]
R. Agarwal, M. Caesar, P. Godfrey, and B. Y. Zhao. Shortest paths in microseconds. arXiv preprint arXiv:1309.0874, 2013.
[2]
C. C. Aggarwal, H. Wang, et al. Managing and mining graph data, volume 40. Springer, 2010.
[3]
S. Baswana. Streaming algorithm for graph spanners-single pass and constant processing time per edge. Information Processing Letters, 106(3):110--114, 2008.
[4]
C. Demetrescu. Fully dynamic algorithms for path problems on directed graphs. 2001.
[5]
B. Dolgorsuren, W. Nawas, and Y. K. Lee. Dynamic taxi trip information management using g* system". volume BigDAS2015, 2015.
[6]
J. Gao, R. Jin, J. Zhou, J. X. Yu, X. Jiang, and T. Wang. Relational approach for shortest path discovery over large graphs. Proceedings of the VLDB Endowment, 5(4):358--369, 2011.
[7]
M. Kapralov and D. Woodruff. Spanners and sparsifiers in dynamic streams. In Proceedings of the 2014 ACM symposium on Principles of distributed computing, pages 272--281. ACM, 2014.
[8]
J. Leskovec and A. Krevl. SNAP Datasets: Stanford large network dataset collection. http://snap.stanford.edu/data, June 2014.
[9]
A. McGregor. Graph stream algorithms: a survey. ACM SIGMOD Record, 43(1):9--20, 2014.
[10]
A. Mislove, M. Marcon, K. P. Gummadi, P. Druschel, and B. Bhattacharjee. Measurement and Analysis of Online Social Networks. In Proceedings of the 5th ACM/Usenix Internet Measurement Conference (IMC'07), San Diego, CA, October 2007.
[11]
W. Nawaz, K.-U. Khan, and Y.-K. Lee. Spore: shortest path overlapped regions and confined traversals towards graph clustering. Applied Intelligence, 43(1):208--232, 2015.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
EDB '16: Proceedings of the Sixth International Conference on Emerging Databases: Technologies, Applications, and Theory
October 2016
183 pages
ISBN:9781450347549
DOI:10.1145/3007818
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

  • KoDB: Korea Database Agency
  • Nara System: Nara System
  • 2e consulting: 2e consulting

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 17 October 2016

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. SP2
  2. CUP-operations
  3. dynamic algorithm
  4. graph spanner
  5. stream processing
  6. streaming data

Qualifiers

  • Research-article

Conference

EDB
Sponsor:
  • KoDB
  • Nara System
  • 2e consulting
EDB: 2016 International Conference on Emerging Databases
October 17 - 19, 2016
Jeju, Republic of Korea

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 85
    Total Downloads
  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)0
Reflects downloads up to 28 Feb 2025

Other Metrics

Citations

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