On top-n reverse top-k queries: Variants, algorithms, and applications

Abstract

Summary form only given. Given a set of products and a set of customers with different preferences on these products, a reverse top-k query computes for each product the number of customers who consider this product as their top-k favorites, named favorite number. Accordingly, the top-n reverse top-k query selects the top-n products based on their favorite numbers. This problem is encountered in many applications. In this keynote speech, variants of the problem, possible applications, as well as techniques needed to solve these problems, including skyline queries and bi-chromatic reverse k-nearest neighbor queries will be presented.