Re: Do We Need Specialized Graph Databases? Benchmarking Real-Time Social Networking Applications
Stephen Mallette <spmal...@...>
toggle quoted message Show quoted text
It did use parameters. They basically forked Jonathan Ellithorpe's work:
converted all the embedded Gremlin to strings.
Not sure how much they modified the Gremlin statements from the Ellithorpe repo. I stopped digging into it once I didn't see vertex centric indices defined and other data modelling choices I probably wouldn't have taken. LDBC is "complex" in the sense that it takes time to dig into - hasn't really been a priority to me.
I'm not sure why Gremlin Server got smacked around so badly in what they did. I couldn't find anything about how it was set up at all. They used TinkerPop 3.2.3 for their work - there have been a lot of enhancements since then in relation to memory management, so perhaps newer versions would have fared better in their tests. Again, hard to say what could/would have happened without spending a decent amount of time on it.
> then we'll be able to see what improvements can be made to the benchmark itself or within TinkerPop and JanusGraph
very cool, jason. glad your colleagues could spend some time on that. it would be nice to hear what they find.
On Mon, Aug 7, 2017 at 1:05 PM, Jason Plurad <plu...@...> wrote: