Search

• < Previous
• 1
• Next >

---

A Near-Optimal Parallel Algorithm for Joining Binary Relations

Bas Ketsman ; Dan Suciu ; Yufei Tao.

We present a constant-round algorithm in the massively parallel computation (MPC) model for evaluating a natural join where every input relation has two attributes. Our algorithm achieves a load of $\tilde{O}(m/p^{1/\rho})$ where $m$ is the total size of the input relations, $p$ is the number of&nbsp;[&hellip;]

---

Robustness against Read Committed for Transaction Templates with Functional Constraints

Brecht Vandevoort ; Bas Ketsman ; Christoph Koch ; Frank Neven.

The popular isolation level Multiversion Read Committed (RC) trades some of the strong guarantees of serializability for increased transaction throughput. Sometimes, transaction workloads can be safely executed under RC obtaining serializability at the lower cost of RC. Such workloads are said to be&nbsp;[&hellip;]

---