Altin, SonerBaeza Yates, RicardoCambazoglu, B. Barla2021-05-252021-05-252020Altin S, Baeza-Yates R, Cambazoglu B. Pre-indexing pruning strategies. In: Boucher C, Thankachan SV, editors. SPIRE 2020: International Symposium on String Processing and Information Retrieval; 2020 Oct 13-15; Orlando, USA. Cham: Springer; 2020. p.177-93. DOI: 10.1007/978-3-030-59212-7_13http://hdl.handle.net/10230/47646Comunicació presentada al SPIRE 2020: International Symposium on String Processing and Information Retrieval, celebrat del 13 al 15 d'octubre de 2020 a Orlando, Estats Units.We explore different techniques for pruning an inverted index in advance, that is, without building the full index. These techniques provide interesting trade-offs between index size, answer quality and query coverage. We experimentally analyze them in a large public web collection with two different query logs. The trade-offs that we find range from an index of size 4% and 35% of precision@10 to an index of size 46% and 90% of precision@10, with respect to the full index case. In both cases we cover almost 97% of the query volume. We also do a relative relevance analysis with a smaller private web collection and query log, finding that some of our techniques allow a reduction of almost 40% the index size by losing less than 2% for NDCG@10.application/pdfeng© Springer The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-030-59212-7_13info:eu-repo/semantics/conferenceObjecthttp://dx.doi.org/10.1007/978-3-030-59212-7_13Web searchInverted indexIndex pruningSearch efficiencyinfo:eu-repo/semantics/openAccess