Affiliation:
1. North China Electric Power University
Abstract
Query recommendation as an important tool to enhance the user search efficiency has gradually become a hotspot. In the context of big data, using the MapReduce programming model, combined with distributed minimum spanning tree algorithm, a parallel query recommended method based on MapReduce was proposed in this paper. The final results show that the efficiency of query recommendation was greatly improved through parallel computing.
Publisher
Trans Tech Publications, Ltd.
Reference6 articles.
1. Yang Cao, Ju Fan, and Guoliang Li. A User-Friendly Patent Search Paradigm. IEEE TRANS- ACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 25, NO. 6, JUNE (2013).
2. Heasoo Hwang, Hady W. Lauw, Lise Getoor, and Alexandros Ntoulas. Organizing User Search Histories. IEEE Transactions On Knowledge And Data Engineering, VOL. 24, NO. 5, MAY (2012).
3. Lu Wei, Zhang Xiaojua. Study on Query Recommendation Based on the Analysis of Topic and User Personalization. Journal Of The China Society For Scientific And Technical Information, 2012, 31(12).
4. G Liu Y, Jing N, Chen L, Xiong W. Algorithm for processing k-nearest join based on R-tree in MapReduce. Ruan Jian Xue Bao/Journal of Software, 2013, 24(8): 1836−1851 (in Chinese).
5. LI Weiwei, ZHAO Hang, ZHANG Yang, et al. Research on massive data mining based on MapReduce. Computer Engineering and Applications, 2013, 49(20): 112-117.