{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T13:43:02Z","timestamp":1778679782029,"version":"3.51.4"},"reference-count":46,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004837","name":"Ministerio de Ciencia e Innovaci\u00f3n","doi-asserted-by":"publisher","award":["07SIN005206PR"],"award-info":[{"award-number":["07SIN005206PR"]}],"id":[{"id":"10.13039\/501100004837","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008530","name":"FEDER","doi-asserted-by":"crossref","award":["TIN2008-06566-C04-04\/TIN"],"award-info":[{"award-number":["TIN2008-06566-C04-04\/TIN"]}],"id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Inf. Syst."],"published-print":{"date-parts":[[2010,1]]},"abstract":"<jats:p>Information retrieval (IR) systems typically compress their indexes in order to increase their efficiency. Static pruning is a form of lossy data compression: it removes from the index, data that is estimated to be the least important to retrieval performance, according to some criterion. Generally, pruning criteria are derived from term weighting functions, which assign weights to terms according to their contribution to a document's contents. Usually, document-term occurrences that are assigned a low weight are ruled out from the index. The main assumption is that those entries contribute little to the document content.<\/jats:p>\n          <jats:p>We present a novel pruning technique that is based on a probabilistic model of IR. We employ the Probability Ranking Principle as a decision criterion over which posting list entries are to be pruned. The proposed approach requires the estimation of three probabilities, combining them in such a way that we gather all the necessary information to apply the aforementioned criterion.<\/jats:p>\n          <jats:p>We evaluate our proposed pruning technique on five TREC collections and various retrieval tasks, and show that in almost every situation it outperforms the state of the art in index pruning. The main contribution of this work is proposing a pruning technique that stems directly from the same source as probabilistic retrieval models, and hence is independent of the final model used for retrieval.<\/jats:p>","DOI":"10.1145\/1658377.1658378","type":"journal-article","created":{"date-parts":[[2010,1,26]],"date-time":"2010-01-26T14:01:38Z","timestamp":1264514498000},"page":"1-33","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":23,"title":["Probabilistic static pruning of inverted files"],"prefix":"10.1145","volume":"28","author":[{"given":"Roi","family":"Blanco","sequence":"first","affiliation":[{"name":"University of A Coru\u00f1a, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alvaro","family":"Barreiro","sequence":"additional","affiliation":[{"name":"University of A Coru\u00f1a, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,1,29]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/11735106_3"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/582415.582416"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/564376.564380"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148235"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277775"},{"key":"e_1_2_1_6_1","volume-title":"Modern Information Retrieval","author":"Baeza-Yates R. A.","unstructured":"Baeza-Yates , R. A. and Ribeiro-Neto , B. A. 1999. Modern Information Retrieval . ACM\/Addison-Wesley . Baeza-Yates, R. A. and Ribeiro-Neto, B. A. 1999. Modern Information Retrieval. ACM\/Addison-Wesley."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277904"},{"key":"e_1_2_1_8_1","volume-title":"Proceedings of the 29th European Conference on IR Research (ECIR). Lecture Notes in Computer Science","volume":"4425","author":"Blanco R.","unstructured":"Blanco , R. and Barreiro , A . 2007b. Static pruning of terms in inverted files . In Proceedings of the 29th European Conference on IR Research (ECIR). Lecture Notes in Computer Science , vol. 4425 . Springer, 64--75. Blanco, R. and Barreiro, A. 2007b. Static pruning of terms in inverted files. In Proceedings of the 29th European Conference on IR Research (ECIR). Lecture Notes in Computer Science, vol. 4425. Springer, 64--75."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4573(95)00052-I"},{"key":"e_1_2_1_10_1","volume-title":"Proceedings of the 7th International Conference on World Wide Web. Elsevier Science Publishers B. V.","author":"Brin S.","unstructured":"Brin , S. and Page , L . 1998. The anatomy of a large-scale hypertextual Web search engine . In Proceedings of the 7th International Conference on World Wide Web. Elsevier Science Publishers B. V. , Amsterdam, The Netherlands, 107--117. Brin, S. and Page, L. 1998. The anatomy of a large-scale hypertextual Web search engine. In Proceedings of the 7th International Conference on World Wide Web. Elsevier Science Publishers B. V., Amsterdam, The Netherlands, 107--117."},{"key":"e_1_2_1_11_1","volume-title":"Proceedings of the 4th Text REtrieval Conference (TREC-4). 25--48","author":"Buckley C.","unstructured":"Buckley , C. , Singhal , A. , Mitra , M. , and Salton , G . 1995. New retrieval approaches using smart: Trec . In Proceedings of the 4th Text REtrieval Conference (TREC-4). 25--48 . Buckley, C., Singhal, A., Mitra, M., and Salton, G. 1995. New retrieval approaches using smart: Trec. In Proceedings of the 4th Text REtrieval Conference (TREC-4). 25--48."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1183614.1183644"},{"key":"e_1_2_1_13_1","volume-title":"Proceedings of the 10th Text REtrieval Conference (TREC). 228--236","author":"Carmel D.","unstructured":"Carmel , D. , Amitay , E. , Herscovici , M. , Maarek , Y. S. , Petruschka , Y. , and Soffer , A . 2001a. Juru at trec 10 - experiments with index pruning . In Proceedings of the 10th Text REtrieval Conference (TREC). 228--236 . Carmel, D., Amitay, E., Herscovici, M., Maarek, Y. S., Petruschka, Y., and Soffer, A. 2001a. Juru at trec 10 - experiments with index pruning. In Proceedings of the 10th Text REtrieval Conference (TREC). 228--236."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/383952.383958"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/564376.564454"},{"key":"e_1_2_1_16_1","volume-title":"Proceedings of the 13th Text REtrieval Conference (TREC).","author":"Craswell N.","unstructured":"Craswell , N. and Hawking , D . 2004. Overview of the TREC-2004 Web Track . In Proceedings of the 13th Text REtrieval Conference (TREC). Craswell, N. and Hawking, D. 2004. Overview of the TREC-2004 Web Track. In Proceedings of the 13th Text REtrieval Conference (TREC)."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1108\/eb026683"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480102412856"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/956863.956867"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/30.1-2.81"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/564376.564383"},{"key":"e_1_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Lafferty J. and Zhai C. 2003. Probabilistic relevance models based on document and query generation. In Language Modeling for Information Retrieval W. Croft and J. Lafferty Eds. Kluwer 11--56.  Lafferty J. and Zhai C. 2003. Probabilistic relevance models based on document and query generation. In Language Modeling for Information Retrieval W. Croft and J. Lafferty Eds. Kluwer 11--56.","DOI":"10.1007\/978-94-017-0171-6_1"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/383952.383972"},{"key":"e_1_2_1_24_1","volume-title":"Proceedings of the 29th International Conference on Very Large Data Bases. VLDB Endowment, 129--140","author":"Long X.","unstructured":"Long , X. and Suel , T . 2003. Optimized query execution in large search engines with global page ordering . In Proceedings of the 29th International Conference on Very Large Data Bases. VLDB Endowment, 129--140 . Long, X. and Suel, T. 2003. Optimized query execution in large search engines with global page ordering. In Proceedings of the 29th International Conference on Very Large Data Bases. VLDB Endowment, 129--140."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/383952.384005"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277776"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1108\/eb026647"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1002\/asi.4630270302"},{"key":"e_1_2_1_29_1","volume-title":"Proceedings of the 3rd Annual ACM Conference on Research and Development in Information Retrieval (SIGIR). Butterworth & Co.","author":"Robertson S.","unstructured":"Robertson , S. , van Rijsbergen , C. J. , and Porter , M. F . 1981. Probabilistic models of indexing and searching . In Proceedings of the 3rd Annual ACM Conference on Research and Development in Information Retrieval (SIGIR). Butterworth & Co. , Kent, UK, 35--56. Robertson, S., van Rijsbergen, C. J., and Porter, M. F. 1981. Probabilistic models of indexing and searching. In Proceedings of the 3rd Annual ACM Conference on Research and Development in Information Retrieval (SIGIR). Butterworth & Co., Kent, UK, 35--56."},{"key":"e_1_2_1_30_1","volume-title":"Proceedings of the 17th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval). ACM","author":"Robertson S.","unstructured":"Robertson , S. and Walker , S . 1994. Some simple effective approximations to the 2-poisson model for probabilistic weighted retrieval . In Proceedings of the 17th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval). ACM , New York, NY, 232--241. Robertson, S. and Walker, S. 1994. Some simple effective approximations to the 2-poisson model for probabilistic weighted retrieval. In Proceedings of the 17th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval). ACM, New York, NY, 232--241."},{"key":"e_1_2_1_31_1","volume-title":"Proceedings of the 4th Text REtrieval Conference (TREC-4). 73--86","author":"Robertson S. E.","unstructured":"Robertson , S. E. , Walker , S. , Hancock-Beaulieu , M. , Gull , A. , and Lau , M . 1995. Okapi at TREC-4 . In Proceedings of the 4th Text REtrieval Conference (TREC-4). 73--86 . Robertson, S. E., Walker, S., Hancock-Beaulieu, M., Gull, A., and Lau, M. 1995. Okapi at TREC-4. In Proceedings of the 4th Text REtrieval Conference (TREC-4). 73--86."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/383952.383987"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/361219.361220"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1076034.1076064"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/243199.243206"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1076034.1076074"},{"key":"e_1_2_1_37_1","volume-title":"Proceedings of the 13th International Conference on Very Large Data Bases. VLDB Endowment, 648--659","author":"Theobald M.","unstructured":"Theobald , M. , Weikum , G. , and Schenkel , R . 2004. Top-k query evaluation with probabilistic guarantees . In Proceedings of the 13th International Conference on Very Large Data Bases. VLDB Endowment, 648--659 . Theobald, M., Weikum, G., and Schenkel, R. 2004. Top-k query evaluation with probabilistic guarantees. In Proceedings of the 13th International Conference on Very Large Data Bases. VLDB Endowment, 648--659."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4573(95)00020-H"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/858476.858479"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1108\/eb026637"},{"key":"e_1_2_1_41_1","volume-title":"Information Retrieval","author":"van Rijsbergen C. J.","unstructured":"van Rijsbergen , C. J. 1979. Information Retrieval . Butterworths , London . van Rijsbergen, C. J. 1979. Information Retrieval. Butterworths, London."},{"key":"e_1_2_1_42_1","volume-title":"TREC: Experiment and Evaluation in Information Retrieval","author":"Voorhees E. M.","year":"2005","unstructured":"Voorhees , E. M. and Harman , D. K . 2005 . TREC: Experiment and Evaluation in Information Retrieval . The MIT Press . Voorhees, E. M. and Harman, D. K. 2005. TREC: Experiment and Evaluation in Information Retrieval. The MIT Press."},{"key":"e_1_2_1_43_1","volume-title":"Proceedings of the 10th Text Retrieval Conference (TREC-10)","author":"Westerveld T.","unstructured":"Westerveld , T. , Kraaij , W. , and Hiemstra , D . 2002. Retrieving Web pages using content, links, URLS and anchors . In Proceedings of the 10th Text Retrieval Conference (TREC-10) . 663--672. Westerveld, T., Kraaij, W., and Hiemstra, D. 2002. Retrieving Web pages using content, links, URLS and anchors. In Proceedings of the 10th Text Retrieval Conference (TREC-10). 663--672."},{"key":"e_1_2_1_44_1","volume-title":"Managing Gigabytes: Compressing and Indexing Documents and Images","author":"Witten I. H.","year":"1999","unstructured":"Witten , I. H. , Moffat , A. , and Bell , T. C . 1999 . Managing Gigabytes: Compressing and Indexing Documents and Images . Morgan Kaufmann Publishers , San Francisco, CA . Witten, I. H., Moffat, A., and Bell, T. C. 1999. Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan Kaufmann Publishers, San Francisco, CA."},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/984321.984322"},{"key":"e_1_2_1_46_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\/1658377.1658378","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1658377.1658378","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:41:02Z","timestamp":1750250462000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1658377.1658378"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1]]},"references-count":46,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,1]]}},"alternative-id":["10.1145\/1658377.1658378"],"URL":"https:\/\/doi.org\/10.1145\/1658377.1658378","relation":{},"ISSN":["1046-8188","1558-2868"],"issn-type":[{"value":"1046-8188","type":"print"},{"value":"1558-2868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1]]},"assertion":[{"value":"2008-01-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2010-01-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}