Back to authors
Longbin Lai
- Author ID
- o0009-0009-4735-3835
- ORCID
-
0009-0009-4735-3835
- Links
-
(found by gpt-5.6-luna on jul 24 2026)
- Most Frequent Institution
- Alibaba
- Pagerank
- 0.11022368
- Overall Rank
- 605 | 97.21%
- 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 |
| 1,572 |
Scalable Subgraph Enumeration in MapReduce |
2015 |
VLDB |
0.00010197978 |
| 2,020 |
Scalable Distributed Subgraph Enumeration |
2017 |
VLDB |
9.1729558e-05 |
| 2,774 |
GraphScope: A Unified Engine For Big Graph Processing |
2021 |
VLDB |
8.0327008e-05 |
| 3,880 |
Distributed Subgraph Matching on Timely Dataflow |
2019 |
VLDB |
6.9510799e-05 |
| 4,123 |
HUGE: An Efficient and Scalable Subgraph Enumeration System |
2021 |
SIGMOD |
6.7927568e-05 |
| 5,558 |
I/O-Efficient Butterfly Counting at Scale |
2023 |
SIGMOD |
6.0850942e-05 |
| 7,898 |
GraphScope: A One-Stop Large Graph Processing System |
2021 |
VLDB |
5.4310122e-05 |
| 9,309 |
Revisiting Graph Analytics Benchmark |
2025 |
SIGMOD |
5.1969334e-05 |
| 9,770 |
GraphScope Flex: LEGO-like Graph Computing Stack |
2024 |
SIGMOD |
5.133285e-05 |
| 10,127 |
A Modular Graph-Native Query Optimization Framework |
2025 |
SIGMOD |
5.0751052e-05 |
| 10,184 |
Path-centric Cardinality Estimation for Subgraph Matching |
2025 |
VLDB |
5.0651993e-05 |
| 10,245 |
Towards the Scheduling of Vertex-constrained Multi Subgraph Matching Query |
2020 |
SIGMOD |
5.0525742e-05 |
| 11,313 |
Sectric: Towards Accurate, Privacy-preserving and Efficient Triangle Counting |
2025 |
VLDB |
4.9793485e-05 |
| 11,546 |
Towards a Converged Relational-Graph Optimization Framework |
2024 |
SIGMOD |
4.9793485e-05 |
| 13,627 |
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.