{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:23:26Z","timestamp":1758273806697,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,6,11]],"date-time":"2007-06-11T00:00:00Z","timestamp":1181520000000},"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":[[2007,6,11]]},"DOI":"10.1145\/1247480.1247494","type":"proceedings-article","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T16:07:37Z","timestamp":1189786057000},"page":"103-114","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":48,"title":["Progressive and selective merge"],"prefix":"10.1145","author":[{"given":"Dong","family":"Xin","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiawei","family":"Han","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kevin C.","family":"Chang","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"475","volume-title":"VLDB","author":"Bast H.","year":"2006","unstructured":"H. Bast , D. Majumdar , R. Schenkel , M. Theobald , and G. Weikum . Io-top-k: Index-access optimized top-k query processing . In VLDB , pages 475 -- 486 , 2006 . H. Bast, D. Majumdar, R. Schenkel, M. Theobald, and G. Weikum. Io-top-k: Index-access optimized top-k query processing. In VLDB, pages 475--486, 2006."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/304182.304214"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_1_4_1","first-page":"294","volume-title":"DaWaK","author":"Bohm C.","year":"2001","unstructured":"C. Bohm and H. P. Kriegel . Determining the convex hull in large multidimensional databases . In DaWaK , pages 294 -- 306 . Springer-Verlag , 2001 . C. Bohm and H. P. Kriegel. Determining the convex hull in large multidimensional databases. In DaWaK, pages 294--306. Springer-Verlag, 2001."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/645484.656550"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170075"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2002.994751"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142516"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/248603.248616"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/275487.275488"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/565117.565143"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/375551.375567"},{"key":"e_1_3_2_1_13_1","first-page":"169","article-title":"Novel compression of sparse bit-strings-preliminary report. Combinatorial Algorithms on Words","volume":"12","author":"Fraenkel A.","year":"1985","unstructured":"A. Fraenkel and S. Klein . Novel compression of sparse bit-strings-preliminary report. Combinatorial Algorithms on Words , NATO ASI Series , 12 : 169 -- 183 , 1985 . A. Fraenkel and S. Klein. Novel compression of sparse bit-strings-preliminary report. Combinatorial Algorithms on Words, NATO ASI Series, 12:169--183, 1985.","journal-title":"NATO ASI Series"},{"key":"e_1_3_2_1_14_1","volume-title":"Database Systems: The Complete Book","author":"Garcia-Molina H.","year":"2002","unstructured":"H. Garcia-Molina , J. D. Ullman , and J. Widom . Database Systems: The Complete Book . Prentice Hall , 2002 . H. Garcia-Molina, J. D. Ullman, and J. Widom. Database Systems: The Complete Book. Prentice Hall, 2002."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276326"},{"key":"e_1_3_2_1_16_1","first-page":"637","volume-title":"VLDB","author":"Michel S.","year":"2005","unstructured":"S. Michel , P. Triantafillou , and G. Weikum . Klee: a framework for distributed top-k query algorithms . In VLDB , pages 637 -- 648 , 2005 . S. Michel, P. Triantafillou, and G. Weikum. Klee: a framework for distributed top-k query algorithms. In VLDB, pages 637--648, 2005."},{"key":"e_1_3_2_1_17_1","first-page":"379","volume-title":"VLDB","author":"Morfonios K.","year":"2006","unstructured":"K. Morfonios and Y. Ioannidis . Cure for cubes: cubing using a rolap engine . In VLDB , pages 379 -- 390 , 2006 . K. Morfonios and Y. Ioannidis. Cure for cubes: cubing using a rolap engine. In VLDB, pages 379--390, 2006."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1061318.1061320"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2003.1245293"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/22952.22955"},{"key":"e_1_3_2_1_21_1","first-page":"463","volume-title":"VLDB","author":"Xin D.","year":"2006","unstructured":"D. Xin , J. Han , H. Cheng , and X. Li . Answering top-k queries with multi-dimensional selections: The ranking cube approach . In VLDB , pages 463 -- 475 , 2006 . D. Xin, J. Han, H. Cheng, and X. Li. Answering top-k queries with multi-dimensional selections: The ranking cube approach. In VLDB, pages 463--475, 2006."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142515"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.65"}],"event":{"name":"SIGMOD\/PODS07: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","ACM Association for Computing Machinery"],"location":"Beijing China","acronym":"SIGMOD\/PODS07"},"container-title":["Proceedings of the 2007 ACM SIGMOD international conference on Management of data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1247480.1247494","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1247480.1247494","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:51:45Z","timestamp":1750258305000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1247480.1247494"}},"subtitle":["computing top-k with ad-hoc ranking functions"],"short-title":[],"issued":{"date-parts":[[2007,6,11]]},"references-count":23,"alternative-id":["10.1145\/1247480.1247494","10.1145\/1247480"],"URL":"https:\/\/doi.org\/10.1145\/1247480.1247494","relation":{},"subject":[],"published":{"date-parts":[[2007,6,11]]},"assertion":[{"value":"2007-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}