The efficiency of using k-d trees for finding nearest neighbors in discrete space
type: Item
instance of: scholarly article
title: The efficiency of using k-d trees for finding nearest neighbors in discrete space
zbMATH Open document ID: 0627.68052
DOI: 10.1016/0020-0190(86)90138-9
author: O. J. Murphy
author: Stanley Selkow
published in: Information Processing Letters
publication date: 1986-01-01T00:00:00Z
review text: In this paper, we examine the efficiency of the k-d tree for retrieving from a file of fixed-length binary key records the best match to a given input word. We provide guidelines for determining if the search of the tree will provide any savings when compared with an exhaustive search.
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 4020489
zbMATH Keywords: multi-key searching
zbMATH Keywords: nearest neighbor
zbMATH Keywords: k-d tree
MaRDI profile type: MaRDI publication profile
full work available at URL: 0020-0190(86)90138-9
OpenAlex ID: W2080358756
cites work: Multidimensional binary search trees used for associative searching
cites work: An Algorithm for Finding Best Matches in Logarithmic Expected Time
Recommended article: Refinements to nearest-neighbor searching in k-dimensional trees
Recommended article: Choosing optimal branching factors for k-d-B trees
Recommended article: Q3140435
Recommended article: Improving the performance of multidimensional search using fingers
Recommended article: An Improved Algorithm Finding Nearest Neighbor Using Kd-trees
description: scientific article; zbMATH DE number 4020489