{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,12]],"date-time":"2026-10-12T15:18:10Z","timestamp":1791818290913,"version":"4.3.4"},"reference-count":46,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2008,6,1]],"date-time":"2008-06-01T00:00:00Z","timestamp":1212278400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004410","name":"T\u00fcrkiye Bilimsel ve Teknolojik Arastirma Kurumu","doi-asserted-by":"publisher","award":["1.05E+26"],"award-info":[{"award-number":["1.05E+26"]}],"id":[{"id":"10.13039\/501100004410","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Inf. Syst."],"published-print":{"date-parts":[[2008,6]]},"abstract":"<jats:p>We propose a unique cluster-based retrieval (CBR) strategy using a new cluster-skipping inverted file for improving query processing efficiency. The new inverted file incorporates cluster membership and centroid information along with the usual document information into a single structure. In our incremental-CBR strategy, during query evaluation, both best(-matching) clusters and the best(-matching) documents of such clusters are computed together with a single posting-list access per query term. As we switch from term to term, the best clusters are recomputed and can dynamically change. During query-document matching, only relevant portions of the posting lists corresponding to the best clusters are considered and the rest are skipped. The proposed approach is essentially tailored for environments where inverted files are compressed, and provides substantial efficiency improvement while yielding comparable, or sometimes better, effectiveness figures. Our experiments with various collections show that the incremental-CBR strategy using a compressed cluster-skipping inverted file significantly improves CPU time efficiency, regardless of query length. The new compressed inverted file imposes an acceptable storage overhead in comparison to a typical inverted file. We also show that our approach scales well with the collection size.<\/jats:p>","DOI":"10.1145\/1361684.1361688","type":"journal-article","created":{"date-parts":[[2008,6,24]],"date-time":"2008-06-24T12:48:51Z","timestamp":1214311731000},"page":"1-36","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["Incremental cluster-based retrieval using compressed cluster-skipping inverted files"],"prefix":"10.1145","volume":"26","author":[{"given":"Ismail Sengor","family":"Altingovde","sequence":"first","affiliation":[{"name":"Bilkent University, Ankara, Turkey"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Engin","family":"Demir","sequence":"additional","affiliation":[{"name":"Bilkent University, Ankara, Turkey"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fazli","family":"Can","sequence":"additional","affiliation":[{"name":"Bilkent University, Ankara, Turkey"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"\u00d6zg\u00fcr","family":"Ulusoy","sequence":"additional","affiliation":[{"name":"Bilkent University, Ankara, Turkey"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2008,6,20]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/11902140_74"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277961"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/383952.383957"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:INRT.0000048490.99518.5c"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1076034.1076075"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148235"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277775"},{"key":"e_1_2_1_8_1","volume-title":"Proceedings of the Data Compression Conference. IEEE, 342--351","author":"Blandford D.","unstructured":"Blandford , D. and Blelloch , G . 2002. Index compression through document reordering . In Proceedings of the Data Compression Conference. IEEE, 342--351 . Blandford, D. and Blelloch, G. 2002. Index compression through document reordering. In Proceedings of the Data Compression Conference. IEEE, 342--351."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/215206.215329"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/253495.253515"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/345508.345543"},{"key":"e_1_2_1_13_1","volume-title":"Proceedings of the 26th European Conference on IR Research (ECIR). 364--377","author":"Cacheda F.","unstructured":"Cacheda , F. and Baeza-Yates , R . 2004. An optimistic model for searching Web directories . In Proceedings of the 26th European Conference on IR Research (ECIR). 364--377 . Cacheda, F. and Baeza-Yates, R. 2004. An optimistic model for searching Web directories. In Proceedings of the 26th European Conference on IR Research (ECIR). 364--377."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1757788.1757830"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2005.06.004"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/130226.134466"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4573(94)90049-3"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0306-4379(03)00062-0"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/99935.99938"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4379(80)90010-1"},{"key":"e_1_2_1_22_1","volume-title":"Information Retrieval: Data Structures and Algorithms","author":"Harman D.","unstructured":"Harman , D. 1992. Ranking algorithms . In Information Retrieval: Data Structures and Algorithms , W. B. Frakes and R. Baeza-Yates, eds. Prentice Hall, Englewood Cliffs, NJ , (Chapter 14), 363--392. Harman, D. 1992. Ranking algorithms. In Information Retrieval: Data Structures and Algorithms, W. B. Frakes and R. Baeza-Yates, eds. Prentice Hall, Englewood Cliffs, NJ, (Chapter 14), 363--392."},{"key":"e_1_2_1_23_1","unstructured":"Jain A. K. and Dubes R. C. 1988. Algorithms for Clustering Data. Prentice-Hall Englewood Cliffs NJ.   Jain A. K. and Dubes R. C. 1988. Algorithms for Clustering Data. Prentice-Hall Englewood Cliffs NJ."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0271(71)90051-9"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/11581062_37"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008992.1009026"},{"key":"e_1_2_1_27_1","volume-title":"Proceedings of the 29th International Conference on Very Large Data Bases (VLDB). 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). 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). 129--140."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/237496.237497"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2005.03.023"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/188490.188597"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-4571(199610)47:10%3C749::AID-ASI3%3E3.3.CO;2-U"},{"key":"e_1_2_1_33_1","volume-title":"Dynamic Information and Library Processing","author":"Salton G.","unstructured":"Salton , G. 1975. Dynamic Information and Library Processing . Prentice-Hall , Englewood Cliffs, NJ . Salton, G. 1975. Dynamic Information and Library Processing. Prentice-Hall, Englewood Cliffs, NJ."},{"key":"e_1_2_1_34_1","volume-title":"Automatic Text Processing: The Transformation, Analysis, and Retrieval of Information by Computer","author":"Salton G.","unstructured":"Salton , G. 1989. Automatic Text Processing: The Transformation, Analysis, and Retrieval of Information by Computer . Addison-Wesley , Reading, MA . Salton, G. 1989. Automatic Text Processing: The Transformation, Analysis, and Retrieval of Information by Computer. Addison-Wesley, Reading, MA."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4573(88)90021-0"},{"key":"e_1_2_1_36_1","volume-title":"Introduction to Modern Information Retrieval","author":"Salton G.","unstructured":"Salton , G. and McGill , M. J. 1983. Introduction to Modern Information Retrieval . McGraw Hill , New York . Salton, G. and McGill, M. J. 1983. Introduction to Modern Information Retrieval. McGraw Hill, New York."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008992.1009046"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/1763653.1763668"},{"key":"e_1_2_1_39_1","unstructured":"Stanford University. 2007. Webbase project Web site. www-diglib.stanford.edu\/~testbed\/doc2\/WebBase.  Stanford University. 2007. Webbase project Web site. www-diglib.stanford.edu\/~testbed\/doc2\/WebBase."},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277774"},{"key":"e_1_2_1_41_1","unstructured":"Trec 2006. Trec. Web site. http:\/\/trec.nist.gov.  Trec 2006. Trec. Web site. http:\/\/trec.nist.gov."},{"key":"e_1_2_1_43_1","volume-title":"Information Retrieval","author":"Van Rijsbergen C. J.","unstructured":"Van Rijsbergen , C. J. 1979. Information Retrieval , 2 nd ed. Butterworths , London . Van Rijsbergen, C. J. 1979. Information Retrieval, 2nd ed. Butterworths, London.","edition":"2"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/253495.253524"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/253168.253203"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4573(88)90027-1"},{"key":"e_1_2_1_48_1","doi-asserted-by":"crossref","unstructured":"Witten I. H. Moffat A. and Bell T. C. 1994. Managing Gigabytes Compressing and Indexing Documents and Images. Van Nostrand Reinhold New York.   Witten I. H. Moffat A. and Bell T. C. 1994. Managing Gigabytes Compressing and Indexing Documents and Images. Van Nostrand Reinhold New York.","DOI":"10.1109\/TIT.1995.476344"},{"key":"e_1_2_1_49_1","unstructured":"Zettair 2007. The Zettair search engine. http:\/\/www.seg.rmit.edu.au\/zettair\/.  Zettair 2007. The Zettair search engine. http:\/\/www.seg.rmit.edu.au\/zettair\/."},{"key":"e_1_2_1_50_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\/1361684.1361688","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1361684.1361688","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:58:03Z","timestamp":1750255083000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1361684.1361688"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6]]},"references-count":46,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,6]]}},"alternative-id":["10.1145\/1361684.1361688"],"URL":"https:\/\/doi.org\/10.1145\/1361684.1361688","relation":{},"ISSN":["1046-8188","1558-2868"],"issn-type":[{"value":"1046-8188","type":"print"},{"value":"1558-2868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,6]]},"assertion":[{"value":"2006-02-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2007-12-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-06-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}