{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T03:54:30Z","timestamp":1775274870419,"version":"3.50.1"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030029333","type":"print"},{"value":"9783030029340","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-02934-0_37","type":"book-chapter","created":{"date-parts":[[2018,11,19]],"date-time":"2018-11-19T00:42:53Z","timestamp":1542588173000},"page":"404-412","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An Efficient Algorithm for Computing k-Average-Regret Minimizing Sets in Databases"],"prefix":"10.1007","author":[{"given":"Xianhong","family":"Qiu","sequence":"first","affiliation":[]},{"given":"Jiping","family":"Zheng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,20]]},"reference":[{"issue":"4","key":"37_CR1","doi-asserted-by":"publisher","first-page":"11:1","DOI":"10.1145\/1391729.1391730","volume":"40","author":"IF Ilyas","year":"2008","unstructured":"Ilyas, I.F., Beskales, G., Soliman, M.A.: A survey of top-k query processing techniques in relational database systems. ACM Comput. Surv. 40(4), 11:1\u201311:58 (2008)","journal-title":"ACM Comput. Surv."},{"key":"37_CR2","doi-asserted-by":"crossref","unstructured":"B\u00f6rzs\u00f6ny, S., Kossmann, D., Stocker, K.: The skyline operator. In: ICDE, pp. 421\u2013430 (2001)","DOI":"10.1109\/ICDE.2001.914855"},{"issue":"1-2","key":"37_CR3","doi-asserted-by":"publisher","first-page":"1114","DOI":"10.14778\/1920841.1920980","volume":"3","author":"Danupon Nanongkai","year":"2010","unstructured":"Nanongkai, D., Sarma, A.D., Lall, A., Lipton, R.J., Xu, J.: Regret-minimizing representative databases. In: VLDB, pp. 1114\u20131124 (2010)","journal-title":"Proceedings of the VLDB Endowment"},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"Zeighami, S., Wong, R.C.W.: Minimizing average regret ratio in database. In: SIGMOD, pp. 2265\u20132266 (2016)","DOI":"10.1145\/2882903.2914831"},{"key":"37_CR5","doi-asserted-by":"publisher","first-page":"610","DOI":"10.14778\/1687627.1687697","volume":"2","author":"D Mindolin","year":"2009","unstructured":"Mindolin, D., Chomicki, J.: Discovering relative importance of skyline attributes. Proc. VLDB Endow. 2, 610\u2013621 (2009)","journal-title":"Proc. VLDB Endow."},{"issue":"1","key":"37_CR6","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.is.2008.04.004","volume":"34","author":"J Lee","year":"2009","unstructured":"Lee, J., You, G.W., Hwang, S.W.: Personalized top-k skyline queries in high-dimensional space. Inf. Syst. 34(1), 45\u201361 (2009)","journal-title":"Inf. Syst."},{"key":"37_CR7","doi-asserted-by":"crossref","unstructured":"Lin, X., Yuan, Y., Zhang, Q., Zhang, Y.: Selecting stars: the k most representative skyline operator. In: ICDE, pp. 86\u201395 (2007)","DOI":"10.1109\/ICDE.2007.367854"},{"key":"37_CR8","doi-asserted-by":"crossref","unstructured":"Tao, Y., Ding, L., Lin, X., Pei, J.: Distance-based representative skyline. In: ICDE, pp. 892\u2013903 (2009)","DOI":"10.1109\/ICDE.2009.84"},{"key":"37_CR9","doi-asserted-by":"crossref","unstructured":"Peng, P., Wong, R.C.W.: Geometry approach for k-regret query. In: ICDE, pp. 772\u2013783 (2014)","DOI":"10.1109\/ICDE.2014.6816699"},{"key":"37_CR10","doi-asserted-by":"crossref","unstructured":"Xie, M., Wong, R.C.W., 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":"37_CR11","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/3230634","volume":"43","author":"J Qi","year":"2018","unstructured":"Qi, J., Zuo, F., Samet, H., Yao, J.: K-regret queries using multiplicative utility functions. ACM Trans. Database Syst. 43, 10 (2018)","journal-title":"ACM Trans. Database Syst."}],"container-title":["Lecture Notes in Computer Science","Web Information Systems and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-02934-0_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T03:08:51Z","timestamp":1775272131000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-02934-0_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030029333","9783030029340"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-02934-0_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"20 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WISA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web Information Systems and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiyuan","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wisa22018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/jisq.nju.edu.cn\/wisa2018\/index.html","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"103","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":"29","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":"16","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":"28% - 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":"4","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)"}}]}}