CPMA: An Efficient Batch-Parallel Compressed Set Without Pointers
Brian Wheatman, Randal C. Burns, Aydın Buluç, Helen Xu · 2024
This paper introduces the batch-parallel Compressed Packed Memory Array (CPMA), a compressed, dynamic, ordered set data structure based on the Packed Memory Array (PMA). Traditionally, batch-parallel sets are built on pointer-based data structures such as trees because pointer-based structures enable fast parallel unions via pointer manipulation. When compared with cache-optimized trees, PMAs were slower to update but faster to scan.