Results 11 to 14 of 14
|
Enjoy an ad free experience by logging in. Not a member yet? Register.
|
|
-
02-28-2013 #11
- Join Date
- Jan 2008
- Posts
- 28
so, if your starting data is:
AAAAA
BBBBB
AAAAA
VFVDS
AAAAA
then you'd first transform it to:
AAAAA|1
BBBBB|2
AAAAA|3
VFVDS|4
AAAAA|5
Then you'd sort it to:
AAAAA|1
AAAAA|3
AAAAA|5
BBBBB|2
VFVDS|4
Then you'd fold it to:
AAAAA|1|3|5
BBBBB|2
VFVDS|4
Is that the process you are looking for?
-
03-03-2013 #12
-
03-03-2013 #13
- Join Date
- Jan 2008
- Posts
- 28
While it may appear to be Huffman Coding, we don't deal with actual compression of the symbols or likelyhood of the appearance of the symbols. This is more like a linked database with the symbol as a primary key.
I am not entirely clear, either. I hope the OP let's us know if my description is accurate.
-
03-04-2013 #14
Have a look at this lessfs | Open source data de-duplication
First they ignore you,Then they laugh at you,Then they fight with you,Then you win. - M.K.Gandhi
-----
FOSS India Award winning ext3fs Undelete tool www.giis.co.in. Online Linux Terminal http://www.webminal.org