Asian Journal of Information Technology

114
Views

1
Downloads

An Optimal Algorithm for Range Search on Multidimensional Points

K.S. Easwarakumar and T. Hema
Page: 1723-1730 | Received 21 Sep 2022, Published online: 21 Sep 2022

By Research Area

Medicine & Public Health Life Sciences Engineering Mathematics Biomedicine Physics Chemistry Computer Science Earth Sciences Social Sciences Business and Management Psychology Materials Science Economics Education Environment Philosophy Statistics Law Political Science and International Relations Pharmacy Dentistry Energy Linguistics Geography Finance Criminology and Criminal Justice Medicine Cultural and Media Studies History Architecture / Design Literature Biomedical Sciences Religious Studies Education & Language Food Science & Nutrition Public Health

By Volume and Issue

Abstract

This study proposes an efficient and novel method to address range search on multidimensional points in θ(t) time where t is the number of points reported in ℜ^k space. This is accomplished by introducing a new data structure, called BITS kd-tree. This structure also supports fast updation that takes θ(1) time for insertion and O(log n) time for deletion. The earlier best known algorithm for this problem is O(log^kn+t) time in the pointer machine model.

How to cite this article:

K.S. Easwarakumar and T. Hema. An Optimal Algorithm for Range Search on Multidimensional Points.
DOI: https://doi.org/10.36478/ajit.2016.1723.1730
URL: https://www.makhillpublications.co/view-article/1682-3915/ajit.2016.1723.1730