Range Queries in Non-blocking k-ary Search Trees

@article{Brown2012RangeQI,
  title={Range Queries in Non-blocking k-ary Search Trees},
  author={Trevor Brown and Hillel Avni},
  journal={ArXiv},
  year={2012},
  volume={abs/1712.05101}
}
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… CONTINUE READING
BETA

Similar Papers

Citations

Publications citing this paper.
SHOWING 1-10 OF 18 CITATIONS

Lock-free Contention Adapting Search Trees

VIEW 9 EXCERPTS
CITES METHODS, BACKGROUND & RESULTS
HIGHLY INFLUENCED

Lock-free Linearizable 1-Dimensional Range Queries

VIEW 4 EXCERPTS
CITES BACKGROUND, RESULTS & METHODS
HIGHLY INFLUENCED

A contention adapting approach to concurrent ordered sets

  • J. Parallel Distrib. Comput.
  • 2017
VIEW 7 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

KiWi: A Key-Value Map for Scalable Real-Time Analytics

VIEW 5 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED