Avatar

Longbin Lai

Staff Engineer

Tongyi Lab, Alibaba Group

Biography

Dr. Longbin Lai obtained his Bachelor’s and Master’s degrees from Shanghai Jiao Tong University (SJTU) in 2010 and 2013, respectively. He then pursued his Ph.D. studies in the Database Group at the School of Computer Science and Engineering (CSE), University of New South Wales (UNSW), Sydney, under the supervision of Prof. Xuemin Lin and Prof. Lu Qin. He completed his Ph.D. in March 2017, and his thesis is available here. Dr. Lai joined Alibaba to develop large-scale graph data analytics systems for its e-commerce platform. He is also a lead contributor to the open-source project GraphScope. His work includes GAIA, a distributed dataflow system for large-scale graph queries; GLogS, a distributed interactive pattern matching system; and GOpt, a unified graph query optimization framework. Currently, he is a member of Alibaba Tongyi Lab, where he leads research and development initiatives focusing on innovative applications of Large Language Models (LLMs).

Interests

  • Big Data Management
  • Graph Database
  • Distributed Processing
  • Query Optimizations
  • Large Language Models

Education

  • PhD in Computer Science and Engineering, 2017

    University of New South Wales, Sydney

  • Master in Computer Engineering, 2013

    Shanghai Jiao Tong University

  • BSc in Information Security, 2010

    Shanghai Jiao Tong University

Projects

*

Distributed Pattern Matching System with Cypher

To develop a graph pattern matching system in the distributed context, while gluing together the academic results of optimal join …

Recent Publications

Quickly discover relevant content by filtering publications.

Towards a Converged Relational-Graph Optimization Framework

Interactive GPM (iGPM) is becoming increasingly important for data scientists to explore graphs in real life, where a series of graph …

A Survey of Distributed Graph Algorithms on Massive Graphs

Distributed processing of large-scale graph data has many practical applications and has been widely studied. In recent years, a lot of …

Parallelization of Butterfly Counting on Hierarchical Memory

Butterfly (a cyclic graph motif) counting is a fundamental task with many applications in graph analysis, which aims at computing the …

GraphScope Flex: LEGO-like Graph Computing Stack

Graph computing has become increasingly crucial in processing large-scale graph data, with numerous systems developed for this purpose. …

Bridging the Gap between Relational OLTP and Graph-based OLAP

This paper presents GART, an in-memory system extended from hybrid transactional/analytical processing (HTAP) systems for hybrid …

Contact

  • 969 Wen Yi Xi Road, Hangzhou, Zhejiang 311121