> Yes, I think that was the original intent of the project proposal. It
> could probably be reworded to decrease emphasis on a single algorithm,
> but I read it as a generic exploration of alternative algorithms.
Yes, you read right. The original intent was to investigate
alternative algorithms i
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 imple
H. Park, K. Park, CPM, LNCS, Vol. 2676, 2003
[6]"Space ecient linear time construction of sux arrays",P. Ko and
S. Aluru, CPM 2003.
[7]"Fast Lightweight Suffix Array Construction and
Checking". Burkhardt, Stefan and Kärkkäinen, Juha. 14th Annual
Symposium, CPM 2003,
Domingos
n the subject;
2) lzo is copyrighted, so it's not clear if it can be used on ZFS;
3) lzo is just another implementation of Ziv-Lempel while BWT is a
completely different approach. Why not try it?
Domingos.
--
Domingos Soares Neto
University of Sao Paulo
Institute of Mathematics and Statistics
7;t say it's true before a deeper analysis and some
experiments.
Summarizing, I think the idea of an adaptative scheme very nice and
interesting. :-)
Domingos.
--
Domingos Soares Neto
University of Sao Paulo
Institute of Mathematics and Statistics
> Adam
>
> On Thu, Jul 05, 2007 at
nstruction and
Checking". Burkhardt, Stefan and Kärkkäinen, Juha. 14th Annual
Symposium, CPM 2003,
Domingos Soares Neto
University of Sao Paulo
Institute of Mathematics and Statistics
___
zfs-discuss mailing list
zfs-discuss@opensolaris.org
http://mail.opensolaris.org/mailman/listinfo/zfs-discuss
