Due to the rapid development of massively parallel data processing systems such as
MapReduce and Spark, there have been revived interests in designing algorithms in a …

This paper studies communication-oblivious algorithms under the massively parallel
computation (MPC) model. The communication patterns of these algorithms follow a …

In addition to its theoretical interest, computing with circuits has found applications in many
other areas such as secure multi-party computation and outsourced query processing. Yet …

We study equi-join computation in the massively parallel computation (MPC) model.
Currently, a main open question under this topic is whether it is possible to design an …

Trusted execution environment (TEE) has provided an isolated and secure environment for
building cloud-based analytic systems, but it still suffers from access pattern leakages …

SimRank is one of the most fundamental measures that evaluate the structural similarity
between two nodes in a graph and has been applied in a plethora of data management …

We study the design and analysis of parallel join algorithms in a topology-aware
computational model. In this model, the network is modeled as a directed graph, where each …

In cloud databases, cloud computation over sensitive data uploaded by clients inevitably
causes concern about data security and privacy. Even when encryption primitives and …

The classic Yannakakis framework proposed in 1981 is still the state-of-the-art approach for
tackling acyclic join-aggregate queries defined over commutative semi-rings. It has been …

In PODS'21, Hu presented an algorithm in the massively parallel computation (MPC) model
that processes any acyclic join with an asymptotically optimal load. In this paper, we present …