Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked
 
PerlMonks  

Re: Specialized data compression

by QM (Vicar)
on Oct 04, 2012 at 09:34 UTC ( #997211=note: print w/ replies, xml ) Need Help??


in reply to Specialized data compression

Thanks for posting such an interesting question!

Another idea I've seen work is to transpose your CSV, so that the first row is the timestamp, the second row is the X, etc. Then compress this. As the X's may be self-similar, and the Y's self-similar, but the X's and Y's are not, this may give the compression algorithm a break.

The timestamp should also be delta, except the first reading on resume.

-QM
--
Quantum Mechanics: The dreams stuff is made of


Comment on Re: Specialized data compression

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://997211]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others perusing the Monastery: (4)
As of 2014-07-29 06:48 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite superfluous repetitious redundant duplicative phrase is:









    Results (211 votes), past polls