Zhekai Jiang

EPFL IC IINFCOM DATA
BC 214 (Bâtiment BC)
Station 14
1015 Lausanne

EPFL IC IINFCOM DATA
BC 214 (Bâtiment BC)
Station 14
1015 Lausanne

EPFLETUEDOCEDIC

Education

Docteur ès sciences

| Computer and communication sciences

2024 – 2026 EPFL

Bachelor of software engineering

| Software engineering

2019 – 2024 McGill University

Professionals experiences

Research intern

Research intern

Awards

EDIC PhD Fellowship

EPFL

2024

Charles Michael Morsson Gold Medal

McGill University

2024

Dean's Honour List

McGill University

2024

Tomlinson Engagement Award for Mentoring

McGill University

2022

Hatch Scholarship in Engineering

McGill University

2022

Scholarship of Excellence

EPFL

2022

Schull–Yang International Experience Award

McGill University

2022

Engineering Class of 1983 Scholarship

McGill University

2021

Rio Tinto–Richard Evans International Exchange Award

McGill University

2020

John V. Galley Scholarship

McGill University

2020

Selected publications

Succinct Structure Representations for Efficient Query Optimization

Zhekai Jiang, Qichen Wang, Christoph Koch
Published in SIGMOD '26: Proceedings of the ACM on Management of Data, Vol. 4, No. 3 (SIGMOD) in 2026

Size Bound–Adorned Datalog

Christian Fattebert, Zhekai Jiang, Christoph Koch, Reinhard Pichler, Qichen Wang
Published in PODS '26: Proceedings of the ACM on Management of Data, Vol. 4, No. 2 (PODS) in 2026

Aggregation and Exploration of High-Dimensional Data Using the Sudokube Data Cube Engine

Sachin Basil John, Peter Lindner, Zhekai Jiang, Christoph Koch
Published in SIGMOD '23 Demo: Companion of the 2023 International Conference on Management of Data in 2023

Concretize: A Model-Driven Tool for Scenario-Based Autonomous Vehicle Testing

Jerry Hou-Liu, Zhekai Jiang, Aren A. Babikian
Published in MODELS '24 Demo: Companion of the ACM/IEEE 27th International Conference on Model Driven Engineering Languages and Systems in 2024

Towards a Traffic Scenario Catalog for Collaborative Testing of Autonomous Vehicles

Zhekai Jiang, Oszkár Semeráth, Aren A. Babikian
Published in SE4ADS '25: 2025 IEEE/ACM 1st International Workshop on Software Engineering for Autonomous Driving Systems in 2025

OptObstacles at the SBFT 2025 Tool Competition – UAV Testing Track

Zhekai Jiang, Aren A. Babikian
Published in SBFT '25 Tool Competition: 18th International Workshop on Search-Based and Fuzz Testing in 2025

Research

Structure-guided query optimization in database systems

During my PhD at EPFL, I am currently working on algorithms for query optimization in database systems. In particular, I exploit structural information of the queries to help reason about their theoretical worst-case asymptotic complexity and guide query optimizers towards good execution plans in practice.

In the case of conjunctive (select-project-join) queries, I proposed a query optimization approach based on "meta-decompositions", a representation that succinctly encodes the structures of all possible join trees for acyclic queries and allows for an efficient dynamic programming algorithm for cost-based optimization. Not only can this representation be viewed as a helpful strategy to guide cost-based optimizers to efficiently find query plans that are likely good, but it can also be helpful for many current theoretically desirable structure-guided approaches that require enumerating or selecting optimal join trees.
  • Succinct Structure Representations for Efficient Query Optimization
    Zhekai Jiang*, Qichen Wang*, and Christoph Koch
    (* denotes equal contribution)
    To appear at SIGMOD ’26: 2026 International Conference on Management of Data, Bengaluru, India, May 2026
    To be published in Proceedings of the ACM on Management of Data, Vol. 4, No. 3 (SIGMOD), Article 240 (Jun 2026), 27 pages
    Full version: arXiv:2603.15465 / EPFL Infoscience 20.500.14299/261601
    Code repository: https://github.com/epfldata/metaDecomp

I also extended similar ideas to recursive queries, in, e.g., Datalog and Recursive SQL, and proposed the notion of size bound–adorned datalog which allows us to derive, for the first time, a series of theoretical upper bounds on asymptotic complexity and result sizes of recursively defined relations.
  • Size Bound–Adorned Datalog
    Christian Fattebert, Zhekai Jiang, Christoph Koch, Reinhard Pichler, and Qichen Wang
    (Authors ordered alphabetically, as is conventional in theoretical venues)
    To appear at PODS ’26: 45th Symposium on Principles of Database Systems, Bengaluru, India, May 2026
    To be published in Proceedings of the ACM on Management of Data, Vol. 4, No. 2 (PODS), Article 97 (May 2026), 27 pages
    Full version: arXiv:2603.15425 / EPFL Infoscience 20.500.14299/261600

Earlier, during my internship at EPFL, I worked on algorithms to efficiently approximate results of aggregation or rollup queries, based on partially materialized data cubes that contain aggregation results projected to lower dimensions.

Past work on model-driven software engineering at McGill

During my undergraduate study of software engineering at McGill, I worked on model-driven software engineering, especially in the context of test case generation for autonomous vehicles. We designed a system Concretize which automatically generates concrete test scenarios (that can be run directly in simulators) based on high-level specifications by the user in a domain-specific language.

We further proposed our vision on a collaborative "scenario catalog" that facilitates sharing and analysis of test cases and results, based on a unified metamodel of test scenarios and related statistics.
  • Towards a Traffic Scenario Catalog for Collaborative Testing of Autonomous Vehicles
    Zhekai Jiang, Oszkaár Semeráth, and Aren A. Babikian
    SE4ADS ’25: IEEE/ACM 1st International Workshop on Software Engineering for Autonomous Driving Systems, Ottawa, Canada, Apr 2025
    https://doi.org/10.1109/SE4ADS66461.2025.00015

Teaching & PhD

Teaching assistantship / mentorship

EPFL
McGill University