Google's BMdiff is, if I understand correctly, running diff against
different columns in the column family, and adjacent rows within the
column family (the call the previous rows/columns dictionaries for the
diff). While bmz runs the diff on the key/values that are in the same
compression block. Are these two about equivalent, do you think, in
effectiveness?
Also, do you prefix compress the keys? As I see it, most keys will
differ in only a few bytes in most cases, so prefix compression is
really helpful here.
--
You received this message because you are subscribed to the Google Groups "Hypertable User" group.
To post to this group, send email to hyperta...@googlegroups.com.
To unsubscribe from this group, send email to hypertable-us...@googlegroups.com.
For more options, visit this group at http://groups.google.com/group/hypertable-user?hl=en.