Skip to main content

Indexing Continuous Paths in Temporal Graphs

  • Conference paper
  • First Online:
New Trends in Database and Information Systems (ADBIS 2022)

Abstract

Temporal property graph databases track the evolution over time of nodes, properties, and edges in graphs. Computing temporal paths in these graphs is hard. In this paper we focus on indexing Continuous Paths, defined as paths that exist continuously during a certain time interval. We propose an index structure called TGIndex where index nodes are defined as nodes in the graph database. Two different indexing strategies are studied. We show how the index is used for querying and also present different search strategies, that are compared and analyzed using a large synthetic graph.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.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

References

  1. Angles, R.: The property graph database model. In: Proceedings of AMW 2018, CEUR Workshop Proceedings, Cali, Colombia, 21–25 May 2018, vol. 2100. CEUR-WS.org (2018)

    Google Scholar 

  2. Debrouvier, A., Parodi, E., Perazzo, M., Soliani, V., Vaisman, A.: A model and query language for temporal graph databases. VLDB J. 30(5), 825–858 (2021). https://doi.org/10.1007/s00778-021-00675-4

    Article  Google Scholar 

  3. Elmasri, R., Kim, Y., Wuu, G.T.J.: Efficient implementation techniques for the time index. In: Proceedings of ICDE 1991, 8–12 April 1991, Kobe, Japan, pp. 102–111. IEEE Computer Society (1991)

    Google Scholar 

  4. Elmasri, R., Wuu, G.T.J., Kim, Y.: The time index: an access structure for temporal data. In: Proceedings of VLDB 1990, Brisbane, Queensland, Australia, 13–16 August 1990, pp. 1–12. Morgan Kaufmann (1990)

    Google Scholar 

  5. Huo, W., Tsotras, V.J.: Efficient temporal shortest path queries on evolving social graphs. In: SSDBM, Aalborg, Denmark, 30 June–2 July 2014, pp. 38:1–38:4 (2014)

    Google Scholar 

  6. Kvet, M., Matiasko, K.: Impact of index structures on temporal database performance. In: EMS 2016, Pisa, Italy, 28–30 November 2016, pp. 3–9. IEEE (2016)

    Google Scholar 

  7. Pokorný, J., Valenta, M., Troup, M.: Indexing patterns in graph databases. In: DATA 2018, Porto, Portugal, 26–28 July 2018, pp. 313–321. SciTePress (2018)

    Google Scholar 

Download references

Acknowledgements

Valeria Soliani and Alejandro Vaisman were partially supported by Project PICT 2017-1054, from the Argentinian Scientific Agency.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alejandro Vaisman .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kuijpers, B., Ribas, I., Soliani, V., Vaisman, A. (2022). Indexing Continuous Paths in Temporal Graphs. In: Chiusano, S., et al. New Trends in Database and Information Systems. ADBIS 2022. Communications in Computer and Information Science, vol 1652. Springer, Cham. https://doi.org/10.1007/978-3-031-15743-1_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-15743-1_22

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-15742-4

  • Online ISBN: 978-3-031-15743-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics