An Efficient Top-k Query Scheme Based on Multilayer Grouping

• Main Authors: Zongmin Cui, Yu Gao, Caixue Zhou, Guangyong Gao, Zhuolin Mei, Zongda Wu
• Format: Article
• Language: English
• Published: Faculty of Mechanical Engineering in Slavonski Brod, Faculty of Electrical Engineering in Osijek, Faculty of Civil Engineering in Osijek 2019-01-01
• Series: Tehnički Vjesnik
• Subjects: almost minimizing sorting; multilayer grouping; top-k query
• Online Access: https://hrcak.srce.hr/file/329359

The top-k query is to find the k data that has the highest scores from a candidate dataset. Sorting is a common method to find out top-k results. However, most of existing methods are not efficient enough. To remove this issue, we propose an efficient top-k query scheme based on multilayer grouping. First, we find the reference item by computing the average score of the candidate dataset. Second, we group the candidate dataset into three datasets: winner set, middle set and loser set based on the reference item. Third, we further group the winner set to the second-layer three datasets according to k value. And so on, until the data number of winner set is close to k value. Meanwhile, if k value is larger than the data number of winner set, we directly return the winner set to the user as a part of top-k results almost without sorting. In this case, we also return the top results with the highest scores from the middle set almost without sorting. Based on above innovations, we almost minimize the sorting. Experimental results show that our scheme significantly outperforms the current classical method on the performance of memory consumption and top-k query.