Concurrent linearizable nearest neighbour search in LockFree-kD-tree

DOI10.1016/J.TCS.2021.06.041MaRDI QIDQ2232591zbMATH OpenOpenAlexFDO

Authors Bapi Chatterjee, Ivan Walulya, Philippas Tsigas

Publication date 6 October 2021

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://research.chalmers.se/en/publication/232185

zbMATH Keywords

concurrent data structurekD-treelinearizabilitylock-freenearest neighbour searchsimilarity search

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Efficient lock-free binary search trees
• Refinements to nearest-neighbor searching in k-dimensional trees
• Parallel algorithms for nearest neighbor search problems in high dimensions
• Simple and fast nearest neighbor search
• Fast neighbor search by using revised k-d tree

Cites work

• An Algorithm for Finding Best Matches in Logarithmic Expected Time
• An optimal algorithm for approximate nearest neighbor searching fixed dimensions
• Approximate closest-point queries in high dimensions
• Efficient lock-free binary search trees
• Expected-Case Complexity of Approximate Nearest Neighbor Searching
• Fast and lock-free concurrent priority queues for multi-thread systems
• Foundations of multidimensional and metric data structures.
• scientific article; zbMATH DE number 437552 (Why is no real title available?)
• scientific article; zbMATH DE number 2006660 (Why is no real title available?)
• Lock-free reference counting
• Multidimensional binary search trees used for associative searching
• New algorithms for efficient high-dimensional nonparametric classification
• The priority R-tree: a practically efficient and worst-case optimal R-tree

Describes a project that uses

Uses Software

• ANN

This page was built for publication: Concurrent linearizable nearest neighbour search in LockFree-kD-tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2232591)