Tuesday 29th May, 2012
1:40pm to 2:25pm
With property graph databases and NoSQL coming into fashion over the last years, the interest in graph algorithms, graph processing and recommender systems has increased considerably. In this talk, Peter Neubauer is outlining the differences in approach between imperative scripting of graph traversals with Gremlin and nested iterators over a data structure, and declarative techniques like Cypher, a pattern matching language over Neo4j.
Peter will show basic recommendation algos, spreading activation and min/max flow calculations on live demo graphs. Be aware that things might break, but fun and pun is guaranteed.
If you can write, you can code - @coderdojomalmo. If you can sketch, you can use a graph database - @neo4j bio from Twitter
Sign in to add slides, notes or videos to this session