{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:49:16Z","timestamp":1750308556786,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,5,27]],"date-time":"2015-05-27T00:00:00Z","timestamp":1432684800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,5,27]]},"DOI":"10.1145\/2723372.2723736","type":"proceedings-article","created":{"date-parts":[[2015,6,2]],"date-time":"2015-06-02T05:35:02Z","timestamp":1433223302000},"page":"1955-1967","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Output-sensitive Evaluation of Prioritized Skyline Queries"],"prefix":"10.1145","author":[{"given":"Niccolo'","family":"Meneghetti","sequence":"first","affiliation":[{"name":"University at Buffalo State University of New York, Buffalo, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Denis","family":"Mindolin","sequence":"additional","affiliation":[{"name":"Bloomberg L.P., New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Ciaccia","sequence":"additional","affiliation":[{"name":"University of Bologna, Bologna, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Chomicki","sequence":"additional","affiliation":[{"name":"University at Buffalo State University of New York, Buffalo, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,5,27]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"1414","volume-title":"Fast computation of output-sensitive maxima in a word RAM","author":"Afshani P.","year":"2014","unstructured":"P. Afshani . Fast computation of output-sensitive maxima in a word RAM . In C. Chekuri, editor, SODA, pages 1414 -- 1423 . SIAM , 2014 . P. Afshani. Fast computation of output-sensitive maxima in a word RAM. In C. Chekuri, editor, SODA, pages 1414--1423. SIAM, 2014."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1412331.1412343"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/358841.358850"},{"key":"e_1_3_2_1_4_1","first-page":"179","volume-title":"Fast linear expected-time algorithms for computing maxima and convex hulls","author":"Bentley J. L.","year":"1990","unstructured":"J. L. Bentley , K. L. Clarkson , and D. B. Levine . Fast linear expected-time algorithms for computing maxima and convex hulls . In D. S. Johnson, editor, SODA, pages 179 -- 187 . SIAM , 1990 . J. L. Bentley, K. L. Clarkson, and D. B. Levine. Fast linear expected-time algorithms for computing maxima and convex hulls. In D. S. Johnson, editor, SODA, pages 179--187. SIAM, 1990."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008861.1008865"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/322092.322095"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/645484.656550"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(89)90156-7"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02712873"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1998196.1998198"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"J.\n      Chomicki\n    .\n  Querying with intrinsic preferences\n  . In C. S. Jensen K. G. Jeffery J. Pokorn\u00fd S. Saltenis E. Bertino K. B\u00f6hm and M. Jarke editors EDBT volume \n  2287\n   of \n  Lecture Notes in Computer Science pages \n  34\n  --\n  51\n  . \n  Springer 2002\n  .   J. Chomicki. Querying with intrinsic preferences. In C. S. Jensen K. G. Jeffery J. Pokorn\u00fd S. Saltenis E. Bertino K. B\u00f6hm and M. Jarke editors EDBT volume 2287 of Lecture Notes in Computer Science pages 34--51. Springer 2002.","DOI":"10.1007\/3-540-45876-X_5"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/958942.958946"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2536669.2536671"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2003.1260846"},{"key":"e_1_3_2_1_15_1","volume-title":"Introduction to Algorithms (3. ed.)","author":"Cormen T. H.","year":"2009","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to Algorithms (3. ed.) . MIT Press , 2009 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms (3. ed.). MIT Press, 2009."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-6419.1994.tb00097.x"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.2307\/2296854"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/800057.808675"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"P.\n      Godfrey\n    .\n  Skyline cardinality for relational processing\n  . In D. Seipel and J. M. T. Torres editors FoIKS volume \n  2942\n   of \n  Lecture Notes in Computer Science pages \n  78\n  --\n  97\n  . \n  Springer 2004\n  .  P. Godfrey. Skyline cardinality for relational processing. In D. Seipel and J. M. T. Torres editors FoIKS volume 2942 of Lecture Notes in Computer Science pages 78--97. Springer 2004.","DOI":"10.1007\/978-3-540-24627-5_7"},{"key":"e_1_3_2_1_20_1","first-page":"229","volume-title":"K. B\u00f6hm, C. S. Jensen, L. M. Haas, M. L. Kersten, P.-\u00c5","author":"Godfrey P.","year":"2005","unstructured":"P. Godfrey , R. Shipley , and J. Gryz . Maximal vector computation in large data sets . In K. B\u00f6hm, C. S. Jensen, L. M. Haas, M. L. Kersten, P.-\u00c5 . Larson, and B. C. Ooi, editors, VLDB, pages 229 -- 240 . ACM , 2005 . P. Godfrey, R. Shipley, and J. Gryz. Maximal vector computation in large data sets. In K. B\u00f6hm, C. S. Jensen, L. M. Haas, M. L. Kersten, P.-\u00c5. Larson, and B. C. Ooi, editors, VLDB, pages 229--240. ACM, 2005."},{"key":"e_1_3_2_1_21_1","first-page":"887","volume-title":"Output-sensitive skyline algorithms in external memory","author":"Hu X.","year":"2013","unstructured":"X. Hu , C. Sheng , Y. Tao , Y. Yang , and S. Zhou . Output-sensitive skyline algorithms in external memory . In S. Khanna, editor, SODA, pages 887 -- 900 . SIAM , 2013 . X. Hu, C. Sheng, Y. Tao, Y. Yang, and S. Zhou. Output-sensitive skyline algorithms in external memory. In S. Khanna, editor, SODA, pages 887--900. SIAM, 2013."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1287369.1287397"},{"key":"e_1_3_2_1_23_1","first-page":"32","volume-title":"Preference XPATH: A query language for e-commerce","author":"Kie\u00dfling W.","unstructured":"W. Kie\u00dfling , B. Hafenrichter , S. Fischer , and S. Holland . Preference XPATH: A query language for e-commerce . In H. U. Buhl, A. Huther, and B. Reitwiesner, editors, Wirtschaftsinformatik , page 32 . Physica Verlag \/ Springer, 2001. W. Kie\u00dfling, B. Hafenrichter, S. Fischer, and S. Holland. Preference XPATH: A query language for e-commerce. In H. U. Buhl, A. Huther, and B. Reitwiesner, editors, Wirtschaftsinformatik, page 32. Physica Verlag \/ Springer, 2001."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/1287369.1287457"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/323233.323246"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215021"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/SWAT.1974.19"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/321906.321910"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-011-0227-9"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1061318.1061320"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-4870(02)00082-X"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2389241.2389245"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/11926078_44"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2000824.2000829"},{"key":"e_1_3_2_1_35_1","first-page":"670","volume-title":"Towards efficient sampling: Exploiting random walk strategies","author":"Wei W.","year":"2004","unstructured":"W. Wei , J. Erenrich , and B. Selman . Towards efficient sampling: Exploiting random walk strategies . In D. L. McGuinness and G. Ferguson, editors, AAAI, pages 670 -- 676 . AAAI Press \/ The MIT Press , 2004 . W. Wei, J. Erenrich, and B. Selman. Towards efficient sampling: Exploiting random walk strategies. In D. L. McGuinness and G. Ferguson, editors, AAAI, pages 670--676. AAAI Press \/ The MIT Press, 2004."}],"event":{"name":"SIGMOD\/PODS'15: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Melbourne Victoria Australia","acronym":"SIGMOD\/PODS'15"},"container-title":["Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2723372.2723736","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2723372.2723736","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:03:58Z","timestamp":1750273438000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2723372.2723736"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,27]]},"references-count":35,"alternative-id":["10.1145\/2723372.2723736","10.1145\/2723372"],"URL":"https:\/\/doi.org\/10.1145\/2723372.2723736","relation":{},"subject":[],"published":{"date-parts":[[2015,5,27]]},"assertion":[{"value":"2015-05-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}