7 citations · 10 across the 8 of their papers we have counts for
5 papers · 1 filter
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…
Batch Hop-Constrained s-t Simple Path Query Processing in Large Graphs
Long Yuan, Kongzhang Hao, Xuemin Lin +1
Hop-constrained s-t simple path (HC-s-t path) enumeration is a fundamental problem in graph analysis. Existing solutions for this problem focus on optimizing the processing perform…
An Empirical Analysis of Just-in-Time Compilation in Modern Databases
Miao Ma, Zhengyi Yang, Kongzhang Hao +3
JIT (Just-in-Time) technology has garnered significant attention for improving the efficiency of database execution. It offers higher performance by eliminating interpretation over…
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…
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…