Subscribe
Issue No.08 - August (2011 vol.23)
pp: 1215-1229
Akrivi Vlachou , Norwegian University of Science and Technology, Trondheim
Christos Doulkeridis , Norwegian University of Science and Technology, Trondheim
Yannis Kotidis , Athens University of Economics and Business, Athens
Kjetil Nørvåg , Norwegian University of Science and Technology, Trondheim
ABSTRACT
Nowadays, most applications return to the user a limited set of ranked results based on the individual user's preferences, which are commonly expressed through top-k queries. From the perspective of a manufacturer, it is imperative that her products appear in the highest ranked positions for many different user preferences, otherwise the product is not visible to potential customers. In this paper, we define a novel query type, namely the reverse top-k query, that covers this requirement: “Given a potential product, which are the user preferences that make this product belong to the top-k query result set?.” Reverse top-k queries are essential for manufacturers to assess the impact of their products in the market based on the competition. We formally define reverse top-k queries and introduce two versions of the query, monochromatic and bichromatic. First, we provide a geometric interpretation of the monochromatic reverse top-k query to acquire an intuition of the solution space. Then, we study in detail the case of bichromatic reverse top-k query, and we propose two techniques for query processing, namely an efficient threshold-based algorithm and an algorithm based on materialized reverse top-k views. Our experimental evaluation demonstrates the efficiency of our techniques.
INDEX TERMS
Reverse top-k query, top-k query, user preferences.
CITATION
Akrivi Vlachou, Christos Doulkeridis, Yannis Kotidis, Kjetil Nørvåg, "Monochromatic and Bichromatic Reverse Top-k Queries", IEEE Transactions on Knowledge & Data Engineering, vol.23, no. 8, pp. 1215-1229, August 2011, doi:10.1109/TKDE.2011.50
REFERENCES
 [1] V. Hristidis, N. Koudas, and Y. Papakonstantinou, "Prefer: A System for the Efficient Execution of Multi-Parametric Ranked Queries," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 259-270, 2001. [2] D. Xin, C. Chen, and J. Han, "Towards Robust Indexing for Ranked Queries," Proc. 32nd Int'l Conf. Very Large Data Bases (VLDB '06), pp. 235-246, 2006. [3] A. Vlachou, C. Doulkeridis, Y. Kotidis, and K. Nørvåg, "Reverse Top-k Queries," Proc. IEEE 26th Int'l Conf. Data Eng. (ICDE), pp. 365-376, 2010. [4] F. Korn and S. Muthukrishnan, "Influence Sets Based on Reverse Nearest Neighbor Queries," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 201-212, 2000. [5] E. Dellis and B. Seeger, "Efficient Computation of Reverse Skyline Queries," Proc. 33rd Int'l Conf. Very Large Data Bases (VLDB '07), pp. 291-302, 2007. [6] X. Lian and L. Chen, "Monochromatic and Bichromatic Reverse Skyline Search over Uncertain Databases," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 213-226, 2008. [7] Y.-C. Chang, L.D. Bergman, V. Castelli, C.-S. Li, M.-L. Lo, and J.R. Smith, "The Onion Technique: Indexing for Linear Optimization Queries," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 391-402, 2000. [8] D.J. Rosenkrantz, R.E. Stearns, and P.M. Lewis II, "An Analysis of Several Heuristics for the Traveling Salesman Problem," SIAM J. Computing, vol. 6, no. 3, pp. 563-581, 1977. [9] S. Börzsönyi, D. Kossmann, and K. Stocker, "The Skyline Operator," Proc. 17th Int'l Conf. Data Eng. (ICDE), pp. 421-430, 2001. [10] K. Yi, H. Yu, J. Yang, G. Xia, and Y. Chen, "Efficient Maintenance of Materialized Top-k Views," Proc. 19th Int'l Conf. Data Eng. (ICDE), pp. 189-200, 2003. [11] L. Zou and L. Chen, "Dominant Graph: An Efficient Indexing Structure to Answer Top-k Queries," Proc. IEEE 24th Int'l Conf. Data Eng. (ICDE '08), pp. 536-545, 2008. [12] R. Fagin, A. Lotem, and M. Naor, "Optimal Aggregation Algorithms for Middleware," Proc. 20th ACM SIGMOD-SIGACT-SIGART Symp. Principles of Database Systems (PODS), pp. 102-113, 2001. [13] R. Akbarinia, E. Pacitti, and P. Valduriez, "Best Position Algorithms for Top-k Queries," Proc. 33rd Int'l Conf. Very Large Data Bases (VLDB '07), pp. 495-506, 2007. [14] S. Chaudhuri and L. Gravano, "Evaluating Top-k Selection Queries," Proc. 25th Int'l Conf. Very Large Data Bases (VLDB '99), pp. 397-410, 1999. [15] U. Güntzer, W.-T. Balke, and W. Kießling, "Optimizing Multi-Feature Queries for Image Databases," Proc. 26th Int'l Conf. Very Large Data Bases (VLDB '00), pp. 419-428, 2000. [16] A. Marian, N. Bruno, and L. Gravano, "Evaluating Top-$k$ Queries over Web-Accessible Databases," ACM Trans. Database Systems, vol. 29, no. 2, pp. 319-362, 2004. [17] B. Yao, F. Li, and P. Kumar, "Reverse Furthest Neighbors in Spatial Databases," Proc. IEEE 25th Int'l Conf. Data Eng. (ICDE '09), 2009. [18] C. Li, B.C. Ooi, A.K.H. Tung, and S. Wang, "Dada: A Data Cube for Dominant Relationship Analysis," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 659-670, 2006. [19] Q. Wan, R.C.-W. Wong, I.F. Ilyas, M.T. Özsu, and Y. Peng, "Creating Competitive Products," Proc. Very Large Data Base Endowment, vol. 2, no. 1, pp. 898-909, 2009. [20] M. Miah, G. Das, V. Hristidis, and H. Mannila, "Standing Out in a Crowd: Selecting Attributes for Maximum Visibility," Proc. IEEE 24th Int'l Conf. Data Eng. (ICDE '08), pp. 356-365, 2008. [21] A. Vlachou, C. Doulkeridis, K. Nørvåg, and Y. Kotidis, "Identifying the Most Influential Data Objects with Reverse Top-k Queries," Proc. Very Large Data Base Endowment, vol. 3, no. 1, pp. 364-372, 2010.