Wukong

Querying graph data is becoming increasingly prevalent and important across many application domains, like social networking, urban monitoring, electronic payment, and semantic webs. In the last few years, we have ben working on improving the performance of graph querying by leveraging new hardware features and system designs. Moving towards this goal, we have designed and developed Wukong, a distributed in-memory framework that provides low latency and high throughput for concurrent query processing over large and fast-evolving graph data. This article overviews our architecture and presents four systems that aim to satisfy diverse challenging requirements on graph querying (e. g. high concurrency, evolving graphs, workload heterogencity, and locality preserving). Our systems also significantly outperform state-of-the-art systems in both latency and throughput, usually by orders of magnitude.