By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Arbee L. P. Chen ; Department of Computer Science, National Chengchi University, Taipei, Taiwan, 11605, R.O.C.

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.

Published in:

Granular Computing (GrC), 2011 IEEE International Conference on

Date of Conference:

8-10 Nov. 2011