Concurrent Linearizable Nearest Neighbour Search in LockFree-kD-tree
Bapi Chatterjee, Ivan Walulya, Philippas Tsigas · 2018
The Nearest neighbour search (NNS) is a fundamental problem in many application domains dealing with multidimensional data. In a concurrent setting, where dynamic modifications are allowed, a linearizable implementation of NNS is highly desirable.