Amortized efficiency of list update and paging rules
Communications of the ACM
Self-adjusting binary search trees
Journal of the ACM (JACM)
AVL-trees for localized search
Information and Control
The design and analysis of spatial data structures
The design and analysis of spatial data structures
A constant update time finger search tree
Information Processing Letters
Multidimensional access methods
ACM Computing Surveys (CSUR)
Online computation and competitive analysis
Online computation and competitive analysis
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Journal of the ACM (JACM)
Finger search trees with constant insertion time
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Multidimensional binary search trees used for associative searching
Communications of the ACM
Analysis of range search for random k-d trees
Acta Informatica
ACM Computing Surveys (CSUR)
Optimal finger search trees in the pointer machine
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
SIAM Journal on Computing
On the average performance of orthogonal range search in multidimensional data structures
Journal of Algorithms - Analysis of algorithms
Localized search in sorted lists
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
A new representation for linear lists
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
We propose two variants of K-d trees where fingers are used to improve the performance of orthogonal range search and nearest neighbor queries when they exhibit locality of reference. The experiments show that the second alternative yields significant savings. Although it yields more modest improvements, the first variant does it with much less memory requirements and great simplicity, which makes it more attractive on practical grounds.