Quegel: A General-Purpose System For Querying Big Graphs
SIGMOD/PODS'16: International Conference on Management of Data San Francisco California USA June, 2016(2016)
摘要
Inspired by Google's Pregel., many distributed graph processing systems have been developed recently to process big graphs. These systems expose a vertex-centric programming interface to users, where a programmer thinks like a vertex when designing parallel graph algorithms. However, existing systems are designed for tasks where most vertices in a graph participate in the computation, and they are not suitable for processing light-workload graph queries which only access a small portion of vertices. This is because their programming model can seriously under-utilize the resources in a cluster for processing graph queries.In this demonstration, we introduce a general-purpose system felt querying big graphs, called Quegel, which treats queries as Brat-class citizens in the design of its computing model. Quegel adopts a novel supersrep-sharing execution model to overcome the weaknesses of existing systems. We demonstrate it is user-friendly to write parallel graph-querying programs with Quegel's interface; and we also show that Quegel is able to achieve real-time response time in various applications, including the two applications that we plan to demonstrate: point-to-point shortest-path queries and XML keyword search.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要