I am new to graph databases. I am trying to use a in memory radix tree for prefix based search. Is it possible to maintain radix tree in DGraph? please share any code snippet if possible.
It sounds like a specific use case, so it would be hard to get specific code samples. You’ll have to build one yourself.