This Week in Neo4j – Exploration from Bloom Canvas, Building your first Graph App, Parallel k-Hop counts, Scala Cypher DSL

This week Anurag Tandon shows us how to do graph exploration from the Bloom canvas, and Max De Marzi builds a procedure that computes parallel k-Hop counts.

We also the release of a Scala Cypher DSL and a library that packages functionality for working with Neo4j and R. And Will Lyon and Amy Hodler published the slides from their Graph Algorithms talk at OSCON 2019.

Our featured community members this week is Nicole Forrester.

Nicole Forrester - This Week’s Featured Community Member

Nicole Forrester – This Week’s Featured Community Member

Like many others in the Neo4j community, Nicole is one of those fascinating visionary people who is flowing with new and interesting ideas. What’s even more inspirational about her is that she backs her ideas up with action!

We’ve contracted her idea and design work for a couple projects including some you may have seen, like the design of the photo-booth at GraphConnect, badges on the Neo4j community site, and most recently, the design for the Global GraphHack 2019 t-shirts (they are going to be so awesome!)!

Thanks for being so involved with our community, Nicole. We’re so lucky to have you as part of it.

Exploration from Bloom Canvas (Video #3 in Bloom Series)

In the 3rd video of Anurag Tandon‘s series of videos on Neo4j Bloom, the graph visualisation tool, we learn how to do graph exploration from the Bloom canvas.

With the help of an Olympics dataset, Anurag shows us how to find and expand nodes, zoom the screen to fit a selection, find the shortest path between a pair of nodes, and more.

Build your first Neo4j Desktop Graph App in vanilla Javascript

Aldrin Misquitta has written a step by step tutorial showing how to build your first Graph App. You can find a list of all the available Graph Apps in the Graph App Installer.

Parallel k-Hop counts

In Max De Marzi’s latest blog post he builds on a previous post from October 2018, in which he showed how to quickly count the number of nodes that a node has.

In this post Max shows how to write a faster version of the procedure using Neo4j’s Internal API. He also parallelises the computation to gain further speed improvements.

Football Transfers Graph, Neo4jShell, SSIS and Neo4j, Graph Algorithms Slidedeck

    • I wrote a blog post showing how I built a football (soccer) transfers graph, containing players, clubs, leagues, and of course transfers, based on data from the website.
    • Keith McNulty released neo4jshell, a library that packages functionality for working with Neo4j and R. The library includes rapid querying, and various functions to aid with ETL and management of the Neo4J server from within an R session.
    • Chris Skardon has started a series of blog posts showing how to use an existing SSIS (SQL Server Integration Services) infrastructure with Neo4j. In the first post he gives an overview of the two parts of the connector: the Neo4j Connection Manager (CM) and the Execute Cypher Task (ECT).
    • Will Lyon and Amy Hodler published the slides from their OSCON talk, Graph Algorithms: Predict Real-World Behavior

Introducing Scala Cypher DSL

Manish Katoch released Scala-cypher-DSL, a type-safe, compile-time DSL for Neo4J Cypher Query Language in Scala.

In the release blog post, Manish shows us how to install and use the library with the help of a small friends dataset. There’s also more information on the project Wiki.

Tweet of the Week

My favourite tweet this week was by Gabriela D’avila Ferrara:

Don’t forget to RT if you liked it too.

That’s all for this week. Have a great weekend!

Cheers, Mark