20 citations · 40 across the 8 of their papers we have counts for
9 papers · 1 filter
Differentially Private Data Release over Multiple Tables
Badih Ghazi, Xiao Hu, Ravi Kumar +1
We study synthetic data release for answering multiple linear queries over a set of database tables in a differentially private way. Two special cases have been considered in the l…
Computing the Difference of Conjunctive Queries Efficiently
Xiao Hu, Qichen Wang
We investigate how to efficiently compute the difference result of two (or multiple) conjunctive queries, which is the last operator in relational algebra to be unraveled. The stan…
Change Propagation Without Joins
Qichen Wang, Xiao Hu, Binyang Dai +1
We revisit the classical change propagation framework for query evaluation under updates. The standard framework takes a query plan and materializes the intermediate views, which i…
Ranked Enumeration of Join Queries with Projections
Shaleen Deep, Xiao Hu, Paraschos Koutris
Join query evaluation with ordering is a fundamental data processing task in relational database management systems. SQL and custom graph query languages such as Cypher offer this…
Enumeration Algorithms for Conjunctive Queries with Projection
Shaleen Deep, Xiao Hu, Paraschos Koutris
We investigate the enumeration of query results for an important subset of CQs with projections, namely star and path queries. The task is to design data structures and algorithms…
Aggregated Deletion Propagation for Counting Conjunctive Query Answers
Xiao Hu, Shouzhuo Sun, Shweta Patwa +2
We investigate the computational complexity of minimizing the source side-effect in order to remove a given number of tuples from the output of a conjunctive query. This is a varia…
Algorithms for a Topology-aware Massively Parallel Computation Model
Xiao Hu, Paraschos Koutris, Spyros Blanas
Most of the prior work in massively parallel data processing assumes homogeneity, i.e., every computing unit has the same computational capability, and can communicate with every o…
Fast Join Project Query Evaluation using Matrix Multiplication
Shaleen Deep, Xiao Hu, Paraschos Koutris
In the last few years, much effort has been devoted to developing join algorithms in order to achieve worst-case optimality for join queries over relational databases. Towards this…
Instance and Output Optimal Parallel Algorithms for Acyclic Joins
Xiao Hu, Ke Yi
Massively parallel join algorithms have received much attention in recent years, while most prior work has focused on worst-optimal algorithms. However, the worst-case optimality o…