Downloads: 6 | Views: 331 | Weekly Hits: ⮙2 | Monthly Hits: ⮙2
Research Paper | Computer Engineering | India | Volume 11 Issue 12, December 2022 | Rating: 5 / 10
Bo-Tree: An Efficient Search Tree
Sumit S Shevtekar, Sayeed Khan, Sanket Jhavar, Harsh Dhawale
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
Edition: Volume 11 Issue 12, December 2022,
Pages: 273 - 277