Hybridization of B-tree and HashMap for optimized search engine indexing

Performance of a Search engines depend on indexing schemes for fast retrieval of results. Hash Map based indexing schemes is one the most popular indexing scheme. Although it has a good best case performance, it has poor performance with increase in number of documents as many keys hash to the same value and the search complexity rises [4]. A balanced multi-way B-tree based solution is used as an attempt to find whether document contains search word and then Hash Map is used to retrieve the occurrence of the word in a document. It reduces the number of look ups on Hash Map. The advantages of both the algorithms are combined to produce faster results in constant time; Ranking of web pages is done by analyzing the content. The document containing higher frequency of occurrence of query word is listed on top and the decreasing order of results is displayed. The proposed solution provides a logarithmic retrieval time even with increasing number of documents.