MTASet: A Tree-based Set for Efficient Range Queries in Update-heavy Workloads

TL;DR

MTASet is a new concurrent data structure based on (a,b)-trees, designed to efficiently handle update-heavy workloads and atomic range queries, outperforming existing solutions by up to 2x while ensuring linearizability.

Contribution

Introduces MTASet, a concurrent (a,b)-tree-based set optimized for update-heavy workloads and atomic range queries, filling a gap in existing data structures.

Findings

MTASet outperforms existing concurrent sets in range query tasks by up to 2x.

MTASet maintains linearizability during concurrent operations.

Efficiently supports atomic range queries in update-heavy workloads.

Abstract

In concurrent data structures, the efficiency of set operations can vary significantly depending on the workload characteristics. Numerous concurrent set implementations are optimized and fine-tuned to excel in scenarios characterized by predominant read operations. However, they often perform poorly when confronted with workloads that heavily prioritize updates. Additionally, current leading-edge concurrent sets optimized for update-heavy tasks typically lack efficiency in handling atomic range queries. This study introduces the MTASet, which leverages a concurrent (a,b)-tree implementation. Engineered to accommodate update-heavy workloads and facilitate atomic range queries, MTASet surpasses existing counterparts optimized for tasks in range query operations by up to 2x. Notably, MTASet ensures linearizability.