Bichromatic Reverse Ranking Query in Two Dimensions

Capturing potential customers for a given product based on individual preferences is very important in many personalized applications. Reverse ranking queries are widely employed in this scenario from the perspective of product in database community. Currently, most existing approaches to handle reverse ranking queries generally focus on the d-dimensional space. However, those approaches are oblivious to special properties in the 2-dimensional space which is useful for further optimization. Moreover, there exist many applications, such as data visualization, in the 2-D space. In this work, we propose two general approaches, namely sorting-based method and tree-based pruning method, in order to efficiently process reverse ranking query in the 2-D space. Both methods are able to handle two variants of reverse ranking query i.e., reverse top-k query and top-k reverse query. Analysis and experimental reports on real and synthetic data sets illustrate the efficiency of our proposed methods.

[1]  Ronald Fagin,et al.  Combining Fuzzy Information from Multiple Systems , 1999, J. Comput. Syst. Sci..

[2]  Alex Thomo,et al.  Indexing Reverse Top-k Queries in Two Dimensions , 2013, DASFAA.

[3]  Xiang Lian,et al.  Probabilistic inverse ranking queries in uncertain databases , 2011, The VLDB Journal.

[4]  Kevin Chen-Chuan Chang,et al.  Enabling data retrieval: by ranking and beyond , 2007 .

[5]  Nikos Mamoulis,et al.  Efficient All Top-k Computation - A Unified Solution for All Top-k, Reverse Top-k and Top-m Influential Queries , 2013, IEEE Transactions on Knowledge and Data Engineering.

[6]  Yuan-Chi Chang,et al.  The onion technique: indexing for linear optimization queries , 2000, SIGMOD 2000.

[7]  Christos Doulkeridis,et al.  Identifying the most influential data objects with reverse top-k queries , 2010, Proc. VLDB Endow..

[8]  Ronald Fagin,et al.  Combining fuzzy information from multiple systems (extended abstract) , 1996, PODS.

[9]  Vagelis Hristidis,et al.  PREFER: a system for the efficient execution of multi-parametric ranked queries , 2001, SIGMOD '01.

[10]  Ken C. K. Lee,et al.  Reverse ranking query over imprecise spatial data , 2010, COM.Geo '10.

[11]  Christos Doulkeridis,et al.  Branch-and-bound algorithm for reverse top-k queries , 2013, SIGMOD '13.

[12]  Moni Naor,et al.  Optimal aggregation algorithms for middleware , 2001, PODS '01.

[13]  Christos Doulkeridis,et al.  Reverse top-k queries , 2010, 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010).

[14]  Christos Doulkeridis,et al.  Monochromatic and Bichromatic Reverse Top-k Queries , 2011, IEEE Transactions on Knowledge and Data Engineering.

[15]  Patrick Valduriez,et al.  Best Position Algorithms for Top-k Queries , 2007, VLDB.

[16]  Donald Kossmann,et al.  The Skyline operator , 2001, Proceedings 17th International Conference on Data Engineering.

[17]  Jiawei Han,et al.  Towards robust indexing for ranked queries , 2006, VLDB.