1 citations · 1 across the 7 of their papers we have counts for
7 papers
Answering Conjunctive Queries with Aggregations under Updates
Qichen Wang, Xiao Hu
Dynamic query processing keeps query answers up to date during insertions and deletions. For conjunctive queries (CQs) under set semantics, the classes maintainable in constant amo…
BaCon: Efficient Batch Processing of Counting Queries [Full Version]
Yuxi Liu, Xiao Hu, Pankaj K. Agarwal +1
Counting queries are ubiquitous in database systems, particularly for driving internal system optimization. Learned models for cardinality estimation rely heavily on large-scale tr…
Fast Matrix Multiplication meets the Submodular Width
Mahmoud Abo Khamis, Xiao Hu, Dan Suciu
One fundamental question in database theory is the following: Given a Boolean Conjunctive Query (BCQ) Q, what is the best complexity for computing the answer to Q in terms of the i…
Output-Optimal Algorithms for Join-Aggregate Queries
Xiao Hu
One of the most celebrated results of computing join-aggregate queries defined over commutative semi-rings is the classic Yannakakis algorithm proposed in 1981. It is known that th…
Reservoir Sampling over Joins
Binyang Dai, Xiao Hu, Ke Yi
Sampling over joins is a fundamental task in large-scale data analytics. Instead of computing the full join results, which could be massive, a uniform sample of the join results wo…
On Reporting Durable Patterns in Temporal Proximity Graphs
Pankaj K. Agarwal, Xiao Hu, Stavros Sintos +1
Finding patterns in graphs is a fundamental problem in databases and data mining. In many applications, graphs are temporal and evolve over time, so we are interested in finding du…
NOCAP: Near-Optimal Correlation-Aware Partitioning Joins
Zichen Zhu, Xiao Hu, Manos Athanassoulis
Storage-based joins are still commonly used today because the memory budget does not always scale with the data size. One of the many join algorithms developed that has been widely…