Implemented a B+tree based indexing to speed up searching in a relational database resulting in the reduction of search time to log(n) with base d where d is the degree of the B+tree and n is the number of index pages