101 reputation
bio website mapillary.com
location
age
visits member for 2 years, 8 months
seen Aug 2 '13 at 8:06

Jun
18
comment How can I model this problem in a graph database?
The structure looks about right. At depth 10 you are probably exhausting the diameter of your graph, meaning that you touch all nodes depending on the connectedness of your data (e.g. if images are referred from different PDFs so you can traverse on through them).
Jun
13
comment How can I model this problem in a graph database?
could you model the graph you are suggesting with console.neo4j.org, using docs.neo4j.org/chunked/snapshot/cypher-query-lang.html so it's easier to see?