Back to authors
Longbin Lai
- Author ID
- 20222
- ORCID
-
0009-0009-4735-3835
- Links
-
(found by gpt-5.2 on feb 09 2026)
- Most Frequent Institution
- Alibaba
- Pagerank
- 0.10241158
- Overall Rank
- 590 | 97.22%
- 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,162 |
Scalable Subgraph Enumeration in MapReduce |
2015 |
VLDB |
9.3964337e-05 |
| 2,801 |
Scalable Distributed Subgraph Enumeration |
2017 |
VLDB |
8.0992955e-05 |
| 3,287 |
GraphScope: A Unified Engine For Big Graph Processing |
2021 |
VLDB |
7.2739447e-05 |
| 4,556 |
Distributed Subgraph Matching on Timely Dataflow |
2019 |
VLDB |
6.0883757e-05 |
| 5,009 |
HUGE: An Efficient and Scalable Subgraph Enumeration System |
2021 |
SIGMOD |
5.761237e-05 |
| 5,773 |
I/O-Efficient Butterfly Counting at Scale |
2023 |
SIGMOD |
5.3319911e-05 |
| 7,813 |
GraphScope: A One-Stop Large Graph Processing System |
2021 |
VLDB |
4.6441779e-05 |
| 9,455 |
GraphScope Flex: LEGO-like Graph Computing Stack |
2024 |
SIGMOD |
4.3388007e-05 |
| 9,477 |
Revisiting Graph Analytics Benchmark |
2025 |
SIGMOD |
4.3341665e-05 |
| 9,788 |
A Modular Graph-Native Query Optimization Framework |
2025 |
SIGMOD |
4.2818172e-05 |
| 9,845 |
Path-centric Cardinality Estimation for Subgraph Matching |
2025 |
VLDB |
4.2721228e-05 |
| 10,672 |
Sectric: Towards Accurate, Privacy-preserving and Efficient Triangle Counting |
2025 |
VLDB |
4.1945683e-05 |
| 10,994 |
Towards a Converged Relational-Graph Optimization Framework |
2024 |
SIGMOD |
4.1945683e-05 |
| 11,570 |
Towards the Scheduling of Vertex-constrained Multi Subgraph Matching Query |
2020 |
SIGMOD |
4.1945683e-05 |
| 13,100 |
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.