TY - EJOU
AU - Xie, Jiajun
AU - Li, Zuyan
AU - Wu, Han
AU - Li, nhan
AU - Pan, Bin
AU - Guo, Peng
AU - Sun1,*, Guang
TI - Application of Quicksort Algorithm in Information Retrieval
T2 - Journal on Big Data
PY - 2021
VL - 3
IS - 4
SN - 2579-0056
AB - 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.
KW - Quicksort; Information Retrieval; information processing
DO - 10.32604/jbd.2021.017017