{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T11:39:01Z","timestamp":1725622741402},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1109\/bigdata.2016.7840649","type":"proceedings-article","created":{"date-parts":[[2017,2,7]],"date-time":"2017-02-07T21:46:59Z","timestamp":1486504019000},"page":"570-577","source":"Crossref","is-referenced-by-count":5,"title":["Efficient processing of top-k joins in MapReduce"],"prefix":"10.1109","author":[{"given":"Mei","family":"Saouk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos","family":"Doulkeridis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akrivi","family":"Vlachou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kjetil","family":"Norvag","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.108"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.104"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.14778\/2336664.2336675"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-013-0319-9"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"ref14"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/B978-155860869-6\/50094-9"},{"key":"ref3","first-page":"281","article-title":"Supporting incremental join queries on ranked inputs","author":"natsev","year":"2001","journal-title":"Proc of VLDB"},{"key":"ref6","first-page":"902","article-title":"Depth estimation for ranking query optimization","author":"schnaitter","year":"2007","journal-title":"Proc of VLDB"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/B978-012722442-8\/50072-0"},{"key":"ref8","first-page":"145","article-title":"Towards efficient ranked query processing in peer-to-peer networks","author":"zhao","year":"2005","journal-title":"Cognitive Processes and Systems"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/375551.375567"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.14778\/2732286.2732287"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MMUL.2010.70"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.1145"}],"event":{"name":"2016 IEEE International Conference on Big Data (Big Data)","start":{"date-parts":[[2016,12,5]]},"location":"Washington DC,USA","end":{"date-parts":[[2016,12,8]]}},"container-title":["2016 IEEE International Conference on Big Data (Big Data)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7818133\/7840573\/07840649.pdf?arnumber=7840649","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,1]],"date-time":"2017-03-01T22:21:21Z","timestamp":1488406881000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7840649\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/bigdata.2016.7840649","relation":{},"subject":[],"published":{"date-parts":[[2016,12]]}}}