Concurrent linearizable nearest neighbour search in LockFree-kD-tree (Q2232591)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7407457
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Concurrent linearizable nearest neighbour search in LockFree-kD-tree |
scientific article; zbMATH DE number 7407457 |
Statements
Concurrent linearizable nearest neighbour search in LockFree-kD-tree (English)
0 references
6 October 2021
0 references
concurrent data structure
0 references
kD-tree
0 references
nearest neighbour search
0 references
similarity search
0 references
lock-free
0 references
linearizability
0 references
0.7314543724060059
0 references
0.700627863407135
0 references
0.6985690593719482
0 references
0.6982203722000122
0 references
0.6959546208381653
0 references
