Skip to main content
SpringerLink
Log in

The Time Has Come: Traversal and Reachability in Time-Varying Graphs

  • Conference paper
  • First Online:
Biomedical Data Management and Graph Online Querying (Big-O(Q) 2015, DMAH 2015)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9579))

  • 800 Accesses

Abstract

Increasingly, enterprises require efficient graph processing capabilities to store and analyze the evolution of the graph topology over time. While a static graph captures information about the connectedness of vertices at a certain point in time, a time-varying graph keeps track of every data manipulation—insertion and removal of a vertex or an edge—performed on the graph and allows detecting topological changes, such as cluster growth and subgraph densification, and discovering behavioral patterns of the connected entities in the graph. Although temporal graph processing has been an active research area in the past decade, most well-known graph algorithms are defined on static graphs only.

In this paper we study the problem of graph traversals and reachability in the presence of a temporal dimension and derive three classes of temporal traversals from a set of realistic use cases. We validate our prototypical implementations against two graph processing systems, a columnar graph execution engine and a native graph database management system. Our experimental evaluation on a large real-world graph dataset demonstrates the generality and applicability of our solution and shows the scalability of our proposed temporal traversal operators to different graph sizes.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    https://dandelion.eu/datagems/SpazioDati/telecom-mi-to-mi/.

References

  1. Allen, J.F.: Maintaining knowledge about temporal intervals. Commun. ACM 26(11), 832–843 (1983)

    Article  MATH  Google Scholar 

  2. Casteigts, A., Flocchini, P., Mans, B., Santoro, N.: Measuring temporal lags in delay-tolerant networks. In: Proceedings of the IPDPS, pp. 209–218. IEEE (2011)

    Google Scholar 

  3. Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. Int. J. Parallel Emerg. Distrib. Syst. 27(5), 387–408 (2012)

    Article  Google Scholar 

  4. Cattuto, C., Quaggiotto, M., Panisson, A., Averbuch, A.: Time-varying Social Networks in a graph database: A Neo4j use case. In: Proceedings of the GRADES 2013, pp. 1–6 (2013)

    Google Scholar 

  5. Kempe, D., Kleinberg, J., Kumar, A.: Connectivity and inference problems for temporal networks. J. Comput. System Sci. 64(4), 820–842 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  6. Martínez-Bazan, N., Águila Lorente, M.A., Muntés-Mulero, V., Dominguez-Sal, D., Gómez-Villamor, S., Larriba-Pey, J.L.: Efficient graph management based on bitmap indices. In: Proceedings of the IDEAS, pp. 110–119 (2012)

    Google Scholar 

  7. Nicosia, V., Tang, J., Mascolo, C., Musolesi, M., Russo, G., Latora, V.: Graph metrics for temporal networks. In: Holme, P., Saramäki, J. (eds.) Temporal Networks. UCS, pp. 15–40. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  8. Pan, R.K., Saramäki, J.: Path lengths, correlations, and centrality in temporal networks. Phys. Rev. E 84(1), 197–206 (2011)

    Article  Google Scholar 

  9. Paradies, M., Lehner, W., Bornhövd, C.: GRAPHITE: an extensible graph traversal framework for relational database management systems. In: Proceedings of the SSDBM, pp. 29: 1–29: 12 (2015)

    Google Scholar 

  10. Wu, H., Cheng, J., Huang, S., Ke, Y., Lu, Y., Xu, Y.: Path problems in temporal graphs. Proc. VLDB Endow. 7(9), 721–732 (2014)

    Article  Google Scholar 

Download references

Acknowledgments

We would like to express our gratitute to Martin Kaufmann, who assisted in carving out the ideas presented in this paper and has given insightful feedback on previous versions of it. Also, Christof Bornhövd has encouraged us in pursuing this research direction and supported us in various ways.

Author information

Authors and Affiliations

  1. SAP SE, 69190, Walldorf, Germany

    Max Wildemann, Michael Rudolf & Marcus Paradies

  2. Database Technology Group, TU Dresden, 01187, Dresden, Germany

    Michael Rudolf & Marcus Paradies

Authors
  1. Max Wildemann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael Rudolf
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Marcus Paradies
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Michael Rudolf .

Editor information

Editors and Affiliations

  1. Stony Brook University, Stony Brook, New York, USA

    Fusheng Wang

  2. University of Utah, Salt Lake City, Utah, USA

    Gang Luo

  3. Columbia University, New York, New York, USA

    Chunhua Weng

  4. Nanyang Technological University, Singapore, Singapore

    Arijit Khan

  5. Qatar Computing Research Institute, Doha, Qatar

    Prasenjit Mitra

  6. Google Research, New York, New York, USA

    Cong Yu

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Wildemann, M., Rudolf, M., Paradies, M. (2016). The Time Has Come: Traversal and Reachability in Time-Varying Graphs. In: Wang, F., Luo, G., Weng, C., Khan, A., Mitra, P., Yu, C. (eds) Biomedical Data Management and Graph Online Querying. Big-O(Q) DMAH 2015 2015. Lecture Notes in Computer Science(), vol 9579. Springer, Cham. https://doi.org/10.1007/978-3-319-41576-5_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-41576-5_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-41575-8

  • Online ISBN: 978-3-319-41576-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation