Small Search Engine based on Red and Black Tree
DOI:
https://doi.org/10.54691/sjt.v5i8.5495Keywords:
Red-black Tree; Merge Sort; Term Frequency-Inverse Document Frequency Algorithm; File Operation; Search.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.
Downloads
References
Li Zhaofeng. Construction method of efficient web page classifier in topic search engine [J]. Science and Technology Bulletin, 2013, 29 (08): 109-111. DOI: 10.13774/J.cnki.kjtb.2013. 08.047.
Ma Botao, Sun Peng, Zhu Xiaoyong. Research Review of Red and Black Tree Algorithm [J]. Network New Media Technology, 2018, 7 (04): 56-62.
Chen Guang, Wood Peng. An improved algorithm of red-black tree [J]. Journal of Inner Mongolia Normal University (Educational Science Edition), 2012, 25 (12): 75-79.
Gao Qing, Jiang Fan. Red-black tree algorithm and its application [J]. Software Guide, 2008 (09): 40-42.
Elmasry A, Kahla M, Ahdy F, et al. Red–black trees with constant update time[J]. Acta Informatica, 2019, 56 (5).
Downloads
Published
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
How to Cite
