Efficient Computation of a Near-Maximum Independent Set over Evolving Graphs. - Weiguo Zheng; Qichen Wang 001; Jeffrey Xu Yu; Hong Cheng 001; Lei Zou 001 (ICDE, 2018)

Maintaining Acyclic Foreign-Key Joins under Updates. - Qichen Wang 001; Ke Yi 001 (SIGMOD Conference, 2020)

Cquirrel: Continuous Query Processing over Acyclic Relational Schemas. - Qichen Wang 001; Chaoqi Zhang 002; Danish Alsayed; Ke Yi 001; Bin Wu 003; Feifei Li 001; Chaoqun Zhan (Proc. VLDB Endow., 2021)

SparkSQL+: Next-generation Query Planning over Spark. - Binyang Dai; Qichen Wang 001; Ke Yi 001 (SIGMOD Conference Companion, 2023)

Computing the Difference of Conjunctive Queries Efficiently. - Xiao Hu 005; Qichen Wang 001 (Proc. ACM Manag. Data, 2023)

Change Propagation Without Joins. - Qichen Wang 001; Xiao Hu 005; Binyang Dai; Ke Yi 001 (Proc. VLDB Endow., 2023)

Conjunctive Queries with Comparisons. - Qichen Wang 001; Ke Yi 001 (SIGMOD Rec., 2023)

Effective Clustering on Large Attributed Bipartite Graphs. - Renchi Yang; Yidu Wu; Xiaoyang Lin; Qichen Wang 001; Tsz Nam Chan; Jieming Shi 001 (KDD, 2024)

Relational Algorithms for Top-k Query Evaluation. - Qichen Wang 001; Qiyao Luo; Yilei Wang (Proc. ACM Manag. Data, 2024)

FedKNN: Secure Federated k-Nearest Neighbor Search. - Xinyi Zhang; Qichen Wang 001; Cheng Xu 004; Yun Peng 002; Jianliang Xu (Proc. ACM Manag. Data, 2024)

Towards Update-Dependent Analysis of Query Maintenance. - Xiao Hu 005; Qichen Wang 001 (Proc. ACM Manag. Data, 2025)

Yannakakis+: Practical Acyclic Query Evaluation with Theoretical Guarantees. - Qichen Wang 001; Bingnan Chen; Binyang Dai; Ke Yi 001; Feifei Li 001; Liang Lin (Proc. ACM Manag. Data, 2025)