Hello

In the current version of Ruby
(http://svn.ruby-lang.org/repos/ruby/trunk/lib/rinda/tuplespace.rb)
Rinda::TupleBag is implemented with hash by tuple size and then with array.
This realization is simple and fast on very small amount of data (e.g.
on writing), but
scales very bad in reading and searching.

How can it be rewritten?
May be other realizations of tuplespaces are more scalable and fast?
Is there any attempts to make faster the standard version?


-- 
WBR, Alex V Breger, computer-science.ru