{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T05:15:26Z","timestamp":1784178926914,"version":"3.55.0"},"reference-count":92,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T00:00:00Z","timestamp":1570147200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Australian Research Training Program Scholarship"},{"name":"Australian Research Council\u2019s Discovery Projects Scheme","award":["DP170102231"],"award-info":[{"award-number":["DP170102231"]}]},{"name":"RMIT Vice Chancellors PhD Scholarship"},{"name":"Amazon Research Award"},{"name":"Google Faculty Research Award"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Inf. Syst."],"published-print":{"date-parts":[[2019,10,31]]},"abstract":"<jats:p>Rank fusion is a powerful technique that allows multiple sources of information to be combined into a single result set. Query variations covering the same information need represent one way in which different sources of information might arise. However, when implemented in the obvious manner, fusion over query variations is not cost-effective, at odds with the usual web-search requirement for strict per-query efficiency guarantees. In this work, we propose a novel solution to query fusion by splitting the computation into two parts: one phase that is carried out offline, to generate pre-computed centroid answers for queries addressing broadly similar information needs, and then a second online phase that uses the corresponding topic centroid to compute a result page for each query. To achieve this, we make use of score-based fusion algorithms whose costs can be amortized via the pre-processing step and that can then be efficiently combined during subsequent per-query re-ranking operations. Experimental results using the ClueWeb12B collection and the UQV100 query variations demonstrate that centroid-based approaches allow improved retrieval effectiveness at little or no loss in query throughput or latency and within reasonable pre-processing requirements. We additionally show that queries that do not match any of the pre-computed clusters can be accurately identified and efficiently processed in our proposed ranking pipeline.<\/jats:p>","DOI":"10.1145\/3345001","type":"journal-article","created":{"date-parts":[[2019,10,7]],"date-time":"2019-10-07T12:20:59Z","timestamp":1570450859000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":28,"title":["Boosting Search Performance Using Query Variations"],"prefix":"10.1145","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6319-5165","authenticated-orcid":false,"given":"Rodger","family":"Benham","sequence":"first","affiliation":[{"name":"RMIT University, Melbourne, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7992-4633","authenticated-orcid":false,"given":"Joel","family":"Mackenzie","sequence":"additional","affiliation":[{"name":"RMIT University, Melbourne, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6638-0232","authenticated-orcid":false,"given":"Alistair","family":"Moffat","sequence":"additional","affiliation":[{"name":"The University of Melbourne, Melbourne, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1902-9087","authenticated-orcid":false,"given":"J. Shane","family":"Culpepper","sequence":"additional","affiliation":[{"name":"RMIT University, Melbourne, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2019,10,4]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Proceedings of the ACM International Conference on Web Search and Data Mining (WSDM\u201909)","author":"Agrawal R.","unstructured":"R. Agrawal , S. Gollapudi , A. Halverson , and S. Ieong . 2009. Diversifying search results . In Proceedings of the ACM International Conference on Web Search and Data Mining (WSDM\u201909) . 5--14. R. Agrawal, S. Gollapudi, A. Halverson, and S. Ieong. 2009. Diversifying search results. In Proceedings of the ACM International Conference on Web Search and Data Mining (WSDM\u201909). 5--14."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/582415.582416"},{"key":"e_1_2_1_3_1","volume-title":"Proceedings of the International Conference on Theory of Information Retrieval (ICTIR\u201916)","author":"Anava Y.","unstructured":"Y. Anava , A. Shtok , O. Kurland , and E. Rabinovich . 2016. A probabilistic fusion framework . In Proceedings of the International Conference on Theory of Information Retrieval (ICTIR\u201916) . 1463--1472. Y. Anava, A. Shtok, O. Kurland, and E. Rabinovich. 2016. A probabilistic fusion framework. In Proceedings of the International Conference on Theory of Information Retrieval (ICTIR\u201916). 1463--1472."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1409220.1409223"},{"key":"e_1_2_1_5_1","volume-title":"Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201916)","author":"Bailey P.","unstructured":"P. Bailey , A. Moffat , F. Scholer , and P. Thomas . 2016. UQV100: A test collection with query variability . In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201916) . 725--728. P. Bailey, A. Moffat, F. Scholer, and P. Thomas. 2016. UQV100: A test collection with query variability. In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201916). 725--728."},{"key":"e_1_2_1_6_1","volume-title":"Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201917)","author":"Bailey P.","unstructured":"P. Bailey , A. Moffat , F. Scholer , and P. Thomas . 2017. Retrieval consistency in the presence of query variations . In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201917) . 395--404. P. Bailey, A. Moffat, F. Scholer, and P. Thomas. 2017. Retrieval consistency in the presence of query variations. In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201917). 395--404."},{"key":"e_1_2_1_7_1","unstructured":"M. Barbaro and T. Zeller. 2006. A face is exposed for AOL searcher No. 4417749. Retrieved November 8 2018 from https:\/\/nytimes.com\/2006\/08\/09\/technology\/09aol.html.  M. Barbaro and T. Zeller. 2006. A face is exposed for AOL searcher No. 4417749. Retrieved November 8 2018 from https:\/\/nytimes.com\/2006\/08\/09\/technology\/09aol.html."},{"key":"e_1_2_1_8_1","volume-title":"Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201993)","author":"Belkin N. J.","unstructured":"N. J. Belkin , C. Cool , W. B. Croft , and J. P. Callan . 1993. The effect of multiple query variations on information retrieval system performance . In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201993) . 339--346. N. J. Belkin, C. Cool, W. B. Croft, and J. P. Callan. 1993. The effect of multiple query variations on information retrieval system performance. In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201993). 339--346."},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the ACM International Conference on Web Search and Data Mining (WSDM\u201912)","author":"Bendersky M.","unstructured":"M. Bendersky , D. Metzler , and W. B. Croft . 2012. Effective query formulation with multiple information sources . In Proceedings of the ACM International Conference on Web Search and Data Mining (WSDM\u201912) . 443--452. M. Bendersky, D. Metzler, and W. B. Croft. 2012. Effective query formulation with multiple information sources. In Proceedings of the ACM International Conference on Web Search and Data Mining (WSDM\u201912). 443--452."},{"key":"e_1_2_1_10_1","volume-title":"Proceedings of the Australasian Document Computing Symposium (ADCS\u201917)","author":"Benham R.","unstructured":"R. Benham and J. S. Culpepper . 2017. Risk-reward trade-offs in rank fusion . In Proceedings of the Australasian Document Computing Symposium (ADCS\u201917) . 1:1--1:8. R. Benham and J. S. Culpepper. 2017. Risk-reward trade-offs in rank fusion. In Proceedings of the Australasian Document Computing Symposium (ADCS\u201917). 1:1--1:8."},{"key":"e_1_2_1_11_1","volume-title":"Proceedings of the Conference on Design of Experimental Search 8 Information Retrieval Systems (DESIRES\u201918)","author":"Benham R.","unstructured":"R. Benham , J. S. Culpepper , L. Gallagher , X. Lu , and J. Mackenzie . 2018. Towards efficient and effective query variant generation . In Proceedings of the Conference on Design of Experimental Search 8 Information Retrieval Systems (DESIRES\u201918) . 62--67. R. Benham, J. S. Culpepper, L. Gallagher, X. Lu, and J. Mackenzie. 2018. Towards efficient and effective query variant generation. In Proceedings of the Conference on Design of Experimental Search 8 Information Retrieval Systems (DESIRES\u201918). 62--67."},{"key":"e_1_2_1_12_1","volume-title":"Proceedings of the Text Retrieval Conference (TREC\u201917)","author":"Benham R.","unstructured":"R. Benham , L. Gallagher , J. Mackenzie , T. T. Damessie , R.-C. Chen , F. Scholer , A. Moffat , and J. S. Culpepper . 2017. RMIT at the 2017 TREC CORE track . In Proceedings of the Text Retrieval Conference (TREC\u201917) . R. Benham, L. Gallagher, J. Mackenzie, T. T. Damessie, R.-C. Chen, F. Scholer, A. Moffat, and J. S. Culpepper. 2017. RMIT at the 2017 TREC CORE track. In Proceedings of the Text Retrieval Conference (TREC\u201917)."},{"key":"e_1_2_1_13_1","volume-title":"Proceedings of the Text Retrieval Conference (TREC\u201918)","author":"Benham R.","unstructured":"R. Benham , L. Gallagher , J. Mackenzie , B. Liu , X. Lu , F. Scholer , A. Moffat , and J. S. Culpepper . 2018. RMIT at the 2018 TREC CORE track . In Proceedings of the Text Retrieval Conference (TREC\u201918) . R. Benham, L. Gallagher, J. Mackenzie, B. Liu, X. Lu, F. Scholer, A. Moffat, and J. S. Culpepper. 2018. RMIT at the 2018 TREC CORE track. In Proceedings of the Text Retrieval Conference (TREC\u201918)."},{"key":"e_1_2_1_14_1","volume-title":"Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201903)","author":"Billerbeck B.","unstructured":"B. Billerbeck , F. Scholer , H. E. Williams , and J. Zobel . 2003. Query expansion using associated queries . In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201903) . 2--9. B. Billerbeck, F. Scholer, H. E. Williams, and J. Zobel. 2003. Query expansion using associated queries. In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201903). 2--9."},{"key":"e_1_2_1_15_1","volume-title":"Proceedings of the Symposium on String Processing and Information Retrieval (SPIRE\u201904)","author":"Billerbeck B.","unstructured":"B. Billerbeck and J. Zobel . 2004. Techniques for efficient query expansion . In Proceedings of the Symposium on String Processing and Information Retrieval (SPIRE\u201904) . 30--42. B. Billerbeck and J. Zobel. 2004. Techniques for efficient query expansion. In Proceedings of the Symposium on String Processing and Information Retrieval (SPIRE\u201904). 30--42."},{"key":"e_1_2_1_16_1","volume-title":"Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201913)","author":"Broccolo D.","unstructured":"D. Broccolo , C. Macdonald , S. Orlando , I. Ounis , R. Perego , F. Silvestri , and N. Tonellotto . 2013. Load-sensitive selective pruning for distributed search . In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201913) . 379--388. D. Broccolo, C. Macdonald, S. Orlando, I. Ounis, R. Perego, F. Silvestri, and N. Tonellotto. 2013. Load-sensitive selective pruning for distributed search. In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201913). 379--388."},{"key":"e_1_2_1_17_1","volume-title":"Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201903)","author":"Broder A. Z.","unstructured":"A. Z. Broder , D. Carmel , M. Herscovici , A. Soffer , and J. Y. Zien . 2003. Efficient query evaluation using a two-level retrieval process . In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201903) . 426--434. A. Z. Broder, D. Carmel, M. Herscovici, A. Soffer, and J. Y. Zien. 2003. Efficient query evaluation using a two-level retrieval process. In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201903). 426--434."},{"key":"e_1_2_1_18_1","volume-title":"Proceedings of the Text Retrieval Conference (TREC\u201995)","author":"Buckley C.","unstructured":"C. Buckley , G. Salton , J. Allan , and A. Singhal . 1995. Automatic query expansion using SMART: TREC 3 . In Proceedings of the Text Retrieval Conference (TREC\u201995) . C. Buckley, G. Salton, J. Allan, and A. Singhal. 1995. Automatic query expansion using SMART: TREC 3. In Proceedings of the Text Retrieval Conference (TREC\u201995)."},{"key":"e_1_2_1_19_1","volume-title":"Proceedings of the Conference on Neural Information Processing Systems (NIPS\u201906)","author":"Burges C.","unstructured":"C. Burges , R. Ragno , and Q. V. Le . 2006. Learning to rank with nonsmooth cost functions . In Proceedings of the Conference on Neural Information Processing Systems (NIPS\u201906) . 193--200. C. Burges, R. Ragno, and Q. V. Le. 2006. Learning to rank with nonsmooth cost functions. In Proceedings of the Conference on Neural Information Processing Systems (NIPS\u201906). 193--200."},{"key":"e_1_2_1_20_1","unstructured":"C. Cadwalladr and E. Graham-Harrison. 2018. Revealed: 50 million Facebook profiles harvested for Cambridge Analytica in major data breach. Retrieved November 8. 2018 from https:\/\/theguardian.com\/news\/2018\/mar\/17\/cambridge-analytica-facebook-influence-us-election. Accessed: 2018-11-08.  C. Cadwalladr and E. Graham-Harrison. 2018. Revealed: 50 million Facebook profiles harvested for Cambridge Analytica in major data breach. Retrieved November 8. 2018 from https:\/\/theguardian.com\/news\/2018\/mar\/17\/cambridge-analytica-facebook-influence-us-election. Accessed: 2018-11-08."},{"key":"e_1_2_1_21_1","volume-title":"Proceedings of the International Conference on the World Wide Web (WWW\u201910)","author":"Cambazoglu B. B.","unstructured":"B. B. Cambazoglu , F. P. Junqueira , V. Plachouras , S. Banachowski , B. Cui , S. Lim , and B. Bridge . 2010. A refreshing perspective of search engine caching . In Proceedings of the International Conference on the World Wide Web (WWW\u201910) . 181--190. B. B. Cambazoglu, F. P. Junqueira, V. Plachouras, S. Banachowski, B. Cui, S. Lim, and B. Bridge. 2010. A refreshing perspective of search engine caching. In Proceedings of the International Conference on the World Wide Web (WWW\u201910). 181--190."},{"key":"e_1_2_1_22_1","volume-title":"Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201910)","author":"Cartright M.-A.","unstructured":"M.-A. Cartright , J. Allan , V. Lavrenko , and A. McGregor . 2010. Fast query expansion using approximations of relevance models . In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201910) . 1573--1576. M.-A. Cartright, J. Allan, V. Lavrenko, and A. McGregor. 2010. Fast query expansion using approximations of relevance models. In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201910). 1573--1576."},{"key":"e_1_2_1_23_1","volume-title":"Proceedings of the International Conference on Data Engineering (ICDE\u201911)","author":"Chakrabarti K.","unstructured":"K. Chakrabarti , S. Chaudhuri , and V. Ganti . 2011. Interval-based pruning for top-k processing over compressed lists . In Proceedings of the International Conference on Data Engineering (ICDE\u201911) . 709--720. K. Chakrabarti, S. Chaudhuri, and V. Ganti. 2011. Interval-based pruning for top-k processing over compressed lists. In Proceedings of the International Conference on Data Engineering (ICDE\u201911). 709--720."},{"key":"e_1_2_1_24_1","volume-title":"Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201917)","author":"Chen R.-C.","unstructured":"R.-C. Chen , L. Gallagher , R. Blanco , and J. S. Culpepper . 2017. Efficient cost-aware cascade ranking in multi-stage retrieval . In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201917) . 445--454. R.-C. Chen, L. Gallagher, R. Blanco, and J. S. Culpepper. 2017. Efficient cost-aware cascade ranking in multi-stage retrieval. In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201917). 445--454."},{"key":"e_1_2_1_25_1","volume-title":"Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201909)","author":"Cormack G. V.","unstructured":"G. V. Cormack , C. L. A. Clarke , and S. B\u00fcttcher . 2009. Reciprocal rank fusion outperforms Condorcet and individual rank learning methods . In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201909) . 758--759. G. V. Cormack, C. L. A. Clarke, and S. B\u00fcttcher. 2009. Reciprocal rank fusion outperforms Condorcet and individual rank learning methods. In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201909). 758--759."},{"key":"e_1_2_1_26_1","volume-title":"Proceedings of the ACM International Conference on Web Search and Data Mining (WSDM\u201917)","author":"Crane M.","unstructured":"M. Crane , J. S. Culpepper , J. Lin , J. Mackenzie , and A. Trotman . 2017. A comparison of document-at-a-time and score-at-a-time query evaluation . In Proceedings of the ACM International Conference on Web Search and Data Mining (WSDM\u201917) . 201--210. M. Crane, J. S. Culpepper, J. Lin, J. Mackenzie, and A. Trotman. 2017. A comparison of document-at-a-time and score-at-a-time query evaluation. In Proceedings of the ACM International Conference on Web Search and Data Mining (WSDM\u201917). 201--210."},{"key":"e_1_2_1_27_1","volume-title":"Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201907)","author":"Craswell N.","unstructured":"N. Craswell and M. Szummer . 2007. Random walks on the click graph . In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201907) . 239--246. N. Craswell and M. Szummer. 2007. Random walks on the click graph. In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201907). 239--246."},{"key":"e_1_2_1_28_1","volume-title":"Proceedings of the ACM International Conference on Web Search and Data Mining (WSDM\u201910)","author":"Dang V.","unstructured":"V. Dang and W. B. Croft . 2010. Query reformulation using anchor text . In Proceedings of the ACM International Conference on Web Search and Data Mining (WSDM\u201910) . 41--50. V. Dang and W. B. Croft. 2010. Query reformulation using anchor text. In Proceedings of the ACM International Conference on Web Search and Data Mining (WSDM\u201910). 41--50."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2408776.2408794"},{"key":"e_1_2_1_30_1","volume-title":"Proceedings of the Conference on Knowledge Discovery and Data Mining (KDD\u201916)","author":"Dhulipala L.","unstructured":"L. Dhulipala , I. Kabiljo , B. Karrer , G. Ottaviano , S. Pupyrev , and A. Shalita . 2016. Compressing graphs and indexes with recursive graph bisection . In Proceedings of the Conference on Knowledge Discovery and Data Mining (KDD\u201916) . 1535--1544. L. Dhulipala, I. Kabiljo, B. Karrer, G. Ottaviano, S. Pupyrev, and A. Shalita. 2016. Compressing graphs and indexes with recursive graph bisection. In Proceedings of the Conference on Knowledge Discovery and Data Mining (KDD\u201916). 1535--1544."},{"key":"e_1_2_1_31_1","volume-title":"Proceedings of the ACM International Conference on Web Search and Data Mining (WSDM\u201913)","author":"Dimopoulos C.","unstructured":"C. Dimopoulos , S. Nepomnyachiy , and T. Suel . 2013. Optimizing top-k document retrieval strategies for block-max indexes . In Proceedings of the ACM International Conference on Web Search and Data Mining (WSDM\u201913) . 113--122. C. Dimopoulos, S. Nepomnyachiy, and T. Suel. 2013. Optimizing top-k document retrieval strategies for block-max indexes. In Proceedings of the ACM International Conference on Web Search and Data Mining (WSDM\u201913). 113--122."},{"key":"e_1_2_1_32_1","volume-title":"Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201911)","author":"Ding S.","unstructured":"S. Ding and T. Suel . 2011. Faster top-k document retrieval using block-max indexes . In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201911) . 993--1002. S. Ding and T. Suel. 2011. Faster top-k document retrieval using block-max indexes. In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201911). 993--1002."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1125857.1125859"},{"key":"e_1_2_1_34_1","first-page":"1213","article-title":"Evaluation strategies for top-k queries over memory-resident inverted indexes","volume":"4","author":"Fontoura M.","year":"2011","unstructured":"M. Fontoura , V. Josifovski , J. Liu , S. Venkatesan , X. Zhu , and J. Zien . 2011 . Evaluation strategies for top-k queries over memory-resident inverted indexes . Proceedings of the Very Large Databases (VLDB) 4 , 12 (2011), 1213 -- 1224 . M. Fontoura, V. Josifovski, J. Liu, S. Venkatesan, X. Zhu, and J. Zien. 2011. Evaluation strategies for top-k queries over memory-resident inverted indexes. Proceedings of the Very Large Databases (VLDB) 4, 12 (2011), 1213--1224.","journal-title":"Proceedings of the Very Large Databases (VLDB)"},{"key":"e_1_2_1_35_1","volume-title":"Proceedings of the Text Retrieval Conference (TREC\u201993)","author":"Fox E. A.","unstructured":"E. A. Fox and J. A. Shaw . 1993. Combination of multiple searches . In Proceedings of the Text Retrieval Conference (TREC\u201993) . 243--252. E. A. Fox and J. A. Shaw. 1993. Combination of multiple searches. In Proceedings of the Text Retrieval Conference (TREC\u201993). 243--252."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3190580.3190586"},{"key":"e_1_2_1_37_1","volume-title":"Proceedings of the ACM International Conference on Web Search and Data Mining (WSDM\u201919)","author":"Gallagher L.","unstructured":"L. Gallagher , R.-C. Chen , R. Blanco , and J. S. Culpepper . 2019. Joint optimization of cascade ranking models . In Proceedings of the ACM International Conference on Web Search and Data Mining (WSDM\u201919) . 15--23. L. Gallagher, R.-C. Chen, R. Blanco, and J. S. Culpepper. 2019. Joint optimization of cascade ranking models. In Proceedings of the ACM International Conference on Web Search and Data Mining (WSDM\u201919). 15--23."},{"key":"e_1_2_1_38_1","volume-title":"Proceedings of the International Conference on the World Wide Web (WWW\u201909)","author":"Gan Q.","unstructured":"Q. Gan and T. Suel . 2009. Improved techniques for result caching in web search engines . In Proceedings of the International Conference on the World Wide Web (WWW\u201909) . 431--440. Q. Gan and T. Suel. 2009. Improved techniques for result caching in web search engines. In Proceedings of the International Conference on the World Wide Web (WWW\u201909). 431--440."},{"key":"e_1_2_1_39_1","volume-title":"Proceedings of the European Conference on Information Retrieval (ECIR\u201917)","author":"Hafizoglu F.","unstructured":"F. Hafizoglu , E. C. Kucukoglu , and I. S. Altingovde . 2017. On the efficiency of selective search . In Proceedings of the European Conference on Information Retrieval (ECIR\u201917) . 705--712. F. Hafizoglu, E. C. Kucukoglu, and I. S. Altingovde. 2017. On the efficiency of selective search. In Proceedings of the European Conference on Information Retrieval (ECIR\u201917). 705--712."},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.6028\/NIST.SP.500-225"},{"key":"e_1_2_1_41_1","volume-title":"Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201916)","author":"He Y.","unstructured":"Y. He , J. Tang , H. Ouyang , C. Kang , D. Yin , and Y. Chang . 2016. Learning to rewrite queries . In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201916) . 1443--1452. Y. He, J. Tang, H. Ouyang, C. Kang, D. Yin, and Y. Chang. 2016. Learning to rewrite queries. In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201916). 1443--1452."},{"key":"e_1_2_1_42_1","volume-title":"Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201914)","author":"Huo S.","unstructured":"S. Huo , M. Zhang , Y. Liu , and S. Ma . 2014. Improving tail query performance by fusion model . In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201914) . 559--658. S. Huo, M. Zhang, Y. Liu, and S. Ma. 2014. Improving tail query performance by fusion model. In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201914). 559--658."},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/582415.582418"},{"key":"e_1_2_1_44_1","volume-title":"Proceedings of the ACM International Conference on Web Search and Data Mining (WSDM\u201915)","author":"Kim S.","unstructured":"S. Kim , Y. He , S.-W. Hwang , S. Elnikety , and S. Choi . 2015. Delayed-dynamic-selective (DDS) prediction for reducing extreme tail latency in web search . In Proceedings of the ACM International Conference on Web Search and Data Mining (WSDM\u201915) . 7--16. S. Kim, Y. He, S.-W. Hwang, S. Elnikety, and S. Choi. 2015. Delayed-dynamic-selective (DDS) prediction for reducing extreme tail latency in web search. In Proceedings of the ACM International Conference on Web Search and Data Mining (WSDM\u201915). 7--16."},{"key":"e_1_2_1_45_1","volume-title":"Proceedings of the European Conference on Information Retrieval (ECIR\u201916)","author":"Kim Y.","unstructured":"Y. Kim , J. Callan , J. S. Culpepper , and A. Moffat . 2016. Does selective search benefit from WAND optimization? In Proceedings of the European Conference on Information Retrieval (ECIR\u201916) . 145--158. Y. Kim, J. Callan, J. S. Culpepper, and A. Moffat. 2016. Does selective search benefit from WAND optimization? In Proceedings of the European Conference on Information Retrieval (ECIR\u201916). 145--158."},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-016-9290-6"},{"key":"e_1_2_1_47_1","unstructured":"J. Kong A. Scott and G. M. Goerg. 2016. Improving semantic topic clustering for search queries with word co-occurrence and bigraph co-clustering. Google Inc (2016). Retrieved from https:\/\/ai.google\/research\/pubs\/pub45569.pdf.  J. Kong A. Scott and G. M. Goerg. 2016. Improving semantic topic clustering for search queries with word co-occurrence and bigraph co-clustering. Google Inc (2016). Retrieved from https:\/\/ai.google\/research\/pubs\/pub45569.pdf."},{"key":"e_1_2_1_48_1","volume-title":"Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201911)","author":"Kozorovitsky A. K.","unstructured":"A. K. Kozorovitsky and O. Kurland . 2011. Cluster-based fusion of retrieved lists . In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201911) . 893--902. A. K. Kozorovitsky and O. Kurland. 2011. Cluster-based fusion of retrieved lists. In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201911). 893--902."},{"key":"e_1_2_1_49_1","volume-title":"Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201918)","author":"Kurland O.","unstructured":"O. Kurland and J. S. Culpepper . 2018. Tutorial: Fusion in information retrieval . In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201918) . 1383--1386. O. Kurland and J. S. Culpepper. 2018. Tutorial: Fusion in information retrieval. In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201918). 1383--1386."},{"key":"e_1_2_1_50_1","unstructured":"V. Lavrenko and J. Allan. 2006. Real-time query expansion in relevance models. IR 473 University of Massachusetts Amherst (2006).  V. Lavrenko and J. Allan. 2006. Real-time query expansion in relevance models. IR 473 University of Massachusetts Amherst (2006)."},{"key":"e_1_2_1_51_1","volume-title":"Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201901)","author":"Lavrenko V.","unstructured":"V. Lavrenko and W. B. Croft . 2001. Relevance-based language models . In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201901) . 120--127. V. Lavrenko and W. B. Croft. 2001. Relevance-based language models. In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201901). 120--127."},{"key":"e_1_2_1_52_1","volume-title":"Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201915)","author":"Lee C.-J.","unstructured":"C.-J. Lee , Q. Ai , W. B. Croft , and D. Sheldon . 2015. An optimization framework for merging multiple result lists . In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201915) . 303--312. C.-J. Lee, Q. Ai, W. B. Croft, and D. Sheldon. 2015. An optimization framework for merging multiple result lists. In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201915). 303--312."},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600428.2609561"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000016"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-016-9282-6"},{"key":"e_1_2_1_56_1","volume-title":"Proceedings of the International Conference on Theory of Information Retrieval (ICTIR\u201916)","author":"Lu X.","unstructured":"X. Lu , A. Moffat , and J. S. Culpepper . 2016. Efficient and effective higher order proximity modeling . In Proceedings of the International Conference on Theory of Information Retrieval (ICTIR\u201916) . 21--30. X. Lu, A. Moffat, and J. S. Culpepper. 2016. Efficient and effective higher order proximity modeling. In Proceedings of the International Conference on Theory of Information Retrieval (ICTIR\u201916). 21--30."},{"key":"e_1_2_1_57_1","volume-title":"Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201912)","author":"Ma H.","unstructured":"H. Ma and B. Wang . 2012. User-aware caching and prefetching query results in web search engines . In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201912) . 1163--1164. H. Ma and B. Wang. 2012. User-aware caching and prefetching query results in web search engines. In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201912). 1163--1164."},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-012-9209-9"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/2493175.2493176"},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3084152"},{"key":"e_1_2_1_61_1","volume-title":"Proceedings of the ACM International Conference on Web Search and Data Mining (WSDM\u201918)","author":"Mackenzie J.","unstructured":"J. Mackenzie , J. S. Culpepper , R. Blanco , M. Crane , and J. Lin . 2018. Query driven algorithm selection in early stage retrieval . In Proceedings of the ACM International Conference on Web Search and Data Mining (WSDM\u201918) . 396--404. J. Mackenzie, J. S. Culpepper, R. Blanco, M. Crane, and J. Lin. 2018. Query driven algorithm selection in early stage retrieval. In Proceedings of the ACM International Conference on Web Search and Data Mining (WSDM\u201918). 396--404."},{"key":"e_1_2_1_62_1","volume-title":"Proceedings of the European Conference on Information Retrieval (ECIR\u201919)","author":"Mackenzie J.","unstructured":"J. Mackenzie , A. Mallia , M. Petri , J. S. Culpepper , and T. Suel . 2019. Compressing inverted indexes with recursive graph bisection: A reproducibility study . In Proceedings of the European Conference on Information Retrieval (ECIR\u201919) . 339--352. J. Mackenzie, A. Mallia, M. Petri, J. S. Culpepper, and T. Suel. 2019. Compressing inverted indexes with recursive graph bisection: A reproducibility study. In Proceedings of the European Conference on Information Retrieval (ECIR\u201919). 339--352."},{"key":"e_1_2_1_63_1","volume-title":"Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201917)","author":"Mallia A.","unstructured":"A. Mallia , G. Ottaviano , E. Porciani , N. Tonellotto , and R. Venturini . 2017. Faster blockmax WAND with variable-sized blocks . In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201917) . 625--634. A. Mallia, G. Ottaviano, E. Porciani, N. Tonellotto, and R. Venturini. 2017. Faster blockmax WAND with variable-sized blocks. In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201917). 625--634."},{"key":"e_1_2_1_64_1","volume-title":"Proceedings of the European Conference on Information Retrieval (ECIR\u201919)","author":"Mallia A.","unstructured":"A. Mallia , M. Siedlaczek , and T. Suel . 2019. An experimental study of index compression and DAAT query processing methods . In Proceedings of the European Conference on Information Retrieval (ECIR\u201919) . 353--368. A. Mallia, M. Siedlaczek, and T. Suel. 2019. An experimental study of index compression and DAAT query processing methods. In Proceedings of the European Conference on Information Retrieval (ECIR\u201919). 353--368."},{"key":"e_1_2_1_65_1","volume-title":"Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201905)","author":"Metzler D.","unstructured":"D. Metzler and W. B. Croft . 2005. A Markov random field model for term dependencies . In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201905) . 472--479. D. Metzler and W. B. Croft. 2005. A Markov random field model for term dependencies. In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201905). 472--479."},{"key":"e_1_2_1_66_1","volume-title":"Proceedings of the European Conference on Information Retrieval (ECIR\u201907)","author":"Metzler D.","unstructured":"D. Metzler , S. Dumais , and C. Meek . 2007. Similarity measures for short segments of text . In Proceedings of the European Conference on Information Retrieval (ECIR\u201907) . 16--27. D. Metzler, S. Dumais, and C. Meek. 2007. Similarity measures for short segments of text. In Proceedings of the European Conference on Information Retrieval (ECIR\u201907). 16--27."},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/3015022.3015025"},{"key":"e_1_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/3052768"},{"key":"e_1_2_1_69_1","volume-title":"Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201915)","author":"Moffat A.","unstructured":"A. Moffat , F. Scholer , P. Thomas , and P. Bailey . 2015. Pooled evaluation over query variations: Users are as diverse as systems . In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201915) . 1759--1762. A. Moffat, F. Scholer, P. Thomas, and P. Bailey. 2015. Pooled evaluation over query variations: Users are as diverse as systems. In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201915). 1759--1762."},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/1416950.1416952"},{"key":"e_1_2_1_71_1","volume-title":"Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201918)","author":"Mour\u00e3o A.","unstructured":"A. Mour\u00e3o and J. Magalh\u00e3es . 2018. Low-complexity supervised rank fusion models . In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201918) . 1691--1694. A. Mour\u00e3o and J. Magalh\u00e3es. 2018. Low-complexity supervised rank fusion models. In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201918). 1691--1694."},{"key":"e_1_2_1_72_1","volume-title":"Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201914)","author":"Ottaviano G.","unstructured":"G. Ottaviano and R. Venturini . 2014. Partitioned Elias-Fano indexes . In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201914) . 273--282. G. Ottaviano and R. Venturini. 2014. Partitioned Elias-Fano indexes. In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201914). 273--282."},{"key":"e_1_2_1_73_1","volume-title":"Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201998)","author":"Ponte J.","unstructured":"J. Ponte and W. B. Croft . 1998. A language modeling approach to information retrieval . In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201998) . 275--281. J. Ponte and W. B. Croft. 1998. A language modeling approach to information retrieval. In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201998). 275--281."},{"key":"e_1_2_1_74_1","volume-title":"Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201908)","author":"Radlinski F.","unstructured":"F. Radlinski , M. Kurup , and T. Joachims . 2008. How does clickthrough data reflect retrieval quality? In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201908) . 43--52. F. Radlinski, M. Kurup, and T. Joachims. 2008. How does clickthrough data reflect retrieval quality? In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201908). 43--52."},{"key":"e_1_2_1_75_1","volume-title":"Proceedings of the Text Retrieval Conference (TREC\u201900)","author":"Robertson S. E.","unstructured":"S. E. Robertson and S. Walker . 2000. Microsoft Cambridge at TREC-9: Filtering track . In Proceedings of the Text Retrieval Conference (TREC\u201900) . S. E. Robertson and S. Walker. 2000. Microsoft Cambridge at TREC-9: Filtering track. In Proceedings of the Text Retrieval Conference (TREC\u201900)."},{"key":"e_1_2_1_76_1","unstructured":"J. J. Rocchio. 1971. Relevance feedback in information retrieval. In The SMART Retrieval System: Experiments in Automatic Document Processing. 313--323.  J. J. Rocchio. 1971. Relevance feedback in information retrieval. In The SMART Retrieval System: Experiments in Automatic Document Processing. 313--323."},{"key":"e_1_2_1_77_1","volume-title":"Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201902)","author":"Scholer F.","unstructured":"F. Scholer and H. E. Williams . 2002. Query association for effective retrieval . In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201902) . 324--331. F. Scholer and H. E. Williams. 2002. Query association for effective retrieval. In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201902). 324--331."},{"key":"e_1_2_1_78_1","volume-title":"Proceedings of the ACM International Conference on Web Search and Data Mining (WSDM\u201911)","author":"Sheldon D.","unstructured":"D. Sheldon , M. Shokouhi , M. Szummer , and N. Craswell . 2011. LambdaMerge: Merging the results of query reformulations . In Proceedings of the ACM International Conference on Web Search and Data Mining (WSDM\u201911) . 795--804. D. Sheldon, M. Shokouhi, M. Szummer, and N. Craswell. 2011. LambdaMerge: Merging the results of query reformulations. In Proceedings of the ACM International Conference on Web Search and Data Mining (WSDM\u201911). 795--804."},{"key":"e_1_2_1_79_1","volume-title":"Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201918)","author":"Shen J.","unstructured":"J. Shen , M. Karimzadehgan , M. Bendersky , Z. Qin , and D. Metzler . 2018. Multi-task learning for email search ranking with auxiliary query clustering . In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201918) . 2127--2135. J. Shen, M. Karimzadehgan, M. Bendersky, Z. Qin, and D. Metzler. 2018. Multi-task learning for email search ranking with auxiliary query clustering. In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201918). 2127--2135."},{"key":"e_1_2_1_80_1","volume-title":"Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201905)","author":"Strohman T.","unstructured":"T. Strohman , H. Turtle , and W. B. Croft . 2005. Optimization strategies for complex queries . In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201905) . 219--225. T. Strohman, H. Turtle, and W. B. Croft. 2005. Optimization strategies for complex queries. In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201905). 219--225."},{"key":"e_1_2_1_81_1","doi-asserted-by":"crossref","unstructured":"H. Turtle and W. B. Croft. 1991. Evaluation of an inference network-based retrieval model. 9 3 (1991) 187--222.  H. Turtle and W. B. Croft. 1991. Evaluation of an inference network-based retrieval model. 9 3 (1991) 187--222.","DOI":"10.1145\/125187.125188"},{"key":"e_1_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4573(95)00020-H"},{"key":"e_1_2_1_84_1","volume-title":"Proceedings of the Recherche d\u2019Information etses Applications (RIAO\u201900)","author":"Vogt C. C.","year":"2000","unstructured":"C. C. Vogt . 2000 . How much more is better? Characterizing the effects of adding more IR systems to a combination . In Proceedings of the Recherche d\u2019Information etses Applications (RIAO\u201900) . 457--475. C. C. Vogt. 2000. How much more is better? Characterizing the effects of adding more IR systems to a combination. In Proceedings of the Recherche d\u2019Information etses Applications (RIAO\u201900). 457--475."},{"key":"e_1_2_1_85_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009980820262"},{"key":"e_1_2_1_86_1","doi-asserted-by":"publisher","DOI":"10.1145\/2661629"},{"key":"e_1_2_1_87_1","volume-title":"Proceedings of the International Conference on the World Wide Web (WWW\u201901)","author":"Wen J. R.","unstructured":"J. R. Wen , J. Y. Nie , and H. J. Zhang . 2001. Clustering user queries of a search engine . In Proceedings of the International Conference on the World Wide Web (WWW\u201901) . 162--168. J. R. Wen, J. Y. Nie, and H. J. Zhang. 2001. Clustering user queries of a search engine. In Proceedings of the International Conference on the World Wide Web (WWW\u201901). 162--168."},{"key":"e_1_2_1_88_1","doi-asserted-by":"publisher","DOI":"10.1145\/503104.503108"},{"key":"e_1_2_1_89_1","volume-title":"Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201913)","author":"Wu H.","unstructured":"H. Wu and H. Fang . 2013. An incremental approach to efficient pseudo-relevance feedback . In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201913) . 553--562. H. Wu and H. Fang. 2013. An incremental approach to efficient pseudo-relevance feedback. In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201913). 553--562."},{"key":"e_1_2_1_90_1","volume-title":"Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201904)","author":"Xue G.-R.","unstructured":"G.-R. Xue , H.-J. Zeng , Z. Chen , Y. Yu , W.-Y. Ma , W. Xi , and W. Fan . 2004. Optimizing web search using web click-through data . In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201904) . 118--126. G.-R. Xue, H.-J. Zeng, Z. Chen, Y. Yu, W.-Y. Ma, W. Xi, and W. Fan. 2004. Optimizing web search using web click-through data. In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201904). 118--126."},{"key":"e_1_2_1_91_1","doi-asserted-by":"publisher","DOI":"10.1145\/2457465.2457466"},{"key":"e_1_2_1_92_1","volume-title":"Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201915)","author":"Yun J.-M.","unstructured":"J.-M. Yun , Y. He , S. Elnikety , and S. Ren . 2015. Optimal aggregation policy for reducing tail latency of web search . In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201915) . 63--72. J.-M. Yun, Y. He, S. Elnikety, and S. Ren. 2015. Optimal aggregation policy for reducing tail latency of web search. In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201915). 63--72."},{"key":"e_1_2_1_93_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132956.1132959"}],"container-title":["ACM Transactions on Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3345001","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3345001","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:54:28Z","timestamp":1750204468000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3345001"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,4]]},"references-count":92,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,10,31]]}},"alternative-id":["10.1145\/3345001"],"URL":"https:\/\/doi.org\/10.1145\/3345001","relation":{},"ISSN":["1046-8188","1558-2868"],"issn-type":[{"value":"1046-8188","type":"print"},{"value":"1558-2868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10,4]]},"assertion":[{"value":"2018-11-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-07-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-10-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}