Technical Report: Bundling Linked Data Structures for Linearizable Range Queries
Abstract
We present bundled references, a new building block to provide linearizable range query operations for highly concurrent lock-based linked data structures. Bundled references allow range queries to traverse a path through the data structure that is consistent with the target atomic snapshot. We demonstrate our technique with three data structures: a linked list, skip list, and a binary search tree. Our evaluation reveals that in mixed workloads, our design can improve upon the state-of-the-art techniques by 1.2x-1.8x for a skip list and 1.3x-3.7x for a binary search tree. We also integrate our bundled data structure into the DBx1000 in-memory database, yielding up to 40% gain over the same competitors.
Cite
@article{arxiv.2201.00874,
title = {Technical Report: Bundling Linked Data Structures for Linearizable Range Queries},
author = {Jacob Nelson-Slivon and Ahmed Hassan and Roberto Palmieri},
journal= {arXiv preprint arXiv:2201.00874},
year = {2022}
}
Comments
arXiv admin note: substantial text overlap with arXiv:2012.15438