Range Queries in Non-blocking $k$-ary Search Trees
Distributed, Parallel, and Cluster Computing
2017-12-15 v1
Abstract
We present a linearizable, non-blocking -ary search tree (-ST) that supports fast searches and range queries. Our algorithm uses single-word compare-and-swap (CAS) operations, and tolerates any number of crash failures. Performance experiments show that, for workloads containing small range queries, our -ST significantly outperforms other algorithms which support these operations, and rivals the performance of a leading concurrent skip-list, which provides range queries that cannot always be linearized.
Cite
@article{arxiv.1712.05101,
title = {Range Queries in Non-blocking $k$-ary Search Trees},
author = {Trevor Brown and Hillel Avni},
journal= {arXiv preprint arXiv:1712.05101},
year = {2017}
}