{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:40:06Z","timestamp":1742917206907,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":15,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307701"},{"type":"electronic","value":"9780387301624"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_84","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:36:50Z","timestamp":1214505410000},"page":"178-183","source":"Crossref","is-referenced-by-count":4,"title":["Compressing Integer Sequences and Sets"],"prefix":"10.1007","author":[{"given":"Alistair","family":"Moffat","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"84_CR1_84","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1109\/TKDE.2006.99","volume":"18","author":"V.N. Anh","year":"2006","unstructured":"Anh, V.N., Moffat, A.: Improved word-aligned binary compression for text indexing. IEEE Trans. Knowl. Data Eng. 18(6), 857\u2013861 (2006)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"4","key":"84_CR2_84","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.: Codes for the world-wide web. Internet Math. 2(4), 405\u2013427 (2005)","journal-title":"Internet Math."},{"key":"84_CR3_84","doi-asserted-by":"crossref","unstructured":"Brisaboa, N.R., Fari\u00f1a, A., Navarro, G., Esteller, M.F.: $$ { ({S},{C}) } $$-dense coding: An optimized compression code for natural language text databases. In: Nascimento, M.A. (ed.) Proc. Symp. String Processing and Information Retrieval. LNCS, vol.\u00a02857, pp.\u00a0122\u2013136, Manaus, Brazil, October 2003","DOI":"10.1007\/978-3-540-39984-1_10"},{"key":"84_CR4_84","doi-asserted-by":"crossref","unstructured":"Chen, D., Chiang, Y.J., Memon, N., Wu, X.: Optimal alphabet partitioning for semi-adaptive coding of sources of unknown sparse distributions. In: Storer, J.A., Cohn, M. (eds.) Proc. 2003 IEEE Data Compression Conference, pp.\u00a0372\u2013381, IEEE Computer Society Press, Los Alamitos, California, March 2003","DOI":"10.1109\/DCC.2003.1194028"},{"issue":"2","key":"84_CR5_84","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/j.ipm.2005.02.002","volume":"42","author":"C.S. Cheng","year":"2006","unstructured":"Cheng, C.S., Shann, J.J.J., Chung, C.P.: Unique-order interpolative coding for fast querying and space-efficient indexing in information retrieval systems. Inf. Process. Manag. 42(2), 407\u2013428 (2006)","journal-title":"Inf. Process. Manag."},{"key":"84_CR6_84","doi-asserted-by":"crossref","unstructured":"Culpepper, J.S., Moffat, A.: Enhanced byte codes with restricted prefix properties. In: Consens, M.P., Navarro, G. (eds.) Proc. Symp. String Processing and Information Retrieval. LNCS Volume 3772, pp.\u00a01\u201312, Buenos Aires, November 2005","DOI":"10.1007\/11575832_1"},{"issue":"2","key":"84_CR7_84","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1145\/348751.348754","volume":"18","author":"E.S. de Moura","year":"2000","unstructured":"de Moura, E.S., Navarro, G., Ziviani, N., Baeza-Yates, R.: Fast and flexible word searching on compressed text. ACM Trans. Inf. Syst. 18(2), 113\u2013139 (2000)","journal-title":"ACM Trans. Inf. Syst."},{"key":"84_CR8_84","doi-asserted-by":"crossref","unstructured":"Fenwick, P.: Universal codes. In: Sayood, K. (ed.) Lossless Compression Handbook, pp.\u00a055\u201378, Academic Press, Boston (2003)","DOI":"10.1016\/B978-012620861-0\/50004-8"},{"key":"84_CR9_84","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-642-82456-2_12","volume-title":"Combinatorial Algorithms on Words, NATO ASI Series F, vol. 12","author":"A.S. Fraenkel","year":"1985","unstructured":"Fraenkel, A.S., Klein, S.T.: Novel compression of sparse bit-strings\u00a0\u2013Preliminary report. In: Apostolico, A., Galil, Z. (eds) Combinatorial Algorithms on Words, NATO ASI Series F, vol.\u00a012, pp.\u00a0169\u2013183. Springer, Berlin (1985)"},{"key":"84_CR10_84","doi-asserted-by":"crossref","unstructured":"Gupta, A., Hon, W.K., Shah, R., Vitter, J.S.: Compressed data structures: Dictionaries and data-aware measures. In: Storer, J.A., Cohn, M. (eds) Proc. 16th IEEE Data Compression Conference, pp.\u00a0213\u2013222, IEEE, Snowbird, Utah, March 2006 Computer Society, Los Alamitos, CA","DOI":"10.1109\/DCC.2006.12"},{"issue":"5","key":"84_CR11_84","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, V.N.: Binary codes for locally homogeneous sequences. Inf. Process. Lett. 99(5), 75\u201380 (2006) Source code available from www.cs.mu.oz.au\/~alistair\/rbuc\/","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"84_CR12_84","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1023\/A:1013002601898","volume":"3","author":"A. Moffat","year":"2000","unstructured":"Moffat, A., Stuiver, L.: Binary interpolative coding for effective index compression. Inf. Retr. 3(1), 25\u201347 (2000)","journal-title":"Inf. Retr."},{"key":"84_CR13_84","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.: Compression and Coding Algorithms. Kluwer Academic Publishers, Boston (2002)"},{"key":"84_CR14_84","unstructured":"Raman, R., Raman, V., Srinivasa Rao, S.: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In: Proc. 13th ACM-SIAM Symposium on Discrete Algorithms, pp.\u00a0233\u2013242, San Francisco, CA, January 2002, SIAM, Philadelphia, PA"},{"key":"84_CR15_84","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, 2nd edn. Morgan Kaufmann, San Francisco, (1999)","edition":"2"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_84","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T21:32:43Z","timestamp":1738272763000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_84"}},"subtitle":["2000; Moffat, Stuiver"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_84","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}