Range Queries in Non-blocking k-ary Search Trees
| dc.contributor.author | Brown, Trevor | |
| dc.contributor.author | Avni, Hillel | |
| dc.date.accessioned | 2026-10-20T20:14:52Z | |
| dc.date.issued | 2012 | |
| dc.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. | |
| dc.description.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. | |
| dc.description.sponsorship | Natural Sciences and Engineering Research Council of Canada. | |
| dc.identifier.uri | https://doi.org/10.1007/978-3-642-35476-2_3 | |
| dc.identifier.uri | https://hdl.handle.net/10012/24563 | |
| dc.language.iso | en | |
| dc.publisher | Springer Berlin Heidelberg | |
| dc.relation.ispartofseries | Principles of Distributed Systems (OPODIS 2012), Lecture Notes in Computer Science; 7702 | |
| dc.subject | search trees | |
| dc.title | Range Queries in Non-blocking k-ary Search Trees | |
| dc.type | Conference Paper | |
| dcterms.bibliographicCitation | Trevor Brown and Hillel Avni. 2012. Range Queries in Non-blocking k-ary Search Trees. In Principles of Distributed Systems (OPODIS 2012), Lecture Notes in Computer Science 7702, pp. 31–45. Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-35476-2_3 | |
| uws.contributor.affiliation1 | Faculty of Mathematics | |
| uws.contributor.affiliation2 | David R. Cheriton School of Computer Science | |
| uws.peerReviewStatus | Reviewed | |
| uws.scholarLevel | Faculty | |
| uws.typeOfResource | Text | en |
Files
Original bundle
1 - 2 of 2
Loading...
- Name:
- cv-38-range-queries-in-non-blocking-k-ary-search-trees.pdf
- Size:
- 444.94 KB
- Format:
- Adobe Portable Document Format
- Description:
- OPODIS 2012 accepted author manuscript, 15 pages; published edition pp. 31–45. Subject to Springer Nature’s accepted-manuscript terms; see record notice. PDF unchanged.
Loading...
- Name:
- cv-65-range-queries-in-non-blocking-k-ary-search-trees-2017.pdf
- Size:
- 565.3 KB
- Format:
- Adobe Portable Document Format
- Description:
- Revised expanded manuscript, arXiv:1712.05101v1 (2017), 18 pages, with double-collect fallback. Not separately peer reviewed. Selected PDF unchanged; original notices retained.
License bundle
1 - 1 of 1
Loading...
- Name:
- license.txt
- Size:
- 4.47 KB
- Format:
- Item-specific license agreed upon to submission
- Description: