activity
20082023
most citedInstance and Output Optimal Parallel Algorithms for Acyclic Joins

20 citations · 79 across the 26 of their papers we have counts for

collaborators
Showing cs.DBShow all

7 papers · 1 filter

cs.DB2023★ 16 cited

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…

cs.DB2021

A Nearly Instance-optimal Differentially Private Mechanism for Conjunctive Queries

Wei Dong, Ke Yi

Releasing the result size of conjunctive queries and graph pattern queries under differential privacy (DP) has received considerable attention in the literature, but existing solut…

cs.DB2019★ 20 cited

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…

cs.DB2017★ 14 cited

Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151)

Serge Abiteboul, Marcelo Arenas, Pablo Barceló +18

In April 2016, a community of researchers working in the area of Principles of Data Management (PDM) joined in a workshop at the Dagstuhl Castle in Germany. The workshop was organi…

cs.DB2011

Building Wavelet Histograms on Large Data in MapReduce

Jeffrey Jestes, Ke Yi, Feifei Li

MapReduce is becoming the de facto framework for storing and processing massive data, due to its excellent scalability, reliability, and elasticity. In many MapReduce applications,…

cs.DB2011★ 7 cited

Verifying Computations with Streaming Interactive Proofs

Graham Cormode, Justin Thaler, Ke Yi

When computation is outsourced, the data owner would like to be assured that the desired computation has been performed correctly by the service provider. In theory, proof systems…