Top all-time · #6454
Marko A. Rodriguez
Personal blog · markorodriguez.comprogrammingdata
Marko A. Rodriguez's personal blog at markorodriguez.com covers programming and data. Since 2010, 12 different Hacker News readers have linked it 29 times, most often “MySQL vs. Neo4j on a Large-Scale Graph Traversal”. No feed was found, so read it on the site itself.
Most-linked posts?
- MySQL vs. Neo4j on a Large-Scale Graph Traversal4 people · 5 mentions · first linked 2011-02-28
- On Graph Computing3 people · 4 mentions · first linked 2013-01-10
- /2 people · 4 mentions · first linked 2011-06-25
- /Lectures.html2 people · 2 mentions · first linked 2010-06-14
What Hacker News says?
I emailed this article to Marko ( http://markorodriguez.com/ ), and he summerized it nicely as, "Always ensure many degrees of freedom."
Comment linking /
on “Physicist proposes new way to think about intelligence”Submitted A Graph-Based Movie Recommender Engine Tutorial with Neo4j & Gremlin as a story · 105 points
HN discussionThe Neo4j User Group wants to help with this ( https://groups.google.com/d/topic/neo4j/rkhjlQx-bfo/discussi... ). Gremlin ( https://github.com/tinkerpop/gremlin/wiki ) works great for real-time recommendations. See "A Graph-Based Movie Recommender Engine" by Gremlin's creator, Marko Rodriguez ( http://markorodriguez.com/2011/09/22/a-graph-based-movie-rec... )
Comment linking /2011/09/22/a-graph-based-movie-recommender-engine/
on “Help Reddit build a recommender”Submitted MySQL vs. Neo4j on a Large-Scale Graph Traversal as a story · 18 points
HN discussionThe brain most closely resembles a graph. See Marko's post on "Graphs, Brains, and Gremlin" ( http://markorodriguez.com/2011/07/14/graphs-brains-and-greml... ). Sebastian Seung is a leading researcher in the field of neuroscience called connectomics, which studies the wiring of the brain, and he is a professor at MIT's Department of Brain and Cognitive Sciences. He is focused on mapping the connections between each…
Comment linking /2011/07/14/graphs-brains-and-gremlin/
on “Ask HN: What data structure does our brain use?”Submitted MySQL vs. Neo4j performance on a Large-Scale Graph Traversal as a story · 10 points
HN discussionBtw if youre further interested the authors other papers are listed at http://markorodriguez.com/Lectures.html . Bonus you dont need a slideshare account to download the slides pointed to by this story.
Comment linking /Lectures.html
on “Problem Solving using Graph Traversals”Submitted Global vs. Local Graph Ranking, a Tutorial Using Neo4j & Gremlin as a story · 5 points
HN discussionGraph databases usually have an accompanying index. For example, Neo4j is tightly integrated with Lucene. You can use the index to get the start node, or you can reference the start node directly by using the node ID. If you have modeled the graph so that each Person node has a link (or "edge" in graph speak) labeled "location" that points to their country, then the Gremlin query to return all software engineers in…
Comment linking /2011/02/23/knowledge-representation-and-reasoning-with-graph-databases/
on “List of graph databases”Submitted On Graph Computing as a story · 4 points
HN discussionGraphs are a much more elegant way of storing relational data. With graph databases you don't have to mess with tables or joins -- everything is implicitly joined. And Neo4j rocks -- store 32 billion nodes ( http://blog.neo4j.org/2011/03/neo4j-13-abisko-lampa-m04-size... ) with 2 million traversals per second ( http://www.infoq.com/news/2010/02/neo4j-10 ), and you can use Gremlin with it (the graph traversal languag…
Comment linking /
on “List of graph databases”Submitted The graph-programming language Gremlin opens the door to Clojure, Scala, & JRuby as a story · 3 points
HN discussionYou might appreciate this landscape distinction. http://www.slideshare.net/slidarko/titan-the-rise-of-big-gra... Furthermore, please have a look at "On Graph Computing" for a break down of 3 different categories of graph computing systems -- toolkit, database, analytics. http://markorodriguez.com/2013/01/09/on-graph-computing/ Finally, yes -- there is no theoretical expressivity gains between RDBMS and property grap…
Comment linking /2013/01/09/on-graph-computing/
on “Graph databases and Python”Submitted Graphs, Brains, & Gremlin - What Graphs and Brains Have in Common as a story · 3 points
HN discussionFor general graph DB tutorials, see... * TinkerPop Book "Resources" section: http://www.tinkerpopbook.com/ * Marko's blog: http://markorodriguez.com/ -- start with the "On Graph Computing" post ( http://markorodriguez.com/2013/01/09/on-graph-computing/ ). * Aurelius Blog: http://thinkaurelius.com/blog/ For Python, see the Bulbs Docs: http://bulbflow.com/docs/ I've been meaning to update the Bulbs docs for Bulbs/Tita…
Comment linking /2013/01/09/on-graph-computing/
on “Graph databases and Python”Submitted Exploring Wikipedia with Gremlin Graph Traversals as a story · 2 points
HN discussionTitan is one piece of the Aurelius Graph Cluster ( http://thinkaurelius.com/subscription/ ). 1. Titan is the OLTP piece, and it's very fast at running local-rank algorithms ( http://markorodriguez.com/2011/03/30/global-vs-local-graph-r... ). 2. Faunus is an OLAP graph-analytics engine that integrates Titan with Hadoop for global analysis of Titan graphs. Graphs are analyzed using a MapReduce implementation of the Gr…
Comment linking /2011/03/30/global-vs-local-graph-ranking/
on “Titan 0.3.0 Released: Geo, full-text, edge indexing on billion edge graphs”Submitted A TinkerPop Story as a story · 2 points
HN discussionTitan is distributed and has much higher write performance (5000 transactions/sec). In the words of Matthias Broecheler, the creator of Titan, you would use Titan to implement a social network ( https://twitter.com/MBroecheler/statuses/213350753031569409 ). Titan has pluggable storage options: Cassandra, HBase, Berkeley DB, and some have been working on adapters for DynamoDB and App Engine Datastore. However, it's n…
Comment linking /
on “The Distributed Graph Database Titan Provides Real-Time Big Graph Data”Submitted On Graph Computing as a story · 1 points
HN discussiona well designed relational database will execute your graph queries faster Why do you say that? -- see "MySQL vs. Neo4j on a Large-Scale Graph Traversal" ( http://markorodriguez.com/2011/02/18/mysql-vs-neo4j-on-a-lar... ). You can represent a graph in almost any data structure, including a relational database. But the difference between a graph database and everything else is that in a real graph database (like Neo4…
Comment linking /2011/02/18/mysql-vs-neo4j-on-a-large-scale-graph-traversal/
on “NoSQL is a Premature Optimization”Submitted MySQL vs. Neo4j on a Large-Scale Graph Traversal as a story · 1 points
HN discussionMarko's website has more information on graphs including lectures, papers, blog posts and the graph traversal language, Gremlin: http://markorodriguez.com/
Comment linking /
on “An Introduction to Graph Theory and Network Science”http://markorodriguez.com/2011/02/18/mysql-vs-neo4j-on-a-lar... Most graph databases use BerkeleyDB under the hood. They are pretty safe to work with.
Comment linking /2011/02/18/mysql-vs-neo4j-on-a-large-scale-graph-traversal/
on “Graph Databases Intrigue Me”It's cool to see graph DBs like Titan and Neo4j moving up the ranks. There are some major advancements coming down the pipe in the world of open-source graph computing that will make working with big graph data accessible to anyone, not just the Googles, Facebooks, and Twitters of the world. Here are some of the things coming down the pipe: Titan 0.4 was just released https://github.com/thinkaurelius/titan ), and th…
Comment linking /2011/04/19/local-and-distributed-traversal-engines/
on “DB-Engines Ranking ranks database management systems according to popularity”1. I believe I was referring to Marko Rodriguez’ attempt, documented here: http://markorodriguez.com/2011/02/18/mysql-vs-neo4j-on-a-lar... I love Marko to bits and he often publishes work of great insight; but I'm not sure what he was trying to demonstrate with this one. 2. I'm not going to try to get into Ben’s head — I'll let him answer that. 3. Downtown Seattle. I have no idea what emergency was going on but ther…
Comment linking /2011/02/18/mysql-vs-neo4j-on-a-large-scale-graph-traversal/
on “The NOSQL Tapes, vol. 9: Benjamin Black on NOSQL, Cloud Computing & fast_ip”You can write these type of algorithms easily with a graph-programming language like Gremlin ( https://github.com/tinkerpop/gremlin/wiki ): g = new Neo4jGraph('/tmp/neo4j') // calculate basic collaborative filtering for vertex 1 m = [:] g.v(1).out('likes').in('likes').out('likes').groupCount(m) m.sort{a,b -> a.value <=> b.value} // calculate the primary eigenvector (eigenvector centrality) of a graph m = [:]; c = 0;…
Comment linking /2011/03/30/global-vs-local-graph-ranking/
on “Facebook Graph Theory”Spend some time here http://markorodriguez.com/Lectures.html
Comment linking /Lectures.html
on “Ask HN: Learning Social Network Analysis - question about the math”
