{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:07:26Z","timestamp":1743113246018,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031251979"},{"type":"electronic","value":"9783031251986"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-25198-6_5","type":"book-chapter","created":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T07:32:38Z","timestamp":1676014358000},"page":"53-68","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Accelerated Algorithms for $$\\alpha $$-Happiness Query"],"prefix":"10.1007","author":[{"given":"Min","family":"Xie","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,10]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, P., Har-Peled, S., Varadarajan, K.: Approximating extent measures of points. JACM 51, 606\u2013635 (2004)","DOI":"10.1145\/1008731.1008736"},{"key":"5_CR2","unstructured":"Agarwal, P.K., Kumar, N., Sintos, S., Suri, S.: Efficient algorithms for k-regret minimizing sets. In: SEA (2017)"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Asudeh, A., Nazi, A., Zhang, N., Das, G.: Efficient computation of regret-ratio minimizing set: a compact maxima representative. In: SIGMOD (2017)","DOI":"10.1145\/3035918.3035932"},{"key":"5_CR4","doi-asserted-by":"publisher","unstructured":"Bernhard, K., Vygen, J.: Combinatorial Optimization: Theory and Algorithms, 3rd edn. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-662-56039-6","DOI":"10.1007\/978-3-662-56039-6"},{"key":"5_CR5","unstructured":"Borzsony, S., Kossmann, D., Stocker, K.: The skyline operator. In: ICDE (2001)"},{"key":"5_CR6","unstructured":"Cao, W., et al.: k-regret minimizing: efficient algorithms and hardness. In: ICDT (2017)"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Chester, S., Thomo, A., Venkatesh, S., Whitesides, S.: Computing k-regret minimizing sets. In: VLDB (2014)","DOI":"10.14778\/2732269.2732275"},{"key":"5_CR8","unstructured":"Faulkner, T.K., Brackenbury, W., Lall, A.: k-regret queries with nonlinear utilities. In: VLDB (2015)"},{"issue":"2","key":"5_CR9","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/s41019-022-00183-7","volume":"7","author":"J He","year":"2022","unstructured":"He, J., Han, X.: Efficient skyline computation on massive incomplete data. Data Sci. Eng. 7(2), 102\u2013119 (2022)","journal-title":"Data Sci. Eng."},{"key":"5_CR10","unstructured":"He, Z., Lo, E.: Answering why-not questions on top-k queries. In: TKDE (2014)"},{"issue":"4","key":"5_CR11","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0020-0190(84)90084-X","volume":"19","author":"M Kallay","year":"1984","unstructured":"Kallay, M.: The complexity of incremental convex hull algorithms in RD. Inf. Process. Lett. 19(4), 197 (1984)","journal-title":"Inf. Process. Lett."},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Kumar, N., Sintos, S.: Faster approximation algorithm for the k-regret minimizing set and related problems. In: ALENEX (2018)","DOI":"10.1137\/1.9781611975055.6"},{"issue":"4","key":"5_CR13","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/s41019-021-00157-1","volume":"6","author":"P Liu","year":"2021","unstructured":"Liu, P., Wang, M., Cui, J., Li, H.: Top-k competitive location selection over moving objects. Data Sci. Eng. 6(4), 392\u2013401 (2021)","journal-title":"Data Sci. Eng."},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Nanongkai, D., Lall, A., Sarma, A., Makino, K.: Interactive regret minimization. In: SIGMOD (2012)","DOI":"10.1145\/2213836.2213850"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Nanongkai, D., Sarma, A., Lall, A., Lipton, R., Xu, J.: Regret-minimizing representative databases. In: VLDB (2010)","DOI":"10.14778\/1920841.1920980"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Peng, P., Wong, R.: Geometry approach for k-regret query. In: ICDE (2014)","DOI":"10.1109\/ICDE.2014.6816699"},{"key":"5_CR17","unstructured":"Qi, J., Zuo, F., Yao, J.: K-regret queries: from additive to multiplicative utilities. CoRR (2016)"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Qin, L., Yu, J., Chang, L.: Diversifying top-k results. In: VLDB (2012)","DOI":"10.14778\/2350229.2350233"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Soliman, M., Ilyas, I., Chang, C.: Top-k query processing in uncertain databases. In: ICDE (2007)","DOI":"10.1109\/ICDE.2007.367935"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Tao, Y., Ding, L., Lin, X., Pei, J.: Distance-based representative skyline. In: ICDE (2009)","DOI":"10.1109\/ICDE.2009.84"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Tao, Y., Xiao, X., Pei, J.: Efficient skyline and top-k retrieval in subspaces. In: TKDE (2007)","DOI":"10.1109\/TKDE.2007.1051"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Wang, W., Wong, R., Xie, M.: Interactive search for one of the top-$$k$$. In: SIGMOD (2021)","DOI":"10.1145\/3448016.3457322"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Xie, M., Chen, T., Wong, R.: Find your favorite: an interactive system for finding the user\u2019s favorite tuple in the database. In: SIGMOD (2019)","DOI":"10.1145\/3299869.3320215"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Xie, M., Wong, R., Lall, A.: Strongly truthful interactive regret minimization. In: SIGMOD (2019)","DOI":"10.1145\/3299869.3300068"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"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\u2013175 (2020)","DOI":"10.1007\/s00778-019-00570-z"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1145\/3183713.3196903"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"Xie, M., Wong, R., Peng, P., Tsotras, V.: Being happy with the least: achieving $$\\alpha $$-happiness with minimum number of tuples. In: ICDE (2020)","DOI":"10.1109\/ICDE48307.2020.00092"},{"key":"5_CR28","unstructured":"Xin, D., Han, J., Cheng, H., Li, X.: Answering top-k queries with multi-dimensional selections: the ranking cube approach. In: VLDB (2006)"}],"container-title":["Lecture Notes in Computer Science","Web and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-25198-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T07:55:30Z","timestamp":1676015730000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-25198-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031251979","9783031251986"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-25198-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"10 February 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APWeb-WAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nanjing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apwebwaim2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/apweb-waim2022.com\/proceedings","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"297","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"75","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5 Demo papers + 23 workshop papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}