{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,12]],"date-time":"2023-10-12T10:10:37Z","timestamp":1697105437865},"reference-count":29,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,11,3]],"date-time":"2006-11-03T00:00:00Z","timestamp":1162512000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Am. Soc. Inf. Sci."],"published-print":{"date-parts":[[2007,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>To bound memory consumption, most compression systems provide a facility that controls the amount of data that may be processed at once\u2014usually as a block size, but sometimes as a direct megabyte limit. In this work we consider the Re\u2010Pair mechanism of Larsson and Moffat (2000), which processes large messages as disjoint blocks to limit memory consumption. We show that the blocks emitted by Re\u2010Pair can be postprocessed to yield further savings, and describe techniques that allow files of 500 MB or more to be compressed in a holistic manner using less than that much main memory. The block merging process we describe has the additional advantage of allowing new text to be appended to the end of the compressed file.<\/jats:p>","DOI":"10.1002\/asi.20515","type":"journal-article","created":{"date-parts":[[2006,11,4]],"date-time":"2006-11-04T01:16:51Z","timestamp":1162603011000},"page":"3-14","source":"Crossref","is-referenced-by-count":5,"title":["Block merging for off\u2010line compression"],"prefix":"10.1002","volume":"58","author":[{"given":"Raymond","family":"Wan","sequence":"first","affiliation":[]},{"given":"Alistair","family":"Moffat","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,11,3]]},"reference":[{"key":"e_1_2_11_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/360825.360855"},{"key":"e_1_2_11_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.892709"},{"key":"e_1_2_11_4_1","doi-asserted-by":"publisher","DOI":"10.1002\/1532-2890(2001)9999:9999<::AID-ASI1084>3.0.CO;2-Z"},{"key":"e_1_2_11_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/568727.568730"},{"key":"e_1_2_11_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1984.1096090"},{"key":"e_1_2_11_7_1","volume-title":"Introduction to algorithms","author":"Cormen T.H.","year":"2001"},{"key":"e_1_2_11_8_1","unstructured":"Gailly J.\u2010L.(1993).GZIP program and documentation."},{"key":"e_1_2_11_8_2","unstructured":"Retrieved fromhttp:\/\/www.gzip.org\/"},{"key":"e_1_2_11_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4573(94)00047-7"},{"key":"e_1_2_11_10_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/32.3.228"},{"key":"e_1_2_11_11_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/40.2_and_3.117"},{"key":"e_1_2_11_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.892708"},{"key":"e_1_2_11_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/248625.248639"},{"key":"e_1_2_11_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/26.634683"},{"key":"e_1_2_11_14_2","unstructured":"Retrieved fromhttp:\/\/www.cs.mu.oz.au\/\u02dcalistair\/mr_coder"},{"key":"e_1_2_11_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0935-6"},{"key":"e_1_2_11_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/SPIRE.2001.989752"},{"key":"e_1_2_11_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.591454"},{"key":"e_1_2_11_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.892710"},{"key":"e_1_2_11_19_1","first-page":"230","article-title":"Browsing in digital libraries: A phrasebased approach","volume":"97","author":"Nevill\u2010Manning C.G.","year":"1997","journal-title":"Proceedings of the ACM Digital Libraries"},{"key":"e_1_2_11_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/360363.360368"},{"key":"e_1_2_11_21_1","unstructured":"Seward J.(1996).BZIP program and documentation."},{"key":"e_1_2_11_21_2","unstructured":"Retrieved fromhttp:\/\/sources.redhat.com\/bzip2\/"},{"key":"e_1_2_11_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/26.843129"},{"key":"e_1_2_11_22_2","unstructured":"Retrieved fromhttp:\/\/www.cs.mu.oz.au\/\u02dcalistair\/mr_coder\/"},{"key":"e_1_2_11_23_1","unstructured":"Wan R.(2003).Browsing and searching compressed documents. Unpublished doctoral dissertation Department of Computer Science and Software Engineering University of Melbourne Australia."},{"key":"e_1_2_11_23_2","unstructured":"Retrieved fromhttp:\/\/eprints.infodiv.unimelb.edu.au\/archive\/00000871\/01\/wan_phd.pdf"},{"key":"e_1_2_11_24_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.2044-8295.1975.tb01442.x"},{"key":"e_1_2_11_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055714"}],"container-title":["Journal of the American Society for Information Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fasi.20515","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/asi.20515","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,11]],"date-time":"2023-10-11T21:26:48Z","timestamp":1697059608000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/asi.20515"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,11,3]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,1]]}},"alternative-id":["10.1002\/asi.20515"],"URL":"https:\/\/doi.org\/10.1002\/asi.20515","archive":["Portico"],"relation":{},"ISSN":["1532-2882","1532-2890"],"issn-type":[{"value":"1532-2882","type":"print"},{"value":"1532-2890","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,11,3]]}}}