Abstract
Extracting a good representative subset of tuples that meets the user’s needs from a large database is an important problem in multi-criteria decision making. Many queries have been proposed for this purpose, including the top-k query and the skyline query. Unfortunately, these traditional queries either ask the user to specify their needs explicitly or overwhelm users with a large output size. Recently, an \(\alpha \)-happiness query was proposed, which overcomes the deficiencies of existing queries: users do not need to specify any preference, while they can obtain a small set of tuples such that users are happy with the results, i.e., their favorite tuples in the returned subset is guaranteed to be not much worse than their favorite tuples in the whole database. In this paper, we study the \(\alpha \)-happiness query. Inspired by the techniques of incremental convex hull computation, we develop two accelerated algorithms, which maintain useful information to avoid redundant computation, in both 2-dimensional and d-dimensional space (\(d > 2\)). We performed extensive experiments, comparing against the best-known method under various settings on both real and synthetic datasets. Our superiority is demonstrated: we can achieve up to two orders and 7 times of improvements in execution times in 2-dimensional and d-dimensional space, respectively.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Agarwal, P., Har-Peled, S., Varadarajan, K.: Approximating extent measures of points. JACM 51, 606–635 (2004)
Agarwal, P.K., Kumar, N., Sintos, S., Suri, S.: Efficient algorithms for k-regret minimizing sets. In: SEA (2017)
Asudeh, A., Nazi, A., Zhang, N., Das, G.: Efficient computation of regret-ratio minimizing set: a compact maxima representative. In: SIGMOD (2017)
Bernhard, K., Vygen, J.: Combinatorial Optimization: Theory and Algorithms, 3rd edn. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-662-56039-6
Borzsony, S., Kossmann, D., Stocker, K.: The skyline operator. In: ICDE (2001)
Cao, W., et al.: k-regret minimizing: efficient algorithms and hardness. In: ICDT (2017)
Chester, S., Thomo, A., Venkatesh, S., Whitesides, S.: Computing k-regret minimizing sets. In: VLDB (2014)
Faulkner, T.K., Brackenbury, W., Lall, A.: k-regret queries with nonlinear utilities. In: VLDB (2015)
He, J., Han, X.: Efficient skyline computation on massive incomplete data. Data Sci. Eng. 7(2), 102–119 (2022)
He, Z., Lo, E.: Answering why-not questions on top-k queries. In: TKDE (2014)
Kallay, M.: The complexity of incremental convex hull algorithms in RD. Inf. Process. Lett. 19(4), 197 (1984)
Kumar, N., Sintos, S.: Faster approximation algorithm for the k-regret minimizing set and related problems. In: ALENEX (2018)
Liu, P., Wang, M., Cui, J., Li, H.: Top-k competitive location selection over moving objects. Data Sci. Eng. 6(4), 392–401 (2021)
Nanongkai, D., Lall, A., Sarma, A., Makino, K.: Interactive regret minimization. In: SIGMOD (2012)
Nanongkai, D., Sarma, A., Lall, A., Lipton, R., Xu, J.: Regret-minimizing representative databases. In: VLDB (2010)
Peng, P., Wong, R.: Geometry approach for k-regret query. In: ICDE (2014)
Qi, J., Zuo, F., Yao, J.: K-regret queries: from additive to multiplicative utilities. CoRR (2016)
Qin, L., Yu, J., Chang, L.: Diversifying top-k results. In: VLDB (2012)
Soliman, M., Ilyas, I., Chang, C.: Top-k query processing in uncertain databases. In: ICDE (2007)
Tao, Y., Ding, L., Lin, X., Pei, J.: Distance-based representative skyline. In: ICDE (2009)
Tao, Y., Xiao, X., Pei, J.: Efficient skyline and top-k retrieval in subspaces. In: TKDE (2007)
Wang, W., Wong, R., Xie, M.: Interactive search for one of the top-\(k\). In: SIGMOD (2021)
Xie, M., Chen, T., Wong, R.: Find your favorite: an interactive system for finding the user’s favorite tuple in the database. In: SIGMOD (2019)
Xie, M., Wong, R., Lall, A.: Strongly truthful interactive regret minimization. In: SIGMOD (2019)
Xie, M., Wong, R., Lall, A.: An experimental survey of regret minimization query and variants: bridging the best worlds between top-\(k\) query and skyline query. VLDB J. 29, 147–175 (2020)
Xie, M., Wong, R., Li, J., Long, C., Lall, A.: Efficient k-regret query algorithm with restriction-free bound for any dimensionality. In: SIGMOD (2018)
Xie, M., Wong, R., Peng, P., Tsotras, V.: Being happy with the least: achieving \(\alpha \)-happiness with minimum number of tuples. In: ICDE (2020)
Xin, D., Han, J., Cheng, H., Li, X.: Answering top-k queries with multi-dimensional selections: the ranking cube approach. In: VLDB (2006)
Acknowledgements
This work was supported by Longhua Science and Technology Innovation Bureau LHKJCXJCYJ202003 and Guangdong Basic and Applied Basic Research Foundation 2022A1515010120.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Xie, M. (2023). Accelerated Algorithms for \(\alpha \)-Happiness Query. In: Li, B., Yue, L., Tao, C., Han, X., Calvanese, D., Amagasa, T. (eds) Web and Big Data. APWeb-WAIM 2022. Lecture Notes in Computer Science, vol 13422. Springer, Cham. https://doi.org/10.1007/978-3-031-25198-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-031-25198-6_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-25197-9
Online ISBN: 978-3-031-25198-6
eBook Packages: Computer ScienceComputer Science (R0)