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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Beveridge, A., Shan, J.: Network of Thrones. Math Horiz. 23(4), 18–22 (2016)
Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. Comput. Netw. ISDN Syst. 30(1–7), 107–117 (1998)
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)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 Springer Nature Switzerland AG
About this paper
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)