2011
DOI: 10.1007/978-3-642-25873-2_15
|View full text |Cite
|
Sign up to set email alerts
|

Non-blocking k-ary Search Trees

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
37
0

Year Published

2013
2013
2020
2020

Publication Types

Select...
3
3
2

Relationship

1
7

Authors

Journals

citations
Cited by 39 publications
(37 citation statements)
references
References 11 publications
0
37
0
Order By: Relevance
“…We input the pointers to the current leaf-node and its parent along with the AABB described by its two corners. The rst step is to nd the direction of the current sub-tree and then decide whether the other sub-tree of the parent is visited or not, see lines 8,11 and 12. Basically we check whether the axis-orthogonal hyperplane associated with the parent node is beyond the AABB.…”
Section: C3 the Helping Stepsmentioning
confidence: 99%
See 1 more Smart Citation
“…We input the pointers to the current leaf-node and its parent along with the AABB described by its two corners. The rst step is to nd the direction of the current sub-tree and then decide whether the other sub-tree of the parent is visited or not, see lines 8,11 and 12. Basically we check whether the axis-orthogonal hyperplane associated with the parent node is beyond the AABB.…”
Section: C3 the Helping Stepsmentioning
confidence: 99%
“…In recent years, a number of practical lock-free search data structures have been designed: skip-lists [5,6], binary search trees (BSTs) [710], k-ary search tree [11], B+tree [12], etc. Despite the growing literature on lock-free data structures, the research community has largely focused on one-dimensional search problems.…”
Section: Introduction 1backgroundmentioning
confidence: 99%
“…Ellen et al [15] gave a provably correct, non-blocking implementation of leaf-oriented BSTs directly from single-word CAS. A similar approach was used for k-ary search trees [11] and Patricia tries [28]. All three used the cooperative technique originated by Turek, Shasha and Prakash [31] and Barnes [4].…”
Section: Related Workmentioning
confidence: 99%
“…We experimentally compared the performance of our implementation (PAT) with non-blocking binary search trees (BST) [11], non-blocking k-ary search trees (4-ST) [8], ConcurrentSkipListMap (SL) of the Java library, lock-based AVL trees (AVL) [6] and non-blocking hash tries (Ctrie) [24]. For the k-ary search trees, we use the value k = 4, which was found to be optimal in [8].…”
Section: Empirical Evaluationmentioning
confidence: 99%
“…For the k-ary search trees, we use the value k = 4, which was found to be optimal in [8]. Nodes in Ctrie have up to 32 children.…”
Section: Empirical Evaluationmentioning
confidence: 99%