Hi TG team members!
I am now making a comprehensive comparison amongst popular graph databases, and found something interesting. In spite of many competitors, TG still remains dominantly fast when it comes to applications with extremely huge data and long hops between edges. I knew some graph databases strive to achieve a competitive edge by using faster programming languages (such as Golang which introduces special mechanisms like goroutines without thread-local storage) and “twisting” the code. However, these measures seldom come with algorithmic-level improvement (such as from O(N) to O(logN)).
I wonder if I could know with which programming language you implemented TG? Supposedly, it could be C++ or Golang? Thank you.