Hi,
I see, thanks. Right now I'm using memcached as a distributed
clipboard and i guess I shouldn't be.
ANy object bigger than 1MB i split into chunks of C kb and an
identifier key,value to string them together.
I'll look into entangled.
Thanks for a nice and easy to use app.
Regards
Saptarshi
On Nov 22, 2008, at 2:58 AM, Dustin wrote:
On Nov 21, 11:38 pm, Saptarshi Guha <[EMAIL PROTECTED]> wrote:
Hi,
Thanks for the prompt answer. Is there a specific reason why?
I'm sure it's come up many times on the list(s) and there are
probably good answers written, but it's not in the FAQ. That might be
a good addition for any FAQ maintainers out there. :)
Do the algorithms depend on the size limit?
Slabbing might become more inefficient as you get into really large
blocks, but there's nothing inherent.
Saptarshi Guha | [EMAIL PROTECTED] | http://www.stat.purdue.edu/~sguha
