Efficient Processing of Reverse Top-k Dominating Queries

The top-k dominating queries (kDQ) are very useful to the users who hope to select their favorite products. It combines the characteristics of top-k query and skyline query. Although kDQ has been well-studied in the literature, there is, to the best of our knowledge, no prior work on one of the most intuitive and practical types of kDQ, namely, reverse top-k dominating queries (RkDQ), which returns all data points so that the results of their top-k dominating queries contain the query point q. We formalize the RkDQ query and then propose an efficient algorithm for computing RkDQ with some smart pruning heuristics. Extensive experimental results over real and synthetic datasets show that our proposed algorithms are effective and efficient.