... ¹

This research was supported by the JPL HTMT project, Arthur J. Schmitt Fellowship, and ND Faculty Research Program.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

... variables.²

The current implementation requires exporting three kernel variables. However, the authors are confident that this can be avoided in future versions of the MonA file system.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

... ext2.³

Following a transformation link in ext2 results in a ``File not found'' error.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

... access⁴

A transformation may require additional copies depending on its complexity and nature. For example, a decompress transformation often overflows into a second buffer.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

...decompress,⁵

The decompress and compress transformations are based on the Lempel-Ziv-Oberhumer algorithm distributed in the minilzo library [7]. The transformations are optimized for fast compression and decompression at the expense of compression ratio. The algorithm requires no memory for decompression and bounds the space requirement of compression at 64 KB, regardless of input size.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

...decompress⁶

Execution times for compression and decompression are averaged over multiple tests using different raw text files.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.