Back to authors
Longbin Lai
- Author ID
- 20226
- ORCID
-
0009-0009-4735-3835
- Links
-
(found by gpt-5.2 on feb 09 2026)
- Most Frequent Institution
- Alibaba
- Pagerank
- 0.10238
- Overall Rank
- 610 | 97.08%
- Paper Count
- 15
Affiliation Timeline
Incoming Non-self Citations Over Time
Total yearly non-self incoming citations across all papers by this author.
Publications by Paper Pagerank
Showing 15 of 15 publications.
| Rank |
Title |
Year |
Venue |
Pagerank |
| 2,172 |
Scalable Subgraph Enumeration in MapReduce |
2015 |
VLDB |
9.37776e-05 |
| 2,787 |
Scalable Distributed Subgraph Enumeration |
2017 |
VLDB |
8.1219297e-05 |
| 3,287 |
GraphScope: A Unified Engine For Big Graph Processing |
2021 |
VLDB |
7.2689944e-05 |
| 4,554 |
Distributed Subgraph Matching on Timely Dataflow |
2019 |
VLDB |
6.0839934e-05 |
| 5,002 |
HUGE: An Efficient and Scalable Subgraph Enumeration System |
2021 |
SIGMOD |
5.7610359e-05 |
| 5,782 |
I/O-Efficient Butterfly Counting at Scale |
2023 |
SIGMOD |
5.3268721e-05 |
| 7,819 |
GraphScope: A One-Stop Large Graph Processing System |
2021 |
VLDB |
4.6397234e-05 |
| 9,457 |
GraphScope Flex: LEGO-like Graph Computing Stack |
2024 |
SIGMOD |
4.3346427e-05 |
| 9,479 |
Revisiting Graph Analytics Benchmark |
2025 |
SIGMOD |
4.3300131e-05 |
| 9,791 |
A Modular Graph-Native Query Optimization Framework |
2025 |
SIGMOD |
4.2777144e-05 |
| 9,845 |
Path-centric Cardinality Estimation for Subgraph Matching |
2025 |
VLDB |
4.2680295e-05 |
| 10,680 |
Sectric: Towards Accurate, Privacy-preserving and Efficient Triangle Counting |
2025 |
VLDB |
4.1905499e-05 |
| 10,997 |
Towards a Converged Relational-Graph Optimization Framework |
2024 |
SIGMOD |
4.1905499e-05 |
| 11,574 |
Towards the Scheduling of Vertex-constrained Multi Subgraph Matching Query |
2020 |
SIGMOD |
4.1905499e-05 |
| 13,114 |
Graphy’our Data: Towards End-to-End Modeling, Exploring and Generating Report from Raw Data |
2025 |
SIGMOD |
- |
Frequent Co-authors
Co-authored at least 5 papers.