부산대학교 도서관

In today’s world, large volumes of data are being generated through various automated data collection tools. Managing and processing of this data is time consuming task which demands an efficient search algorithm. In this paper, an efficient search tree named "BO-Tree", a Balanced "O" structure of the tree is introduced. Nodes in the BO-Tree are organized into various levels and each level is divided into sections for efficient searching of data. A Reference array is created and used to search for data in BO-Tree. Reference array stores a set of minimum and maximum values of each level and its sections along with their corresponding addresses in BO-Tree. BO-Tree is search efficient in all cases of time complexity, with the usage of Reference array, when compared with other existing trees.