Erkang Zhu

Erkang Zhu

Auto-generated profile, based on publicly available information

Erkang Zhu

Microsoft Research, Redmond, Washington, USA

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
25 April 2025
Verified
Conference Paper
Open access
WEWill Epperson
Will Epperson
GBGagan Bansal
Gagan Bansal
VDVictor C Dibia
Victor C Dibia
AFAdam Fourney
Adam Fourney
JGJack Gerrits
Jack Gerrits
SASaleema Amershi
Saleema Amershi

15 December 2023
Verified
Conference Paper
Open access
ASAnkita Sharma
Ankita Sharma
XLXuanmao Li
Xuanmao Li
HGHong Guan
Hong Guan
GSGuo-Xin Sun
Guo-Xin Sun
Liang ZhangLiang Zhang
Liang Zhang
JZJia Zou
Jia Zou
Existing approaches to automatic data transformation are insufficient to meet the requirements in many real-world scenarios, such as the building sector. First, there is no convenient interface for domain experts to provide domain knowledge easily. Second, they require significant training data collection overheads. Third, the accuracy suffers from complicated schema changes. To address these shortcomings, we present a novel approach that leverages the unique capabilities of large language models (LLMs) in coding, complex reasoning, and zero-shot learning to generate SQL code that transforms the source datasets into the target datasets. We demonstrate the viability of this approach by designing an LLM-based framework, termed SQLMorpher, which comprises a prompt generator that integrates the initial prompt with optional domain knowledge and historical patterns in external databases. It also implements an iterative prompt optimization mechanism that automatically improves the prompt based on flaw detection. The key contributions of this work include (1) pioneering an end-to-end LLM-based solution for data transformation, (2) developing a benchmark dataset of 105 real-world building energy data transformation problems, and (3) conducting an extensive empirical evaluation where our approach achieved 96% accuracy in all 105 problems. SQLMorpher demonstrates the effectiveness of utilizing LLMs in complex, domain-specific challenges, highlighting the potential of their potential to drive sustainable solutions.

13 June 2023 in Proceedings of the ACM on Management of Data
Verified
Journal Article
Open access
SHSilu Huang
Silu Huang
EZErkang Zhu
Erkang Zhu
SCSurajit Chaudhuri
Surajit Chaudhuri
LSLeonhard Spiegelberg
Leonhard Spiegelberg
Pattern search is an important class of queries for time series data. Time series patterns often match variable-length segments with a large search space, thereby posing a significant performance challenge. The existing pattern search systems, for example, SQL query engines supporting MATCH_RECOGNIZE, are ineffective in pruning the large search space of variable-length segments. In many cases, the issue is due to the use of a restrictive query language modeled on time series points and a computational model that limits search space pruning. We built T-ReX to address this problem using two main building blocks: first, a MATCH_RECOGNIZE language extension that exposes the notion of segment variable and adds new operators, lending itself to better optimization; second, an executor capable of pruning the search space of matches and minimizing total query time using an optimizer. We conducted experiments using 5 real-world datasets and 11 query templates, including those from existing works. T-ReX outperformed an optimized NFA-based pattern search executor by 6x in median query time and an optimized tree-based executor by 19X.