Bo-Tree: An Efficient Search Tree
Abstract: Large amounts of data are being produced today using a variety of automated data collection tools. This data management and processing requires a time-consuming operation that calls for an effective search algorithm. This study introduces the ?BO-Tree, ? a productive search tree with a balanced ?O? structure. For effective data searching, nodes in the BO-Tree are arranged into a number of levels, with each level being divided into sections. To find data in a BO-Tree, a Reference array is generated and used. Each level and its sections? minimum and maximum values, as well as their corresponding addresses in the BO-Tree, are stored in the reference array. When using a Reference array, BO-Tree is search-efficient in all circumstances of time complexity.
Keywords: Data collection, data management, data searching, search-efficient, reference array, time complexity
How to Cite?: Sumit S Shevtekar, Sayeed Khan, Sanket Jhavar, Harsh Dhawale, "Bo-Tree: An Efficient Search Tree", Volume 11 Issue 12, December 2022, International Journal of Science and Research (IJSR), Pages: 273-277, https://www.ijsr.net/getabstract.php?paperid=SR221202123124, DOI: https://dx.doi.org/10.21275/SR221202123124