Weighted top-k dominating queries on highly incomplete data

摘要

Top-k dominating (TKD) query retrieves the top k items that dominate other objects in the dataset. This is a key decision-making tool for any organization since it allows data analysts to discover dominant objects that can be used for recommendation. Incomplete data is a regular occurrence in real-world applications which occurs in many ways such as system failure, privacy protection, data loss, unavailability of data, and other issues. In this paper, we introduce a new approach for answering the top-k dominating queries over incomplete data. In many scenarios, the dominating object is one which has very high average rating but the number of rating is very low. We apply a weighted factor to calculate the score for dominating object. Hence realistic recommendation is possible. The idea of data bucketing is used to prune the non-candidate objects. The buckets are built using the B+ tree that makes the processing faster for high retrieval performance. In terms of top-k dominating query performance with incomplete data, the proposed model outperforms previous methods.