Skip to main content
SpringerLink
Log in

Finding \(k\) most favorite products based on reverse top-\(t\) queries

  • Regular Paper
  • Published:
The VLDB Journal Aims and scope Submit manuscript

Abstract

A reverse top-t query for a product returns a set of customers, named potential customers, who regard the product as one of their top-t favorites. Given a set of customers with different preferences on the features of the products, we want to select at most \(k\) products from a pool of candidate products such that their total number of potential customers is maximized. Two versions of the problem are defined according to whether the competitive existing products are given. For solving this NP-hard problem, we first propose an incremental greedy approach to find an approximate solution of the problem with quality guaranteed. For further speeding up this basic greedy approach, we exploit several properties of the top-\(t\) queries and skyline queries to reduce the solution space of the problem. In addition, an upper bound of the potential customers is estimated to reduce the cost of computing the reverse top-\(t\) queries for the candidate products. Finally, when the candidate products are formed from multiple component tables, we propose a strategy to reduce the number of the accessed tuples in the component tables such that only the tuples that are possibly components of the top-\(t\) favorites of the customers need to be accessed. By applying these pruning strategies, we propose another faster greedy approach. The experiment results demonstrate that the proposed pruning strategies work very well and make the faster greedy algorithms for both versions of the problem achieve excellent performance on both efficiency and memory utilization.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14

Similar content being viewed by others

Notes

  1. http://randdataset.projects.postgresql.org/.

  2. http://www.yelp.com/.

References

  1. Borzsonyi, S., Kossmann, D., Stocker, K.: The skyline operator. In: Proceedings of the 17th International Conference on Data Engineering, pp. 421–430 (2001)

  2. Chang, Y.-C., Bergman, L., Castelli, V.: The onion technique: indexing for linear optimization queries. In: Proceedings of the 19th ACM SIGMOD International Conference on Management of Data, pp. 391–402 (2000)

  3. Dellis, E., Seeger, B.: Efficient computation of reverse skyline queries. In: Proceedings of the 33rd International Conference on Very Large Data Bases, pp. 291–302 (2007)

  4. Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. J. Comput. Syst. Sci. 66(4), 614–656 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  5. Hochbaum, D. (ed.): Approximation Algorithms for NP-Hard Problem. PWS Publishing company, Boston, MA (1997)

    Google Scholar 

  6. Korn, F., Muthukrishnan, S.: Influence sets based on reverse nearest neighbor queries. In: Proceedings of the 19th ACM SIGMOD International Conference on Management of Data, pp. 201–212 (2000)

  7. Lee, K.C.K., Lee, W.-C., Zheng, B., Li, H., Tian, Y.: Z-SKY: an efficient skyline query processing framework based on Z-order. VLDB J 19, 333–362 (2010)

    Article  Google Scholar 

  8. Li, C., Ooi, B.C., Tung, A.K.H., Wang, S.: DADA: a data cube for dominant relationship analysis. In: Proceedings of the 25th ACM SIGMOD International Conference on Management of Data, pp. 659–670 (2006)

  9. Lian, X., Chen, L.: Monochromatic and bichromatic reverse skyline search over uncertain databases. In: Proceedings of the 27th ACM SIGMOD International Conference on Management of Data, pp. 213–226 (2008)

  10. Lin, C.-Y., Koh, J.-L., Chen, A.L.P.: Determining \(k\)-most demanding products with maximum expected number of total customers. IEEE Trans. Knowl. Data Eng. 05 March 2012. IEEE Comput. Soc. Digit Libr (2012)

  11. Lin, C.-Y., Koh, J.-L., Chen, A.L.P.: Finding k most favorite products based on reverse top-t queries. Technique report of National Tsing Hua University (2012)

  12. Miah, M., Das, G., Hristidis, V., Mannila, H.: Standing out in a crowd: selecting attributes for maximum visibility. In: Proceedings of the 24th International Conference on Data Engineering, pp. 356–365 (2008)

  13. Su, H.Z., Wang, E.T., Chen, A.L.P.: Continuous probabilistic skyline queries over uncertain data streams. In: Proceedings of the 21st International Conference on Database and Expert Systems Applications, pp. 105–121 (2010)

  14. Vlachou, A., Doulkeridis, C., Kotidis, Y., Norvag, K.: Reverse top-\(k\) queries. In: Proceedings of the 26th International Conference on Data Engineering, pp. 365–376 (2010)

  15. Vlachou, A., Doulkeridis, C., Norvag, K., Kotidis, Y.: Identifying the most influential data objects with reverse top-\(k\) queries. In: Proceedings of the 36th International Conference on Very Large Data Bases, pp. 364–372 (2010)

  16. Vlachou, A., Doulkeridis, C., Polyzotis, N.: Skyline query processing over joins: In: Proceedings of the 30th ACM SIGMOD International Conference on Management of Data, pp. 73–84 (2011)

  17. Wan, Q., Wong, R.C.-W., Ilyas, I.F., Ozsu, M.T., Peng, Y.: Creating competitive products. In: Proceedings of the 35th International Conference on Very Large Data Bases, pp. 898–909 (2009)

  18. Wan, Q., Wong, R.C.-W., Peng, Y.: Finding top-\(k\) profitable products. In: Proceedings of the 26th International Conference on Data Engineering, pp. 1055–1066 (2010)

  19. Wang, W.C., Wang, E.T., Chen, A.L.P.: Dynamic skylines considering range queries. In: Proceedings of the 16th International Conference on Database Systems for Advanced Applications, pp. 235–250 (2011)

  20. Wong, R.C.-W., Ozsu, M.T., Yu, P.S., Fu, A.W.-C., Liu, L.: Efficient method for maximizing bichromatic reverse nearest neighbour. In: Proceedings of the 35th International Conference on Very Large Data Bases, pp. 1126–1137 (2009)

  21. Wu, T., Xin, D., Mei, Q., Han, J.: Promotion analysis in multi-dimensional space. In: Proceedings of the 35th International Conference on Very Large Data Bases, pp. 109–120 (2009)

  22. Wu, W., Yang, F., Chan, C.Y., Tan, K.L.: FINCH: evaluating reverse \(k\)-nearest-neighbor queries on location data. In: Proceedings of the 34th International Conference on Very Large Data Bases, pp. 1056–1067 (2008)

  23. Xia, T., Zhang, D., Kanoulas, E., Du, Y.: On computing top-\(t\) most influential spatial sites. In: Proceedings of the 31st International Conference on Very Large Data Bases, pp. 946–957 (2005)

  24. Zhang, Z., Lakshmanan, L.V.S., Tung, A.K.H.: On domination game analysis for microeconomic data mining. ACM Trans. Knowl. Discov. Data 2(4), 18–44 (2009)

    Article  Google Scholar 

  25. Zou, L., Chen, L.: Dominant graph: an efficient indexing structure to answer top-\(k\) queries. In: Proceedings of the 24th International Conference on Data Engineering, pp. 536–545 (2008)

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Information Engineering, National Taiwan Normal University, Taipei, Taiwan, R.O.C.

    Jia-Ling Koh

  2. Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan, R.O.C.

    Chen-Yi Lin

  3. Department of Computer Science, National Chengchi University, Taipei, Taiwan, R.O.C.

    Arbee L. P. Chen

Authors
  1. Jia-Ling Koh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chen-Yi Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Arbee L. P. Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Arbee L. P. Chen.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Koh, JL., Lin, CY. & Chen, A.L.P. Finding \(k\) most favorite products based on reverse top-\(t\) queries. The VLDB Journal 23, 541–564 (2014). https://doi.org/10.1007/s00778-013-0336-8

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00778-013-0336-8

Keywords

Search

Navigation