Xiao Hu

Orcid: 0000-0002-7890-665X

Affiliations:
  • University of Waterloo, Canada
  • Google Research
  • Duke University, Durham, NC, USA


According to our database1, Xiao Hu authored at least 26 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Parallel Acyclic Joins: Optimal Algorithms and Cyclicity Separation.
J. ACM, 2024

Finding Smallest Witnesses for Conjunctive Queries.
Proceedings of the 27th International Conference on Database Theory, 2024

2023
NOCAP: Near-Optimal Correlation-Aware Partitioning Joins.
Proc. ACM Manag. Data, December, 2023

Change Propagation Without Joins.
Proc. VLDB Endow., 2023

Front Matter.
Proc. VLDB Endow., 2023

Computing the Difference of Conjunctive Queries Efficiently.
Proc. ACM Manag. Data, 2023

General Space-Time Tradeoffs via Relational Queries.
Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Differentially Private Data Release over Multiple Tables.
Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2023

On Differentially Private Sampling from Gaussian and Product Distributions.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

2022
Ranked Enumeration of Join Queries with Projections.
Proc. VLDB Endow., 2022

Computing Complex Temporal Join Queries Efficiently.
Proceedings of the SIGMOD '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

Selectivity Functions of Range Queries are Learnable.
Proceedings of the SIGMOD '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

2021
Space-Time Tradeoffs for Answering Boolean Conjunctive Queries.
CoRR, 2021

Algorithms for a Topology-aware Massively Parallel Computation Model.
Proceedings of the PODS'21: Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2021

Cover or Pack: New Upper and Lower Bounds for Massively Parallel Joins.
Proceedings of the PODS'21: Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2021

Enumeration Algorithms for Conjunctive Queries with Projection.
Proceedings of the 24th International Conference on Database Theory, 2021

Dynamic Enumeration of Similarity Joins.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020
Massively Parallel Join Algorithms.
SIGMOD Rec., 2020

Aggregated Deletion Propagation for Counting Conjunctive Query Answers.
Proc. VLDB Endow., 2020

Fast Join Project Query Evaluation using Matrix Multiplication.
Proceedings of the 2020 International Conference on Management of Data, 2020

Parallel Algorithms for Sparse Matrix Multiplication and Join-Aggregate Queries.
Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2020

2019
Output-Optimal Massively Parallel Algorithms for Similarity Joins.
ACM Trans. Database Syst., 2019

Instance and Output Optimal Parallel Algorithms for Acyclic Joins.
Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2019

2018
Random Sampling over Joins Revisited.
Proceedings of the 2018 International Conference on Management of Data, 2018

2017
Output-optimal Parallel Algorithms for Similarity Joins.
Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2017

2016
Towards a Worst-Case I/O-Optimal Algorithm for Acyclic Joins.
Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016


  Loading...