RRB Vector: A Practical General Purpose Immutable Sequence

State-of-the-art immutable collections have wildly differing performance characteristics across their operations, often forcing programmers to choose different collection implementations for each task. Thus, changes to the program can invalidate the choice of collections, making code evolution costly. It would be desirable to have a collection that performs well for a broad range of operations. To this end, we present the RRB-Vector, an immutable sequence collection that offers good performance across a large number of sequential and parallel operations. The underlying innovations are: (1) the Relaxed-Radix-Balanced (RRB) tree structure, which allows efficient structural reorganization, and (2) an optimization that exploits spatio-temporal locality on the RRB data structure in order to offset the cost of traversing the tree. In our benchmarks, the RRB-Vector speedup for parallel operations is lower bounded by 7x when executing on 4 CPUs of 8 cores each. The performance for discrete operations, such as appending on either end, or updating and removing elements, is consistently good and compares favorably to the most important immutable sequence collections in the literature and in use today. The memory footprint of RRB-Vector is on par with arrays and an order of magnitude less than competing collections.

Published in:
Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming, 342--354
Presented at:
International Conference on Functional Programming (ICFP), Vancouver, BC, Canada, August 31 – September 2, 2015
New York, NY, USA, ACM

 Record created 2015-11-02, last modified 2018-01-28

External links:
Download fulltextURL
Download fulltextPublisher's version
Rate this document:

Rate this document:
(Not yet reviewed)