English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

This paper introduces the batch-parallel Compressed Packed Memory Array(CPMA), a compressed, dynamic, ordered set data structure based on the PackedMemory Array (PMA). Traditionally, batch-parallel sets are built onpointer-based data structures such as trees because pointer-based structuresenable fast parallel unions via pointer manipulation. When compared withcache-optimized trees, PMAs were slower to update but faster to scan.  he batch-parallel CPMA overcomes this tradeoff between updates and scans byoptimizing for cache-friendliness. On average, the CPMA achieves 3x fasterbatch-insert throughput and 4x faster range-query throughput compared withcompressed PaC-trees, a state-of-the-art batch-parallel set library based oncache-optimized trees.  We further evaluate the CPMA compared with compressed PaC-trees and Aspen, astate-of-the-art system, on a real-world application of dynamic-graphprocessing. The CPMA is on average 1.2x faster on a suite of graph algorithmsand 2x faster on batch inserts when compared with compressed PaC-trees.Furthermore, the CPMA is on average 1.3x faster on graph algorithms and 2xfaster on batch inserts compared with Aspen.

CPMA: An Efficient Batch-Parallel Compressed Set Without Pointers