{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T03:06:04Z","timestamp":1787022364923,"version":"build-2736575974"},"reference-count":54,"publisher":"Association for Computing Machinery (ACM)","issue":"8","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2018,4]]},"abstract":"<jats:p>\n                    Traditional rank-aware processing assumes a dataset that contains available options to cover a specific need (e.g., restaurants, hotels, etc) and users who browse that dataset via top-\n                    <jats:italic>k<\/jats:italic>\n                    queries with linear scoring functions, i.e., by ranking the options according to the weighted sum of their attributes, for a set of given weights. In practice, however, user preferences (weights) may only be estimated with bounded accuracy, or may be inherently uncertain due to the inability of a human user to specify exact weight values with absolute accuracy. Motivated by this, we introduce the\n                    <jats:italic>uncertain top-k query<\/jats:italic>\n                    (\n                    <jats:italic>UTK<\/jats:italic>\n                    ). Given uncertain preferences, that is, an approximate description of the weight values, the\n                    <jats:italic>UTK<\/jats:italic>\n                    query reports all options that may belong to the top-\n                    <jats:italic>k<\/jats:italic>\n                    set. A second version of the problem additionally reports the exact top-\n                    <jats:italic>k<\/jats:italic>\n                    set for each of the possible weight settings. We develop a scalable processing framework for both\n                    <jats:italic>UTK<\/jats:italic>\n                    versions, and demonstrate its efficiency using standard benchmark datasets.\n                  <\/jats:p>","DOI":"10.14778\/3204028.3204031","type":"journal-article","created":{"date-parts":[[2018,5,22]],"date-time":"2018-05-22T15:56:10Z","timestamp":1527004570000},"page":"866-879","source":"Crossref","is-referenced-by-count":33,"title":["Exact processing of uncertain top-k queries in multi-criteria settings"],"prefix":"10.14778","volume":"11","author":[{"given":"Kyriakos","family":"Mouratidis","sequence":"first","affiliation":[{"name":"Singapore Management University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bo","family":"Tang","sequence":"additional","affiliation":[{"name":"Southern University of Science and Technology"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2018,4]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Hotel dataset 2017. www.hotels-base.com\/. Hotel dataset 2017. www.hotels-base.com\/."},{"key":"e_1_2_1_2_1","unstructured":"House dataset 2017. www.ipums.org\/. House dataset 2017. www.ipums.org\/."},{"key":"e_1_2_1_3_1","unstructured":"NBA dataset 2017. www.basketball-reference.com\/. NBA dataset 2017. www.basketball-reference.com\/."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795281840"},{"key":"e_1_2_1_5_1","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/B978-044482537-7\/50003-6","volume-title":"Arrangements and their applications. Handbook of computational geometry","author":"Agarwal P. K.","year":"2000","unstructured":"P. K. Agarwal and M. Sharir . Arrangements and their applications. Handbook of computational geometry , pages 49 -- 119 , 2000 . P. K. Agarwal and M. Sharir. Arrangements and their applications. Handbook of computational geometry, pages 49--119, 2000."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497507"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/235815.235821"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1370949"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1005332.1005356"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/646110.679440"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/645484.656550"},{"key":"e_1_2_1_12_1","first-page":"1","volume-title":"ICDT","author":"Cao W.","year":"2017","unstructured":"W. Cao , J. Li , H. Wang , K. Wang , R. Wang , R. C. Wong , and W. Zhan . k-regret minimizing set: Efficient algorithms and hardness . In ICDT , pages 11: 1 -- 11 :19, 2017 . W. Cao, J. Li, H. Wang, K. Wang, R. Wang, R. C. Wong, and W. Zhan. k-regret minimizing set: Efficient algorithms and hardness. In ICDT, pages 11:1--11:19, 2017."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335433"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.131"},{"key":"e_1_2_1_15_1","first-page":"427","volume-title":"EDBT","author":"Cheema M. A.","year":"2014","unstructured":"M. A. Cheema , Z. Shen , X. Lin , and W. Zhang . A unified framework for efficiently processing ranking related queries . In EDBT , pages 427 -- 438 , 2014 . M. A. Cheema, Z. Shen, X. Lin, and W. Zhang. A unified framework for efficiently processing ranking related queries. In EDBT, pages 427--438, 2014."},{"key":"e_1_2_1_16_1","first-page":"201","volume-title":"DASFAA","author":"Chester S.","year":"2012","unstructured":"S. Chester , A. Thomo , S. Venkatesh , and S. Whitesides . Indexing reverse top-k queries in two dimensions . In DASFAA , pages 201 -- 208 , 2012 . S. Chester, A. Thomo, S. Venkatesh, and S. Whitesides. Indexing reverse top-k queries in two dimensions. In DASFAA, pages 201--208, 2012."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732269.2732275"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137653"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.75"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807174"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559886"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24627-5_7"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376685"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1391729.1391730"},{"key":"e_1_2_1_26_1","first-page":"2240","volume-title":"NIPS","author":"Jamieson K. G.","year":"2011","unstructured":"K. G. Jamieson and R. D. Nowak . Active ranking using pairwise comparisons . In NIPS , pages 2240 -- 2248 , 2011 . K. G. Jamieson and R. D. Nowak. Active ranking using pairwise comparisons. In NIPS, pages 2240--2248, 2011."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401940"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775067"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.2307\/1910129"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920923"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687685"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/2831360.2831363"},{"key":"e_1_2_1_33_1","doi-asserted-by":"crossref","unstructured":"T. Liu. Learning to Rank for Information Retrieval. Springer 2011.  T. Liu. Learning to Rank for Information Retrieval. Springer 2011.","DOI":"10.1007\/978-3-642-14267-3"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687697"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824053"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02574692"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920980"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1061318.1061320"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816699"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2723735"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.14778\/2809974.2809992"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.102"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367935"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989408"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064044"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-005-0168-2"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.5555\/1287369.1287395"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.50"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497571"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213882"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2451630"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610508"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559899"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.240"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3204028.3204031","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T05:20:44Z","timestamp":1672204844000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3204028.3204031"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4]]},"references-count":54,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["10.14778\/3204028.3204031"],"URL":"https:\/\/doi.org\/10.14778\/3204028.3204031","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2018,4]]}}}