I am trying to use Dgraph to create a BGP Hijack detection module. For this project I need to read thousands of packets a minute and for each packet I do 1 mutate and then a couple queries. My program wasn’t fast enough to keep up in real time with the network packets and the main problem is that the mutate is too slow
Each query takes about 0.0026 seconds while each mutate takes 0.037 seconds. I am only setting 1 edge in each mutate so it is not a lot of data that is changed. Is this expected behavior and is there any way I can make the mutations fast? Currently I am using the official dgraph python library for my code.