A Bitmap based Algorithm for Computing Top-k Dominating Queries

The top-k dominating queries return k items from a set of data objects that dominate the other objects on a data-set. Theses top k items are the major items if it is taken from user preferences. Therefore, recommendations can be provided based on the dominating items. It plays a vital role in a decision support system and also helps to find remarkable data objects in a data-set. Using top-k dominating queries, users can limit the number of output data objects. This concept is used to recommend top objects to users from a data-set. In this paper, we introduce a Bitmap-based top-k dominating query algorithm that creates bitmaps to compute the dominating object. The algorithm shows improved results since all the operations used in the algorithm are bitmap operations, which are faster. The experimental result shows the superiority of the algorithm.