{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T20:02:11Z","timestamp":1772913731274,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":57,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T00:00:00Z","timestamp":1561420800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1741022, 1250880, 1343976, 1801539, 1850605, 1745925"],"award-info":[{"award-number":["1741022, 1250880, 1343976, 1801539, 1850605, 1745925"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,25]]},"DOI":"10.1145\/3299869.3300080","type":"proceedings-article","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T17:41:43Z","timestamp":1560879703000},"page":"263-280","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["RRR"],"prefix":"10.1145","author":[{"given":"Abolfazl","family":"Asudeh","sequence":"first","affiliation":[{"name":"University of Michigan, Ann Arbor, MI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Azade","family":"Nazi","sequence":"additional","affiliation":[{"name":"Google AI, Mountain View, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nan","family":"Zhang","sequence":"additional","affiliation":[{"name":"Pennsylvania State University, University Park, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gautam","family":"Das","sequence":"additional","affiliation":[{"name":"University of Texas at Arlington, Arlington, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H. V.","family":"Jagadish","sequence":"additional","affiliation":[{"name":"University of Michigan, Ann Arbor, MI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,6,25]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Query reranking as a service. VLDB, 9(11)","author":"Asudeh Abolfazl","year":"2016","unstructured":"Abolfazl Asudeh , Nan Zhang , and Gautam Das . Query reranking as a service. VLDB, 9(11) , 2016 . Abolfazl Asudeh, Nan Zhang, and Gautam Das. Query reranking as a service. VLDB, 9(11), 2016."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00199"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806451"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/645484.656550"},{"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":"On the expected complexity of random convex hulls. arXiv preprint arXiv:1111.5340","author":"Har-Peled Sariel","year":"2011","unstructured":"Sariel Har-Peled . On the expected complexity of random convex hulls. arXiv preprint arXiv:1111.5340 , 2011 . Sariel Har-Peled. On the expected complexity of random convex hulls. arXiv preprint arXiv:1111.5340, 2011."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142530"},{"key":"e_1_3_2_1_8_1","volume-title":"Ranking the sky: Discovering the importance of skyline points through subspace dominance relationships. DKE, 69(9)","author":"Vlachou Akrivi","year":"2010","unstructured":"Akrivi Vlachou and Michalis Vazirgiannis . Ranking the sky: Discovering the importance of skyline points through subspace dominance relationships. DKE, 69(9) , 2010 . Akrivi Vlachou and Michalis Vazirgiannis. Ranking the sky: Discovering the importance of skyline points through subspace dominance relationships. DKE, 69(9), 2010."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920980"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213850"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2914831"},{"key":"e_1_3_2_1_12_1","volume-title":"k-regret queries with nonlinear utilities. VLDB, 8(13)","author":"Faulkner Taylor Kessler","year":"2015","unstructured":"Taylor Kessler Faulkner , Will Brackenbury , and Ashwin Lall . k-regret queries with nonlinear utilities. VLDB, 8(13) , 2015 . Taylor Kessler Faulkner, Will Brackenbury, and Ashwin Lall. k-regret queries with nonlinear utilities. VLDB, 8(13), 2015."},{"key":"e_1_3_2_1_13_1","volume-title":"Computing k-regret minimizing sets. VLDB, 7(5)","author":"Chester Sean","year":"2014","unstructured":"Sean Chester , Alex Thomo , S Venkatesh , and Sue Whitesides . Computing k-regret minimizing sets. VLDB, 7(5) , 2014 . Sean Chester, Alex Thomo, S Venkatesh, and Sue Whitesides. Computing k-regret minimizing sets. VLDB, 7(5), 2014."},{"key":"e_1_3_2_1_14_1","volume-title":"LIPIcs","author":"Agarwal Pankaj K","year":"2017","unstructured":"Pankaj K Agarwal , Nirman Kumar , Stavros Sintos , and Subhash Suri . Efficient algorithms for k-regret minimizing sets . LIPIcs , 2017 . Pankaj K Agarwal, Nirman Kumar, Stavros Sintos, and Subhash Suri. Efficient algorithms for k-regret minimizing sets. LIPIcs, 2017."},{"key":"e_1_3_2_1_15_1","volume-title":"LIPIcs","author":"Cao Wei","year":"2017","unstructured":"Wei Cao , Jian Li , Haitao Wang , Kangning Wang , Ruosong Wang , Raymond Chi-Wing Wong , and Wei Zhan . k-regret minimizing set: Efficient algorithms and hardness . In LIPIcs , 2017 . Wei Cao, Jian Li, Haitao Wang, Kangning Wang, Ruosong Wang, Raymond Chi-Wing Wong, and Wei Zhan. k-regret minimizing set: Efficient algorithms and hardness. In LIPIcs, 2017."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975055.6"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/28905"},{"key":"e_1_3_2_1_18_1","volume-title":"Linear programming and extensions","author":"Dantzig George Bernard","year":"1998","unstructured":"George Bernard Dantzig . Linear programming and extensions . Princeton university press , 1998 . George Bernard Dantzig. Linear programming and extensions. Princeton university press, 1998."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/2904483.2904491"},{"key":"e_1_3_2_1_20_1","volume-title":"Stochastic geometry, handbook of convex geometry","author":"Weil W","year":"1993","unstructured":"W Weil and J Wieacker . Stochastic geometry, handbook of convex geometry , vol. a, b, 1391-- 1438 , 1993 . W Weil and J Wieacker. Stochastic geometry, handbook of convex geometry, vol. a, b, 1391--1438, 1993."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(97)00006-0"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02570718"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300079"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/323233.323248"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/73393.73394"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009354"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/336154.336173"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548300000225"},{"key":"e_1_3_2_1_29_1","volume-title":"Rrr: Rank-regret representative. CoRR, abs\/1802.10303","author":"Abolfazl","year":"2018","unstructured":"Abolfazl sudeh, Azade Nazi , Nan Zhang , Gautam Das , and H. V. Jagadish . Rrr: Rank-regret representative. CoRR, abs\/1802.10303 , 2018 . Abolfazl sudeh, Azade Nazi, Nan Zhang, Gautam Das, and H. V. Jagadish. Rrr: Rank-regret representative. CoRR, abs\/1802.10303, 2018."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48447-7_1"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"e_1_3_2_1_32_1","volume-title":"The nature of statistical learning theory","author":"Vapnik Vladimir","year":"2013","unstructured":"Vladimir Vapnik . The nature of statistical learning theory . Springer science & business media, 2013 . Vladimir Vapnik. The nature of statistical learning theory. Springer science & business media, 2013."},{"key":"e_1_3_2_1_33_1","volume-title":"Densit\u00e9 et dimension. Ann","author":"Assouad P","year":"1983","unstructured":"P Assouad . Densit\u00e9 et dimension. Ann . Institut Fourier (Grenoble) , 1983 . P Assouad. Densit\u00e9 et dimension. Ann. Institut Fourier (Grenoble), 1983."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187876"},{"key":"e_1_3_2_1_35_1","volume-title":"Int. KHo z., 6(1--2)","author":"P ErdHo","year":"1961","unstructured":"P ErdHo s. On a classical problem of probability theory. Magy. Tud. Akad. Mat. Kut . Int. KHo z., 6(1--2) , 1961 . P ErdHo s. On a classical problem of probability theory. Magy. Tud. Akad. Mat. Kut. Int. KHo z., 6(1--2), 1961."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288933"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1391729.1391730"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00026-6"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480102412856"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/568518.568519"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1005566.1005569"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-003-0099-8"},{"key":"e_1_3_2_1_43_1","volume-title":"VLDB","author":"Das Gautam","year":"2006","unstructured":"Gautam Das , Dimitrios Gunopulos , Nick Koudas , and Dimitris Tsirogiannis . Answering top-k queries using views . In VLDB , 2006 . Gautam Das, Dimitrios Gunopulos, Nick Koudas, and Dimitris Tsirogiannis. Answering top-k queries using views. In VLDB, 2006."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3133012"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/335191.335433"},{"key":"e_1_3_2_1_46_1","volume-title":"VLDB","author":"Xin Dong","year":"2006","unstructured":"Dong Xin , Chen Chen , and Jiawei Han . Towards robust indexing for ranked queries . In VLDB , 2006 . Dong Xin, Chen Chen, and Jiawei Han. Towards robust indexing for ranked queries. In VLDB, 2006."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816699"},{"key":"e_1_3_2_1_48_1","first-page":"107","article-title":"On the number of halving lines. Ann. Univ. Sci. Budapest, E\u00f6tv\u00f6s","volume":"14","author":"Lov\u00e1sz L\u00e1szl\u00f3","year":"1971","unstructured":"L\u00e1szl\u00f3 Lov\u00e1sz . On the number of halving lines. Ann. Univ. Sci. Budapest, E\u00f6tv\u00f6s , Sec. Math , 14 : 107 -- 108 , 1971 . L\u00e1szl\u00f3 Lov\u00e1sz. On the number of halving lines. Ann. Univ. Sci. Budapest, E\u00f6tv\u00f6s, Sec. Math, 14:107--108, 1971.","journal-title":"Sec. Math"},{"key":"e_1_3_2_1_49_1","first-page":"139","volume-title":"Dissection graphs of planar point sets. A survey of combinatorial theory","author":"P ErdHo","year":"1973","unstructured":"P ErdHo s, L\u00e1szl\u00f3 Lov\u00e1sz , A Simmons , and Ernst G Straus . Dissection graphs of planar point sets. A survey of combinatorial theory , pages 139 -- 149 , 1973 . P ErdHo s, L\u00e1szl\u00f3 Lov\u00e1sz, A Simmons, and Ernst G Straus. Dissection graphs of planar point sets. A survey of combinatorial theory, pages 139--149, 1973."},{"key":"e_1_3_2_1_50_1","first-page":"38","article-title":"On the number of line separations of a finite set in the plane","author":"Edelsbrunner Herbert","year":"1985","unstructured":"Herbert Edelsbrunner and Emo Welzl . On the number of line separations of a finite set in the plane . Journal of Combinatorial Theory, Series A , 38 , 1985 . Herbert Edelsbrunner and Emo Welzl. On the number of line separations of a finite set in the plane. Journal of Combinatorial Theory, Series A, 38, 1985.","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004540010022"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00181432"},{"issue":"1","key":"e_1_3_2_1_53_1","first-page":"109","article-title":"An upper bound on the number of planar k-sets","volume":"7","author":"Pach J\u00e1nos","year":"1992","unstructured":"J\u00e1nos Pach , William Steiger , and Endre Szemer\u00e9di . An upper bound on the number of planar k-sets . DCG , 7 ( 1 ): 109 -- 123 , 1992 . J\u00e1nos Pach, William Steiger, and Endre Szemer\u00e9di. An upper bound on the number of planar k-sets. DCG, 7(1):109--123, 1992.","journal-title":"DCG"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/160985.161148"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215019"},{"key":"e_1_3_2_1_56_1","volume-title":"Department of Computer Science","author":"Chan Timothy M","year":"1999","unstructured":"Timothy M Chan . Remarks on k-level algorithms in the plane. Manuscript , Department of Computer Science , University of Waterloo , Waterloo, Canada , 1999 . Timothy M Chan. Remarks on k-level algorithms in the plane. Manuscript, Department of Computer Science, University of Waterloo, Waterloo, Canada, 1999."},{"issue":"2","key":"e_1_3_2_1_57_1","article-title":"Choosing a point from the surface of a sphere","volume":"43","author":"George Marsaglia","year":"1972","unstructured":"George Marsaglia et al . Choosing a point from the surface of a sphere . The Annals of Mathematical Statistics , 43 ( 2 ), 1972 . George Marsaglia et al. Choosing a point from the surface of a sphere. The Annals of Mathematical Statistics, 43(2), 1972.","journal-title":"The Annals of Mathematical Statistics"}],"event":{"name":"SIGMOD\/PODS '19: International Conference on Management of Data","location":"Amsterdam Netherlands","acronym":"SIGMOD\/PODS '19","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2019 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3299869.3300080","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3299869.3300080","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3299869.3300080","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:02:16Z","timestamp":1750208536000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3299869.3300080"}},"subtitle":["Rank-Regret Representative"],"short-title":[],"issued":{"date-parts":[[2019,6,25]]},"references-count":57,"alternative-id":["10.1145\/3299869.3300080","10.1145\/3299869"],"URL":"https:\/\/doi.org\/10.1145\/3299869.3300080","relation":{},"subject":[],"published":{"date-parts":[[2019,6,25]]},"assertion":[{"value":"2019-06-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}