Vertex centric index, are a solution to traverse edges quickly. If a Vertex has a 1000 of edges, let say of various types (i.e. labels in Gremelin parlance), the traversal steps need to select the edge to traverse according to their type and the target Vertex they are supposed to connect to. Vertex centric indices here enable a quick scan. In Store Like Janus or Datastax, Vertex centric indices are used. Does TigerGraph has a similar solution or a better solution to deal with the same problems ? In other words, has a native Graph DB, what solution TigerGraph has for it, and how theoretically faster is it ? What trade-off has been made here if any ?
Many thanks in advance