News for hackers. Stuff that matters.
Re:Graphs in the database: SQL meets social networks by espeed on Friday March 16, 2012 @11:03AM (#3713585)
You can represent a graph in just about any data structure.

The key thing that separates a graph database like Neo4j (http://neo4j.org) from a graph represented in a relational database is that in a real graph database, relationships between nodes are explicitly connected so you don't have any overhead from external index look ups during traversals.

Index look ups also degrade the bigger the index gets in a relational database, whereas in a directly connected graph, it doesn't matter how many other nodes or relationships there are in the graph, performance stays constant -- Neo4j for example does about 2 million traversal steps per second (a traversal step resembles a join in a RDBMS).

Re:Graphs in the database: SQL meets social networks by 3pt14159 on Friday March 16, 2012 @12:00PM (#3713832)
2 million a second? That must be with cached data, no way it's picking up from disk that fast, even in the case where it has all the data lined up.

Edit:

I'm not saying you are wrong, I'm curious to see if they can do it and what I can learn from it.

Re:Graphs in the database: SQL meets social networks by espeed on Friday March 16, 2012 @12:45PM (#3714046)