{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:01:11Z","timestamp":1725897671511},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642325991"},{"type":"electronic","value":"9783642326004"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32600-4_30","type":"book-chapter","created":{"date-parts":[[2012,8,20]],"date-time":"2012-08-20T01:02:17Z","timestamp":1345424537000},"page":"412-421","source":"Crossref","is-referenced-by-count":1,"title":["Fast Block-Compressed Inverted Lists"],"prefix":"10.1007","author":[{"given":"Giovanni M.","family":"Sacco","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","unstructured":"Baeza-Yates, R.A., Ribeiro-Neto, B.: Modern Information Retrieval. Addison-Wesley Longman Publishing Co., Inc., Boston (1999)"},{"key":"30_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/978-3-540-27801-6_30","volume-title":"Combinatorial Pattern Matching","author":"R.A. Baeza-Yates","year":"2004","unstructured":"Baeza-Yates, R.A.: A Fast Set Intersection Algorithm for Sorted Sequences. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol.\u00a03109, pp. 400\u2013408. Springer, Heidelberg (2004)"},{"issue":"1","key":"30_CR3","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/320521.320530","volume":"2","author":"R. Bayer","year":"1977","unstructured":"Bayer, R., Unterauer, K.: Prefix B-trees. ACM Trans. Database Syst.\u00a02(1), 11\u201326 (1977)","journal-title":"ACM Trans. Database Syst."},{"issue":"2","key":"30_CR4","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/356770.356776","volume":"11","author":"D. Comer","year":"1979","unstructured":"Comer, D.: The Ubiquitous B-Tree. ACM Comput. Surv.\u00a011(2), 121\u2013137 (1979)","journal-title":"ACM Comput. Surv."},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Culpepper, J.S., Moffat, A.: Efficient set intersection for inverted indexing. ACM Trans. Inf.\u00a029(1) (2010)","DOI":"10.1145\/1877766.1877767"},{"issue":"2","key":"30_CR6","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1109\/TIT.1975.1055349","volume":"IT-21","author":"P. Elias","year":"1975","unstructured":"Elias, P.: Universal codeword sets and representations of the integers. IEEE Trans. on Information Theory\u00a0IT-21(2), 194\u2013203 (1975)","journal-title":"IEEE Trans. on Information Theory"},{"issue":"3","key":"30_CR7","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1109\/TIT.1966.1053907","volume":"12","author":"S.W. Golomb","year":"1966","unstructured":"Golomb, S.W.: Run-length encodings. IEEE Trans. Info Theory\u00a012(3), 399\u2013401 (1966)","journal-title":"IEEE Trans. Info Theory"},{"issue":"1","key":"30_CR8","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1023\/A:1009934302807","volume":"3","author":"G. Navarro","year":"2000","unstructured":"Navarro, G., de Moura, S.E., Neubert, M., Ziviani, N., Baeza-Yates, R.: Adding Compression to Block Addressing Inverted Indexes. Information Retrieval\u00a03(1), 49\u201377 (2000)","journal-title":"Information Retrieval"},{"issue":"3","key":"30_CR9","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1109\/69.846296","volume":"12","author":"G.M. Sacco","year":"2000","unstructured":"Sacco, G.M.: Dynamic Taxonomies: A Model for Large Information Bases. IEEE Trans. on Knowl. and Data Eng.\u00a012(3), 468\u2013479 (2000)","journal-title":"IEEE Trans. on Knowl. and Data Eng."},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Sacco, G.M., Tzitzikas, Y. (eds.): Dynamic Taxonomies and Faceted Search: Theory, Practice, and Experience. The Information Retrieval Series, vol.\u00a025. Springer (2009)","DOI":"10.1007\/978-3-642-02359-0"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Scholer, F., Williams, H.E., Yiannis, J., Zobel, J.: Compression of inverted indexes for fast query evaluation. In: Proc. ACM SIGIR Conf. (SIGIR 2002), pp. 222\u2013229 (2002)","DOI":"10.1145\/564414.564416"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Wagner, R.: Indexing design considerations. IBM Syst. J., 351-367 (1973)","DOI":"10.1147\/sj.124.0351"},{"key":"30_CR13","volume-title":"Managing Gigabytes: Compressing and Indexing Documents and Images","author":"I.H. Witten","year":"1999","unstructured":"Witten, I.H., Moffat, A., Bell, T.C.: Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan Kaufmann Publishers Inc., San Francisco (1999)"},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"Yan, H., Ding, S., Suel, T.: Inverted index compression and query processing with optimized document ordering. In: Proc. Conf. on World Wide Web (WWW 2009), pp. 401\u2013410 (2009)","DOI":"10.1145\/1526709.1526764"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Zobel, J., Moffat, A.: Inverted files for text search engines. ACM Comp. Surv.\u00a038(2) (2006)","DOI":"10.1145\/1132956.1132959"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32600-4_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T08:08:50Z","timestamp":1620115730000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32600-4_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642325991","9783642326004"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32600-4_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}