K.S.  Easwarakumar, T.  Hema, 
    An Optimal Algorithm for Range Search on Multidimensional Points,
    Asian Journal of Information Technology,
    Volume 15,Issue 11,
    2016,
    Pages 1723-1730,
    ISSN 1682-3915,
    ajit.2016.1723.1730,
    (https://makhillpublications.co/view-article.php?doi=ajit.2016.1723.1730)
    Abstract: 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.
    Keywords: time;BITS kd-tree;threaded trie;range search;algorithm