Xiao Hu
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 2 in the filters
on a stage with
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Join Algorithms Meet New Constraints: Scalability, Latency and Privacy | 9th Annual Simons Institute Industry Day | 2023-11-02 |
Algorithms that scale joins across hundreds or thousands of machines by minimizing communication rounds and per-server load, with formal claims of an optimal… | ||
| Massively Parallel Evaluation of Relational Queries I | Fine-Grained Complexity, Logic, and Query Evaluation 2023 | 2023-09-22 |
Massively parallel relational evaluation uses the BSP/MPC model with p servers, r rounds and maximum load L; concrete one‑round algorithms use randomized… | ||
| Massively Parallel Evaluation of Relational Queries II | Fine-Grained Complexity, Logic, and Query Evaluation 2023 | 2023-09-22 |
Shows a precise round-vs-load tradeoff: for path queries diameter k the load falls from N/p^{1/4} with one round toward N/p as rounds increase, and achieving… | ||
| Incremental View Maintenance: Beyond Worst-Case Analysis I | Fine-Grained Complexity, Logic, and Query Evaluation 2023 | 2023-09-22 |
Focuses on achieving constant-delay enumeration for conjunctive queries by replacing join materialization with layered semi-joins and projections, storing… | ||
| Incremental View Maintenance: Beyond Worst-Case Analysis II | Fine-Grained Complexity, Logic, and Query Evaluation 2023 | 2023-09-22 |
Defines a join-tree-based enclosureness that measures effective lifespans in a generalized join tree and claims any free-connex conjunctive query can be… | ||
| nothing matches | ||