3 citations · 3 across the 2 of their papers we have counts for
4 papers
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 Framework to Quantify Approximate Simulation on Graph Data
Xiaoshuang Chen, Longbin Lai, Lu Qin +2
Simulation and its variants (e.g., bisimulation and degree-preserving simulation) are useful in a wide spectrum of applications. However, all simulation variants are coarse "yes-or…
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…