Find out what's new in the Neo4j world
Iterating over large numbers of nodes using Cypher is quite a common use case in Neo4j. Typically, the reason for doing this
is that we want to perform some kind of operation for each one of these nodes. In this blog post, we will use one million
TestNodes and try to iterate over them in order to index their contents into a freshly created Elasticsearch index.
There are three approaches we can take, two of which are quite common, but the most performant technique is largely unknown.
Last month, I had the pleasure of speaking at GraphConnect in San Francisco, introducing the Graph-Aided Search to a large audience of Neo4j users and graph enthusiasts. For those who missed the conference, the recording and slides have now been made available. Enjoy and get in touch with feedback / questions!
Recently, Neo Technology announced the 2.3.0-RC1 release of their Neo4j graph database. One of the key new features is Triadic Selection built into Cypher’s Cost Based Planner. In this blog post, we will explore the Triadic Selection in detail and demonstrate how significantly it can speed up recommendations computed in Neo4j.
For the last couple of years, Neo4j has been increasingly popular as the technology of choice for people building real-time recommendation engines. Having been at the forefront of the graph movement through client engagements and open-source software development, we have identified the next step in the natural evolution of graph-based recommendation engines. We call it Graph-Aided Search.
Drawing a graph on a whiteboard is easy and fun! Translating that graph into an object model can sometimes result in questions such as “do I have to define relationships in both participating node entities?” or “which end of the relationship should I save?”.
Writing integration tests for your code that runs against Neo4j is simple enough when using the native API, but there’s not a great deal of help out there if you’re working in client-server mode. Making assertions about the shape of the graph can also be difficult, particularly if use cases involve more than a few nodes and relationships.
In this blog post, we’ll demonstrate how to use variable length relationships (sometimes called “variable length paths”) in Cypher using examples. We will also see when zero length relationships can be useful.
GraphAware is very proud to sponsor GraphConnect Europe 2015, the only conference that focuses on the rapidly growing world of graph databases and applications that make sense of connected data. The conference takes place in London on 7th May 2015.
01 Apr 2015 by Luanne Misquitta GraphAware
Graph Aware Ltd. is excited to announce their new partnership with Glasses Inc. Managing Director Michal Bachman claims that wearers of GA-Glass become truly graph aware, allowing them to boldly go where no Glass has traversed before.