Range Queries in Non-blocking k-ary Search Trees
Loading...
Date
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Springer Berlin Heidelberg
Abstract
We present a linearizable, non-blocking k-ary search tree (k-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 k-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.
Description
Accepted author manuscript of the OPODIS 2012 paper, 15 pages. This peer-reviewed manuscript is not the Version of Record and excludes publisher production changes. The published edition is copyright 2012 Springer-Verlag Berlin Heidelberg. Final authenticated version: https://doi.org/10.1007/978-3-642-35476-2_3. Use is subject to Springer Nature’s accepted-manuscript terms: https://www.springernature.com/gp/open-research/policies/accepted-manuscript-terms. Also includes the revised 18-page expanded manuscript, arXiv:1712.05101v1 (2017), with the double-collect fallback; it is not separately peer reviewed. PDFs unchanged; no new Creative Commons licence assigned.