{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T01:55:19Z","timestamp":1775181319517,"version":"3.50.1"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031282409","type":"print"},{"value":"9783031282416","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-28241-6_6","type":"book-chapter","created":{"date-parts":[[2023,3,16]],"date-time":"2023-03-16T01:02:20Z","timestamp":1678928540000},"page":"86-100","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Index-Based Batch Query Processing Revisited"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7992-4633","authenticated-orcid":false,"given":"Joel","family":"Mackenzie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6638-0232","authenticated-orcid":false,"given":"Alistair","family":"Moffat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,16]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Albers, S.: New results on web caching with request reordering. In: Proceedings of SPAA, pp. 84\u201392 (2004)","DOI":"10.1145\/1007912.1007925"},{"key":"6_CR2","unstructured":"Bajaj, P., et al.: MS MARCO: a human generated MAchine Reading COmprehension dataset. arXiv:1611.09268v3 (2018)"},{"issue":"2","key":"6_CR3","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1147\/sj.52.0078","volume":"5","author":"LA Belady","year":"1966","unstructured":"Belady, L.A.: A study of replacement algorithms for a virtual-storage computer. IBM Syst. J. 5(2), 78\u2013101 (1966)","journal-title":"IBM Syst. J."},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Benham, R., Mackenzie, J., Moffat, A., Culpepper, J.S.: Boosting search performance using query variations. ACM Trans. Inf. Syst. 37(4), 41.1\u201341.25 (2019)","DOI":"10.1145\/3345001"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Blandford, D., Blelloch, G.: Index compression through document reordering. In: Proceedings of DCC, pp. 342\u2013352 (2002)","DOI":"10.1109\/DCC.2002.999972"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Cambazoglu, B.B., et al.: A refreshing perspective of search engine caching. In: Proceedings of WWW, pp. 181\u2013190 (2010)","DOI":"10.1145\/1772690.1772710"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Catena, M., Tonellotto, N.: Multiple query processing via logic function factoring. In: Proceedings of SIGIR, pp. 937\u2013940 (2019)","DOI":"10.1145\/3331184.3331297"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Church, K., K\u00f6nig, A.C., Sui, L.: Heavy-tailed distributions and multi-keyword queries. In: Proceedings of SIGIR, pp. 663\u2013670 (2007)","DOI":"10.1145\/1277741.1277855"},{"issue":"3","key":"6_CR9","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1016\/j.ipm.2005.05.003","volume":"42","author":"C Cheng","year":"2006","unstructured":"Cheng, C., Chung, C., Shann, J.J.: Fast query evaluation through document identifier assignment for inverted file-based information retrieval systems. Inf. Proc. Man. 42(3), 729\u2013750 (2006)","journal-title":"Inf. Proc. Man."},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Choudhury, F.M., Culpepper, J.S., Bao, Z., Sellis, T.: Batch processing of top-$$k$$ spatial-textual queries. ACM Trans. Spat. Alg. Syst. 3(4), 13.1\u201313.40 (2018)","DOI":"10.1145\/3196155"},{"issue":"6","key":"6_CR11","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1016\/j.ipm.2012.02.003","volume":"48","author":"G Chowdhury","year":"2012","unstructured":"Chowdhury, G.: An agenda for green information retrieval research. Inf. Proc. Man. 48(6), 1067\u20131077 (2012)","journal-title":"Inf. Proc. Man."},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Craswell, N., Campos, D., Mitra, B., Yilmaz, E., Billerbeck, B.: ORCAS: 20 million clicked query-document pairs for analyzing search. In: Proceedings of CIKM, pp. 2983\u20132989 (2020)","DOI":"10.1145\/3340531.3412779"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Craswell, N., Mitra, B., Yilmaz, E., Campos, D., Lin, J.: Overview of the TREC 2021 deep learning track. In: Proceedings of TREC (2021)","DOI":"10.6028\/NIST.SP.500-335.deep-overview"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Culpepper, J.S., Moffat, A.: Efficient set intersection for inverted indexing. ACM Trans. Inf. Syst. 29(1), 1.1\u20131.25 (2010)","DOI":"10.1145\/1877766.1877767"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Dhulipala, L., Kabiljo, I., Karrer, B., Ottaviano, G., Pupyrev, S., Shalita, A.: Compressing graphs and indexes with recursive graph bisection. In: Proceedings of KDD, pp. 1535\u20131544 (2016)","DOI":"10.1145\/2939672.2939862"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Ding, S., Attenberg, J., Baeza-Yates, R., Suel, T.: Batch query processing for web search engines. In: Proceedings of WSDM, pp. 137\u2013146 (2011)","DOI":"10.1145\/1935826.1935858"},{"issue":"1","key":"6_CR17","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/1125857.1125859","volume":"24","author":"T Fagni","year":"2006","unstructured":"Fagni, T., Perego, R., Silvestri, F., Orlando, S.: Boosting the performance of web search engines: caching and prefetching query results by exploiting historical usage data. ACM Trans. Inf. Syst. 24(1), 51\u201378 (2006)","journal-title":"ACM Trans. Inf. Syst."},{"key":"6_CR18","unstructured":"Feder, T., Motwani, R., Panigrahy, R., Zhu, A.: Web caching with request reordering. In: Proceedings of SODA, pp. 104\u2013105 (2002)"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Hwang, S.-W., Kim, S., He, Y., Elnikety, S., Choi, S.: Prediction and predictability for search query acceleration. ACM Trans. Web 10(3), 19.1\u201319.28 (2016)","DOI":"10.1145\/2943784"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Jonassen, S., Cambazoglu, B.B., Silvestri, F.: Prefetching query results and its impact on search engines. In: Proceedings of SIGIR, pp. 631\u2013640 (2012)","DOI":"10.1145\/2348283.2348368"},{"issue":"1","key":"6_CR21","first-page":"1","volume":"41","author":"D Lemire","year":"2015","unstructured":"Lemire, D., Boytsov, L.: Decoding billions of integers per second through vectorization. Soft. Prac. Exp. 41(1), 1\u201329 (2015)","journal-title":"Soft. Prac. Exp."},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Lempel, R., Moran, S.: Predictive caching and prefetching of query results in search engines. In: Proceedings of WWW, pp. 19\u201328 (2003)","DOI":"10.1145\/775152.775156"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Lin, J., et al.: Supporting interoperability between open-source search engines with the common index file format. In: Proceedings of SIGIR, pp. 2149\u20132152 (2020)","DOI":"10.1145\/3397271.3401404"},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"Ma, H., Wang, B.: User-aware caching and prefetching query results in web search engines. In: Proceedings of SIGIR, pp. 1163\u20131164 (2012)","DOI":"10.1145\/2348283.2348520"},{"key":"6_CR25","doi-asserted-by":"crossref","unstructured":"Ma, X., Pradeep, R., Nogueira, R., Lin, J.: Document expansions and learned sparse lexical representations for MSMARCO V1 and V2. In: Proceedings of SIGIR, pp. 3187\u20133197 (2022)","DOI":"10.1145\/3477495.3531749"},{"key":"6_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-030-15712-8_22","volume-title":"Advances in Information Retrieval","author":"J Mackenzie","year":"2019","unstructured":"Mackenzie, J., Mallia, A., Petri, M., Culpepper, J.S., Suel, T.: Compressing inverted indexes with recursive graph bisection: a reproducibility study. In: Azzopardi, L., Stein, B., Fuhr, N., Mayr, P., Hauff, C., Hiemstra, D. (eds.) ECIR 2019. LNCS, vol. 11437, pp. 339\u2013352. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-15712-8_22"},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"Mackenzie, J., Petri, M., Moffat, A.: Tradeoff options for bipartite graph partitioning. IEEE Trans. Know. Data Eng. (2022, to appear)","DOI":"10.1109\/TKDE.2022.3208902"},{"key":"6_CR28","unstructured":"Mallia, A., Siedlaczek, M., Mackenzie, J., Suel, T.: PISA: performant indexes and search for academia. In: Proceedings of OSIRRC at SIGIR 2019, pp. 50\u201356 (2019)"},{"key":"6_CR29","doi-asserted-by":"crossref","unstructured":"Mar\u00edn, M., Navarro, G.: Distributed query processing using suffix arrays. In: Proceedings of SPIRE, pp. 311\u2013325 (2003)","DOI":"10.1007\/978-3-540-39984-1_24"},{"key":"6_CR30","doi-asserted-by":"crossref","unstructured":"Petersen, C., Simonsen, J.G., Lioma, C.: Power law distributions in information retrieval. ACM Trans. Inf. Syst. 34(2), 8.1\u20138.37 (2016)","DOI":"10.1145\/2816815"},{"key":"6_CR31","doi-asserted-by":"crossref","unstructured":"Scells, H., Zhuang, S., Zuccon, G.: Reduce, reuse, recycle: green information retrieval research. In: Proceedings of SIGIR, pp. 2825\u20132837 (2022)","DOI":"10.1145\/3477495.3531766"},{"issue":"1","key":"6_CR32","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/42201.42203","volume":"13","author":"TK Sellis","year":"1988","unstructured":"Sellis, T.K.: Multiple-query optimization. ACM Trans. Data. Syst. 13(1), 23\u201352 (1988)","journal-title":"ACM Trans. Data. Syst."},{"key":"6_CR33","doi-asserted-by":"crossref","unstructured":"Strubell, E., Ganesh, A., McCallum, A.: Energy and policy considerations for deep learning in NLP. In: Proceedings of ACL, pp. 3645\u20133650 (2019)","DOI":"10.18653\/v1\/P19-1355"},{"issue":"3","key":"6_CR34","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/s10791-017-9299-5","volume":"20","author":"G Tolosa","year":"2017","unstructured":"Tolosa, G., Becchetti, L., Feuerstein, E., Marchetti-Spaccamela, A.: Performance improvements for search systems using an integrated cache of lists + intersections. Inf. Retr. 20(3), 172\u2013198 (2017)","journal-title":"Inf. Retr."},{"issue":"4\u20135","key":"6_CR35","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1561\/1500000057","volume":"12","author":"N Tonellotto","year":"2018","unstructured":"Tonellotto, N., Macdonald, C., Ounis, I.: Efficient query processing for scalable web search. Found. Trnd. Inf. Retr. 12(4\u20135), 319\u2013500 (2018)","journal-title":"Found. Trnd. Inf. Retr."},{"issue":"4","key":"6_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3239571","volume":"10","author":"P Yang","year":"2018","unstructured":"Yang, P., Fang, H., Lin, J.: Anserini: reproducible ranking baselines using Lucene. J. Data Inf. Qual. 10(4), 1\u201320 (2018)","journal-title":"J. Data Inf. Qual."}],"container-title":["Lecture Notes in Computer Science","Advances in Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-28241-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,16]],"date-time":"2024-10-16T14:14:11Z","timestamp":1729088051000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-28241-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031282409","9783031282416"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-28241-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"16 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECIR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Information Retrieval","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dublin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ireland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecir2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ecir2023.org\/index.html?v=1.0","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"489","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"77","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"83","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}