Skip to content

Report Archives | STAGING

Weakly Connected Components in Large-Scale Knowledge Graphs: Benchmark Study

DataWalk is an enterprise graph analytics platform designed to reveal patterns, relationships, and anomalies in large-scale, multi-source data. One of the key graph algorithms supported by DataWalk is weakly connected components, which efficiently analyzes and understands networks by breaking them into smaller, manageable groups, ensuring connectivity within each group.

DataWalk vs TigerGraph Find Paths Benchmark

DataWalk conducted performance benchmarks of the find path algorithm on DataWalk software as well as the TigerGraph graph database. Test results showed that: DataWalk is 2.1 – 3.7X faster for low and medium degree vertices. DataWalk was also significantly faster for the high degree tests, though this could not be fully quantified as TigerGraph generated […]