Skip to main content
SpringerLink
Log in

An experimental survey of regret minimization query and variants: bridging the best worlds between top-k query and skyline query

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

Abstract

When faced with a database containing millions of tuples, a user may be only interested in a (typically much) smaller representative subset. Recently, a query called the regret minimization query was proposed toward this purpose to create such a subset for users. Specifically, this query finds a set of tuples that minimizes the user regret (measured by how far the user’s favorite tuple in the selected set is from his/her favorite tuple in the whole database). The regret minimization query was shown to be very useful in bridging the best worlds between two existing well-known queries, top-k queries and skyline queries: Like top-k queries, the total number of tuples returned in this new query is controllable, and like skyline queries, this new query does not require a user to specify any preference function. Thus, it has attracted a lot of attention from researchers in the database community. Various methods were proposed for regret minimization. However, despite the abundant research effort, there is no systematic comparison among the existing methods. This paper surveys this interesting and evolving research topic by broadly reviewing and comparing the state-of-the-art methods for regret minimization. Moreover, we study different variants of the regret minimization query that has garnered considerable attention in recent years and present some interesting problems that have not yet been addressed in the literature. We implemented 12 state-of-the-art methods published in top-tier venues such as SIGMOD and VLDB from 2010 to 2018 for obtaining regret minimization sets and give an experimental comparison under various parameter settings on both synthetic and real datasets. Our evaluation shows that the optimal choice of methods for regret minimization depends on the application demands. This paper provides an empirical guideline for making such a decision.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23
Fig. 24
Fig. 25
Fig. 26
Fig. 27
Fig. 28
Fig. 29
Fig. 30

Similar content being viewed by others

Notes

  1. We define the maximum regret ratio using the supremum instead of the maximum since the function class \(\mathsf {FC}\) can consist of an infinite number of utility functions and a maximum may not exist.

  2. https://www.basketball-reference.com/friv/mvp.html.

References

  1. Agarwal, P., Peled, S., Varadarajan, K.: Approximating extent measures of points. J. ACM 51, 606–635 (2004)

    Article  MathSciNet  Google Scholar 

  2. Agarwal, P.K., Kumar, N., Sintos, S., Suri, S.: Efficient algorithms for k-regret minimizing sets. In: International Symposium on Experimental Algorithms (SEA) (2017)

  3. Alhenshiri, A.: Web information retrieval and search engines techniques. Al-Satil J. (2010)

  4. Asudeh, A., Nazi, A., Zhang, N., Das, G.: Efficient computation of regret-ratio minimizing set: a compact maxima representative. In: Proceedings of the ACM International Conference on Management of Data (2017)

  5. Asudeh, A., Nazi, A., Zhang, N., Dasm, G., Jagadish, H.: Rrr: rank-regret representative. In: Proceedings of the 2019 ACM International Conference on Management of Data (2019)

  6. Borzsony, S., Kossmann, D., Stocker, K.: The skyline operator. In: Proceedings of the 17th International Conference on Data Engineering (2001)

  7. Cao, W., Li, J., Wang, H., Wang, K., Wang, R., Wong, R., Zhan, W.: k-regret minimizing set: efficient algorithms and hardness. In: ICDT (2017)

  8. Chan, C., Jagadish, H., Tan, K., Tung, A., Zhang, Z.: Finding k-dominant skylines in high dimensional space. In: Proceedings of the 2006 ACM SIGMOD International Conference on Management of Data (2006)

  9. Chan, C., Jagadish, H., Tan, K., Tung, A., Zhang, Z.: On high dimensional skylines. In: Advances in Database Technology-EDBT 2006 (2006)

    Google Scholar 

  10. Chang, Y., Bergman, L., Castelli, V., Li, C., Lo, M., Smith, J.: The onion technique: Indexing for linear optimization queries. In: Proceedings of the 2000 SIGMOD International Conference on Management of Data (2000)

    Article  Google Scholar 

  11. Chester, S., Thomo, A., Venkatesh, S., Whitesides, S.: Computing k-regret minimizing sets. In: Proceedings of the VLDB Endowment (2014)

  12. Dong, Q., Zheng, J., Qiu, X., Huang, X.: Efficient approximate algorithms for k-regret queries with binary constraints. In: International Conference on Web Information Systems and Applications (2018)

  13. Faulkner, T.K., Brackenbury, W., Lall, A.: K-regret queries with nonlinear utilities. In: Proceedings of the VLDB Endowment (2015)

  14. Goncalves, M., Yidal, M.: Top-k skyline: a unified approach. In: On the Move to Meaningful Internet System 2005: OTM 2005 workshops (2005)

    Chapter  Google Scholar 

  15. Han, S., Zheng, H., Dong, Q.: Efficient processing of k-regret queries via skyline priority. In: International Conference on Web Information Systems and Applications (2018)

  16. Han, S., Zheng, J., Dong, Q.: Efficient processing of k-regret queries via skyline frequency. In: International Conference on Web Information Systems and Applications (2018)

  17. Hussain, Z., Khan, H., Sharaf, M.: Diversifying with few regrets, but too few to mention. In: Proceedings of the Second International Workshop on Exploratory Search in Databases and the Web (2015)

  18. Il’ev, V.: An approximation guarantee of the greedy descent algorithm for minimizing a supermodular set function. Discrete Appl. Math. 114, 131–146 (2001)

    Article  MathSciNet  Google Scholar 

  19. Kenthapadi, K., Le, B., Venkataraman, G.: Personalized job recommendation system at LinkedIn: practical challenges and lessons learned. In: Proceedings of the 11th ACM Conference on Recommender Systems (2017)

  20. Kleinberg, J., Tardos, E.: Algorithm Design. Addison Wesley, Boston (2006)

    Google Scholar 

  21. Kumar, N., Sintos, S.: Faster approximation algorithm for the k-regret minimizing set and related problems. In: 2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX) (2018)

    Chapter  Google Scholar 

  22. Lee, J., You, G., Hwang, S.: Personalized top-k skyline queries in high-dimensional space. Inf. Syst. 34, 45–61 (2009)

    Article  Google Scholar 

  23. Lian, X., Chen, L.: Top-k dominating queries in uncertain databases. In: Proceedings of International Conference on Extending Database Technology: Advances in Database Technology (2009)

  24. Lin, X., Yuan, Y., Zhang, Q., Zhang, Y.: Selecting stars: The k most representative skyline operator. In: Proceedings of International Conference on Data Engineering (2007)

  25. McDonald, D., Ackerman, M.: Expertise recommender: a flexible recommendation system and architecture. In: Proceedings of the 2000 ACM conference on Computer supported cooperative work (2000)

  26. Mindolin, D., Chomicki, J.: Discovering relative importance of skyline attributes. In: Proceedings of the VLDB Endowment (2009)

    Article  Google Scholar 

  27. Nanongkai, D., Lall, A., Sarma, A.D., Makino, K.: Interactive regret minimization. In: Proceedings of the 2012 ACM International Conference on Management of Data (2012)

  28. Nanongkai, D., Sarma, A., Lall, A., Lipton, R., Xu, J.: Regret-minimizing representative databases. In: Proceedings of the VLDB Endowment (2010)

  29. Papadias, D., Tao, Y., Fu, G., Seeger, B.: Progressive skyline computation in database systems. ACM Trans. Database Syst. (TODS) 30, 41–82 (2005)

    Article  Google Scholar 

  30. Papadopoulos, A.N., Lyritsis, A., Nanopoulos, A., Manolopoulos, Y.: Domination mining and querying. In: DaWaK (2007)

  31. Peng, P., Wong, R.: Geometry approach for k regret query. In: Proceedings of International Conference on Data Engineering (2014)

  32. Qi, J., Zuo, F., Samet, H., Yao, J.: K-regret queries using multiplicative utility functions. ACM Trans. Database Syst. TODS 43, 10 (2018)

    MathSciNet  Google Scholar 

  33. Qiu, X., Zheng, J.: An efficient algorithm for computing k-average-regret minimizing sets in databases. In: International Conference on Web Information Systems and Applications (2018)

  34. Qiu, X., Zheng, J., Dong, Q., Huang, X.: Speed-up algorithms for happiness-maximizing representative databases. In: Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data (2018)

    Chapter  Google Scholar 

  35. Roshdi, A., Roohparvar, A.: Information retrieval techniques and applications. Int. J. Comput. Netw. Commun. Secur. 3, 373–377 (2015)

    Google Scholar 

  36. Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach. Pearson Education Limited, Malaysia (2016)

    MATH  Google Scholar 

  37. Salton, G., McGill, M.: Introduction to Modern Information Retrieval. McGraw-Hill, New York (1986)

    MATH  Google Scholar 

  38. Soliman, M., Ilyas, I., Chang, K.C.C.: Top-k query processing in uncertain databases. In: Proceedings of International Conference on Data Engineering (2007)

  39. Soma, T., Yoshida, Y.: Regret ratio minimization in multi-objective submodular function maximization. In: AAAI (2017)

  40. Tao, Y., Ding, L., Pei, J.: Distance-based representative skyline. In: Proceedings of International Conference on Data Engineering (2009)

  41. Varian, H.: Microeconomic Analysis. Norton and Company, New York (1992)

    Google Scholar 

  42. Walter, F., Battiston, S., Schweitzer, F.: A model of a trust-based recommendation system on a social network. Auton. Agents Multi-Agent Syst. 16, 57–74 (2008)

    Article  Google Scholar 

  43. Xie, M., Wong, R., Lall, A.: Strongly truthful interactive regret minimization. In: Proceedings of the 2019 ACM International Conference on Management of Data (2019)

  44. Xie, M., Wong, R., Li, J., Long, C., Lall, A.: Efficient k-regret query algorithm with restriction-free bound for any dimensionality. In: Proceedings of the 2018 ACM International Conference on Management of Data (2018)

  45. Yu, H., Agarwal, P., Varadarajan, R.P.K.: Practical methods for shape fitting and kinetic data structures using coresets. Algorithmica 52(3), 378–402 (2008)

    Article  MathSciNet  Google Scholar 

  46. Zeighami, S., Wong, R.: Minimizing average regret ratio in database. In: Proceedings of the 2016 International Conference on Management of Data (2016)

  47. Zeighami, S., Wong, R.: Finding average regret ratio minimizing set in database. In: Proceedings of 35th International Conference on Data Engineering (2019)

Download references

Acknowledgements

The research of Min Xie and Raymond Chi-Wing Wong is supported by HKRGC GRF 16214017.

Author information

Authors and Affiliations

  1. The Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong

    Min Xie & Raymond Chi-Wing Wong

  2. Denison University, Granville, USA

    Ashwin Lall

  3. Shenzhen Institute of Computing Sciences, Shenzhen University, Shenzhen, China

    Min Xie

Authors
  1. Min Xie
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Raymond Chi-Wing Wong
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ashwin Lall
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Min Xie.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Xie, M., Wong, R.CW. & Lall, A. An experimental survey of regret minimization query and variants: bridging the best worlds between top-k query and skyline query. The VLDB Journal 29, 147–175 (2020). https://doi.org/10.1007/s00778-019-00570-z

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00778-019-00570-z

Keywords

Search

Navigation