We have a requirement to build a search functionality to find connected nodes based on some identifiers with high performance and TPS. While doing analysis we noticed gremlin queries are not able to support required performance. So i was thinking it there any other way to get connected node.
How large is your graph, can you hold it in memory in its entirety? How large are the subgraphs you want to retrieve in terms of width and size? What are your requirements regarding TPS? When you refer to "gremlin" what graph system did you use instead of JanusGraph?
Our graph is very large around 1TB, so can not hold in memory. Subgraphs that we want to retrieve can have 30 -40 connected nodes. We have requirement of around 200 TPS. We are using JanusGraph only, i meant i am using gremlin query to search in Janus graph.
In individual query for a subgraph of 40 nodes will typically take between 0.1 and 1 seconds (with scyllaDb being the fastest storage backend). The number of 200 TPS can be reached easily by scaling the number of transactions, janusgraph instances and storage backend nodes.
I guess this was already clear to you and you got it confirmed now!
