[
https://issues.apache.org/jira/browse/MAHOUT-168?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=12749721#action_12749721
]
Ted Dunning commented on MAHOUT-168:
------------------------------------
I considered that, but it seemed easier to write a version from scratch.
Somebody should look at the Lucene code to see if they did anything
earth-shakingly clever for speed.
A delta-code, btw, includes gamma and unary codes so that is complete enough to
be interesting.
It should be very little work to add Golomb and byte variable codes to this.
Only the byte-variable code seems like a good candidate because it can be made
faster than these other forms pretty easily.
> Need integer compression routines
> ---------------------------------
>
> Key: MAHOUT-168
> URL: https://issues.apache.org/jira/browse/MAHOUT-168
> Project: Mahout
> Issue Type: Improvement
> Components: Matrix
> Reporter: Ted Dunning
> Assignee: Ted Dunning
>
> A selection of these algorithms would be very nice to have:
> www.cs.rmit.edu.au/~jz/fulltext/compjour99.pdf
--
This message is automatically generated by JIRA.
-
You can reply to this email to add a comment to the issue online.
