Towards a Worst-Case I/O-Optimal Algorithm for Acyclic Joins. - Xiao Hu 005; Ke Yi 001 (PODS, 2016)

Output-optimal Parallel Algorithms for Similarity Joins. - Xiao Hu 005; Yufei Tao 001; Ke Yi 001 (PODS, 2017)

Random Sampling over Joins Revisited. - Zhuoyue Zhao 001; Robert Christensen; Feifei Li 001; Xiao Hu 005; Ke Yi 001 (SIGMOD Conference, 2018)

Instance and Output Optimal Parallel Algorithms for Acyclic Joins. - Xiao Hu 005; Ke Yi 001 (PODS, 2019)

Output-Optimal Massively Parallel Algorithms for Similarity Joins. - Xiao Hu 005; Ke Yi 001; Yufei Tao 001 (ACM Trans. Database Syst., 2019)

Parallel Algorithms for Sparse Matrix Multiplication and Join-Aggregate Queries. - Xiao Hu 005; Ke Yi 001 (PODS, 2020)

Fast Join Project Query Evaluation using Matrix Multiplication. - Shaleen Deep; Xiao Hu 005; Paraschos Koutris (SIGMOD Conference, 2020)

Aggregated Deletion Propagation for Counting Conjunctive Query Answers. - Xiao Hu 005; Shouzhuo Sun; Shweta Patwa; Debmalya Panigrahi; Sudeepa Roy 001 (Proc. VLDB Endow., 2020)

Massively Parallel Join Algorithms. - Xiao Hu 005; Ke Yi 001 (SIGMOD Rec., 2020)

Dynamic Enumeration of Similarity Joins. - Pankaj K. Agarwal; Xiao Hu 005; Stavros Sintos; Jun Yang 001 (ICALP, 2021)

Enumeration Algorithms for Conjunctive Queries with Projection. - Shaleen Deep; Xiao Hu 005; Paraschos Koutris (ICDT, 2021)

Cover or Pack: New Upper and Lower Bounds for Massively Parallel Joins. - Xiao Hu 005 (PODS, 2021)

Algorithms for a Topology-aware Massively Parallel Computation Model. - Xiao Hu 005; Paraschos Koutris; Spyros Blanas (PODS, 2021)

Space-Time Tradeoffs for Answering Boolean Conjunctive Queries. - Shaleen Deep; Xiao Hu 005; Paraschos Koutris (CoRR, 2021)

Selectivity Functions of Range Queries are Learnable. - Xiao Hu 005; Yuxi Liu; Haibo Xiu; Pankaj K. Agarwal; Debmalya Panigrahi; Sudeepa Roy 001; Jun Yang 001 (SIGMOD Conference, 2022)

Computing Complex Temporal Join Queries Efficiently. - Xiao Hu 005; Stavros Sintos; Junyang Gao; Pankaj K. Agarwal; Jun Yang 001 (SIGMOD Conference, 2022)

Ranked Enumeration of Join Queries with Projections. - Shaleen Deep; Xiao Hu 005; Paraschos Koutris (Proc. VLDB Endow., 2022)

On Differentially Private Sampling from Gaussian and Product Distributions. - Badih Ghazi; Xiao Hu 005; Ravi Kumar 001; Pasin Manurangsi (NeurIPS, 2023)

Differentially Private Data Release over Multiple Tables. - Badih Ghazi; Xiao Hu 005; Ravi Kumar 001; Pasin Manurangsi (PODS, 2023)

General Space-Time Tradeoffs via Relational Queries. - Shaleen Deep; Xiao Hu 005; Paraschos Koutris (WADS, 2023)

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

Front Matter. - Georgia Koutrika; Jun Yang 001; Manos Athanassoulis; Kostas Stefanidis; Ju Fan; Abdul Quamar; Yuanyan Tian; Alekh Jindal; Carsten Binnig; Jennie Rogers; Senjuti Basu Roy; Steven Euijong Whang; et al. (Proc. VLDB Endow., 2023)

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

NOCAP: Near-Optimal Correlation-Aware Partitioning Joins. - Zichen Zhu; Xiao Hu 005; Manos Athanassoulis (Proc. ACM Manag. Data, 2023)

Finding Smallest Witnesses for Conjunctive Queries. - Xiao Hu 005; Stavros Sintos (ICDT, 2024)

Fast Matrix Multiplication meets the Subdmodular Width. - Mahmoud Abo Khamis; Xiao Hu 005; Dan Suciu (CoRR, 2024)

Parallel Acyclic Joins: Optimal Algorithms and Cyclicity Separation. - Xiao Hu 005; Yufei Tao 001 (J. ACM, 2024)

Topology-aware Parallel Joins. - Xiao Hu 005; Paraschos Koutris (Proc. ACM Manag. Data, 2024)

On Reporting Durable Patterns in Temporal Proximity Graphs. - Pankaj K. Agarwal; Xiao Hu 005; Stavros Sintos; Jun Yang 001 (Proc. ACM Manag. Data, 2024)

Reservoir Sampling over Joins. - Binyang Dai; Xiao Hu 005; Ke Yi 001 (Proc. ACM Manag. Data, 2024)

Fast Matrix Multiplication for Query Processing. - Xiao Hu 005 (Proc. ACM Manag. Data, 2024)

Computing A Well-Representative Summary of Conjunctive Query Results. - Pankaj K. Agarwal; Aryan Esmailpour; Xiao Hu 005; Stavros Sintos; Jun Yang 001 (Proc. ACM Manag. Data, 2024)

Optimal Oblivious Algorithms for Multi-Way Joins. - Xiao Hu 005; Zhiang Wu 003 (ICDT, 2025)

Smallest Synthetic Witnesses for Conjunctive Queries. - Aryan Esmailpour; Boris Glavic; Xiao Hu 005; Stavros Sintos (Proc. ACM Manag. Data, 2025)

Output-Optimal Algorithms for Join-Aggregate Queries. - Xiao Hu 005 (Proc. ACM Manag. Data, 2025)

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

Fast Matrix Multiplication meets the Submodular Width. - Mahmoud Abo Khamis; Xiao Hu 005; Dan Suciu (Proc. ACM Manag. Data, 2025)