Optimal representation of the minimum spanning tree algorithm in associative parallel processors

1995 ◽  
Vol 31 (4) ◽  
pp. 475-483
Author(s):  
A. Sh. Nepomnyashchaya
Keyword(s):  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Parallel Processors ◽  
Tree Algorithm ◽  
Optimal Representation

Improve and Optimize Query Recommendation System by MST Algorithm and its MapReduce Implementation

2014 ◽  
Vol 701-702 ◽  
pp. 50-53
Author(s):  
Jian Liang Meng ◽  
Da Wei Li
Keyword(s):  
Big Data ◽  
Parallel Computing ◽  
Spanning Tree ◽  
Recommendation System ◽  
Minimum Spanning Tree ◽  
Programming Model ◽  
Search Efficiency ◽  
Tree Algorithm ◽  
Query Recommendation ◽  
Parallel Query

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.

Sign in / Sign up

Export Citation Format

Share Document