Yuliang Li

Yuliang Li

Auto-generated profile, based on publicly available information

Yuliang Li

Megagon Labs, Mountain View, USA

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
18 March 2024
Verified
Conference Paper
Open access
BWBryan Wang
Bryan Wang
YLYuliang Li
Yuliang Li
ZLZhaoyang Lv
Zhaoyang Lv
HXHaijun Xia
Haijun Xia
YXYan Xu
Yan Xu
RSRaj Sodhi
Raj Sodhi

17 January 2023 in The VLDB Journal
Verified
Journal Article
Closed access
PDF file
YLYuliang Li
Yuliang Li
JLJinfeng Li
Jinfeng Li
YSYoshi Suhara
Yoshi Suhara
ADAnHai Doan
AnHai Doan
WTWang-Chiew Tan
Wang-Chiew Tan

4 June 2023
Verified
Conference Paper
Open access
GFGrace Fan
Grace Fan
JWJin Wang
Jin Wang
YLYuliang Li
Yuliang Li
RMRenée J. Miller
Renée J. Miller
Data discovery refers to a set of tasks that enable users and downstream applications to explore and gain insights from massive collections of data sources such as data lakes. In this tutorial, we will provide a comprehensive overview of the most recent table discovery techniques developed by the data management community. We will cover table understanding tasks such as domain discovery, table annotation, and table representation learning which help data lake systems capture semantics of tables. We will also cover techniques enabling various query-driven discovery and table exploration tasks, as well as how table discovery can support key data science applications such as machine learning and knowledge base construction. Finally, we will discuss future research directions on developing new table discovery paradigms by combining structured knowledge and dense table representations, as well as improving the efficiency of discovery using state-of-the-art indexing techniques, and more.

26 October 2020 in Theory of Computing Systems
Verified
Journal Article
Closed access
PDF file
YLYuliang Li
Yuliang Li
JWJianguo Wang
Jianguo Wang
BPBenjamin Pullman
Benjamin Pullman
NBNuno Bandeira
Nuno Bandeira
YPYannis Papakonstantinou
Yannis Papakonstantinou

8 September 2020 in The VLDB Journal
Verified
Journal Article
Closed access
PDF file
YLYuliang Li
Yuliang Li
AFAaron Feng
Aaron Feng
JLJinfeng Li
Jinfeng Li
SCShuwei Chen
Shuwei Chen
SMSaran Mumick
Saran Mumick
WTWang-Chiew Tan
Wang-Chiew Tan

2 April 2026 in Proceedings of the ACM on Management of Data
Verified
Journal Article
Open access
BJBoram Jung
Boram Jung
HTHung-Wei Tseng
Hung-Wei Tseng
YLYuliang Li
Yuliang Li
Homomorphic encryption (HE) enables computations directly on encrypted data, offering strong cryptographic guarantees for secure and privacy-preserving data storage and query execution. However, despite its theoretical power, practical adoption of HE in database systems remains limited due to extreme ciphertext expansion, memory overhead, and the computational cost of bootstrapping, which resets noise levels for correctness. This paper presents NSHEDB, a secure query processing engine designed to address these challenges at the system architecture level. NSHEDB uses word-level leveled HE (LHE) based on the BFV scheme to minimize ciphertext expansion and avoid costly bootstrapping. It introduces novel techniques for executing equality, range, and aggregation operations using purely homomorphic computation, without transciphering between different HE schemes (e.g., CKKS/BFV↔TFHE) or relying on trusted hardware. Additionally, it incorporates a noise-aware query planner to extend computation depth while preserving security guarantees. We implement and evaluate NSHEDB on real-world database workloads (TPC-H) and show that it achieves 20x–1370x speedup and a 73x storage reduction compared to state-of-the-art HE-based systems, while upholding 128-bit security in a semi-honest model with no key release or trusted components.