Hi Mario, This is common knowledge but not completely true. The bottleneck of BWT is the suffix sorting step and there have been many recent advances that significantly reduced the time and space needs of the algorithm. Of course, it will probably never be so fast as a lightweight Ziv-Lempel implementation as is lzo, but I believe (as do many others) that it can be made to run as fast as a medium weight LZ implementation, while compressing a lot more. Also, note that we are dealing with an specific application and not a general purpose library/compression utility as bzip2.
How fast exactly BWT can be made to run under ZFS? I don't know and don't have a clue. It will require a lot if investigation to find out. Now, regarding the hardness if implementing BWT, you are right in the sense that fast suffix sorting algorithms are not at all trivial to implement. Kind regards, Domingos. On 10/8/07, Mario Goebbels <[EMAIL PROTECTED]> wrote: > > Besides, > > there are some new results about BWT that I'm sure would be of > > interest in this context. > > I thought bzip2/BWT is a compression scheme that has a heavy footprint > and is generally brain damaging to implement? > > -mg > > > _______________________________________________ zfs-discuss mailing list zfs-discuss@opensolaris.org http://mail.opensolaris.org/mailman/listinfo/zfs-discuss
