{"ID":2890241,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2507.20041","arxiv_id":"2507.20041","title":"MTASet: A Tree-based Set for Efficient 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.","short_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 wi...","url_abs":"https://arxiv.org/abs/2507.20041","url_pdf":"https://arxiv.org/pdf/2507.20041v1","authors":"[\"Daniel Manor\",\"Mor Perry\",\"Moshe Sulamy\"]","published":"2025-07-26T19:07:16Z","proceeding":"cs.DC","tasks":"[\"cs.DC\",\"cs.DS\"]","methods":"[]","has_code":false}