3 citations · 3 across the 2 of their papers we have counts for
5 papers
Efficient -core Computation and On-the-fly Query at Billion Scale with GPUs
Qingshuai Feng, Shunyang Li, Kai Wang +3
In bipartite graphs, -core is a widely used model for cohesive subgraph mining. Specifically, an -core is a maximal subgraph in which each vertex in the upper layer h…
Learning from the Past: Adaptive Parallelism Tuning for Stream Processing Systems
Yuxing Han, Lixiang Chen, Haoyu Wang +5
Distributed stream processing systems rely on the dataflow model to define and execute streaming jobs, organizing computations as Directed Acyclic Graphs (DAGs) of operators. Adjus…
HUGE: An Efficient and Scalable Subgraph Enumeration System
Zhengyi Yang, Longbin Lai, Xuemin Lin +2
Subgraph enumeration is a fundamental problem in graph analytics, which aims to find all instances of a given query graph on a large data graph. In this paper, we propose a system…
Taming the Expressiveness and Programmability of Graph Analytical Queries
Lu Qin, Longbin Lai, Kongzhang Hao +6
Graph database has enjoyed a boom in the last decade, and graph queries accordingly gain a lot of attentions from both the academia and industry. We focus on analytical queries in…
A Survey and Experimental Analysis of Distributed Subgraph Matching
Longbin Lai, Zhu Qing, Zhengyi Yang +10
Recently there emerge many distributed algorithms that aim at solving subgraph matching at scale. Existing algorithm-level comparisons failed to provide a systematic view to the pr…