From: matz@... (Yukihiro Matsumoto)
Date: 2003-01-05T00:23:46+09:00
Subject: Re: poor performance of Marshal.dump on Hashes

Hi,

In message "poor performance of Marshal.dump on Hashes"
    on 03/01/04, Elias Karakoulakis <ekarak@softlab.ece.ntua.gr> writes:

|Notice that while size of array is linear to the processing time, the 
|size Hash of hash causes exponential growth in processing time. It seems 
|as though the algorithm used to serialize hashes is far worse than O(n). 
|Any ideas/comments on this?

1.8 is much faster:

ruby 1.8.0 (2002-12-31) [i686-linux]
Marshal.dump for 100 keys of 100 items each took 1 jiffies for 44051 bytes
Marshal.dump for 100 keys of 1000 items each took 15 jiffies for 434819 bytes
Marshal.dump for 1000 keys of 100 items each took 15 jiffies for 436824 bytes
Marshal.dump for 1000 keys of 1000 items each took 162 jiffies for 4327665 bytes
Marshal.dump for 10000 keys of 10 items each took 18 jiffies for 473733 bytes

							matz.