TY  - JOUR
T1  - An Optimal Algorithm for Range Search on Multidimensional Points
AU - Easwarakumar, K.S. AU - Hema, T. 
JO  - Asian Journal of Information Technology
VL  - 15
IS  - 11
SP  - 1723
EP  - 1730
PY  - 2016
DA  - 2001/08/19
SN  - 1682-3915
DO  - ajit.2016.1723.1730
UR  - https://makhillpublications.co/view-article.php?doi=ajit.2016.1723.1730
KW  - time
KW  -BITS kd-tree
KW  -threaded trie
KW  -range search
KW  -algorithm
AB  - This study proposes an efficient and novel method to address range search on multidimensional points in &#952;(t) time where t is the number of points reported in &real;<SUP>k</SUP> space. This is accomplished by introducing a new data structure, called BITS kd-tree. This structure also supports fast updation that takes &#952;(1) time for insertion and O(log n) time for deletion. The earlier best known algorithm for this problem is O(log<SUP>k</SUP>n+t) time in the pointer machine model.
ER  -