Hello People!
Does TigerGraph have graph partitioning to optimize query hops?
I know it is distributed but I don’t know if it has the same distributed join issues SQL DB’s has
We use this at Optum where I work and I couldn’t find an answer anywhere
Thanks
Generally, partitioning (in the SQL sense) is not used or needed.
Distributed traversals are heavily optimised and cached to maintain performance even across multiple servers.
Where this becomes a critical issue then please contact support as we do have some options, but they re very much to be considered as a last resort as affinity based partitioning can unbalance your cluster, and almost always does more harm than good.
