Optimizing Edge Existence Checks on Supernodes

When operating on graphs, one very simple question emerges frequently: Is there a connection between two vertices? Does Tom know Jerry? While this looks like an easy question to answer for a graph database, it can actually be quite hard to find out without proper data structures. In this post, we take a look at how we improved JanusGraph to handle queries like these fast and efficiently.


Article Link: https://feeds.feedblitz.com/~/625395762/0/gdatasecurityblog-en~Optimizing-Edge-Existence-Checks-on-Supernodes