{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T12:27:04Z","timestamp":1769171224679,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,5,27]],"date-time":"2018-05-27T00:00:00Z","timestamp":1527379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Natural Science Foundation of China Grant","award":["61772297, 61632016, 61761146003"],"award-info":[{"award-number":["61772297, 61632016, 61761146003"]}]},{"name":"Microsoft Research Asia"},{"name":"National Basic Research Program of China Grant","award":["2015CB358700"],"award-info":[{"award-number":["2015CB358700"]}]},{"name":"HKRGC GRF","award":["16214017"],"award-info":[{"award-number":["16214017"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,5,27]]},"DOI":"10.1145\/3183713.3196903","type":"proceedings-article","created":{"date-parts":[[2018,5,25]],"date-time":"2018-05-25T12:39:28Z","timestamp":1527251968000},"page":"959-974","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":44,"title":["Efficient k-Regret Query Algorithm with Restriction-free Bound for any Dimensionality"],"prefix":"10.1145","author":[{"given":"Min","family":"Xie","sequence":"first","affiliation":[{"name":"Hong Kong University of Science and Technology, Hong Kong, Hong Kong"}]},{"given":"Raymond Chi-Wing","family":"Wong","sequence":"additional","affiliation":[{"name":"Hong Kong University of Science and Technology, Hong Kong, Hong Kong"}]},{"given":"Jian","family":"Li","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"given":"Cheng","family":"Long","sequence":"additional","affiliation":[{"name":"Queen's University Belfast, Belfast, United Kingdom"}]},{"given":"Ashwin","family":"Lall","sequence":"additional","affiliation":[{"name":"Denison University, Granville, OH, USA"}]}],"member":"320","published-online":{"date-parts":[[2018,5,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008731.1008736"},{"key":"e_1_3_2_1_2_1","volume-title":"International Symposium on Experimental Algorithms.","author":"Agarwal P. K.","unstructured":"P. K. Agarwal , N. Kumar , S. Sintos , and S. Suri . 2017. Efficient Algorithms for k-Regret Minimizing Sets . International Symposium on Experimental Algorithms. P. K. Agarwal, N. Kumar, S. Sintos, and S. Suri. 2017. Efficient Algorithms for k-Regret Minimizing Sets. International Symposium on Experimental Algorithms."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1498759.1498766"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293348"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035932"},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings. 17th International Conference on.","author":"Borzsony S.","unstructured":"S. Borzsony , D. Kossmann , and K. Stocker . 2001. The skyline operator Data Engineering, 2001 . Proceedings. 17th International Conference on. S. Borzsony, D. Kossmann, and K. Stocker. 2001. The skyline operator Data Engineering, 2001. Proceedings. 17th International Conference on."},{"key":"e_1_3_2_1_7_1","volume-title":"Minimizing Set: Efficient Algorithms and Hardness 20th International Conference on Database Theory.","author":"Cao W.","year":"2017","unstructured":"W. Cao , J. Li , H. Wang , K. Wang , R. Wang , R.C.W. Wong , and W. Zhan . 2017 . k-Regret Minimizing Set: Efficient Algorithms and Hardness 20th International Conference on Database Theory. W. Cao, J. Li, H. Wang, K. Wang, R. Wang, R.C.W. Wong, and W. Zhan. 2017. k-Regret Minimizing Set: Efficient Algorithms and Hardness 20th International Conference on Database Theory."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142530"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/11687238_30"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/335191.335433"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732269.2732275"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213884"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793250287"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/11575863_99"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3109859.3109921"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2008.04.004"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516437"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"X. Lin Y. Yuan Q. Zhang and Y. Zhang. 2007. Selecting stars: The k most representative skyline operator Proceedings IEEE Conference on Data Engineering.  X. Lin Y. Yuan Q. Zhang and Y. Zhang. 2007. Selecting stars: The k most representative skyline operator Proceedings IEEE Conference on Data Engineering.","DOI":"10.1109\/ICDE.2007.367854"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687697"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213850"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920980"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1061318.1061320"},{"key":"e_1_3_2_1_23_1","volume-title":"International Conference on Data Warehousing and Knowledge Discovery.","author":"Papadopoulos A. N.","unstructured":"A. N. Papadopoulos , A. Lyritsis , A. Nanopoulos , and Y. Manolopoulos . 2007. Domination mining and querying . In International Conference on Data Warehousing and Knowledge Discovery. A. N. Papadopoulos, A. Lyritsis, A. Nanopoulos, and Y. Manolopoulos. 2007. Domination mining and querying. In International Conference on Data Warehousing and Knowledge Discovery."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816699"},{"key":"e_1_3_2_1_25_1","unstructured":"J. Qi F. Zuo and J. Yao. 2016. K-Regret Queries: From Additive to Multiplicative Utilities CoRR. http:\/\/arxiv.org\/abs\/1609.07964  J. Qi F. Zuo and J. Yao. 2016. K-Regret Queries: From Additive to Multiplicative Utilities CoRR. http:\/\/arxiv.org\/abs\/1609.07964"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350233"},{"key":"e_1_3_2_1_27_1","unstructured":"A. Roshdi and A. Roohparvar. 2015. Information Retrieval Techniques and Applications. International Journal of Computer Networks & Communications Security.  A. Roshdi and A. Roohparvar. 2015. Information Retrieval Techniques and Applications. International Journal of Computer Networks & Communications Security."},{"key":"e_1_3_2_1_28_1","volume-title":"Proceedings of 9th Annual Symposium on Theoretical Aspects of Computer Science (STACS). Springer, 569--579","author":"Sharir M.","unstructured":"M. Sharir and E. Welzl . 1992. A combinatorial bound for linear programming and related problems , Proceedings of 9th Annual Symposium on Theoretical Aspects of Computer Science (STACS). Springer, 569--579 . M. Sharir and E. Welzl. 1992. A combinatorial bound for linear programming and related problems, Proceedings of 9th Annual Symposium on Theoretical Aspects of Computer Science (STACS). Springer, 569--579."},{"key":"e_1_3_2_1_29_1","volume-title":"Proceedings IEEE Conference on Data Engineering.","author":"Soliman M.","unstructured":"M. Soliman , I. Ilyas , and K. Chen-Chuan Chang . 2007. Top-k query processing in uncertain databases . In Proceedings IEEE Conference on Data Engineering. M. Soliman, I. Ilyas, and K. Chen-Chuan Chang. 2007. Top-k query processing in uncertain databases. In Proceedings IEEE Conference on Data Engineering."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.84"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.1051"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/2831360.2831364"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497568"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-008-0117-y"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","unstructured":"H. Yu P.K. Agarwal and R. Poreddyand K.R. Varadarajan. 2008. Practical methods for shape fitting and kinetic data structures using coresets. Algorithmica.  H. Yu P.K. Agarwal and R. Poreddyand K.R. Varadarajan. 2008. Practical methods for shape fitting and kinetic data structures using coresets. Algorithmica.","DOI":"10.1007\/s00453-007-9067-9"}],"event":{"name":"SIGMOD\/PODS '18: International Conference on Management of Data","location":"Houston TX USA","acronym":"SIGMOD\/PODS '18","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2018 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3183713.3196903","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3183713.3196903","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:39:18Z","timestamp":1750210758000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3183713.3196903"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,27]]},"references-count":35,"alternative-id":["10.1145\/3183713.3196903","10.1145\/3183713"],"URL":"https:\/\/doi.org\/10.1145\/3183713.3196903","relation":{},"subject":[],"published":{"date-parts":[[2018,5,27]]},"assertion":[{"value":"2018-05-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}