IDEAS home Printed from https://ideas.repec.org/a/bla/jamist/v58y2007i1p3-14.html
   My bibliography  Save this article

Block merging for off‐line compression

Author

Listed:
  • Raymond Wan
  • Alistair Moffat

Abstract

To bound memory consumption, most compression systems provide a facility that controls the amount of data that may be processed at once—usually as a block size, but sometimes as a direct megabyte limit. In this work we consider the Re‐Pair 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‐Pair 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.

Suggested Citation

  • Raymond Wan & Alistair Moffat, 2007. "Block merging for off‐line compression," Journal of the American Society for Information Science and Technology, Association for Information Science & Technology, vol. 58(1), pages 3-14, January.
    • Handle: RePEc:bla:jamist:v:58:y:2007:i:1:p:3-14
    DOI: 10.1002/asi.20515
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/asi.20515
    Download Restriction: no
    File URL: https://libkey.io/10.1002/asi.20515?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bla:jamist:v:58:y:2007:i:1:p:3-14. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: http://www.asis.org .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.