Skip to main content

Comparing Graph Data Science Libraries for Querying and Analysing Datasets: Towards Data Science Queries on Graphs

  • Conference paper
  • First Online:
Service-Oriented Computing – ICSOC 2021 Workshops (ICSOC 2021)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13236))

Included in the following conference series:

Abstract

This paper presents an experimental study to compare analysis tools with management systems for querying and analysing graphs. Our experiment compares classic graph navigational operations queries where analytics tools and management systems adopt different execution strategies. Then, our experiment addresses data science pipelines with clustering and prediction models applied to graphs. In this kind of experiment, we underline the interest of combining both approaches and the interest of relying on a parallel execution platform for executing queries.

This work was funded by the Quasimodo action in U. Orléans and the DOING action of the GDR MADICS.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    https://neo4j.com/docs/graph-data-science/current/algorithms/label-propagation/.

  2. 2.

    https://github.com/gevargas/doing-graph-datascience-queries.

References

  1. Beveridge, A., Shan, J.: Network of Thrones. Math Horiz. 23(4), 18–22 (2016)

    Article  MathSciNet  Google Scholar 

  2. Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. Comput. Netw. ISDN Syst. 30(1–7), 107–117 (1998)

    Article  Google Scholar 

  3. Choi, M.B., Lee, S.U.: A prim minimum spanning tree algorithm for directed graph. J. Inst. Internet Broadcast. Commun. 12(3), 51–61 (2012)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Genoveva Vargas-Solar .

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

Vargas-Solar, G., Marrec, P., Halfeld Ferrari Alves, M. (2022). Comparing Graph Data Science Libraries for Querying and Analysing Datasets: Towards Data Science Queries on Graphs. In: Hacid, H., et al. Service-Oriented Computing – ICSOC 2021 Workshops. ICSOC 2021. Lecture Notes in Computer Science, vol 13236. Springer, Cham. https://doi.org/10.1007/978-3-031-14135-5_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-14135-5_16

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-14134-8

  • Online ISBN: 978-3-031-14135-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics