On Dec 7, 2005, at 2:03 PM, Frank Wiles wrote:
memcache and other daemons could help out here but they take too much
time compared to perls internal data memory to access and write.
Since they are not really fit for complex hash trees without doing a
heck of data coping forward and back.. i would count on twice the
time. So optimal for me as i see it is to keep the cache close by
hand in perl to have most efficient output..
Have you tried Cache::FastMmap? Unless the freeze/thaw in Storable
is your time issue it is a bit faster than memcached, but is only
useful for caching data on a per server basis.
havent tried it, but storable is the general issue..
$tree{}{}... about 10-15 levels deep ..{}{} = data.
quite equally expanded..
In optimal case the full database is reflected there + all analyzes and
god knows what else i put in there..
storable must clone the tree up and down. and since i must secure that
no chances can be made.. i've to constantly read towards the disk..
in perl memory i can access and lock just specific branches without
touching the tree..
I could actually make the tree in filestructure and let the leafs be
isolated files i guess. but its still far from the perl local memory
read/write performance.
~ F
