{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:53:47Z","timestamp":1725580427692},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642201608"},{"type":"electronic","value":"9783642201615"}],"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_55","type":"book-chapter","created":{"date-parts":[[2011,4,12]],"date-time":"2011-04-12T07:41:23Z","timestamp":1302594083000},"page":"555-561","source":"Crossref","is-referenced-by-count":1,"title":["SkipBlock: Self-indexing for Block-Based Inverted List"],"prefix":"10.1007","author":[{"given":"St\u00e9phane","family":"Campinas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renaud","family":"Delbru","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giovanni","family":"Tummarello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"55_CR1","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1002\/spe.948","volume":"40","author":"V.N. Anh","year":"2010","unstructured":"Anh, V.N., Moffat, A.: Index compression using 64-bit words. Softw. Pract. Exper.\u00a040(2), 131\u2013147 (2010)","journal-title":"Softw. Pract. Exper."},{"key":"55_CR2","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":"55_CR3","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1145\/1321440.1321546","volume-title":"Proceedings of the sixteenth ACM conference on Conference on information and knowledge management - CIKM 2007","author":"S. B\u00fcttcher","year":"2007","unstructured":"B\u00fcttcher, S., Clarke, C.L.A.: Index compression is good, especially for random access. In: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management - CIKM 2007, pp. 761\u2013770. ACM Press, New York (2007)"},{"key":"55_CR4","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1145\/1341531.1341537","volume-title":"WSDM 2008: Proceedings of the International Conference on Web Search and Web Data Mining","author":"F. Chierichetti","year":"2008","unstructured":"Chierichetti, F., Lattanzi, S., Mari, F., Panconesi, A.: On placing skips optimally in expectation. In: WSDM 2008: Proceedings of the International Conference on Web Search and Web Data Mining, pp. 15\u201324. ACM, New York (2008)"},{"key":"55_CR5","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1145\/1233341.1233413","volume-title":"ACM-SE 45: Proceedings of the 45th Annual Southeast Regional Conference","author":"B.C. Dean","year":"2007","unstructured":"Dean, B.C., Jones, Z.H.: Exploring the duality between skip lists and binary search trees. In: ACM-SE 45: Proceedings of the 45th Annual Southeast Regional Conference, pp. 395\u2013399. ACM, New York (2007)"},{"key":"55_CR6","unstructured":"Goldstein, J., Ramakrishnan, R., Shaft, U.: Compressing relations and indexes. In: Proceedings of IEEE International Conference on Data Engineering, pp. 370\u2013379 (1998)"},{"key":"55_CR7","doi-asserted-by":"crossref","unstructured":"Messeguer, X.: Skip trees, an alternative data structure to skip lists in a concurrent approach. In: ITA, pp. 251\u2013269 (1997)","DOI":"10.1051\/ita\/1997310302511"},{"issue":"4","key":"55_CR8","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."},{"issue":"6","key":"55_CR9","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1145\/78973.78977","volume":"33","author":"W. Pugh","year":"1990","unstructured":"Pugh, W.: Skip lists: a probabilistic alternative to balanced trees. Commun. ACM\u00a033(6), 668\u2013676 (1990)","journal-title":"Commun. ACM"},{"key":"55_CR10","first-page":"59","volume-title":"ICDE 2006: Proceedings of the 22nd International Conference on Data Engineering","author":"M. Zukowski","year":"2006","unstructured":"Zukowski, M., Heman, S., Nes, N., Boncz, P.: Super-scalar ram-cpu cache compression. In: ICDE 2006: Proceedings of the 22nd International Conference on Data Engineering, p. 59. IEEE Computer Society, Washington, DC (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_55","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T02:20:11Z","timestamp":1712370011000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20161-5_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642201608","9783642201615"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20161-5_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}