Interesting hack! It would be interesting to compare the performance of a solution like this to a hacky solution in a traditional relational database.
The number would only grow with time and the numpath could quickly reach into the 100k. Do you have any idea how performance heavy that query is? I haven’t used DGraph before so I have a hard time estimating it. I could probably improve the performance a bit by filtering out some nodes (eg on date)
I also assume there is no pagination possible here? If there is, one solution would be to make use of that to save some performance