Can I read Fast Parallel Operations on Search Trees on EtoBox?

Fast Parallel Operations on Search Trees by Akhremtsev, Yaroslav; Sanders, Peter is a scholarly article available to read on EtoBox.

What is Fast Parallel Operations on Search Trees about?

Using (a,b)-trees as an example, we show how to perform a parallel split with logarithmic latency and parallel join, bulk updates, intersection, union (or merge), and (symmetric) set difference with logarithmic latency and with information theoretically optimal work. We present both asymptotically optimal solutions and simplified versions that perform well in practice - they are several times faster than previous implementations.

Author

Akhremtsev, Yaroslav; Sanders, Peter

Published

2015

Language

EN