Small Search Engine based on Red and Black Tree

Abstract

This procedure uses C + + language to achieve a small search engine each part, including search, analysis, index, query four processes. And establish corresponding data files to speed up the follow-up query. The data structure used is mainly red and black trees. The algorithms used include multi-channel merge sorting (loser tree optimization) and tf-idf algorithm.