https://peertube.watch/videos/watch/3beb8860-5f68-4341-a74b-ccd54a870d71 We recently released a graph algorithms library for Neo4j. You can use these graph algorithms on your connected data to gain new insights more easily within the transactional database and to improve query results from your graph data, for example by focusing on particular communities or favoring popular entities. We developed this library as part of our effort to make it easier to use Neo4j for a wider variety of applications. Many users expressed interest in running graph algorithms directly on Neo4j without having to employ a secondary system. We also tuned these algorithms to be as efficient as possible in regards to resource utilization as well as streamlined for later management and debugging. In this session, we'll look at some of these graph algorithms and the types of problems that you can use them for in your applications and the implementation choices we made. Speaker: Michael Hunger, Track: Graph Processing, Room: H.2214, When: Saturday 3 February 2018, 14:15–14:50 (Brussels time), Schedule: FOSDEM 2018 event page, Licence: Creative Commons Attribution 2.0 Belgium (CC BY 2.0 BE) (as stated in the FOSDEM video archive). Attribution: “Efficient Graph Algorithms in Neo4j” by Michael Hunger, FOSDEM 2018. Original recording: 2018/H.2214/efficient_graph_algorithms_neo4j.webm from the FOSDEM video archive. This channel is an unofficial mirror; FOSDEM is a free and non-commercial event organised by the community for the community. Mon, 12 Oct 2026 03:47:41 GMT https://validator.w3.org/feed/docs/rss2.html PeerTube - https://peertube.watch https://peertube.watch/lazy-static/avatars/3b284627-b75f-409e-ac2e-10f4c2946f43.png https://peertube.watch/videos/watch/3beb8860-5f68-4341-a74b-ccd54a870d71 All rights reserved, unless otherwise specified in the terms specified at https://peertube.watch/about and potential licenses granted by each content's rightholder.