You are browsing archives for
Graph analysis is all about finding relationships. In this post I show how to compute graph density (a ratio of how well connected relationships in a graph are) using a Cypher query with Neo4j. This is a follow up to the earlier post: SPARQL Query for Graph Density Analysis. Installing Neo4j Graph Database In this example we launch Neo4j and […]
Code snippet: SPARQL Query Graph Density I’m testing out sharing SPARQL code snippets using Github Gist features. I’ll be adding more as I work through more graph-specific examples using SPARQLverse, but here is my first one: View the code on Gist. Ideally we’d have a common landing place for building up a library of these […]
In preparation for a post about doing graph analytics in Neo4j (paralleling SPARQLverse from this earlier post), I had to learn to load text/CSV data into Neo. This post just shows the steps I took to load nodes and then establish edges/relationships in the database. My head hurt trying to find a simple example of […]
Graph analytics – is it just hype or is it technology that has come of age? Mike Hoskins, CTO of Actian sums it up well in this article from InfoWorld: “One area where graph analytics particularly earns its stripes is in data discovery. While most of the discussion around big data has centered on how to […]
