On Apr 10, 10:19 pm, Kenton Varda ken...@google.com wrote:
I think we define compression differently. In my book, redundancy
elimination and compression are pretty much synonymous. It sounds like
you are using a more specific definition (LZW?).
If that was true then string interning would
On Fri, Apr 10, 2009 at 5:24 AM, Alexander Philippou
alexander.philip...@gmail.com wrote:
The redundancy elimination mechanism of FI is actually a vocabulary
and it works differently than compression algorithms do.
I think we define compression differently. In my book, redundancy
On Apr 3, 10:40 am, ShirishKul shirish...@gmail.com wrote:
I worked to see the difference between the *XML fast infoset* and the
*Protocol Buffers* (although I'm not aware about what are internal
things happening therein).
I found that for a typical data to be transferred across the wire for
On Tue, Apr 7, 2009 at 10:15 PM, ShirishKul shirish...@gmail.com wrote:
I do not have any sample file to share with you. But I think FI
handles the repeatative attribute-values.
OK, well, I call that compression. Try gzipping the final protobuf and FI
documents and comparing the compressed
On Fri, Apr 3, 2009 at 2:40 AM, ShirishKul shirish...@gmail.com wrote:
I found that for a typical data to be transferred across the wire for
size of 500KB that a XML file would represent has corresponding file
size as 300KB for PB binary and around 130KB for XML Fast Infoset
binary file.
