Open Access

ARTICLE

Application of Quicksort Algorithm in Information Retrieval

Jiajun Xie¹, Zuyan Li¹, Han Wu¹, Linhan Li², Bin Pan¹, Peng Guo³,Guang Sun1,*

1 Hunan University of Finance and Economics, Changsha, 410205, China
2 Changjun Meixihu Middle School, Changsha, 410205, China
3 University Malaysia Sabah, Kota Kinabalu, 999004, Malaysia

* Corresponding Author:Guang Sun. Email:

Journal on Big Data 2021, 3(4), 135-145. https://doi.org/10.32604/jbd.2021.017017

Received 06 May 2021; Accepted 19 October 2021; Issue published 20 December 2021

Abstract

With the development and progress of today’s network information technology, a variety of large-scale network databases have emerged with the situation, such as Baidu Library and Weipu Database, the number of documents in the inventory has reached nearly one million. So how do you quickly and effectively retrieve the information you want in such a huge database? This requires finding efficient algorithms to reduce the computational complexity of the computer during Information Retrieval, improve retrieval efficiency, and adapt to the rapid expansion of document data. The Quicksort Algorithm gives different weights to each position of the document, and multiplies the weight of each position with the number of matches of that position, and then adds all the multiplied sums to set a feature value for Quicksort, which can achieve the full accuracy of Information Retrieval. Therefore, the purpose of this paper is to use the quick sort algorithm to increase the speed of Information Retrieval, and to use the position weighting algorithm to improve the matching quality of Information Retrieval, so as to achieve the overall effect of improving the efficiency of Information Retrieval.

---

Keywords

---