B^point-tree: An Indexing Structure for Efficient Search in Data Retrieval

The amount of cheap memory growing enables all data to be in main memory databases, this adds a critical performance advantage to the main memory databases. In order to keep and retrieve data effectively, indexing schemes/ systems have been proposed. However, existing indexing algorithms are poorly suited for effective search, not just because of the space efficiency, but also due to the fact that they are unable to execute per every query within a tight time budget. Satisfying such a standard requires a B-tree indexing algorithm to be capable of controlling its memory response time to provide superior search performance. The goal of this research is to present a new technique Bpoint-tree to enhance the effectiveness of indexing search with a new data structure to the conventional B-tree algorithm. The results of the Bpoint-tree performance have been compared to the conventional B-tree, they show that Bpoint-tree exceed the conventional B-tree. The results show that the Bpointtree is able to improve the indexing performance effectiveness.