A Top-k query algorithm for big data based on MapReduce

Abstract

Big data has brought new challenges to Top-k in data partitioning and parallel programming model. In order to overcome these problems, a new Top-k query algorithm for big data based on MapReduce is proposed. Based on the features of MapReduce, this paper presents an in-depth study of Top-k query on big data from the perspective of data partitioning, data reduce, etc. Theoretical and experimental results show the proposed Algorithm makes a sharp increase in efficiency.