{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T01:46:35Z","timestamp":1787017595523,"version":"build-2736575974"},"reference-count":96,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T00:00:00Z","timestamp":1736467200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001459","name":"Ministry of Education, Singapore","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001459","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Academic Research Fund Tier 2","award":["MOE-T2EP20121-0002"],"award-info":[{"award-number":["MOE-T2EP20121-0002"]}]},{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"crossref","award":["62422206"],"award-info":[{"award-number":["62422206"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Database Syst."],"published-print":{"date-parts":[[2025,3,31]]},"abstract":"<jats:p>\n                    The two paradigms to identify records of preference in a multi-objective setting rely either on dominance (e.g., the skyline operator) or on a utility function defined over the records\u2019 attributes (typically using a top-\n                    <jats:italic>k<\/jats:italic>\n                    query). Despite their proliferation, each has its own palpable drawbacks. Motivated by these drawbacks, we identify three hard requirements for practical decision support, namely, personalization, controllable output size, and flexibility in preference specification. With these requirements as a guide, we combine elements from both paradigms and propose two new operators,\n                    <jats:sans-serif>ORD<\/jats:sans-serif>\n                    and\n                    <jats:sans-serif>ORU<\/jats:sans-serif>\n                    . We present a suite of algorithms for their efficient processing, dedicating more technical effort to\n                    <jats:sans-serif>ORU<\/jats:sans-serif>\n                    , whose nature is inherently more challenging. Specifically, besides a sophisticated algorithm for\n                    <jats:sans-serif>ORD<\/jats:sans-serif>\n                    , we describe two exact methods for\n                    <jats:sans-serif>ORU<\/jats:sans-serif>\n                    and one approximate. We perform a qualitative study to demonstrate how our operators work and evaluate the performance of our algorithms against adaptations of previous work that mimic their output.\n                  <\/jats:p>","DOI":"10.1145\/3705726","type":"journal-article","created":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T05:55:11Z","timestamp":1732254911000},"page":"1-37","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Marrying Top-k with Skyline Queries: Operators with Relaxed Preference Input and Controllable Output Size"],"prefix":"10.1145","volume":"50","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8835-430X","authenticated-orcid":false,"given":"Kyriakos","family":"Mouratidis","sequence":"first","affiliation":[{"name":"School of Computing and Information Systems, Singapore Management University, Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-5179-990X","authenticated-orcid":false,"given":"Keming","family":"Li","sequence":"additional","affiliation":[{"name":"School of Information and Computer Sciences, University of California Irvine, Irvine, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8424-0092","authenticated-orcid":false,"given":"Bo","family":"Tang","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Southern University of Science and Technology, Shenzhen, China and Research Institute of Trustworthy Autonomous Systems, Southern University of Science and Technology, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,1,10]]},"reference":[{"key":"e_1_3_2_2_2","unstructured":"Hotel dataset. (n.d.). https:\/\/github.com\/RyanBalfanz\/hotelsbase"},{"key":"e_1_3_2_3_2","unstructured":"House dataset. (n.d.). https:\/\/www.ipums.org"},{"key":"e_1_3_2_4_2","unstructured":"lp_solve. (n.d.). https:\/\/lpsolve.sourceforge.net\/5.5\/"},{"key":"e_1_3_2_5_2","unstructured":"NBA dataset. (n.d.). https:\/\/www.basketball-reference.com"},{"key":"e_1_3_2_6_2","unstructured":"Source code. (n.d.). https:\/\/github.com\/ghlkm\/ordu"},{"key":"e_1_3_2_7_2","unstructured":"TripAdvisor dataset. (n.d.). https:\/\/www.cs.virginia.edu\/hw5x\/dataset.html"},{"key":"e_1_3_2_8_2","first-page":"983","volume-title":"ICDE","author":"Antova Lyublena","year":"2008","unstructured":"Lyublena Antova, Thomas Jansen, Christoph Koch, and Dan Olteanu. 2008. Fast and simple relational processing of uncertain data. In ICDE. 983\u2013992."},{"issue":"3","key":"e_1_3_2_9_2","first-page":"237","article-title":"On obtaining stable rankings","volume":"12","author":"Asudeh Abolfazl","year":"2018","unstructured":"Abolfazl Asudeh, H. V. Jagadish, Gerome Miklau, and Julia Stoyanovich. 2018. On obtaining stable rankings. PVLDB 12, 3 (2018), 237\u2013250.","journal-title":"PVLDB"},{"key":"e_1_3_2_10_2","first-page":"821","volume-title":"SIGMOD Conference","author":"Asudeh Abolfazl","year":"2017","unstructured":"Abolfazl Asudeh, Azade Nazi, Nan Zhang, and Gautam Das. 2017. Efficient computation of regret-ratio minimizing set: A compact maxima representative. In SIGMOD Conference. 821\u2013834."},{"key":"e_1_3_2_11_2","first-page":"263","volume-title":"SIGMOD Conference","author":"Asudeh Abolfazl","year":"2019","unstructured":"Abolfazl Asudeh, Azade Nazi, Nan Zhang, Gautam Das, and H. V. Jagadish. 2019. RRR: Rank-regret representative. In SIGMOD Conference. 263\u2013280."},{"issue":"4","key":"e_1_3_2_12_2","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1145\/235815.235821","article-title":"The quickhull algorithm for convex hulls","volume":"22","author":"Barber C. Bradford","year":"1996","unstructured":"C. Bradford Barber, David P. Dobkin, and Hannu Huhdanpaa. 1996. The quickhull algorithm for convex hulls. ACM Trans. Math. Softw. 22, 4 (1996), 469\u2013483.","journal-title":"ACM Trans. Math. Softw."},{"key":"e_1_3_2_13_2","unstructured":"C. Bradford Barber and Hannu Huhdanpaa. qhull. (n.d.). http:\/\/www.qhull.org"},{"issue":"2","key":"e_1_3_2_14_2","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1109\/TKDE.2010.86","article-title":"Collaborative filtering with personalized skylines","volume":"23","author":"Bartolini Ilaria","year":"2011","unstructured":"Ilaria Bartolini, Zhenjie Zhang, and Dimitris Papadias. 2011. Collaborative filtering with personalized skylines. IEEE Trans. Knowl. Data Eng. 23, 2 (2011), 190\u2013203.","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"e_1_3_2_15_2","first-page":"322","volume-title":"SIGMOD Conference","author":"Beckmann Norbert","year":"1990","unstructured":"Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, and Bernhard Seeger. 1990. The R*-Tree: An efficient and robust access method for points and rectangles. In SIGMOD Conference. 322\u2013331."},{"issue":"4","key":"e_1_3_2_16_2","doi-asserted-by":"crossref","first-page":"536","DOI":"10.1145\/322092.322095","article-title":"On the average number of maxima in a set of vectors and applications","volume":"25","author":"Bentley Jon Louis","year":"1978","unstructured":"Jon Louis Bentley, H. T. Kung, Mario Schkolnick, and Clark D. Thompson. 1978. On the average number of maxima in a set of vectors and applications. J. ACM 25, 4 (1978), 536\u2013543.","journal-title":"J. ACM"},{"key":"e_1_3_2_17_2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry: Algorithms and Applications","author":"Berg Mark de","year":"2008","unstructured":"Mark de Berg, Otfried Cheong, Marc van Kreveld, and Mark Overmars. 2008. Computational Geometry: Algorithms and Applications. Springer-Verlag TELOS."},{"key":"e_1_3_2_18_2","first-page":"421","volume-title":"ICDE","author":"B\u00f6rzs\u00f6nyi Stephan","year":"2001","unstructured":"Stephan B\u00f6rzs\u00f6nyi, Donald Kossmann, and Konrad Stocker. 2001. The skyline operator. In ICDE. 421\u2013430."},{"key":"e_1_3_2_19_2","first-page":"503","volume-title":"SIGMOD Conference","author":"Chan Chee Yong","year":"2006","unstructured":"Chee Yong Chan, H. V. Jagadish, Kian-Lee Tan, Anthony K. H. Tung, and Zhenjie Zhang. 2006. Finding k-dominant skylines in high dimensional space. In SIGMOD Conference. 503\u2013514."},{"key":"e_1_3_2_20_2","first-page":"478","volume-title":"EDBT","author":"Chan Chee Yong","year":"2006","unstructured":"Chee Yong Chan, H. V. Jagadish, Kian-Lee Tan, Anthony K. H. Tung, and Zhenjie Zhang. 2006. On high dimensional skylines. In EDBT. 478\u2013495."},{"key":"e_1_3_2_21_2","first-page":"391","volume-title":"SIGMOD Conference","author":"Chang Yuan-Chi","year":"2000","unstructured":"Yuan-Chi Chang, Lawrence Bergman, Vittorio Castelli, Chung-Sheng Li, Ming-Ling Lo, and John R. Smith. 2000. The onion technique: Indexing for linear optimization queries. In SIGMOD Conference. 391\u2013402."},{"key":"e_1_3_2_22_2","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/BF02573985","article-title":"An optimal convex hull algorithm in any fixed dimension","volume":"10","author":"Chazelle Bernard","year":"1993","unstructured":"Bernard Chazelle. 1993. An optimal convex hull algorithm in any fixed dimension. Discrete Comput. Geom. 10 (1993), 377\u2013409.","journal-title":"Discrete Comput. Geom."},{"issue":"5","key":"e_1_3_2_23_2","first-page":"389","article-title":"Computing k-regret minimizing sets","volume":"7","author":"Chester Sean","year":"2014","unstructured":"Sean Chester, Alex Thomo, S. Venkatesh, and Sue Whitesides. 2014. Computing k-regret minimizing sets. PVLDB 7, 5 (2014), 389\u2013400.","journal-title":"PVLDB"},{"issue":"3","key":"e_1_3_2_24_2","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1145\/2536669.2536671","article-title":"Skyline queries, front and back","volume":"42","author":"Chomicki Jan","year":"2013","unstructured":"Jan Chomicki, Paolo Ciaccia, and Niccol\u00f2 Meneghetti. 2013. Skyline queries, front and back. SIGMOD Rec. 42, 3 (2013), 6\u201318.","journal-title":"SIGMOD Rec."},{"issue":"11","key":"e_1_3_2_25_2","first-page":"1454","article-title":"Reconciling skyline and ranking queries","volume":"10","author":"Ciaccia Paolo","year":"2017","unstructured":"Paolo Ciaccia and Davide Martinenghi. 2017. Reconciling skyline and ranking queries. PVLDB 10, 11 (2017), 1454\u20131465.","journal-title":"PVLDB"},{"key":"e_1_3_2_26_2","first-page":"57","volume-title":"CIKM","author":"Ciaccia Paolo","year":"2018","unstructured":"Paolo Ciaccia and Davide Martinenghi. 2018. FA + TA < FSA: Flexible score aggregation. In CIKM. 57\u201366."},{"issue":"4","key":"e_1_3_2_27_2","first-page":"18:1\u201318:45","article-title":"Flexible skylines: Dominance for arbitrary sets of monotone functions","volume":"45","author":"Ciaccia Paolo","year":"2020","unstructured":"Paolo Ciaccia and Davide Martinenghi. 2020. Flexible skylines: Dominance for arbitrary sets of monotone functions. ACM Trans. Database Syst. 45, 4 (2020), 18:1\u201318:45.","journal-title":"ACM Trans. Database Syst."},{"key":"e_1_3_2_28_2","first-page":"305","volume-title":"ICDE","author":"Cormode Graham","year":"2009","unstructured":"Graham Cormode, Feifei Li, and Ke Yi. 2009. Semantics of ranking queries for probabilistic data and expected ranks. In ICDE. 305\u2013316."},{"key":"e_1_3_2_29_2","first-page":"183","volume-title":"VLDB","author":"Das Gautam","year":"2007","unstructured":"Gautam Das, Dimitrios Gunopulos, Nick Koudas, and Nikos Sarkas. 2007. Ad-hoc top-k query answering for data streams. In VLDB. 183\u2013194."},{"issue":"4","key":"e_1_3_2_30_2","doi-asserted-by":"crossref","first-page":"810","DOI":"10.1287\/opre.27.4.810","article-title":"Measurable multiattribute value functions","volume":"27","author":"Dyer James S.","year":"1979","unstructured":"James S. Dyer and Rakesh K. Sarin. 1979. Measurable multiattribute value functions. Oper. Res. 27, 4 (1979), 810\u2013822.","journal-title":"Oper. Res."},{"key":"e_1_3_2_31_2","volume-title":"Preference Learning","author":"F\u00fcrnkranz Johannes","year":"2010","unstructured":"Johannes F\u00fcrnkranz and Eyke H\u00fcllermeier (Eds.). 2010. Preference Learning. Springer."},{"key":"e_1_3_2_32_2","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1016\/j.knosys.2015.07.007","article-title":"Efficient algorithms for finding the most desirable skyline objects","volume":"89","author":"Gao Yunjun","year":"2015","unstructured":"Yunjun Gao, Qing Liu, Lu Chen, Gang Chen, and Qing Li. 2015. Efficient algorithms for finding the most desirable skyline objects. Knowl. Based Syst. 89 (2015), 250\u2013264.","journal-title":"Knowl. Based Syst."},{"key":"e_1_3_2_33_2","unstructured":"Luca Di Gaspero. (n.d.). QuadProgpp. https:\/\/github.com\/liuq\/QuadProgpp"},{"issue":"5","key":"e_1_3_2_34_2","doi-asserted-by":"crossref","first-page":"1015","DOI":"10.1109\/TKDE.2012.34","article-title":"Efficient all top-k computation\u2014a unified solution for all top-k, reverse top-k and top-m influential queries","volume":"25","author":"Ge Shen","year":"2013","unstructured":"Shen Ge, Leong Hou U, Nikos Mamoulis, and David W. Cheung. 2013. Efficient all top-k computation\u2014a unified solution for all top-k, reverse top-k and top-m influential queries. IEEE Trans. Knowl. Data Eng. 25, 5 (2013), 1015\u20131027.","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"2","key":"e_1_3_2_35_2","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/s10115-013-0694-y","article-title":"Dominance relationship analysis with budget constraints","volume":"42","author":"Ge Shen","year":"2015","unstructured":"Shen Ge, Leong Hou U, Nikos Mamoulis, and David Wai-Lok Cheung. 2015. Dominance relationship analysis with budget constraints. Knowl. Inf. Syst. 42, 2 (2015), 409\u2013440.","journal-title":"Knowl. Inf. Syst."},{"issue":"4","key":"e_1_3_2_36_2","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1287\/mnsc.19.4.357","article-title":"An interactive approach for multi-criterion optimization, with an application to the operation of an academic department","volume":"19","author":"Geoffrion A. M.","year":"1972","unstructured":"A. M. Geoffrion, J. S. Dyer, and A. Feinberg. 1972. An interactive approach for multi-criterion optimization, with an application to the operation of an academic department. Manage. Sci. 19, 4-part-1 (1972), 357\u2013368.","journal-title":"Manage. Sci."},{"issue":"1","key":"e_1_3_2_37_2","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s00778-006-0029-7","article-title":"Algorithms and analyses for maximal vector computation","volume":"16","author":"Godfrey Parke","year":"2007","unstructured":"Parke Godfrey, Ryan Shipley, and Jarek Gryz. 2007. Algorithms and analyses for maximal vector computation. VLDB J. 16, 1 (2007), 5\u201328.","journal-title":"VLDB J."},{"issue":"1","key":"e_1_3_2_38_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02591962","article-title":"A numerically stable dual method for solving strictly convex quadratic programs","volume":"27","author":"Goldfarb Donald","year":"1983","unstructured":"Donald Goldfarb and Ashok U. Idnani. 1983. A numerically stable dual method for solving strictly convex quadratic programs. Math. Program. 27, 1 (1983), 1\u201333.","journal-title":"Math. Program."},{"key":"e_1_3_2_39_2","article-title":"Redefining Hick\u2019s Law","author":"Gross Jason","year":"2012","unstructured":"Jason Gross. 2012. Redefining Hick\u2019s Law. SMASHING Magazine. https:\/\/www.smashingmagazine.com\/2012\/02\/redefining-hicks-law\/","journal-title":"SMASHING Magazine"},{"issue":"1","key":"e_1_3_2_40_2","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1007\/s10115-018-1256-0","article-title":"Ranking the big sky: Efficient top-k skyline computation on massive data","volume":"60","author":"Han Xixian","year":"2019","unstructured":"Xixian Han, Bailing Wang, Jianzhong Li, and Hong Gao. 2019. Ranking the big sky: Efficient top-k skyline computation on massive data. Knowl. Inf. Syst. 60, 1 (2019), 415\u2013446.","journal-title":"Knowl. Inf. Syst."},{"issue":"1","key":"e_1_3_2_41_2","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1080\/17470215208416600","article-title":"On the rate of gain of information","volume":"4","author":"Hick William Edmund","year":"1952","unstructured":"William Edmund Hick. 1952. On the rate of gain of information. Q. J. Exp. Psychol. 4, 1 (1952), 11\u201326.","journal-title":"Q. J. Exp. Psychol."},{"key":"e_1_3_2_42_2","article-title":"Infinite Scrolling, Pagination Or \u201cLoad More\u201d Buttons? Usability Findings in eCommerce","author":"Holst Christian","year":"2016","unstructured":"Christian Holst. 2016. Infinite Scrolling, Pagination Or \u201cLoad More\u201d Buttons? Usability Findings in eCommerce. SMASHING Magazine. https:\/\/www.smashingmagazine.com\/2016\/03\/pagination-infinite-scrolling-load-more-buttons\/","journal-title":"SMASHING Magazine"},{"key":"e_1_3_2_43_2","first-page":"259","volume-title":"SIGMOD Conference","author":"Hristidis Vagelis","year":"2001","unstructured":"Vagelis Hristidis, Nick Koudas, and Yannis Papakonstantinou. 2001. PREFER: A system for the efficient execution of multi-parametric ranked queries. In SIGMOD Conference. 259\u2013270."},{"issue":"3","key":"e_1_3_2_44_2","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1037\/h0056940","article-title":"Stimulus information as a determinant of reaction time","volume":"45","author":"Hyman Ray","year":"1953","unstructured":"Ray Hyman. 1953. Stimulus information as a determinant of reaction time. J. Exp. Psychol. 45, 3 (1953), 188\u2013196.","journal-title":"J. Exp. Psychol."},{"issue":"4","key":"e_1_3_2_45_2","first-page":"11:1\u201311:58","article-title":"A survey of top-k query processing techniques in relational database systems","volume":"40","author":"Ilyas Ihab F.","year":"2008","unstructured":"Ihab F. Ilyas, George Beskales, and Mohamed A. Soliman. 2008. A survey of top-k query processing techniques in relational database systems. ACM Comp. Surveys 40, 4 (2008), 11:1\u201311:58.","journal-title":"ACM Comp. Surveys"},{"issue":"2","key":"e_1_3_2_46_2","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/0377-2217(91)90296-8","article-title":"A framework for sensitivity analysis in discrete multi-objective decision-making","volume":"54","author":"Insua David Rios","year":"1991","unstructured":"David Rios Insua and Simon French. 1991. A framework for sensitivity analysis in discrete multi-objective decision-making. Eur. J. Oper. Res. 54, 2 (1991), 176\u2013190.","journal-title":"Eur. J. Oper. Res."},{"key":"e_1_3_2_47_2","first-page":"2240","volume-title":"NIPS","author":"Jamieson Kevin G.","year":"2011","unstructured":"Kevin G. Jamieson and Robert D. Nowak. 2011. Active ranking using pairwise comparisons. In NIPS. 2240\u20132248."},{"issue":"4","key":"e_1_3_2_48_2","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/582415.582418","article-title":"Cumulated gain-based evaluation of IR techniques","volume":"20","author":"J\u00e4rvelin Kalervo","year":"2002","unstructured":"Kalervo J\u00e4rvelin and Jaana Kek\u00e4l\u00e4inen. 2002. Cumulated gain-based evaluation of IR techniques. ACM Trans. Inf. Syst. 20, 4 (2002), 422\u2013446.","journal-title":"ACM Trans. Inf. Syst."},{"key":"e_1_3_2_49_2","first-page":"133","volume-title":"KDD","author":"Joachims Thorsten","year":"2002","unstructured":"Thorsten Joachims. 2002. Optimizing search engines using clickthrough data. In KDD. 133\u2013142."},{"key":"e_1_3_2_50_2","volume-title":"Decisions with Multiple Objectives: Preferences and Value Trade-offs","author":"Keeney Ralph L.","year":"1976","unstructured":"Ralph L. Keeney and Howard Raiffa. 1976. Decisions with Multiple Objectives: Preferences and Value Trade-offs. Wiley."},{"key":"e_1_3_2_51_2","first-page":"311","volume-title":"VLDB","author":"Kie\u00dfling Werner","year":"2002","unstructured":"Werner Kie\u00dfling. 2002. Foundations of preferences in database systems. In VLDB. 311\u2013322."},{"key":"e_1_3_2_52_2","first-page":"89","volume-title":"Symposium on Computational Geometry","author":"Kirkpatrick David G.","year":"1985","unstructured":"David G. Kirkpatrick and Raimund Seidel. 1985. Output-size sensitive algorithms for finding maximal vectors. In Symposium on Computational Geometry. 89\u201396."},{"issue":"3","key":"e_1_3_2_53_2","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/j.tcs.2006.11.003","article-title":"Approximately dominating representatives","volume":"371","author":"Koltun Vladlen","year":"2007","unstructured":"Vladlen Koltun and Christos H. Papadimitriou. 2007. Approximately dominating representatives. Theor. Comput. Sci. 371, 3 (2007), 148\u2013154.","journal-title":"Theor. Comput. Sci."},{"key":"e_1_3_2_54_2","doi-asserted-by":"crossref","DOI":"10.1142\/8042","volume-title":"Multiple Criteria Decision Making: From Early History to the 21st Century","author":"K\u00f6ksalan Murat","year":"2011","unstructured":"Murat K\u00f6ksalan, Jyrki Wallenius, and Stanley Zionts. 2011. Multiple Criteria Decision Making: From Early History to the 21st Century. World Scientific Publishing Co. Pte. Ltd."},{"key":"e_1_3_2_55_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.is.2013.05.005","article-title":"Scalable skyline computation using a balanced pivot selection technique","volume":"39","author":"Lee Jongwuk","year":"2014","unstructured":"Jongwuk Lee and Seung-won Hwang. 2014. Scalable skyline computation using a balanced pivot selection technique. Inf. Syst. 39 (2014), 1\u201321.","journal-title":"Inf. Syst."},{"issue":"1","key":"e_1_3_2_56_2","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.is.2008.04.004","article-title":"Personalized top-k skyline queries in high-dimensional space","volume":"34","author":"Lee Jongwuk","year":"2009","unstructured":"Jongwuk Lee, Gae-won You, and Seung-won Hwang. 2009. Personalized top-k skyline queries in high-dimensional space. Inf. Syst. 34, 1 (2009), 45\u201361.","journal-title":"Inf. Syst."},{"key":"e_1_3_2_57_2","first-page":"835","volume-title":"SIGMOD Conference","author":"Li Hui","year":"2017","unstructured":"Hui Li, Tsz Nam Chan, Man Lung Yiu, and Nikos Mamoulis. 2017. FEXIPRO: Fast and exact inner product retrieval in recommender systems. In SIGMOD Conference. 835\u2013850."},{"key":"e_1_3_2_58_2","first-page":"86","volume-title":"ICDE","author":"Lin Xuemin","year":"2007","unstructured":"Xuemin Lin, Yidong Yuan, Qing Zhang, and Ying Zhang. 2007. Selecting stars: The k most representative skyline operator. In ICDE. 86\u201395."},{"issue":"5","key":"e_1_3_2_59_2","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1007\/s00778-014-0352-3","article-title":"Taking the big picture: Representative skylines based on significance and diversity","volume":"23","author":"Magnani Matteo","year":"2014","unstructured":"Matteo Magnani, Ira Assent, and Michael L. Mortensen. 2014. Taking the big picture: Representative skylines based on significance and diversity. VLDB J. 23, 5 (2014), 795\u2013815.","journal-title":"VLDB J."},{"key":"e_1_3_2_60_2","first-page":"16","volume-title":"ACM Symposium on Computational Geometry","author":"Matousek Jir\u00ed","year":"1992","unstructured":"Jir\u00ed Matousek and Otfried Schwarzkopf. 1992. Linear optimization queries. In ACM Symposium on Computational Geometry. 16\u201325."},{"key":"e_1_3_2_61_2","first-page":"1955","volume-title":"SIGMOD Conference","author":"Meneghetti Niccol\u00f2","year":"2015","unstructured":"Niccol\u00f2 Meneghetti, Denis Mindolin, Paolo Ciaccia, and Jan Chomicki. 2015. Output-sensitive evaluation of prioritized skyline queries. In SIGMOD Conference. 1955\u20131967."},{"issue":"1","key":"e_1_3_2_62_2","first-page":"610","article-title":"Discovering relative importance of skyline attributes","volume":"2","author":"Mindolin Denis","year":"2009","unstructured":"Denis Mindolin and Jan Chomicki. 2009. Discovering relative importance of skyline attributes. PVLDB 2, 1 (2009), 610\u2013621.","journal-title":"PVLDB"},{"issue":"1","key":"e_1_3_2_63_2","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01587076","article-title":"Interior path following primal-dual algorithms. part II: Convex quadratic programming","volume":"44","author":"Monteiro Renato D. C.","year":"1989","unstructured":"Renato D. C. Monteiro and Ilan Adler. 1989. Interior path following primal-dual algorithms. part II: Convex quadratic programming. Math. Program. 44, 1\u20133 (1989), 43\u201366.","journal-title":"Math. Program."},{"key":"e_1_3_2_64_2","first-page":"1317","volume-title":"SIGMOD Conference","author":"Mouratidis Kyriakos","year":"2021","unstructured":"Kyriakos Mouratidis, Keming Li, and Bo Tang. 2021. Marrying top-k with skyline queries: Relaxing the preference input while producing output of controllable size. In SIGMOD Conference. 1317\u20131330."},{"issue":"8","key":"e_1_3_2_65_2","first-page":"866","article-title":"Exact processing of uncertain top-k queries in multi-criteria settings","volume":"11","author":"Mouratidis Kyriakos","year":"2018","unstructured":"Kyriakos Mouratidis and Bo Tang. 2018. Exact processing of uncertain top-k queries in multi-criteria settings. PVLDB 11, 8 (2018), 866\u2013879.","journal-title":"PVLDB"},{"issue":"12","key":"e_1_3_2_66_2","first-page":"1554","article-title":"Maximum rank query","volume":"8","author":"Mouratidis Kyriakos","year":"2015","unstructured":"Kyriakos Mouratidis, Jilian Zhang, and HweeHwa Pang. 2015. Maximum rank query. PVLDB 8, 12 (2015), 1554\u20131565.","journal-title":"PVLDB"},{"key":"e_1_3_2_67_2","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718508","volume-title":"Discrete Convex Analysis","author":"Murota Kazuo","year":"2003","unstructured":"Kazuo Murota. 2003. Discrete Convex Analysis. Society for Industrial and Applied Mathematics."},{"key":"e_1_3_2_68_2","first-page":"109","volume-title":"SIGMOD Conference","author":"Nanongkai Danupon","year":"2012","unstructured":"Danupon Nanongkai, Ashwin Lall, Atish Das Sarma, and Kazuhisa Makino. 2012. Interactive regret minimization. In SIGMOD Conference. 109\u2013120."},{"issue":"1","key":"e_1_3_2_69_2","first-page":"1114","article-title":"Regret-minimizing representative databases","volume":"3","author":"Nanongkai Danupon","year":"2010","unstructured":"Danupon Nanongkai, Atish Das Sarma, Ashwin Lall, Richard J. Lipton, and Jun (Jim) Xu. 2010. Regret-minimizing representative databases. PVLDB 3, 1 (2010), 1114\u20131124.","journal-title":"PVLDB"},{"issue":"1","key":"e_1_3_2_70_2","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1145\/1061318.1061320","article-title":"Progressive skyline computation in database systems","volume":"30","author":"Papadias Dimitris","year":"2005","unstructured":"Dimitris Papadias, Yufei Tao, Greg Fu, and Bernhard Seeger. 2005. Progressive skyline computation in database systems. ACM Trans. Database Syst. 30, 1 (2005), 41\u201382.","journal-title":"ACM Trans. Database Syst."},{"issue":"4","key":"e_1_3_2_71_2","doi-asserted-by":"crossref","first-page":"1335","DOI":"10.1145\/1189769.1189774","article-title":"Towards multidimensional subspace skyline analysis","volume":"31","author":"Pei Jian","year":"2006","unstructured":"Jian Pei, Yidong Yuan, Xuemin Lin, Wen Jin, Martin Ester, Qing Liu, Wei Wang, Yufei Tao, Jeffrey Xu Yu, and Qing Zhang. 2006. Towards multidimensional subspace skyline analysis. ACM Trans. Database Syst. 31, 4 (2006), 1335\u20131381.","journal-title":"ACM Trans. Database Syst."},{"key":"e_1_3_2_72_2","first-page":"577","volume-title":"SIGMOD Conference","author":"Peng Peng","year":"2015","unstructured":"Peng Peng and Raymond Chi-Wing Wong. 2015. k-Hit query: Top-k query with probabilistic utility function. In SIGMOD Conference. 577\u2013592."},{"issue":"11","key":"e_1_3_2_73_2","first-page":"1322","article-title":"Learning user preferences by adaptive pairwise comparison","volume":"8","author":"Qian Li","year":"2015","unstructured":"Li Qian, Jinyang Gao, and H. V. Jagadish. 2015. Learning user preferences by adaptive pairwise comparison. PVLDB 8, 11 (2015), 1322\u20131333.","journal-title":"PVLDB"},{"key":"e_1_3_2_74_2","first-page":"387","volume-title":"ICDE","author":"Sarma Atish Das","year":"2011","unstructured":"Atish Das Sarma, Ashwin Lall, Danupon Nanongkai, Richard J. Lipton, and Jun (Jim) Xu. 2011. Representative skylines using threshold-based preference distributions. In ICDE. 387\u2013398."},{"key":"e_1_3_2_75_2","first-page":"507","volume-title":"VLDB","author":"Sellis Timos K.","year":"1987","unstructured":"Timos K. Sellis, Nick Roussopoulos, and Christos Faloutsos. 1987. The R+-Tree: A dynamic index for multi-dimensional objects. In VLDB. 507\u2013518."},{"issue":"4","key":"e_1_3_2_76_2","first-page":"26:1\u201326:22","article-title":"Worst-case I\/O-efficient skyline algorithms","volume":"37","author":"Sheng Cheng","year":"2012","unstructured":"Cheng Sheng and Yufei Tao. 2012. Worst-case I\/O-efficient skyline algorithms. ACM Trans. Database Syst. 37, 4 (2012), 26:1\u201326:22.","journal-title":"ACM Trans. Database Syst."},{"key":"e_1_3_2_77_2","first-page":"805","volume-title":"SIGMOD Conference","author":"Soliman Mohamed A.","year":"2011","unstructured":"Mohamed A. Soliman, Ihab F. Ilyas, Davide Martinenghi, and Marco Tagliasacchi. 2011. Ranking with uncertain scoring functions: Semantics and sensitivity measures. In SIGMOD Conference. 805\u2013816."},{"key":"e_1_3_2_78_2","volume-title":"Multiple Criteria Optimization: Theory, Computation and Application","author":"Steuer Ralph E.","year":"1986","unstructured":"Ralph E. Steuer. 1986. Multiple Criteria Optimization: Theory, Computation and Application. Wiley."},{"key":"e_1_3_2_79_2","first-page":"892","volume-title":"ICDE","author":"Tao Yufei","year":"2009","unstructured":"Yufei Tao, Ling Ding, Xuemin Lin, and Jian Pei. 2009. Distance-based representative skyline. In ICDE. 892\u2013903."},{"issue":"3","key":"e_1_3_2_80_2","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1016\/j.is.2005.12.001","article-title":"Branch-and-bound processing of ranked queries","volume":"32","author":"Tao Yufei","year":"2007","unstructured":"Yufei Tao, Vagelis Hristidis, Dimitris Papadias, and Yannis Papakonstantinou. 2007. Branch-and-bound processing of ranked queries. Inf. Syst. 32, 3 (2007), 424\u2013445.","journal-title":"Inf. Syst."},{"issue":"8","key":"e_1_3_2_81_2","doi-asserted-by":"crossref","first-page":"1072","DOI":"10.1109\/TKDE.2007.1051","article-title":"Efficient skyline and top-k retrieval in subspaces","volume":"19","author":"Tao Yufei","year":"2007","unstructured":"Yufei Tao, Xiaokui Xiao, and Jian Pei. 2007. Efficient skyline and top-k retrieval in subspaces. IEEE Trans. Knowl. Data Eng. 19, 8 (2007), 1072\u20131088.","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"6","key":"e_1_3_2_82_2","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1007\/s00778-011-0231-0","article-title":"Progressive processing of subspace dominating queries","volume":"20","author":"Tiakas Eleftherios","year":"2011","unstructured":"Eleftherios Tiakas, Apostolos N. Papadopoulos, and Yannis Manolopoulos. 2011. Progressive processing of subspace dominating queries. VLDB J. 20, 6 (2011), 921\u2013948.","journal-title":"VLDB J."},{"key":"e_1_3_2_83_2","volume-title":"Information Retrieval","author":"Rijsbergen C. J. van","year":"1979","unstructured":"C. J. van Rijsbergen. 1979. Information Retrieval. Butterworth."},{"issue":"9","key":"e_1_3_2_84_2","doi-asserted-by":"crossref","first-page":"943","DOI":"10.1016\/j.datak.2010.03.008","article-title":"Ranking the sky: Discovering the importance of skyline points through subspace dominance relationships","volume":"69","author":"Vlachou Akrivi","year":"2010","unstructured":"Akrivi Vlachou and Michalis Vazirgiannis. 2010. Ranking the sky: Discovering the importance of skyline points through subspace dominance relationships. Data Knowl. Eng. 69, 9 (2010), 943\u2013964.","journal-title":"Data Knowl. Eng."},{"key":"e_1_3_2_85_2","first-page":"783","volume-title":"KDD","author":"Wang Hongning","year":"2010","unstructured":"Hongning Wang, Yue Lu, and Chengxiang Zhai. 2010. Latent aspect rating analysis on review text data: A rating regression approach. In KDD. 783\u2013792."},{"key":"e_1_3_2_86_2","first-page":"618","volume-title":"KDD","author":"Wang Hongning","year":"2011","unstructured":"Hongning Wang, Yue Lu, and ChengXiang Zhai. 2011. Latent aspect rating analysis without aspect keyword supervision. In KDD. 618\u2013626."},{"key":"e_1_3_2_87_2","first-page":"25","volume-title":"COLT","author":"Wang Yining","year":"2013","unstructured":"Yining Wang, Liwei Wang, Yuanzhi Li, Di He, and Tie-Yan Liu. 2013. A theoretical analysis of NDCG type ranking measures. In COLT. 25\u201354."},{"key":"e_1_3_2_88_2","first-page":"1397","volume-title":"ICDE","author":"Xia Tian","year":"2008","unstructured":"Tian Xia, Donghui Zhang, and Yufei Tao. 2008. On skylining with flexible dominance relation. In ICDE. 1397\u20131399."},{"key":"e_1_3_2_89_2","first-page":"281","volume-title":"SIGMOD Conference","author":"Xie Min","year":"2019","unstructured":"Min Xie, Raymond Chi-Wing Wong, and Ashwin Lall. 2019. Strongly truthful interactive regret minimization. In SIGMOD Conference. 281\u2013298."},{"issue":"1","key":"e_1_3_2_90_2","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/s00778-019-00570-z","article-title":"An experimental survey of regret minimization query and variants: Bridging the best worlds between top-k query and skyline query","volume":"29","author":"Xie Min","year":"2020","unstructured":"Min Xie, Raymond Chi-Wing Wong, and Ashwin Lall. 2020. An experimental survey of regret minimization query and variants: Bridging the best worlds between top-k query and skyline query. VLDB J. 29, 1 (2020), 147\u2013175.","journal-title":"VLDB J."},{"key":"e_1_3_2_91_2","first-page":"959","volume-title":"SIGMOD Conference","author":"Xie Min","year":"2018","unstructured":"Min Xie, Raymond Chi-Wing Wong, Jian Li, Cheng Long, and Ashwin Lall. 2018. Efficient k-regret query algorithm with restriction-free bound for any dimensionality. In SIGMOD Conference. 959\u2013974."},{"issue":"12","key":"e_1_3_2_92_2","doi-asserted-by":"crossref","first-page":"1669","DOI":"10.1109\/TKDE.2008.90","article-title":"Efficient processing of top-k queries in uncertain databases with x-relations","volume":"20","author":"Yi Ke","year":"2008","unstructured":"Ke Yi, Feifei Li, George Kollios, and Divesh Srivastava. 2008. Efficient processing of top-k queries in uncertain databases with x-relations. IEEE Trans. Knowl. Data Eng. 20, 12 (2008), 1669\u20131682.","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"3","key":"e_1_3_2_93_2","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1007\/s00778-008-0117-y","article-title":"Multi-dimensional top-k dominating queries","volume":"18","author":"Yiu Man Lung","year":"2009","unstructured":"Man Lung Yiu and Nikos Mamoulis. 2009. Multi-dimensional top-k dominating queries. VLDB J. 18, 3 (2009), 695\u2013718.","journal-title":"VLDB J."},{"issue":"2","key":"e_1_3_2_94_2","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1109\/TKDE.2015.2451630","article-title":"Top-k preferences in high dimensions","volume":"28","author":"Yu Albert","year":"2016","unstructured":"Albert Yu, Pankaj K. Agarwal, and Jun Yang. 2016. Top-k preferences in high dimensions. IEEE Trans. Knowl. Data Eng. 28, 2 (2016), 311\u2013325.","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"e_1_3_2_95_2","first-page":"1722","volume-title":"ICDE","author":"Zeighami Sepanta","year":"2019","unstructured":"Sepanta Zeighami and Raymond Chi-Wing Wong. 2019. Finding average regret ratio minimizing set in database. In ICDE. 1722\u20131725."},{"key":"e_1_3_2_96_2","first-page":"1151","volume-title":"SIGMOD Conference","author":"Zhang Jilian","year":"2014","unstructured":"Jilian Zhang, Kyriakos Mouratidis, and HweeHwa Pang. 2014. Global immutable region computation. In SIGMOD Conference. 1151\u20131162."},{"key":"e_1_3_2_97_2","first-page":"473","volume-title":"APWeb-WAIM","author":"Zheng Jiping","year":"2020","unstructured":"Jiping Zheng and Chen Chen. 2020. Sorting-based interactive regret minimization. In APWeb-WAIM. 473\u2013490."}],"container-title":["ACM Transactions on Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3705726","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3705726","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T21:18:12Z","timestamp":1750281492000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3705726"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,10]]},"references-count":96,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,3,31]]}},"alternative-id":["10.1145\/3705726"],"URL":"https:\/\/doi.org\/10.1145\/3705726","relation":{},"ISSN":["0362-5915","1557-4644"],"issn-type":[{"value":"0362-5915","type":"print"},{"value":"1557-4644","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,10]]},"assertion":[{"value":"2023-10-16","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-11-10","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-01-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}