Back to authors
Longbin Lai
- Author ID
- 20405
- ORCID
-
0009-0009-4735-3835
- Links
-
(found by gpt-5.6-luna on jul 24 2026)
- Most Frequent Institution
- Alibaba
- Pagerank
- 0.11111806
- Overall Rank
- 582 | 97.24%
- 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,552 |
Scalable Subgraph Enumeration in MapReduce |
2015 |
VLDB |
0.00010379532 |
| 2,065 |
Scalable Distributed Subgraph Enumeration |
2017 |
VLDB |
9.2352771e-05 |
| 2,915 |
GraphScope: A Unified Engine For Big Graph Processing |
2021 |
VLDB |
7.9666977e-05 |
| 3,821 |
Distributed Subgraph Matching on Timely Dataflow |
2019 |
VLDB |
7.0933895e-05 |
| 4,158 |
HUGE: An Efficient and Scalable Subgraph Enumeration System |
2021 |
SIGMOD |
6.8628196e-05 |
| 5,427 |
I/O-Efficient Butterfly Counting at Scale |
2023 |
SIGMOD |
6.2230767e-05 |
| 7,796 |
GraphScope: A One-Stop Large Graph Processing System |
2021 |
VLDB |
5.5427726e-05 |
| 9,593 |
GraphScope Flex: LEGO-like Graph Computing Stack |
2024 |
SIGMOD |
5.2511057e-05 |
| 9,622 |
Revisiting Graph Analytics Benchmark |
2025 |
SIGMOD |
5.2434488e-05 |
| 9,942 |
A Modular Graph-Native Query Optimization Framework |
2025 |
SIGMOD |
5.1915905e-05 |
| 9,996 |
Path-centric Cardinality Estimation for Subgraph Matching |
2025 |
VLDB |
5.1814573e-05 |
| 10,050 |
Towards the Scheduling of Vertex-constrained Multi Subgraph Matching Query |
2020 |
SIGMOD |
5.1685424e-05 |
| 10,921 |
Sectric: Towards Accurate, Privacy-preserving and Efficient Triangle Counting |
2025 |
VLDB |
5.093636e-05 |
| 11,205 |
Towards a Converged Relational-Graph Optimization Framework |
2024 |
SIGMOD |
5.093636e-05 |
| 13,305 |
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.