{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T05:17:30Z","timestamp":1770268650369,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,22]],"date-time":"2013-06-22T00:00:00Z","timestamp":1371859200000},"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":[[2013,6,22]]},"DOI":"10.1145\/2463676.2465278","type":"proceedings-article","created":{"date-parts":[[2013,6,25]],"date-time":"2013-06-25T19:13:21Z","timestamp":1372187601000},"page":"481-492","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":54,"title":["Branch-and-bound algorithm for reverse top-k queries"],"prefix":"10.1145","author":[{"given":"Akrivi","family":"Vlachou","sequence":"first","affiliation":[{"name":"Norwegian University of Science and Technology (NTNU), Trondheim, Norway"}]},{"given":"Christos","family":"Doulkeridis","sequence":"additional","affiliation":[{"name":"University of Piraeus, Piraeus, Greece"}]},{"given":"Kjetil","family":"N\u00f8rv\u00e5g","sequence":"additional","affiliation":[{"name":"Norwegian University of Science and Technology (NTNU), Trondheim, Norway"}]},{"given":"Yannis","family":"Kotidis","sequence":"additional","affiliation":[{"name":"Athens University of Economics and Business (AUEB), Athens, Greece"}]}],"member":"320","published-online":{"date-parts":[[2013,6,22]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"495","volume-title":"Proc. of Int. Conf. on Very Large Data Bases (VLDB)","author":"Akbarinia R.","year":"2007","unstructured":"R. Akbarinia , E. Pacitti , and P. Valduriez . Best position algorithms for top-k queries . In Proc. of Int. Conf. on Very Large Data Bases (VLDB) , pages 495 -- 506 , 2007 . R. Akbarinia, E. Pacitti, and P. Valduriez. Best position algorithms for top-k queries. In Proc. of Int. Conf. on Very Large Data Bases (VLDB), pages 495--506, 2007."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2398420"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/2035253.2035279"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335433"},{"key":"e_1_3_2_1_5_1","first-page":"397","volume-title":"Proc. of Int. Conf. on Very Large Data Bases (VLDB)","author":"Chaudhuri S.","year":"1999","unstructured":"S. Chaudhuri and L. Gravano . Evaluating top-k selection queries . In Proc. of Int. Conf. on Very Large Data Bases (VLDB) , pages 397 -- 410 , 1999 . S. Chaudhuri and L. Gravano. Evaluating top-k selection queries. In Proc. of Int. Conf. on Very Large Data Bases (VLDB), pages 397--410, 1999."},{"key":"e_1_3_2_1_6_1","first-page":"291","volume-title":"Proc. of Int. Conf. on Very Large Data Bases (VLDB)","author":"Dellis E.","year":"2007","unstructured":"E. Dellis and B. Seeger . Efficient computation of reverse skyline queries . In Proc. of Int. Conf. on Very Large Data Bases (VLDB) , pages 291 -- 302 , 2007 . E. Dellis and B. Seeger. Efficient computation of reverse skyline queries. In Proc. of Int. Conf. on Very Large Data Bases (VLDB), pages 291--302, 2007."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/375551.375567"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.34"},{"key":"e_1_3_2_1_9_1","first-page":"419","volume-title":"Proc. of Int. Conf. on Very Large Data Bases (VLDB)","author":"G\u00fcntzer U.","year":"2000","unstructured":"U. G\u00fcntzer , W.-T. Balke , and W. Kie\u00dfling . Optimizing multi-feature queries for image databases . In Proc. of Int. Conf. on Very Large Data Bases (VLDB) , pages 419 -- 428 , 2000 . U. G\u00fcntzer, W.-T. Balke, and W. Kie\u00dfling. Optimizing multi-feature queries for image databases. In Proc. of Int. Conf. on Very Large Data Bases (VLDB), pages 419--428, 2000."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/375663.375690"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335415"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142547"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376641"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1005566.1005569"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497444"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/647227.719095"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2005.12.001"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.149"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2010.5447890"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.50"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1999309.1999313"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920890"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687729"},{"key":"e_1_3_2_1_24_1","first-page":"235","volume-title":"Proc. of Int. Conf. on Very Large Data Bases (VLDB)","author":"Xin D.","year":"2006","unstructured":"D. Xin , C. Chen , and J. Han . Towards robust indexing for ranked queries . In Proc. of Int. Conf. on Very Large Data Bases (VLDB) , pages 235 -- 246 , 2006 . D. Xin, C. Chen, and J. Han. Towards robust indexing for ranked queries. In Proc. of Int. Conf. on Very Large Data Bases (VLDB), pages 235--246, 2006."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.62"},{"key":"e_1_3_2_1_26_1","first-page":"189","volume-title":"Proc. of Int. Conf. on Data Engineering (ICDE)","author":"Yi K.","year":"2003","unstructured":"K. Yi , H. Yu , J. Yang , G. Xia , and Y. Chen . Efficient maintenance of materialized top-k views . In Proc. of Int. Conf. on Data Engineering (ICDE) , pages 189 -- 200 , 2003 . K. Yi, H. Yu, J. Yang, G. Xia, and Y. Chen. Efficient maintenance of materialized top-k views. In Proc. of Int. Conf. on Data Engineering (ICDE), pages 189--200, 2003."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213882"}],"event":{"name":"SIGMOD\/PODS'13: International Conference on Management of Data","location":"New York New York USA","acronym":"SIGMOD\/PODS'13","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2463676.2465278","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2463676.2465278","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:05Z","timestamp":1750235945000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2463676.2465278"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,22]]},"references-count":27,"alternative-id":["10.1145\/2463676.2465278","10.1145\/2463676"],"URL":"https:\/\/doi.org\/10.1145\/2463676.2465278","relation":{},"subject":[],"published":{"date-parts":[[2013,6,22]]},"assertion":[{"value":"2013-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}