{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T11:30:30Z","timestamp":1778499030619,"version":"3.51.4"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030012977","type":"print"},{"value":"9783030012984","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-01298-4_27","type":"book-chapter","created":{"date-parts":[[2018,10,20]],"date-time":"2018-10-20T11:22:54Z","timestamp":1540034574000},"page":"321-335","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Speed-Up Algorithms for\u00a0Happiness-Maximizing Representative Databases"],"prefix":"10.1007","author":[{"given":"Xianhong","family":"Qiu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiping","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qi","family":"Dong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xingnan","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,21]]},"reference":[{"issue":"4","key":"27_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":"27_CR2","doi-asserted-by":"crossref","unstructured":"Lian, X., Chen, L.: Top-k dominating queries in uncertain databases. In: EDBT, pp. 660\u2013671 (2009)","DOI":"10.1145\/1516360.1516437"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Soliman, M.A., Ilyas, I.F., Chang, K.C.-C.: Top-k query processing in uncertain databases. In: ICDE, pp. 896\u2013905 (2007)","DOI":"10.1109\/ICDE.2007.367935"},{"issue":"1","key":"27_CR4","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":"27_CR5","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"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Chan, C.-Y., Jagadish, H.V., Tan, K.-L., Tung, A.K.H., Zhang, Z.: Finding k-dominant skylines in high dimensional space. In: SIGMOD, pp. 503\u2013514. ACM (2006)","DOI":"10.1145\/1142473.1142530"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/11687238_30","volume-title":"Advances in Database Technology - EDBT 2006","author":"C-Y Chan","year":"2006","unstructured":"Chan, C.-Y., Jagadish, H.V., Tan, K.-L., Tung, A.K.H., Zhang, Z.: On high dimensional skylines. In: Ioannidis, Y., et al. (eds.) EDBT 2006. LNCS, vol. 3896, pp. 478\u2013495. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11687238_30"},{"issue":"1","key":"27_CR8","doi-asserted-by":"publisher","first-page":"610","DOI":"10.14778\/1687627.1687697","volume":"2","author":"Denis Mindolin","year":"2009","unstructured":"Mindolin, D., Chomicki, J.: Discovering relative importance of skyline attributes. In: VLDB, pp. 610\u2013621 (2009)","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"1","key":"27_CR9","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/1061318.1061320","volume":"30","author":"D Papadias","year":"2005","unstructured":"Papadias, D., Tao, Y., Greg, F., Seeger, B.: Progressive skyline computation in database systems. TODS 30(1), 41\u201382 (2005)","journal-title":"TODS"},{"issue":"1-2","key":"27_CR10","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":"27_CR11","volume-title":"Introduction to Linear Optimization","author":"D Bertsimas","year":"1997","unstructured":"Bertsimas, D., Tsitsiklis, J.: Introduction to Linear Optimization. Athena Scientific, Belmont (1997)"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Mirzasoleiman, B., Badanidiyuru, A., Karbasi, A., Vondrak, J., Krause, A.: Lazier than lazy greedy. In AAAI, pp. 1812\u20131818 (2015)","DOI":"10.1609\/aaai.v29i1.9486"},{"issue":"5","key":"27_CR13","doi-asserted-by":"publisher","first-page":"389","DOI":"10.14778\/2732269.2732275","volume":"7","author":"Sean Chester","year":"2014","unstructured":"Chester, S., Thomo, A., Venkatesh, S., Whitesides, S.: Computing k-regret minimizing sets. In: VLDB, pp. 389\u2013400 (2014)","journal-title":"Proceedings of the VLDB Endowment"},{"key":"27_CR14","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":"27_CR15","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"},{"issue":"5","key":"27_CR16","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1007\/s00778-014-0352-3","volume":"23","author":"M Magnani","year":"2014","unstructured":"Magnani, M., Assent, I., Mortensen, M.L.: Taking the big picture: representative skylines based on significance and diversity. VLDB J. 23(5), 795\u2013815 (2014). October","journal-title":"VLDB J."},{"key":"27_CR17","unstructured":"S\u00f8holm, M., Chester, S., Assent, I.: Maximum coverage representative skyline. In: EDBT, pp. 702\u2013703 (2016)"},{"issue":"8","key":"27_CR18","first-page":"2041","volume":"28","author":"M Bai","year":"2016","unstructured":"Bai, M., et al.: Discovering the $$k$$ representative skyline over a sliding window. TKDE 28(8), 2041\u20132056 (2016)","journal-title":"TKDE"},{"key":"27_CR19","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":"27_CR20","doi-asserted-by":"crossref","unstructured":"Nanongkai, D., Lall, A., Sarma, A.D., Makino, K.: Interactive regret minimization. In: SIGMOD, pp. 109\u2013120 (2012)","DOI":"10.1145\/2213836.2213850"},{"key":"27_CR21","doi-asserted-by":"crossref","unstructured":"Faulkner, T.K., Brackenbury, W., Lall, A.: k-regret queries with nonlinear utilities. In: VLDB, pp. 2098\u20132109 (2015)","DOI":"10.14778\/2831360.2831364"},{"key":"27_CR22","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":"27_CR23","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, pp. 821\u2013834 (2017)","DOI":"10.1145\/3035918.3035932"},{"key":"27_CR24","unstructured":"Cao, W. et al.: k-regret minimizing set: efficient algorithms and hardness. In: ICDT, pp. 11:1\u201319 (2017)"},{"key":"27_CR25","unstructured":"Agarwal, P.K., Kumar, N., Sintos, S., Suri, S.: Efficient algorithms for k-regret minimizing sets. In: International Symposium on Experimental Algorithms, pp. 7:1\u20137:23 (2017)"},{"key":"27_CR26","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1137\/1.9781611975055.6","volume-title":"2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX)","author":"Nirman Kumar","year":"2018","unstructured":"Kumar, N., Sintos, S.: Faster approximation algorithm for the k-regret minimizing set and related problems. In: Proceedings of the 20th Workshop on Algorithm Engineering and Experiments, pp. 62\u201374 (2018)"},{"key":"27_CR27","doi-asserted-by":"crossref","unstructured":"Asudeh, A., Nazi, A., Zhang, N., Das, G., Jagadish, H.V.: RRR: rank-regret representative. CoRR (2018)","DOI":"10.1145\/3299869.3300080"},{"key":"27_CR28","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, pp. 959\u2013974 (2018)","DOI":"10.1145\/3183713.3196903"}],"container-title":["Lecture Notes in Computer Science","Web and Big Data"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-01298-4_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T20:56:16Z","timestamp":1775249776000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-01298-4_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030012977","9783030012984"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-01298-4_27","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":"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":"Macau","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":"23 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 July 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apwebwaim2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/conferences.cis.umac.mo\/apwebwaim2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}