{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T00:44:21Z","timestamp":1792111461260,"version":"4.4.0"},"publisher-location":"New York, NY","reference-count":16,"publisher":"Springer New York","isbn-type":[{"value":"9781493928637","type":"print"},{"value":"9781493928644","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-1-4939-2864-4_84","type":"book-chapter","created":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T15:32:23Z","timestamp":1553095943000},"page":"407-412","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Compressing Integer Sequences"],"prefix":"10.1007","author":[{"given":"Alistair","family":"Moffat","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"issue":"2","key":"84_CR3547","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1002\/spe.948","volume":"40","author":"VN Anh","year":"2010","unstructured":"Anh VN, Moffat A (2010) Index compression using 64-bit words. Softw Pract Exp 40(2):131\u2013147","journal-title":"Softw Pract Exp"},{"issue":"4","key":"84_CR3548","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1080\/15427951.2005.10129113","volume":"2","author":"P Boldi","year":"2005","unstructured":"Boldi P, Vigna S (2005) Codes for the world-wide web. Internet Math 2(4):405\u2013427","journal-title":"Internet Math"},{"key":"84_CR3549","doi-asserted-by":"crossref","unstructured":"Brisaboa NR, Fari\u00f1a A, Navarro G, Esteller MF (2003) (S,\u2009C)-dense coding: an optimized compression code for natural language text databases. In: Proceedings of the symposium on string processing and information retrieval, Manaus, pp\u00a0122\u2013136","DOI":"10.1007\/978-3-540-39984-1_10"},{"key":"84_CR3550","first-page":"1","volume-title":"Enhanced byte codes with restricted prefix properties","author":"JS Culpepper","year":"2005","unstructured":"Culpepper JS, Moffat A (2005) Enhanced byte codes with restricted prefix properties. In: Proceedings of the symposium on string processing and information retrieval, Buenos Aires, pp\u00a01\u201312"},{"issue":"2","key":"84_CR3551","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1145\/348751.348754","volume":"18","author":"ES de Moura","year":"2000","unstructured":"de Moura ES, Navarro G, Ziviani N, Baeza-Yates R (2000) Fast and flexible word searching on compressed text. ACM Trans Inf Syst 18(2):113\u2013139","journal-title":"ACM Trans Inf Syst"},{"issue":"2","key":"84_CR3552","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1145\/321812.321820","volume":"21","author":"P Elias","year":"1974","unstructured":"Elias P (1974) Efficient storage and retrieval by content and address of static files. J ACM 21(2):246\u2013260","journal-title":"J ACM"},{"issue":"2","key":"84_CR3553","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1109\/TIT.1975.1055349","volume":"IT-21","author":"P Elias","year":"1975","unstructured":"Elias P (1975) Universal codeword sets and representations of the integers. IEEE Trans Inf Theory IT-21(2):194\u2013203","journal-title":"IEEE Trans Inf Theory"},{"key":"84_CR3554","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/B978-012620861-0\/50004-8","volume-title":"Lossless compression handbook","author":"P Fenwick","year":"2003","unstructured":"Fenwick P (2003) Universal codes. In: Sayood K (ed) Lossless compression handbook. Academic, Boston, pp\u00a055\u201378"},{"key":"84_CR3555","series-title":"NATO ASI series F","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-642-82456-2_12","volume-title":"Combinatorial algorithms on words","author":"AS Fraenkel","year":"1985","unstructured":"Fraenkel AS, Klein ST (1985) Novel compression of sparse bit-strings\u2014preliminary report. In: Apostolico A, Galil Z (eds) Combinatorial algorithms on words. NATO ASI series F, vol\u00a012. Springer, Berlin, pp\u00a0169\u2013183"},{"key":"84_CR3556","doi-asserted-by":"crossref","unstructured":"Golomb SW (1966) Run-length encodings. IEEE Trans Inf Theory IT\u201312(3):399\u2013401","DOI":"10.1109\/TIT.1966.1053907"},{"key":"84_CR3557","volume-title":"Decoding billions of integers per second through vectorization","author":"D Lemire","year":"2014","unstructured":"Lemire D, Boytsov L (2014, to appear) Decoding billions of integers per second through vectorization. Softw Pract Exp. http:\/\/dx.doi.org\/10.1002\/spe.2203"},{"issue":"5","key":"84_CR3558","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.ipl.2006.04.014","volume":"99","author":"A Moffat","year":"2006","unstructured":"Moffat A, Anh VN (2006) Binary codes for locally homogeneous sequences. Inf Process Lett 99(5):75\u201380","journal-title":"Inf Process Lett"},{"issue":"1","key":"84_CR3559","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1023\/A:1013002601898","volume":"3","author":"A Moffat","year":"2000","unstructured":"Moffat A, Stuiver L (2000) Binary interpolative coding for effective index compression. Inf Retr 3(1):25\u201347","journal-title":"Inf Retr"},{"key":"84_CR3560","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0935-6","volume-title":"Compression and coding algorithms","author":"A Moffat","year":"2002","unstructured":"Moffat A, Turpin A (2002) Compression and coding algorithms. Kluwer Academic, Boston"},{"key":"84_CR3561","first-page":"83","volume-title":"Quasi-succinct indices","author":"S Vigna","year":"2013","unstructured":"Vigna S (2013) Quasi-succinct indices. In: Proceedings of the international conference on web search and data mining, Rome, pp\u00a083\u201392"},{"key":"84_CR3562","doi-asserted-by":"crossref","unstructured":"Zukowski M, H\u00e9man S, Nes N, Boncz P (2006) Super-scalar RAM-CPU cache compression. In: Proceedings of the international conference on data engineering, Atlanta. IEEE Computer Society, Washington, DC, paper\u00a059","DOI":"10.1109\/ICDE.2006.150"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_84","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T23:48:54Z","timestamp":1792108134000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/chapter\/10.1007\/978-1-4939-2864-4_84"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_84","relation":{},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}