{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:23:31Z","timestamp":1750307011997,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,3,27]],"date-time":"2012-03-27T00:00:00Z","timestamp":1332806400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["6.10E+15"],"award-info":[{"award-number":["6.10E+15"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"HGJ PROJECT","award":["2010ZX01042-002-002-03"],"award-info":[{"award-number":["2010ZX01042-002-002-03"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,3,27]]},"DOI":"10.1145\/2247596.2247626","type":"proceedings-article","created":{"date-parts":[[2012,6,11]],"date-time":"2012-06-11T13:03:31Z","timestamp":1339419811000},"page":"240-251","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient approximation of the maximal preference scores by lightweight cubic views"],"prefix":"10.1145","author":[{"given":"Yueguo","family":"Chen","sequence":"first","affiliation":[{"name":"Renmin University of China, MOE, China"}]},{"given":"Bin","family":"Cui","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}]},{"given":"Xiaoyong","family":"Du","sequence":"additional","affiliation":[{"name":"Renmin University of China, MOE, China, and Renmin University of China, Beijing, China"}]},{"given":"Anthony K. H.","family":"Tung","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore"}]}],"member":"320","published-online":{"date-parts":[[2012,3,27]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"914","volume-title":"VLDB","author":"Arai B.","year":"2007","unstructured":"B. Arai , G. Das , D. Gunopulos , and N. Koudas . Anytime measures for top-k algorithms . In VLDB , pages 914 -- 925 , 2007 . B. Arai, G. Das, D. Gunopulos, and N. Koudas. Anytime measures for top-k algorithms. In VLDB, pages 914--925, 2007."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/645484.656550"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/876875.879016"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253302"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/335191.335433"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2003.1260846"},{"key":"e_1_3_2_1_7_1","first-page":"183","volume-title":"VLDB","author":"Das G.","year":"2007","unstructured":"G. Das , D. Gunopulos , N. Koudas , and N. Sarkas . Ad-hoc top-k query answering for data streams . In VLDB , pages 183 -- 194 , 2007 . G. Das, D. Gunopulos, N. Koudas, and N. Sarkas. Ad-hoc top-k query answering for data streams. In VLDB, pages 183--194, 2007."},{"key":"e_1_3_2_1_8_1","first-page":"451","volume-title":"VLDB","author":"Das G.","year":"2006","unstructured":"G. Das , D. Gunopulos , N. Koudas , and D. Tsirogiannis . Answering top-k queries using views . In VLDB , pages 451 -- 462 , 2006 . G. Das, D. Gunopulos, N. Koudas, and D. Tsirogiannis. Answering top-k queries using views. In VLDB, pages 451--462, 2006."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00026-6"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-006-0029-7"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-003-0090-4"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-003-0099-8"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/375663.375690"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1391729.1391730"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142544"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1316689.1316746"},{"key":"e_1_3_2_1_17_1","first-page":"235","volume-title":"VLDB","author":"Xin D.","year":"2006","unstructured":"D. Xin , C. Chen , and J. Han . Towards robust indexing for ranked queries . In VLDB , pages 235 -- 246 , 2006 . D. Xin, C. Chen, and J. Han. Towards robust indexing for ranked queries. In VLDB, pages 235--246, 2006."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559899"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497462"}],"event":{"name":"EDBT '12: 15th International Conference on Extending Database Technology","acronym":"EDBT '12","location":"Berlin Germany"},"container-title":["Proceedings of the 15th International Conference on Extending Database Technology"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2247596.2247626","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2247596.2247626","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:49:03Z","timestamp":1750236543000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2247596.2247626"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,27]]},"references-count":19,"alternative-id":["10.1145\/2247596.2247626","10.1145\/2247596"],"URL":"https:\/\/doi.org\/10.1145\/2247596.2247626","relation":{},"subject":[],"published":{"date-parts":[[2012,3,27]]},"assertion":[{"value":"2012-03-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}