{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T19:28:23Z","timestamp":1771702103825,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642201608","type":"print"},{"value":"9783642201615","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20161-5_53","type":"book-chapter","created":{"date-parts":[[2011,4,12]],"date-time":"2011-04-12T07:41:23Z","timestamp":1302594083000},"page":"530-542","source":"Crossref","is-referenced-by-count":13,"title":["Efficient Compressed Inverted Index Skipping for Disjunctive Text-Queries"],"prefix":"10.1007","author":[{"given":"Simon","family":"Jonassen","sequence":"first","affiliation":[]},{"given":"Svein Erik","family":"Bratsberg","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"53_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/11575832_3","volume-title":"String Processing and Information Retrieval","author":"P. Boldi","year":"2005","unstructured":"Boldi, P., Vigna, S.: Compressed perfect embedded skip lists for quick inverted-index lookups. In: Consens, M.P., Navarro, G. (eds.) SPIRE 2005. LNCS, vol.\u00a03772, pp. 25\u201328. Springer, Heidelberg (2005)"},{"key":"53_CR2","volume-title":"Proc. CIKM","author":"A. Broder","year":"2003","unstructured":"Broder, A., Carmel, D., Herscovici, M., Soffer, A., Zien, J.: Efficient query evaluation using a two-level retrieval process. In: Proc. CIKM. ACM, New York (2003)"},{"key":"53_CR3","first-page":"97","volume-title":"Proc. SIGIR","author":"C. Buckley","year":"1985","unstructured":"Buckley, C., Lewit, A.: Optimization of inverted vector searches. In: Proc. SIGIR, pp. 97\u2013110. ACM, New York (1985)"},{"key":"53_CR4","first-page":"761","volume-title":"Proc. CIKM","author":"S. B\u00fcttcher","year":"2007","unstructured":"B\u00fcttcher, S., Clarke, C.: Index compression is good, especially for random access. In: Proc. CIKM, pp. 761\u2013770. ACM, New York (2007)"},{"key":"53_CR5","doi-asserted-by":"crossref","unstructured":"B\u00fcttcher, S., Clarke, C., Soboroff, I.: The trec 2006 terabyte track. In: Proc. TREC (2006)","DOI":"10.6028\/NIST.SP.500-272.terabyte-overview"},{"key":"53_CR6","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1145\/1341531.1341537","volume-title":"Proc. WSDM","author":"F. Chierichetti","year":"2008","unstructured":"Chierichetti, F., Lattanzi, S., Mari, F., Panconesi, A.: On placing skips optimally in expectation. In: Proc. WSDM, pp. 15\u201324. ACM, New York (2008)"},{"key":"53_CR7","doi-asserted-by":"crossref","unstructured":"Clarke, C., Soboroff, I.: The trec 2005 terabyte track. In: Proc. TREC (2005)","DOI":"10.6028\/NIST.SP.500-266.terabyte-overview"},{"key":"53_CR8","doi-asserted-by":"crossref","first-page":"1213","DOI":"10.1145\/1367497.1367732","volume-title":"Proc. WWW","author":"S. Ding","year":"2008","unstructured":"Ding, S., He, J., Yan, H., Suel, T.: Using graphics processors for high-performance ir query processing. In: Proc. WWW, pp. 1213\u20131214. ACM, New York (2008)"},{"key":"53_CR9","unstructured":"Lacour, P., Macdonald, C., Ounis, I.: Efficiency comparison of document matching techniques. In: Proc. ECIR (2008)"},{"key":"53_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1007\/11581062_37","volume-title":"Web Information Systems Engineering \u2013 WISE 2005","author":"N. Lester","year":"2005","unstructured":"Lester, N., Moffat, A., Webber, W., Zobel, J.: Space-limited ranked query evaluation using adaptive pruning. In: Ngu, A.H.H., Kitsuregawa, M., Neuhold, E.J., Chung, J.-Y., Sheng, Q.Z. (eds.) WISE 2005. LNCS, vol.\u00a03806, pp. 470\u2013477. Springer, Heidelberg (2005)"},{"issue":"3","key":"53_CR11","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s10791-006-9014-4","volume":"10","author":"A. Moffat","year":"2007","unstructured":"Moffat, A., Webber, W., Zobel, J., Baeza-Yates, R.: A pipelined architecture for distributed text query evaluation. Inf. Retr.\u00a010(3), 205\u2013231 (2007)","journal-title":"Inf. Retr."},{"issue":"4","key":"53_CR12","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1145\/237496.237497","volume":"14","author":"A. Moffat","year":"1996","unstructured":"Moffat, A., Zobel, J.: Self-indexing inverted files for fast text retrieval. ACM Trans. Inf. Syst.\u00a014(4), 349\u2013379 (1996)","journal-title":"ACM Trans. Inf. Syst."},{"key":"53_CR13","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1145\/1277741.1277774","volume-title":"Proc. SIGIR","author":"T. Strohman","year":"2007","unstructured":"Strohman, T., Croft, W.: Efficient document retrieval in main memory. In: Proc. SIGIR, pp. 175\u2013182. ACM, New York (2007)"},{"key":"53_CR14","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1145\/1076034.1076074","volume-title":"Proc. SIGIR","author":"T. Strohman","year":"2005","unstructured":"Strohman, T., Turtle, H., Croft, W.: Optimization strategies for complex queries. In: Proc. SIGIR, pp. 219\u2013225. ACM, New York (2005)"},{"issue":"6","key":"53_CR15","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1016\/0306-4573(95)00020-H","volume":"31","author":"H. Turtle","year":"1995","unstructured":"Turtle, H., Flood, J.: Query evaluation: strategies and optimizations. Inf. Process. Manage.\u00a031(6), 831\u2013850 (1995)","journal-title":"Inf. Process. Manage."},{"key":"53_CR16","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1145\/1526709.1526764","volume-title":"Proc. WWW","author":"H. Yan","year":"2009","unstructured":"Yan, H., Ding, S., Suel, T.: Inverted index compression and query processing with optimized document ordering. In: Proc. WWW, pp. 401\u2013410. ACM, New York (2009)"},{"key":"53_CR17","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1145\/1367497.1367550","volume-title":"Proc. WWW","author":"J. Zhang","year":"2008","unstructured":"Zhang, J., Long, X., Suel, T.: Performance of compressed inverted list caching in search engines. In: Proc. WWW, pp. 387\u2013396. ACM, New York (2008)"},{"key":"53_CR18","doi-asserted-by":"crossref","unstructured":"Zobel, J., Moffat, A.: Inverted files for text search engines. ACM Comput. Surv.\u00a038(2) (2006)","DOI":"10.1145\/1132956.1132959"},{"key":"53_CR19","first-page":"59","volume-title":"Proc. ICDE","author":"M. Zukowski","year":"2006","unstructured":"Zukowski, M., Heman, S., Nes, N., Boncz, P.: Super-scalar ram-cpu cache compression. In: Proc. ICDE, p. 59. IEEE Computer Society, Los Alamitos (2006)"}],"container-title":["Lecture Notes in Computer Science","Advances in Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20161-5_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T00:49:53Z","timestamp":1741135793000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20161-5_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642201608","9783642201615"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20161-5_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}